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

Authors:
Subhendu Kumar Sahoo;Chandra Shekhar;Sudeepti Kodali;Abhijit R. Asati;Anu Gupta
Affiliations:
Department of Electrical and Electronics Engineering, Birla Institute of Technology and Science, Pilani, Rajasthan, India.;Central Electronics Engineering Research Institute, Pilani, India.;NVIDIA Graphics Private Limited, Bangalore, India.;Department of Electrical and Electronics Engineering, Birla Institute of Technology and Science, Pilani, Rajasthan, India.;Department of Electrical and Electronics Engineering, Birla Institute of Technology and Science, Pilani, Rajasthan, India
Venue:
International Journal of High Performance Systems Architecture
Year:
2009

Citing 6
Cited 1

Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimal Circuits for Parallel Multipliers

IEEE Transactions on Computers
High-Speed Booth Encoded Parallel Multiplier Design

IEEE Transactions on Computers - Special issue on computer arithmetic
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach

IEEE Transactions on Computers
Evaluation of Booth's algorithm for implementation in parallel multipliers

ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)

Streaming of medical images using JPEG2000 Interactive Protocol

International Journal of Innovative Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.