Implementation of FFT Structures Using the Residue Number System

DOI10.1109/TC.1979.1675263MaRDI QIDQ3859280zbMATH OpenOpenAlexFDO

Authors Ben-Dau Tseng, Graham A. Jullien, W. C. Miller

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1979.1675263

zbMATH Keywords

arrays of read-only memoriesfiltering of speech via a convolutional filter structurehigh-speed filtersimplementation of a fast Fourier transformoptimal hardware realizationresidue number systemscaling factors

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical methods for discrete and fast Fourier transforms (65T50) Mathematical problems of computer architecture (68M07) Communication theory (94A05)

Recommendations

• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
• FFT Implementation with Fused Floating-Point Operations
• Residue number systems. Theory and implementation.
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• scientific article; zbMATH DE number 55185
• On hardware implementation of the split-radix FFT
• FFT techniques in the numerical solution of convolution equations
• Multiplierless implementation of rotators and FFTs

Cited in

(3)

• A new technique for WFTA input/output reordering
• Scaling in residue number systems
• FFT Implementation with Fused Floating-Point Operations

This page was built for publication: Implementation of FFT Structures Using the Residue Number System

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