Abstract

This paper presents a compact structure of recursive discrete Fourier transform (RDFT) with prime factor (PF) and common factor (CF) algorithms to calculate variable-length DFT coefficients. Low-power optimizations in VLSI implementation are applied to the proposed RDFT design. In the algorithm, for 256-point DFT computation, the results show that the proposed method greatly reduces the number of multiplications/additions/computational cycles by 97.40/94.31/46.50% compared to a recent approach. In chip realization, the core size and chip size are, respectively, 0.84 × 0.84 and 1.38 × 1.38 mm2. The power consumption for the 288- and 256-point DFT computations are, respectively, 10.2 (or 0.1051) and 11.5 (or 0.1176) mW at 25 (or 0.273) MHz simulated by NanoSim. It would be more efficient and more suitable than previous works for DRM and DRM+ applications.

Highlights

  • The rapid growth of multimedia and wireless communication technologies has enabled the integration of various audio coding standards in a multimedia platform for audio applications

  • It implies that the computation between c-point discrete Fourier transform (DFT) and m-point DFT has a complex multiplication

  • Note that the twiddle factor multiplications are computed by the same recursive discrete Fourier transform (RDFT) module, if the common factor (CF)-DFT algorithm is adopted

Read more

Summary

Introduction

The rapid growth of multimedia and wireless communication technologies has enabled the integration of various audio coding standards in a multimedia platform for audio applications. The issue of a common architecture design of fast Fourier transform (FFT) and IMDCT has been developed in [2,3,4,5] for a digital audio broadcasting (DAB) system [6,7]. The computational complexity of 256-point RDFT based on Lai et al.’s algorithm [32] still takes more multiplications and additions, because the transform length only has one prime factor so that we only can adopt three 1-D. Hsiao et al merge prime factor and common factor concepts to realize the proposed accelerator, and propose an efficient address generator to avoid the memory access conflict It still requires many radix-r processing units to support the FFT computations.

The Proposed Compact RDFT with Prime Factor and Common Factor Algorithms
The Proposed Compact RDFT Architecture Design
Low-Power Optimizations
Implementation Results
Comparison and Discussion
Method
Design
Conclusions
Radio Broadcasting System
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call