Computing the discrete-time "analytic" signal via FFT

1999/01/01 by L. Marple · 8 citations
Computer Science · Engineering · #Advanced Electrical Measurement Techniques #Image and Signal Denoising Methods #Machine Fault Diagnosis Techniques

paper · doi:10.1109/78.782222

openalex publication_date 1999/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15

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.

Citations

• Analytic signal generation-tips and traps

Cited by

• An enhanced Kurtogram method for fault diagnosis of rolling element bearings
• Flexible perceptual encoding by discrete gamma events
• Modeling Copper Cables and Connectors
• Hadamard-Based Recursive Aperture Decoded Ultrasound Imaging (READI) With Estimated Motion-Compensated Compounding (EMC2) Using Top-Orthogonal to Bottom Electrode (TOBE) Arrays
• Inverse harmonic clustering for multi-pitch estimation: an optimal transport approach
• FROG-measurement based phase retrieval for analytic signals
• Multidimensional Analytic Signals and the Bedrosian Identity
• Time and covariance smoothing for restoration of bivariate signals

Related

• Analytic signal generation-tips and traps
• Fast algorithms for complex-valued discrete Fourier transform with separate real and imaginary inputs/outputs
• Latent Signal Analysis and the Analytic Signal
• A Heuristic Description of Fast Fourier Transform
• Digital Filters for Instantaneous Frequency Estimation