23rd IEEE International SOC Conference 2010
DOI: 10.1109/socc.2010.5784750
|View full text |Cite
|
Sign up to set email alerts
|

Expandable MDC-based FFT architecture and its generator for high-performance applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…In this work, N is set as 512. When the period is power of 2, we can use radix-2 Fast Fourier transform (FFT) algorithn to compute discrete Fourier transform [23], [24]. We separate the points of Xk into even and odd point.…”
Section: Architecture Of Fast Fourier Transformmentioning
confidence: 99%
“…In this work, N is set as 512. When the period is power of 2, we can use radix-2 Fast Fourier transform (FFT) algorithn to compute discrete Fourier transform [23], [24]. We separate the points of Xk into even and odd point.…”
Section: Architecture Of Fast Fourier Transformmentioning
confidence: 99%