TY - GEN
T1 - VLSI architecture for DFT
AU - Chan, Eric
AU - Panchanathan, Sethuraman
PY - 1993/12/1
Y1 - 1993/12/1
N2 - In this paper, a one-dimensional fully pipelined architecture for computing discrete-Fourier transform (DFT) is presented. It consists of an array of N basic cells (BC's) and requires N clock cycles for a N-point DFT. The architecture is modular and makes possible computation of a 2N-point transform by a simple cascade of two identical N-point transform chips. The architecture is simple and regular in structure and is hence very attractive for VLSI implementation.
AB - In this paper, a one-dimensional fully pipelined architecture for computing discrete-Fourier transform (DFT) is presented. It consists of an array of N basic cells (BC's) and requires N clock cycles for a N-point DFT. The architecture is modular and makes possible computation of a 2N-point transform by a simple cascade of two identical N-point transform chips. The architecture is simple and regular in structure and is hence very attractive for VLSI implementation.
UR - http://www.scopus.com/inward/record.url?scp=0027755592&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027755592&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027755592
SN - 0780317610
T3 - Midwest Symposium on Circuits and Systems
SP - 292
EP - 295
BT - Midwest Symposium on Circuits and Systems
PB - Publ by IEEE
T2 - Proceedings of the 36th Midwest Symposium on Circuits and Systems
Y2 - 16 August 1993 through 18 August 1993
ER -