The week's pick
Random Articles
Reseach Article
Fast Fourier Transformation Realistion with Distributed Arithmetic Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 102 - Number 15 |
| Year of Publication: 2014 |
| Authors: Renu Bala, Shamim Aktar |
10.5120/17892-8889
|
Renu Bala, Shamim Aktar . Fast Fourier Transformation Realistion with Distributed Arithmetic Algorithm. International Journal of Computer Applications. 102, 15 ( September 2014), 22-25. DOI=10.5120/17892-8889
Abstract
Fast Fourier transform (FFT) is a sound tool for computation of Discrete Fourier transform (DFT). It is widely used for analysis of digital spectrums, FIR filters, and autocorrelation and pattern recognition applications [1]. FFT is based on violation the input sample sequence into smaller sample sequences and mingling them to get the total output order or transform. FFT reduces the computation time required to compute a DFT and thus improves speed of computation. In this paper FFT computations will be done using a different method known as distributed arithmetic algorithm. Method is designed in VHDL. Simulation of the code is done in ModelSim 6. 4.
References
- R. A Barapate, "Digital Signal processing," Edition 2010, Tech-Max Publications, Pune.
- P. Ramesh Babu, "Digital signal processing," fourth edition, Scitech publications(India).
- L. Erick Oberstar, "Fixed-point representation and fractional math," Oberstar consulting, revision August, 30, 2007.
- P. Augusta Sophi, R. Srinivasan, J. Raja, "Distributed arithmetic based butterfly element for FFT processor in 45 nm technology," ARPN Journal of Engineering and Applied Sciences, vol. 8, no. 1, January 2013.
- M. Suhasini, K. Prabhu Kumar and P. Srinivas, "Multiplier design and performance estimation with distributed arithmetic algorithm," IJCCT, Vol. 3, Issue-4, 2012.
- S. A. White, "A simple FFT butterfly arithmetic unit", IEEE Trans. Circuits system, vol. 28 no. 4, pp. 352-355, April 1981.
- S. A. White " Applications of distributed arithmetic to digital signal processing," Analog and Digital Signal processing, 1989, Vol. 12, no. 23, pp. 4-19.
- J. Cooley and J. Tuckey, "An algorithm for machine calculation of the complex Fourier series," Math. Comput. ,vol. 19, 297-301, April. 1965.
- T. Thong and B. Liu, "Fixed-point fast fourier transform error analysis, " IEEE Trans. Acoust. , Speech, Signal Processing, vol. 24, no. 6, pp. 563-573, dec. 1976.
- A. Wenzler and E. Luder, "New structure for complex multipliers and their noise analysis," in proceeding. IEEE ISCAS, Seatle, WA, April. 30-May3 1995, vol. 2, pp. 1432-1435.
- J. Takala and K. Punkka, "Butterfly unit supporting radix-4 and radix-2 FFT," Tampere University of Technology, P . O . Box 553, FIN-33101 Tampere, FINLAND.
- S. G Smith and P. B Denyer, "Efficient bit-serial complex multiplication and sum of product computation using distributed arithmetic," in proc. IEEE int. conf. Acoustics, Speech and Signal processing, 1986, pp. 271-276.
- A. Berkman, V. Owall, and Mats Torkelson, "A low logic depth complex multiplier using distributed arithmetic," IEEE Journal of Solid State Circuits, vol. 35, no. 4, April 2000.
- T. Ranjith Kumar, "design and implementation of DDA architecture for FIR Filters," IJETT vol. 4, Issue 9, September 2013.
Index Terms
Keywords