## Abstract

This paper presents a set of novel two-parallel pipelined fast Fourier transform architectures for discrete Fourier transform computation of real-valued signal. The previous approaches of designing real-valued fast Fourier transform (RFFT) architectures are the attempts made to make the data path real. Some of the previous designs have partial real data paths (only first two stages are real), whereas the other designs have complete real data-paths, but reordering registers are required to bring the real and imaginary parts in parallel. Hence, these approaches reduce the number of registers and butterflies only to some extent in the RFFT design. In the proposed designs, feedback-based scheduling structures are introduced, which reduce the number of registers to half in several stages when compared with the previously known designs. Therefore, the proposed designs require 30% less area and 31.5% less power than the prior designs.

Original language | English |
---|---|

Pages (from-to) | 330-336 |

Number of pages | 7 |

Journal | IET Circuits, Devices and Systems |

Volume | 10 |

Issue number | 4 |

DOIs | |

Publication status | Published - Jul 2016 |

## Keywords

- fast Fourier transforms
- microprocessor chips
- processor scheduling
- two-parallel pipelined fast Fourier transform processors
- real-valued signals
- discrete Fourier transform computation
- real-valued fast Fourier transform
- data path real
- partial real data paths
- RFFT design
- feedback-based scheduling structures
- FFT ARCHITECTURES
- OFDM SYSTEMS