A prime factor FTT algorithm using distributed arithmetic

DOI10.1109/TASSP.1982.1163875MaRDI QIDQ3677124zbMATH OpenOpenAlexWikidataFDO

Authors Shuni Chu, C. Sidney Burrus

Publication date 1982

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tassp.1982.1163875

zbMATH Keywords

cyclic convolutionsdigital signal processingdiscrete Fourier transformfast Fourier transformprime factor decomposition

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• scientific article; zbMATH DE number 5876376
• Implementation of a self-sorting in-place prime factor FFT algorithm
• A pipeline design of a fast prime factor DFT on a finite field
• On the structure of efficient DFT algorithms
• The design of optimal DFT algorithms using dynamic programming

Cited in

(3)

• Special purpose hardware for discrete Fourier transform implementation
• A pipeline design of a fast prime factor DFT on a finite field
• A pipeline design for the realization of the prime factor algorithm using the extended diagonal structure

This page was built for publication: A prime factor FTT algorithm using distributed arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677124)