The long length DHT design with a new hardware efficient distributed arithmetic approach and cyclic preserving partitioning

Hun Chen Chen*, Tian-Sheuan Chang, Jiun-In Guo, Chein Wei Jen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents a long length discrete Hartley transform (DHT) design with a new hardware efficient distributed arithmetic (DA) approach. The new DA design approach not only explores the constant property of coefficients as the conventional DA, but also exploits its cyclic property. To efficiently apply this approach to long length DHT, we first decompose the long length DHT algorithm to short ones using the prime factor algorithm (PFA), and further reformulate it by using Agarwal-Cooley algorithm such that all the partitioned short DHT still consists of the cyclic property. Besides, we also exploit the scheme of computation sharing on the content of ROM to reduce the hardware cost with the trade-off in slowing down the computing speeds. Comparing with the existing designs shows that the proposed design can reduce the area-delay product from 52% to 91% according to a 0.35 μm CMOS cell library.

Original languageEnglish
Pages (from-to)1061-1069
Number of pages9
JournalIEICE Transactions on Electronics
VolumeE88-C
Issue number5
DOIs
StatePublished - 1 Jan 2005

Keywords

  • Computation sharing
  • Cyclic preserving partitioning
  • Discrete Hartley transform
  • Distributed arithmetic

Fingerprint Dive into the research topics of 'The long length DHT design with a new hardware efficient distributed arithmetic approach and cyclic preserving partitioning'. Together they form a unique fingerprint.

Cite this