Computing the discrete-time "analytic" signal via FFT
- 1 September 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 47 (9) , 2600-2603
- https://doi.org/10.1109/78.782222
Abstract
Starting with a real-valued N-point discrete-time signal, frequency-domain algorithms are provided for computing (1) the complex-valued standard N-point discrete-time "analytic" signal of the same sample rate; (2) the complex-valued decimated N/2-point discrete-time "analytic" signal of half the original sample rate; and (3) the complex-valued interpolated NM-point discrete-time "analytic" signal of M times the original sample rate. Special adjustment of the transform end points are shown to be necessary in order to generate proper discrete-time "analytic" signals.Keywords
This publication has 7 references indexed in Scilit:
- Sources of and remedies for spectral line splitting in autoregressive spectrum analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Estimating group delay and phase delay via discrete-time "analytic" cross-correlationIEEE Transactions on Signal Processing, 1999
- Analytic signal generation-tips and trapsIEEE Transactions on Signal Processing, 1994
- Complex Envelope Properties, Interpretation, Filtering, and EvaluationPublished by Defense Technical Information Center (DTIC) ,1991
- Interpolation by the FFT revisited-an experimental investigationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Comments on "Maximum entropy spectral estimation using the analytical signal"IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Maximum entropy spectral estimation using the analytical signalIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978