By Topic

Quantizing schemes for the discrete Fourier transform of a random time-series

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:24 ,  Issue: 2 )