Computing the discrete-time "analytic" signal via FFT

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" si...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1999-09, Vol.47 (9), p.2600-2603
Main Author: Marple, L.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Amplitude estimation
Applied sciences
Computation
Detection, estimation, filtering, equalization, prediction
Discrete transforms
Exact sciences and technology
Fourier transforms
Frequency domain analysis
Frequency estimation
Information, signal and communications theory
Mathematical analysis
Signal analysis
Signal and communications theory
Signal processing
Signal processing algorithms
Signal, noise
Spectral analysis
Telecommunications and information theory
Transforms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.782222