Research Report on Noise-Shaped One-Bit Coefficients in Discrete Polynomial Fourier Extension
Not on the map. Why?
Abstract (arXiv)
This report studies noise-shaped one-bit coefficients in normalized discrete polynomial Fourier extension. For first-order Sigma-Delta quantization, the error is written as ek=uk-qk=Delta vk with a uniformly bounded state. Discrete summation by parts then yields variation estimates for complex weights and an O(N-1) approximation rate on compact parameter sets. For the parabolic phase φx,t(xi)=xxi+txi2, the bound is expressed through J(x,t)=int01 |x+2txi|dxi, and the uniform N-1 rate is shown to be sharp over the admissible input class. Higher-order finite-record identities are derived with all endpoint traces retained. Under endpoint compatibility, or after explicit boundary correction, an rth-order noise-shaped error e=Deltar v gives O(N-r) decay for sufficiently smooth weights and O(N-(r-1+α)) decay for Cr-1,α weights. Exact L2 orthogonality identities, fourth-moment formulas, local kernel estimates, and oscillatory transfer bounds are also established. Extensions to polynomial phases, multidimensional parameter families, growing observation regions, and correlated state models are included.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 85 references that are in the map. First posted on arXiv 26 Jul 2026.
Builds on
0 of 85 references.
No references here yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026KBBQ: A Predictive Noise Law and the Limits of Spectrum Flattening in FP4 Quantization
- 2021Sigma-Delta and Distributed Noise-Shaping Quantization Methods for Random Fourier Features
- 2026A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products
- 2021Quantization optimized with respect to the Haar basis ↗
- 2022On One-Bit Quantization
- 2026A Note on Scaling in Randomly Rotated Quantization and Its Connection to the CDEF +1 Pythagorean Relation
- 2026LittleBit-2: Maximizing the Spectral Energy Gain in Sub-1-Bit LLMs via Latent Geometry Alignment
- 2024Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing