Journal of VLSI Design Tools and Technology

A Novel Conflict-Free Efficient Memory-Based Real FFT Processor using UTB

  1. Rajasekhar Turaka ✉

Abstract

AbstractWe present “A Novel Conflict-Free Efficient Memory-Based Real Fast Fourier Transform (RFFT) using Urdhva Tiryagbhayam Butterfly”. In this paper different FFT lengths for address schemes are integrated that supports FFT processing which are used in diverse systems such as telecommunications. Address methods for various FFT lengths are coordinated in this paper to help FFT processing for different frameworks like broadcast communications. The memory bank and address can be produced by modulo and multiplication tasks of the deterioration digits. For both Single Power Point (SPP) and Non Single Power Point (NSPP) FFTs, high-radix calculation and parallel-processing method can be utilized to build the throughput. Moreover, a decomposition method, named High Radix Small Butterfly (HRSB), is designed to suit the high-radix algorithm. In the spot of HRSB, the Urdhva Tiryagbhyam Butterfly (UTB) is utilizes to increase the speed of multiplications. Both proposed and existed architecture will be implemented in various FPGA architectures to compare different parameters like area, power and delay. The throughput results are shown along with comparisons.Keyword: Conflict-free address scheme, Fast Fourier transform (FFT), Real FFT, Application Specific Integrated Circuit (ASIC) and Field Programmable Gate Arrays (FPGA).

References (14)

  1. Joshi SM. FFT architectures: a review. International Journal of Computer Applications. 2015 Jan 1;116(7).
  2. Yang, Yao -Xian, et al. Design of cost - efficient memory -based FFT processors using single -port memories. 2007 IEEE International SOC Conference . IEEE, 2007.
  3. Baas, Bevan M. A low -power, high - performance, 1024 -point FFT processor. IEEE Journal of So lid-State Circuits . 1999;34(3): 380–387.
  4. Zhen-Guo Ma, Xiao -Bo Yin, Feng Yu . A Novel Memory Based FFT Architecture for Real Valued Signals Based on a Radix- 2 Decimation -In-Frequency Algorithm. IEEE Transactions on Circuits and Systems II. 2015;62(9):876–880.
  5. Rajasekhar Turaka, M Satya Sai Ram . Low Power VLSI implementation of Real Fast Fourier Transform with DRAM -VM- CLA. Microprocessors and Microsystems. May 2019;69:92–100.
  6. LG Johnson . Conflict free memory addressing for dedicated FFT hardware . IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. May 1992;39(5):312–316.
  7. D Reisis , N Vlassopoulos . Conflict-free parallel memory accessing techniques for FFT architectures . IEEE Trans. Circuits Syst. I Reg. Dec. 2008;55(11):3438–3447. Journal of VLSI Design Tools & Technology Volume 6, Issue 3 ISSN: 2249-474X (Online), ISSN: 2321-6492 (Print) JoVDTT (2019) 1-11 © STM Journals 2019. All Rights Reserved Page 11
  8. Xia K, Wu B, Zhou X, Xiong T. An efficient prime factor memory -based FFT processor for LTE systems. 2016 IEEE International Symposium on Circuits and Systems. 2016;1546–1549.
  9. C-F Hsiao, Y Chen, C -Y Lee . A generalized mixed -radix algorithm for memory-based FFT processors . IEEE Trans. Circuits Syst. II, Express Briefs . Jan. 2010;57(1):26–30.
  10. P-Y Tsai, C-Y Lin. A generalized conflict- free memory addressing scheme for continuous-flow parallel -processing FFT processors with rescheduling. IEEE Trans. Very Large Scale Integr. (VLSI) Syst . Dec. 2011;19(12):2290–2302.
  11. Xia, Kai -Feng, et al. A memory -based FFT processor d esign with generalized efficient conflict -free address schemes. IEEE Transactions on Very Large Sc ale Integration (VLSI) Systems . 2017;25(6):1919–1929.
  12. Kunchigi V, Kulkarni L, Kulkarni S. High speed and area efficient Vedic multiplier. International Confer ence on Devices, Circuits and Systems (ICDCS), 2012. pp.360–364, 15–16 March 2012.
  13. Yojana Jadhav, AP Hatkar . Implementation of FFT Processor using Urdhva Tiryakbhyam Sutra of Vedic Mathematic. International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE) 2007;4(3).
  14. Dravik KishorBhai Kahar, Harsh Mehta . High Speed Vedic Multiplier Used Vedic Mathematics. International Conference on Intelligent Computing and Control Systems (ICICCS). 2017. Cite this Article Rajasekhar Turaka, M. Satya Sai Ram. A Novel Conflict -Free Efficient Memory - Based Real FFT Processor using UTB. Journal of VLSI Design Tools & Technology. 2019; 9(3): 1–11p.

Read more of it

Subscribe to one journal or build your own list of several. One invoice, one payment, access for a full year.

Subscribe to journals →

Publish your article

Peer-reviewed journals across every subject, with open access options. Send your manuscript to the right editor today.

Publish with us → Calculate your APC
Support