High Performance DIF-FFT Using Dissimilar Partitioned LUT Based Distributed Arithmetic
| Autor: | Kusma Kumari Cheepurupalli, Muntha Charan, Jammu Bhaskara Rao, Mahammad S. Noor |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | International Journal of Electronics and Telecommunications, Vol vol. 67, Iss No 4, Pp 631-637 (2021) |
| Druh dokumentu: | article |
| ISSN: | 2081-8491 2300-1933 |
| DOI: | 10.24425/ijet.2021.137856 |
| Popis: | Real-time data processing systems utilize Digital Signal Processing (DSP) functions as the base modules. Most of the DSP functions involve the implementation of Fast Fourier Transform (FFT) to convert the signals from one domain to another domain. The major bottleneck of Decimation in frequency- Fast Fourier Transform (DIF-FFT) implementation lies in using a number of Multipliers. Distributed arithmetic (DA) is considered as one of the efficient techniques to implement DIF-FFT. In this approach, the multipliers are not used. The proposed technique exploits the very advantage of the look-up table by storing the Twiddle factors, thereby avoiding the multipliers required in the butterfly structure. DIF-FFT using Distributed Arithmetic (DIF-FFT DA) models, with different adders such as Ripple carry adder (RCA), Carry-lookahead adder (CLA), and Sklansky prefix graph adder, are proposed in this paper. The three proposed models are synthesized using Cadence 6.1 EDA tools with a 45nm CMOS technology. Compared to the traditional method, it is observed that the area is improved by 53.11%, 53.35%, and 50.15%, power is improved by 42.31%, 42.52%, and 40.39%, and delay is improved by 45.26%, 45.42%, 41.80%, respectively. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|