2018
DOI: 10.1007/s11265-018-1370-y
|View full text |Cite
|
Sign up to set email alerts
|

SFF—The Single-Stream FPGA-Optimized Feedforward FFT Hardware Architecture

Abstract: In this paper, a fast Fourier transform (FFT) hardware architecture optimized for field-programmable gate-arrays (FPGAs) is proposed. We refer to this as the single-stream FPGA-optimized feedforward (SFF) architecture. By using a stage that trades adders for shift registers as compared with the single-path delay feedback (SDF) architecture the efficient implementation of short shift registers in Xilinx FPGAs can be exploited. Moreover, this stage can be combined with ordinary or optimized SDF stages such that … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 25 publications
(58 reference statements)
0
3
0
Order By: Relevance
“…The method based on the maximum function proves sufficient for most cases considered. The absence of floating-point calculations results in less computing power and the possibility of using hardware acceleration methods [33][34][35]. The CoG method allows for the increased resolution in the z-axis.…”
Section: Discussionmentioning
confidence: 99%
“…The method based on the maximum function proves sufficient for most cases considered. The absence of floating-point calculations results in less computing power and the possibility of using hardware acceleration methods [33][34][35]. The CoG method allows for the increased resolution in the z-axis.…”
Section: Discussionmentioning
confidence: 99%
“…The SFF FFT was presented in 2018 [47]. This serial architecture uses a small number of butterflies, rotators and multiplexers.…”
Section: Chronologymentioning
confidence: 99%
“…In traditional Radix-2 SDF and MDC, the actual utilization of computing units is only 50%, which is reflected in both butterfliers and complex multipliers. In the SFF structure proposed by Carl et al [19], the utilization of butterfliers is increased to 100% by using the stage that trades adders for shift registers but at the cost of doubling the storage units. In the structure proposed by Mohammed et al [20], the multiplier utilization is increased to 100% by adding a data channel, but at the cost of doubling the butterfliers.…”
Section: Introductionmentioning
confidence: 99%