OpenAlex ·

Explicit Full-Spark Gabor Windows with Quantitative Phase Retrieval

Dongwei Li

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.09614
Original
Read it at the publisher
Topics
Signal ProcessingNumerical AnalysisComputational Physics

Abstract

We construct explicit algebraic finite Gabor windows that are simultaneously full spark and phase retrievable, with quantitative control of the self-ambiguity function. In every cyclic dimension, a constant--Chu window has an exactly computable ambiguity minimum of order $N^{-3/2}$; for $N\ge25$, a two-site Chu repair has margin comparable to $dN^{-3/2}$ for every divisor $d\le\sqrt N$. A quantitative algebraic regularization, based on the high-degree specialization principle used in explicit full-spark Gabor constructions, imposes full spark while retaining a fixed proportion of a seed's ambiguity margin. These ingredients give explicit simultaneous constructions in every cyclic dimension and a factor-sensitive improvement when $N$ has a divisor near $\sqrt N$. Further consequences include exact Chinese-remainder tensorization, optimal-order squarefree families, near-SIC prime regularization, lifted stability, and a finite cyclic Schrödinger construction.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Signal Processing

Get the few papers worth your time in Signal Processing every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics