Fast Radix-3/9 Discrete Hartley Transform

Pak Kong Lun, Wan Chi Siu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


An efficient radix-3/9 fast Hartley transform (FHART) algorithm is proposed. It shows a great improvement over the previous radix-3 FHART algorithm such that nearly 50% of the number of multiplications is saved. For the computation of real-valued discrete Fourier transforms (DFT's) with sequence lengths which are powers of 3, the proposed radix-3/9 algorithm also gives a significant improvement over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm.
Original languageEnglish
Pages (from-to)2494-2499
Number of pages6
JournalIEEE Transactions on Signal Processing
Issue number7
Publication statusPublished - 1 Jan 1993

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast Radix-3/9 Discrete Hartley Transform'. Together they form a unique fingerprint.

Cite this