Skip to main navigation Skip to search Skip to main content

FPGA implementation of highly modular fast universal discrete transforms

  • Mahanakorn University of Technology
  • University of Texas at Arlington

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

This paper presents an FPGA implementation of highly modular universal discrete transforms. The implementation relies upon the unified discrete Fourier Hartley transform (UDFHT), based on which essential sinusoidal transforms including discrete Fourier transform (DFT), discrete Hartley transform (DHT), discrete cosine transform (DCT) and discrete sine transform (DST) can be realized. It employs a reconfigurable, scalable and modular architecture that consists of a memory-based FFT processor equipped with pre- and post-processing units. Besides, a pipelining technique is exploited to seamlessly harmonize the operation between each sub-module. Experimental results based on Xilinx Virtex-II Pro are given to examine the performance of the proposed UDFHT implementation. Two practical applications are also shown to demonstrate the flexibility and modularity of the proposed work.

Original languageEnglish
Pages (from-to)576-586
Number of pages11
JournalIEICE Transactions on Electronics
VolumeE92-C
Issue number4
DOIs
Publication statusPublished - 2009
Externally publishedYes

Keywords

  • DCT
  • DFT
  • DHT
  • DST
  • FFT
  • FPGA
  • Reconfigurable computing
  • UDFHT

Fingerprint

Dive into the research topics of 'FPGA implementation of highly modular fast universal discrete transforms'. Together they form a unique fingerprint.

Cite this