The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS
Transactions ID Number: 52-640
Full Name: Partha Bhattacharyya
Position: Assistant Professor
Age: ON
Sex: Male
Address: Bengal Engineering and Science University, Shibpur
Country: INDIA
Tel: +913326684561
Tel prefix:
Fax: +913326682916
E-mail address: pb_etc_besu@yahoo.com
Other E-mails:
Title of the Paper: ASIC Implementation of High Speed Processor for Calculating Discrete Fourier Transformation using Circular Convolution Technique
Authors as they appear in the Paper: P. Saha, A. Banerjee,A. Dandapat,P. Bhattacharyya
Email addresses of all the authors: sahaprabir1@gmail.com,banerjee.arindam1@gmail.com,anup.dandapat@gmail.com,pb_etc_besu@yahoo.com
Number of paper pages: 12
Abstract: The improvement in speed and power for calculating discrete Fourier transformation using circular convolution is well established, but all the work so far been reported are at FPGA (gate) level. In this paper ASIC implementation of high speed processor for calculating Discrete Fourier Transformation (DFT) based on circular convolution architectures is reported for the first time. The IEEE-754 single precision format was considered for the representation of the twiddle factors. The improvement of the speed for floating point multiplication/addition was achieved by canonical sign digit implementation methodology, which reduced the stages of operation significantly. The functionality of these circuits was checked and performance parameters such as propagation delay, dynamic switching power consumptions were calculated by spice spectre using standard 90nm CMOS technology. The implementation methodology ensure substantial reduction of propagation delay in comparison wi!
th systolic array and memory based implementation, most commonly used architectures, reported so far, for DFT processors. The propagation delay of the resulting 16 point DFT processor is only 23.79µs while the power consumption of the same was 14.32mW only. Almost 50% improvement in speed from earlier reported DFT processors, e.g. systolic array and memory based implementation methodology, has been achieved.
Keywords: DFT, Fast Fourier Transformation (FFT), Circular Convolution, Multiply and ACcumulate (MAC), Canonical Sign Digit (CSD) Adder, CSD Multiplier
EXTENSION of the file: .doc
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress: Digital VLSI design
IP ADDRESS: 220.225.86.74
