The week's pick
Reseach Article
FFT utilizing Modified SQRT CSLA and Proposed 5:3 & 9:4 Compressor
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 128 - Number 10 |
| Year of Publication: 2015 |
| Authors: Avneesh Kumar Mishra, Neeraj Jain, Paresh Rawat |
10.5120/ijca2015906648
|
Avneesh Kumar Mishra, Neeraj Jain, Paresh Rawat . FFT utilizing Modified SQRT CSLA and Proposed 5:3 & 9:4 Compressor. International Journal of Computer Applications. 128, 10 ( October 2015), 36-40. DOI=10.5120/ijca2015906648
Abstract
While designing Fast Fourier Transform (FFT) cores, due to the use of multiplexers, memory, or ROMs, there is a substantial increase in power consumption and area. In order to increase speed and throughput, folding and pipelining methods have been approached by various existing designs. But the prime disadvantage of those architectures is the use of multipliers for twiddle multiplications. This present work has proposed fast fourier transform using compressors based multiplier. Both parallel and pipelining techniques have also been used in the proposed designs. Carry Select adder is known to be the fastest adder among the Conventional adder structures. This work uses an efficient Carry select adder by sharing the binary to excess-1 converter (BEC) term. After a logic simplification, we only need one XOR gate, one AND gate and one inverter gate for carry and summation operation. Through the multiplexer, we can select the correct output according to the logic states of the carry in signal. These all design and experiments were carried out on a Xilinx 14.1i Spartan 3e device family.
References
- Sushma R. Huddar and Sudhir Rao, Kalpana M., “Novel High Speed Vedic Mathematics Multiplier using Compressors”, 978-1-4673-5090-7/13/$31.00 ©2013 IEEE.
- S. S. Kerur, Prakash Narchi, Jayashree C N, Harish M Kittur and Girish V A, “Implementation of Vedic multiplier for Digital Signal Processing”, International Conference on VLSI, Communication & Instrumentation (ICVCI) 2011, Proceedings published by International Joural of Computer Applications® (IJCA), pp.1-6.
- Himanshu Thapaliyal and M.B Srinivas, “VLSI Implementation of RSA Encryption System Using Ancient Indian Vedic Mathematics”, Center for VLSI and Embedded System Technologies, International Institute of Information Technology Hyderabad, India.
- Jagadguru Swami Sri Bharati Krishna Tirthaji Maharaja, “Vedic Mathematics: Sixteen simple Mathematical Formulae from the Veda”, Delhi(2011).
- Sumit Vaidya and Depak Dandekar. “Delay-power performance comparison of multipliers in VLSI circuit design”. International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.4, July 2010.
- P. D. Chidgupkar and M. T. Karad, “The Implementation of Vedic Algorithms in Digital Signal Processing”, Global J. of Eng. Edu, Vol.8, No.2, 204, UICEE Published in Australia.
- S. Correa, L. C. Freitas, A. Klautau and J. C. W. A. Costa, “VHDL Implementation of a Flexible and Synthesizable FFT Processor”, IEEE LATIN AMERICA TRANSACTIONS, VOL. 10, NO. 1, JAN. 2012.
- Y. Kim and L. -S. Kim, "16-bit carry-select adder with reduced area, “Electron. Lett. vol. 37, no. 10, pp. 614-615, May 2001.
- B. Ramkumar, H. M. Kittur, and P. M. Kannan, “ASIC implementation of modified faster carry save adder,” Eur. J. Sci. Res., vol. 42, no. 1, pp. 53–58, 2010.
- T. Y. Ceiang and M. J. Hsiao, “Carry-select adder using single ripple carry adder,” Electron. Lett., vol. 34, no. 22, pp. 2101–2103, Oct. 1998.
- Y. Kim and L.-S. Kim, “64-bit carry-select adder with reduced area,” Electron. Lett., vol. 37, no. 10, pp. 614–615, May 2001.
- J. M. Rabaey, Digital Integrated Circuits—A Design Perspective. Upper Saddle River, NJ: Prentice-Hall, 2001.
- Y. He, C. H. Chang, and J. Gu, “An area efficient 64-bit square root carry-select adder for low power applications, “in Proc.IEEE Int. Symp. Circuits Syst., 2005, vol. 4, pp. 4082–4085
- Figure 9: Output Waveform of Proposed Design
Index Terms
Keywords