Quantizing schemes for the discrete Fourier transform of a random time-series
- 1 March 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (2) , 156-163
- https://doi.org/10.1109/tit.1978.1055867
Abstract
The problem of quantizing a large-dynamic-range, possibly nonstationary signal after it has been transformed via the discrete Fourier transform (DFT) is investigated. It is demonstrated that, for purposes of d, the polar-form representation for these DFT coefficients is preferable to the Cartesian-form when fixed-information-rate quantization schemes are considered. A technique called spectral phase coding (SPC) is described for transforming the DFT coefficients into a bounded sequence\{\psi_{p}\}, where- \pi < \psi_{p} \leq \pi. In most cases, the terms\psi_{p}are uniformly distributed over this range. The results indicate that SPC is a robust suboptimum procedure for coding nonstationary or large-dynamic-range signals into digital form.Keywords
This publication has 5 references indexed in Scilit:
- Discrete spectral phase coding (Corresp.)IEEE Transactions on Information Theory, 1976
- A survey ol digital picture codingComputer, 1974
- Spectrum Shaping with Parity SequencesApplied Optics, 1972
- Quantizing for minimum distortionIEEE Transactions on Information Theory, 1960
- A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITIONProceedings of the National Academy of Sciences, 1956