[go: up one dir, main page]

Rabiner et al., 2003 - Google Patents

The chirp z-transform algorithm

Rabiner et al., 2003

View PDF
Document ID
17847388704588272339
Author
Rabiner L
Schafer R
Rader C
Publication year
Publication venue
IEEE transactions on audio and electroacoustics

External Links

Snippet

A computational algorithm for numerically evaluating the z-transform of a sequence of N samples is discussed. This algorithm has been named the chirp z-transform (CZT) algorithm. Using the CZT algorithm one can efficiently evaluate the z-transform at M points in the z …
Continue reading at web.ece.ucsb.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis

Similar Documents

Publication Publication Date Title
Rabiner et al. The chirp z-transform algorithm
Rader An improved algorithm for high speed autocorrelation with applications to spectral estimation
EP0649578B1 (en) Digital filter having high accuracy and efficiency
Rabiner et al. The chirp z‐transform algorithm and its application
Clark et al. A unified approach to time-and frequency-domain realization of FIR adaptive digital filters
Makur et al. Warped discrete-Fourier transform: Theory and applications
Jones et al. Moment theory, orthogonal polynomials, quadrature, and continued fractions associated with the unit circle
Sitton et al. Factoring very-high-degree polynomials
US20070094317A1 (en) Method and system for B-spline interpolation of a one-dimensional signal using a fractional interpolation ratio
Blu Iterated filter banks with rational rate changes connection with discrete wavelet transforms
Yegnanarayana Design of recursive group-delay filters by autoregressive modeling
Zhang et al. Efficient design of orthonormal wavelet bases for signal representation
Sekhar et al. Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
Sreenivas et al. High-resolution narrow-band spectra by FFT pruning
Shyu et al. A new approach to the design of discrete coefficient FIR digital filters
Selesnick Balanced GHM-like multiscaling functions
US20030225806A1 (en) Traced fast fourier transform apparatus and method
EP0037130B1 (en) Arrangement for calculating the discrete fourier transform by means of two circular convolutions
Meek et al. Fast convolution for recursive digital filters
Kaiser On the fast generation of equally spaced values of the Gaussian function A exp (-at* t)
Jacobsen et al. Sliding spectrum analysis
Balla et al. Higher radix aperiodic-convolution algorithms
Grigoryan et al. Method of flow graph simplification for the 16-point discrete Fourier transform
Murakami et al. Recursive FIR digital filter design using a z-transform on a finite ring
Murakami Sampling rate conversion systems using a new generalized form of the discrete Fourier transform