An Efficient High-Throughput FFT Architecture to Process Twin Real-Valued Data-Streams With Normal I/O Order

Read full text
Authors: Antony Xavier Glittas, K. K. Abdul Majeed, Pradeep, N. Nandakumar, Pranavu Atithya
Cited by: 0

Abstract

This paper proposes an efficient pipelined modified MDC-based (Multipath Delay Commutator) radix-2 Real-valued Fast Fourier Transform (RFFT) architecture with high throughput. The RFFT is an optimised Fast Fourier Transform (FFT) architecture to process real-valued signals. Though several RFFT architectures are available, they have low throughput and lack a better reordering methodology. Many prior designs process one sample per clock cycle and require relatively more hardware, and data reordering is required at the input and output. The proposed architecture is designed based on an overlapped data flow graph of two independent RFFTs, which can process two real-valued data streams simultaneously. It takes two real-valued samples per data stream per cycle in normal order, and generates output in normal order with the help of a novel reordering circuit. The computational complexity of the proposed design is significantly lower than the prior designs. The adder and register complexity of the proposed design is 50% less than the earlier works, and the proposed design delivers better throughput as well.

Fields of Study & Subjects

Digital Filter Design and Implementation Embedded Systems Design Techniques Parallel Computing and Optimization Techniques

Publication details

Journal / source
IEEE Access
Volume
14
Pages
33170–33177
Publication date
1 January 2026
Language
EN