2016 IEEE 7th Latin American Symposium on Circuits &Amp; Systems (LASCAS) 2016
DOI: 10.1109/lascas.2016.7451037
|View full text |Cite
|
Sign up to set email alerts
|

Design of optimized radix-2 and radix-4 butterflies from FFT with decimation in time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…In the present mobile application, it was chosen the frequency recognition through the Fast Fourier Transform Radix-2 algorithm, according to [8], making use of the native Java development kit, while for the execution of MIDI sounds, the model that was done in [7] was retaken.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In the present mobile application, it was chosen the frequency recognition through the Fast Fourier Transform Radix-2 algorithm, according to [8], making use of the native Java development kit, while for the execution of MIDI sounds, the model that was done in [7] was retaken.…”
Section: Related Workmentioning
confidence: 99%
“…The input and output of an FFT are expressed in complex numbers, in this case, for its implementation, two arrangements are accepted to store the real and imaginary components in them, when using the recording tools of mobile devices, all the bytes of audio information are obtained, which are used within the real components, while the imaginary components are always filled with zeros, the output of the algorithm is contained in two other arrays, one corresponding to each type of component, where the frequency spectra are stored, since only the actual samples are used for input, only the first half of the components need to be analyzed. Each component of the frequency spectrum is related to the previous component, since it is the sampling frequency divided by the number of samples of the FFT [8].…”
Section: B Fast Fourier Transform (Fft)mentioning
confidence: 99%
See 1 more Smart Citation
“…Equation ( 14) can be simplified as (17). It is treated as a 4-point DFT and can be realized using one butterfly radix-4 DIT-FFT algorithm [30].…”
Section: B Mixed-radix Butterfly-based 1-d Sdft Structurementioning
confidence: 99%
“…These can be defined as follows, radix-2 algorithm consists of log 2 N stages, and each stage consists of N/2 stage blocks, and each block consists of 2 stage−1 butterflies. As in signal processing (digital), most of the required arithmetic computations are additions and multiplications, radix-2 offers N/2 × log 2 N complex multiplications and N × log 2 N complex additions [9][10][11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%