Author:
Ms.Dharani S,Satheesan Mr.Abin,Asuvanti M A,Kumar Ranjith,Vidhya S
Abstract
Abstract
The FFT Function in digital signal processing is one of the most important function in several applications such as Image Processing, Wireless Communications and Multimedia. FFT Processors consisting of butterfly structure operations involving necessary operations such as Addition, Subtraction, and Multiplication of complex values. The FFT Butterfly Structure work is designed with a “Vedic Multipliers” for applications at high speed. In this Vedic Multiplier, an algorithm called “Urdhva Triyabhyam” was used to improve its efficiency by optimizing the number of logic gates, constant inputs and garbage outputs. The Data Computation time is reduced by an 3-1-1-2 compressor using reversible logic gates. Hence reducing the surplus power consumption of 11.24% and summation of the partial products is done with less delay factor of about 5.28%. The area, power, delay, area delay product and power delay product are calculated using cadence virtuoso and is implemented in Spartan-6 device family using Xilinx ISE.
Reference14 articles.
1. A low-power adder operating on effective dynamic data ranges;Chen;IEEE Trans. Very Large Scale Integr. (VLSI) Syst.,2000
2. Design of power-ecient configurable booth multiplier;Kung;IEEETrans. Circuits. Syst.–I: RegularPapers,2010
3. High-accuracy fixed-width modified booth multipliers for lossy applications;Wang;IEEE Trans. Very Large Scale Integr. (VLSI) Syst.,2011
4. High speed speculative multipliers based on speculative carry- save tree;Cilardo;IEEE Trans.CircuitsSyst.–I.RegularPap.,2014
5. Run time reconfigurable modified Vedic multiplier for high speed multimedia applications;Sivanandam,2015
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献