New formulation of fast discrete Hartley transform with the minimum number of multiplications

Yuk Hee Chan; Wan Chi Siu

New formulation of fast discrete Hartley transform with the minimum number of multiplications

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

2 Citations (Scopus)

Abstract

A simple algorithm is proposed to realize a one-dimensional DHT with sequence lengths equal to 2m. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the fewest multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.

Original language	English
Title of host publication	IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings
Publisher	Publ by IEEE
Pages	323-326
Number of pages	4
ISBN (Print)	0879426381
Publication status	Published - 1 Dec 1991
Event	Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings - Victoria, BC, United States Duration: 9 May 1991 → 10 May 1991

Conference

Conference	Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings
Country/Territory	United States
City	Victoria, BC
Period	9/05/91 → 10/05/91

ASJC Scopus subject areas

General Engineering

More information

http://hdl.handle.net/10397/1536

Cite this

@inproceedings{9c8a91e0653748279c98b325df994926,

title = "New formulation of fast discrete Hartley transform with the minimum number of multiplications",

abstract = "A simple algorithm is proposed to realize a one-dimensional DHT with sequence lengths equal to 2m. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the fewest multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.",

author = "Chan, {Yuk Hee} and Siu, {Wan Chi}",

year = "1991",

month = dec,

day = "1",

language = "English",

isbn = "0879426381",

pages = "323--326",

booktitle = "IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings",

publisher = "Publ by IEEE",

note = "Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings ; Conference date: 09-05-1991 Through 10-05-1991",

}

Chan, YH & Siu, WC 1991, New formulation of fast discrete Hartley transform with the minimum number of multiplications. in IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings. Publ by IEEE, pp. 323-326, Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings, Victoria, BC, United States, 9/05/91. <http://hdl.handle.net/10397/1536>

New formulation of fast discrete Hartley transform with the minimum number of multiplications. / Chan, Yuk Hee; Siu, Wan Chi.
IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings. Publ by IEEE, 1991. p. 323-326.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - New formulation of fast discrete Hartley transform with the minimum number of multiplications

AU - Chan, Yuk Hee

AU - Siu, Wan Chi

PY - 1991/12/1

Y1 - 1991/12/1

N2 - A simple algorithm is proposed to realize a one-dimensional DHT with sequence lengths equal to 2m. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the fewest multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.

AB - A simple algorithm is proposed to realize a one-dimensional DHT with sequence lengths equal to 2m. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the fewest multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.

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

M3 - Conference article published in proceeding or book

SN - 0879426381

SP - 323

EP - 326

BT - IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings

PB - Publ by IEEE

T2 - Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings

Y2 - 9 May 1991 through 10 May 1991

ER -

New formulation of fast discrete Hartley transform with the minimum number of multiplications

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this