Scalable FFT processors and pipelined butterfly units

DOI10.1007/s11265-006-7265-3zbMath1138.94399OpenAlexW1991805453MaRDI QIDQ2432171

Konsta Punkka, Jarmo Henrik Takala

Publication date: 25 October 2006

Published in: Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11265-006-7265-3

zbMATH Keywords

parallel processingCORDICdistributed arithmeticapplication-specific integrated circuitradix-2

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Analytic circuit theory (94C05)

Cites Work

• Unnamed Item
• Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
• Recursive fast algorithm and the role of the tensor product
• Fourier Transform Computers Using CORDIC Iterations
• Partial column FFT pipelines
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Scalable FFT processors and pipelined butterfly units