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

Yuk Hee Chan, Wan Chi Siu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (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 languageEnglish
Title of host publicationIEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings
PublisherPubl by IEEE
Pages323-326
Number of pages4
ISBN (Print)0879426381
Publication statusPublished - 1 Dec 1991
EventProceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings - Victoria, BC, United States
Duration: 9 May 199110 May 1991

Conference

ConferenceProceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings
CountryUnited States
CityVictoria, BC
Period9/05/9110/05/91

ASJC Scopus subject areas

  • Engineering(all)

Cite this