Name
Abstract | ||
|---|---|---|
This paper presents a novel approach to design four and eight parallel pipelined fast Fourier transform (FFT) architectures using folding transformation. The approach is based on use of decimation in time algorithms which reduce the number of delay elements by 33% compared to the decimation in frequency based designs. The number of delay elements required for an N-point FFT architecture is N - 4 which is comparable to that of delay feedback schemes. The number of complex adders required is only 50% of those in the delay feedback designs. The proposed approach can be extended to any radix-2n based FFT algorithms. The proposed architectures are feed-forward designs and can be pipelined by more stages to increase the throughput. Further, a novel four parallel 128-point FFT architecture is derived using the proposed approach. It is shown that a radix-24 4-parallel 128-point design requires 124 delay elements, 28 complex adders, and four full complex multipliers. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2206781.2206798 | ACM Great Lakes Symposium on VLSI |
Keywords | Field | DocType |
novel approach,128-point fft architecture,delay element,n-point fft architecture,reduced number,delay feedback scheme,fft algorithm,delay feedback design,full complex multiplier,parallel pipelined fft architecture,complex adder,fast fourier transform,feed forward,folding | Decimation,Split-radix FFT algorithm,Adder,Prime-factor FFT algorithm,Twiddle factor,Computer science,Parallel computing,Decimation in frequency,Arithmetic,Electronic engineering,Fast Fourier transform,Throughput | Conference |
Citations | PageRank | References |
4 | 0.49 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Ayinala | 1 | 100 | 7.13 |
| keshab k parhi | 2 | 3235 | 369.07 |