Design of FFT processor using low power Vedic multiplier for wireless communication

被引:7
作者
Padma, C. [1 ]
Jagadamba, P. [2 ]
Reddy, P. Ramana [3 ]
机构
[1] JNTUA, Dept ECE, Res Scholar, Ananthapuramu, Andhra Pradesh, India
[2] SKIT, Dept ECE, Srikalahasti, Andhra Pradesh, India
[3] JNTUA, Dept ECE, Ananthapuramu, Andhra Pradesh, India
关键词
Binary floating-point multiplier; Vedic multiplier; Kogge Stone Adder (KSA); Single path delay feedback architecture (SDF); Digital signal processor (DSP); Fast Fourier Transform (FFT); EFFICIENT;
D O I
10.1016/j.compeleceng.2021.107178
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Digital Signal Processing (DSP) is a very significant and active research area. High throughput is a requirement for most wireless communication systems. The critical bottleneck that affects communication ability is the Fast Fourier Transform (FFT), which is the essence of most modulators. Currently, Floating point FFT processors have been used in Radar signal processing, fast convolution, Spectrum estimation and OFDM based modulators/demodulators. Efficient VLSI based architectures are required for real-time FFT processing. The multiplication limits the performance in terms of throughput of FFT. Consequently, there is a need for high speed and low power multiplier architectures with minor truncation error. The present paper presents a modified binary floating-point multiplier using Vedic mathematics and a modification in the previously published Vedic multiplier circuit has been proposed. The entire design has been implemented in Verilog HDL. Synthesis and simulations are done using Xilinx ISE Design Suite 14.5.The performance evaluation in terms of speed and area occupied is compared with the previously reported Vedic multiplier architectures. Using 90 nm technologies, the Power Delay Product (PDF) of the proposed Vedic multiplier gets reduced through KSA by 86.41% compared to the multipliers. The Vedic adder power is reduced by 45.9% when it is compared with the carry look-ahead adder. The overall power delay product is reduced around 55-60% through the FFT processor by using Vedic mathematics.
引用
收藏
页数:11
相关论文
共 24 条
[1]  
Anjana R., 2014, 2014 International Conference on Embedded Systems (ICES), P28, DOI 10.1109/EmbeddedSys.2014.6953044
[2]   Synthesize of High Speed Floating-point Multipliers Based on Vedic Mathematics [J].
Anjana, S. ;
Pradeep, C. ;
Samuel, Philip .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES, ICICT 2014, 2015, 46 :1294-1302
[3]  
[Anonymous], 2015, INT J ELECT ELECT DA
[4]   A novel high-speed approach for 16 x 16 Vedic multiplication with compressor adders [J].
Bansal, Yogita ;
Madhu, Charu .
COMPUTERS & ELECTRICAL ENGINEERING, 2016, 49 :39-49
[5]   A PIPELINED FFT PROCESSOR FOR WORD-SEQUENTIAL DATA [J].
BI, G ;
JONES, EV .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1989, 37 (12) :1982-1985
[6]  
Bisoyi A, 2014, 2014 INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), P1757, DOI 10.1109/ICACCCT.2014.7019410
[7]   An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications [J].
Ganjikunta, Ganesh Kumar ;
Sahoo, Subhendu Kumar .
INTEGRATION-THE VLSI JOURNAL, 2017, 57 :125-131
[8]  
Gaur N, 2019, INT J INNOV TECHNOL, V8
[9]  
Gowreesrinivas KV, 2016, P INT C CONTR INSTR, P466
[10]  
Gupta R., 2014, Pain Management, P1, DOI [DOI 10.3109/21691401.2014.984301, 10.3109/21691401.2014.984301]