FPGA Implementation of Discrete Fourier Transform Core Using NEDA

Mankar, A.; Prasad, Neeli R.; Meher, Sukadev

doi:10.1109/csnt.2013.152

Search citation statements

Order By: Relevance

Paper Sections

Select...

Transforms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2018

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Transforms are helpful for conversion of difficult calculation into easiest way as possible [8][9]. The analysis of the signal is possible in any form either in frequency or time domain.…”

Section: Transformsmentioning

confidence: 99%

High Speed RADIX-2 Butterfly Structure Using Novel Wallace Multiplier

Thakur¹,

Sohal²,

Jain³

2018

IJET

View full text Add to dashboard Cite

In Signal Processing applications the arithmetic units mainly consists of adders and multipliers. These arithmetic units are used in to enhance the performance of Fast Fourier Transform (FFT) Butterfly structure implementation. This paper discusses the addition and multiplication algorithms for parameters like speed, area and power. The best suited among all adders are Kogge Stone Adder (KSA) while among multipliers are Wallace multiplier(WM) which is used for the implementation of the FFT structure. Verilog coding is used for implementation of circuit and the tool used is Xilinx ISE 14.1 Design suite.

show abstract

“…Transforms are helpful for conversion of difficult calculation into easiest way as possible [8][9]. The analysis of the signal is possible in any form either in frequency or time domain.…”

Section: Transformsmentioning

confidence: 99%