Fast Radix-3/9 Discrete Hartley Transform

Pak Kong Lun; Wan Chi Siu

doi:10.1109/78.224258

Fast Radix-3/9 Discrete Hartley Transform

Pak Kong Lun, Wan Chi Siu

The Hong Kong Polytechnic University

Research output: Journal article publication › Journal article › Academic research › peer-review

5 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	2494-2499
Number of pages	6
Journal	IEEE Transactions on Signal Processing
Volume	41
Issue number	7
DOIs	https://doi.org/10.1109/78.224258
Publication status	Published - 1 Jan 1993

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering

More information

10.1109/78.224258

Cite this

@article{997ba67090f34c06bbb9250f31dce372,

title = "Fast Radix-3/9 Discrete Hartley Transform",

abstract = "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.",

author = "Lun, {Pak Kong} and Siu, {Wan Chi}",

year = "1993",

month = jan,

day = "1",

doi = "10.1109/78.224258",

language = "English",

volume = "41",

pages = "2494--2499",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "IEEE",

number = "7",

}

TY - JOUR

T1 - Fast Radix-3/9 Discrete Hartley Transform

AU - Lun, Pak Kong

AU - Siu, Wan Chi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027634544&partnerID=8YFLogxK

U2 - 10.1109/78.224258

DO - 10.1109/78.224258

M3 - Journal article

SN - 1053-587X

VL - 41

SP - 2494

EP - 2499

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 7

ER -

Fast Radix-3/9 Discrete Hartley Transform

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this