FPGA-Based Structures for On-Line FFT and DCT

  • Authors:
  • Dannie Lau;Aaron Schneider;Milos D. Ercegovac;John Villasenor

  • Affiliations:
  • -;-;-;-

  • Venue:
  • FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Signal processing applications often exhibit substantial parallelism with respect to the number of operations that can be performed independently. However, memory bandwidth and design size present a limiting factor to the speedups that can be achieved. Previous research has focused on bit-serial arithmetic to provide acceleration despite the pin and logic limitations of FPGAs. Conventional bit-serial techniques carry the disadvantage of presenting results in parallel form requiring re-serialization if the results need to be passed to subsequent bit-serial units. This can result in complex control logic, lower performance and, in the case of Xilinx XC4000 FPGAs, inefficient temporary storage structures.This paper presents on-line arithmetic structures tailored for use in the FFT and DCT. Due to their small size, several of these modules can be connected together to form larger, more powerful blocks. The digit-serial nature of on-line arithmetic allows valuable pin resources to feed a larger number of arithmetic units than in the conventional case. Additionally, the resolution of the most significant digit first, a property of on-line arithmetic, allows subsequent calculations to occur at a much earlier stage. As such, performance of the FFT and DCT benefit over conventional and traditional digit-serial FPGA implementations.