scispace - formally typeset
Search or ask a question
Topic

Non-uniform discrete Fourier transform

About: Non-uniform discrete Fourier transform is a research topic. Over the lifetime, 4067 publications have been published within this topic receiving 123952 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A novel fast computational procedure of the quadratic phase transform (QPT) for joint phase parameter estimation of multicomponent chirp signals and explicit expressions for the arithmetic operation count are derived.

59 citations

Journal ArticleDOI
TL;DR: It is shown that radially sampled data can be processed directly using Fourier transforms in polar coordinates, and an intrinsic connection between the polar Fourier transform and the filtered backprojection method that has recently been introduced to process projection-reconstruction NOESY data is described.

59 citations

Book ChapterDOI
28 Jan 2011
TL;DR: When compared, Discrete Cosine Transform and Fast Fourier Transform give better compression ratio, while Discrete Wavelet Transform yields good fidelity parameters with comparable compression ratio.
Abstract: In this paper, a transform based methodology is presented for compression of electrocardiogram (ECG) signal. The methodology employs different transforms such as Discrete Wavelet Transform (DWT), Fast Fourier Transform (FFT) and Discrete Cosine Transform (DCT). A comparative study of performance of different transforms for ECG signal is made in terms of Compression ratio (CR), Percent root mean square difference (PRD), Mean square error (MSE), Maximum error (ME) and Signal-to-noise ratio (SNR). The simulation results included illustrate the effectiveness of these transforms in biomedical signal processing. When compared, Discrete Cosine Transform and Fast Fourier Transform give better compression ratio, while Discrete Wavelet Transform yields good fidelity parameters with comparable compression ratio.

58 citations

Book
20 Feb 2009
TL;DR: Mixed transformations: continuous case Paired Transform-Based DecompositionDecomposition of 1D signals 2D paired representation Fourier Transform and Multiresolution Fourier transform Representation by frequency-time wavelets Time-frequency correlation analysis Givens-Haar transformations.
Abstract: Discrete Fourier Transform Properties of the discrete Fourier transform Fourier transform splitting Fast Fourier transform Codes for the paired FFT Paired and Haar transforms Integer Fourier Transform Reversible integer Fourier transform Lifting schemes for DFT One-point integer transform DFT in vector form Roots of the unit Codes for the block DFT General elliptic Fourier transforms Cosine Transform Partitioning the DCT Paired algorithm for the N-point DCT Codes for the paired transform Reversible integer DCT Method of nonlinear equations Canonical representation of the integer DCT Hadamard Transform The Walsh and Hadamard transform Mixed Hadamard transformation Generalized bit and transformations T-decomposition of Hadamard matrices Mixed Fourier transformations Mixed transformations: continuous case Paired Transform-Based Decomposition Decomposition of 1D signals 2D paired representation Fourier Transform and Multiresolution Fourier transform Representation by frequency-time wavelets Time-frequency correlation analysis Givens-Haar transformations References Index

58 citations

Patent
Choquet Michel1
21 Jun 1977
TL;DR: In this paper, a method for determining the initial values of the coefficients of a transversal equalizer in a data transmission system in which the transmission channel creates frequency shift is presented.
Abstract: A method of and apparatus for determining during an initial training period the initial values of the coefficients of a transversal equalizer in a data transmission system in which the transmission channel creates frequency shift. The received periodic training sequence is modulated by a time-domain window signal whose Fourier transform exhibits a relatively flat central peak and has comparatively low values in the vicinity of those frequencies which are a multiple of the inverse of the period of the transmitted sequence, and the discrete Fourier transform Wk of the modulated signal is computed. The values of the coefficients of the equalizer are obtained by computing the inverse discrete Fourier transform of the ratio Fk =Zk /Wk, where Zk is the discrete Fourier transform of the transmitted sequence.

58 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
88% related
Image processing
229.9K papers, 3.5M citations
81% related
Feature extraction
111.8K papers, 2.1M citations
80% related
Robustness (computer science)
94.7K papers, 1.6M citations
79% related
Pixel
136.5K papers, 1.5M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202318
202233
20213
20201
20191
20189