Rotators in Fast Fourier Transforms

Qureshi, Fahad; Takala, Jarmo; Bhattacharyya, Shuvra S.

doi:10.1007/978-3-030-16949-7_11

Cited by 1 publication

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1 shows a direct implementation of a complex multiplier, which requires four real multipliers and two real adders. This implementation is common in the literature [1][2][3]5]. Note that the complexity of adders and subtractors is the same.…”

Section: Structures To Compute Complex Multiplicationsmentioning

confidence: 99%

“…The multiplication of two complex numbers is an elementary operation, commonly used in digital signal processing algorithms such as the fast Fourier transform (FFT) [1,2]. Large and highly parallel FFT architectures require hundreds of such multipliers.…”

Section: Introductionmentioning

confidence: 99%

“…The direct computation of a complex multiplication requires four real multiplications and two real additions [1][2][3][4][5]. However, the number of real multiplications can be reduced to three by rearranging the operations, at the cost of increasing the number of additions to five [4,[6][7][8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Implementation of Complex Multipliers on FPGAs Using DSP Slices

Paz

Garrido

2023

J Sign Process Syst

View full text Add to dashboard Cite

In this paper, we propose two efficient implementations of complex multipliers on field-programmable gate arrays (FPGAs) using DSP slices. The first implementation aims for high throughput and the second one for low area. By mapping these circuits to the DSP slices in the FPGA, the proposed implementations have the advantage that they only require three DSP slices. Experimental results show that the proposed high-throughput implementation saves hardware resources with respect to previous approaches, while reaching the highest achievable clock frequency. Alternatively, the proposed low-area implementation reduces the amount of hardware resources even further at the cost of reducing the clock frequency.

show abstract

Section: Structures To Compute Complex Multiplicationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%