Dual channel addition based FFT processor architecture for signal and image processing

This paper presents a novel fixed-point 16-bit word-width 16-point FFT/IFFT processor architecture designed primarily for the signal and image processing application. The 16-point FFT is realised by using Cooley-Tukey decimation in time algorithm. This approach reduces the number of required complex multiplications compared to a normal discrete Fourier transform. Since multipliers are very power hungry elements in VLSI designs, they result in significant power consumption. So, the complex multiplication operations are realised using shift-and-add operations. The proposed algorithm performs all intermediate addition operation using a novel dual channel addition technique, which avoids carry propagation delay. Only in the last stage, carry look ahead adders are used to give final result. This dual channel addition algorithm reduces the critical delay path by 42% and 38.29% as compared to traditional and Maharatna approach respectively.

[1]  P. Duhamel,et al.  `Split radix' FFT algorithm , 1984 .

[2]  S.-W. Chen,et al.  A High-speed Highly Pipelined 2N-point FFT Architecture For A Dual Ofdm Processor , 2006, Proceedings of the International Conference Mixed Design of Integrated Circuits and System, 2006. MIXDES 2006..

[3]  Vojin G. Oklobdzija,et al.  Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[4]  Y. S. Li,et al.  A multi-radix FFT processor using Pipeline in Memory-based Architecture (PIMA) FOR DVB-T/H systems , 2008, 2008 15th International Conference on Mixed Design of Integrated Circuits and Systems.

[5]  Makoto Suzuki,et al.  A 4.4 ns CMOS 54/spl times/54-b multiplier using pass-transistor multiplexer , 1995 .

[6]  P. Bonatto,et al.  Evaluation of Booth's algorithm for implementation in parallel multipliers , 1995, Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers.

[7]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[8]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[9]  R. Woods,et al.  Programmable SoC processor for video object recognition and tracking applications , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[10]  Peter D. Welch,et al.  Fast Fourier Transform , 2011, Starting Digital Signal Processing in Telecommunication Engineering.

[11]  SahooSubhendu Kumar,et al.  Dual channel addition based FFT processor architecture for signal and image processing , 2009 .

[12]  D. H. Jacobsohn,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[13]  Makoto Suzuki,et al.  A 4.4-ns CMOS 54/spl times/54-b multiplier using pass-transistor multiplexer , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[14]  R. Ravi,et al.  Optimal Circuits for Parallel Multipliers , 1998, IEEE Trans. Computers.

[15]  U. Jagdhold,et al.  A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM , 2004, IEEE Journal of Solid-State Circuits.

[16]  Chein-Wei Jen,et al.  High-Speed Booth Encoded Parallel Multiplier Design , 2000, IEEE Trans. Computers.

[17]  S.K. Sahoo,et al.  Multiplier less FFT processor architecture for signal and image processing , 2005, Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005..

[18]  Vojin G. Oklobdzija,et al.  A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.