Special purpose hardware for discrete Fourier transform implementation

DOI10.1016/0167-8191(94)90082-5MaRDI QIDQ1319523zbMATH OpenOpenAlexFDO

Authors Michael Conner, R. Tolimieri

Publication date 30 October 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90082-5

zbMATH Keywords

discrete Fourier transformFourier matrixparallel hardware implementationpipeline timing resultspre-addition stages

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Hardware efficient fast computation of the discrete Fourier transform
• scientific article; zbMATH DE number 4129958
• A prime factor FTT algorithm using distributed arithmetic
• scientific article; zbMATH DE number 3915602
• On the structure of efficient DFT algorithms

This page was built for publication: Special purpose hardware for discrete Fourier transform implementation

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