A Novel Approach to Fast Discrete Hartley Transform

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by J.G. Liu Articles by F.H.Y. Chan Articles by F.K. Lam Articles by H.F. Li

1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99)

Fremantle, Australia

June 23-June 25

ISBN: 0-7695-0231-8

	ASCII Text	x
	J.G. Liu, F.H.Y. Chan, F.K. Lam, H.F. Li, "A Novel Approach to Fast Discrete Hartley Transform," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 178, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.

	BibTex	x
	@article{ 10.1109/ISPAN.1999.778936, author = {J.G. Liu and F.H.Y. Chan and F.K. Lam and H.F. Li}, title = {A Novel Approach to Fast Discrete Hartley Transform}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1999}, issn = {1087-4089}, pages = {178}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778936}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - A Novel Approach to Fast Discrete Hartley Transform SN - 1087-4089 SP EP A1 - J.G. Liu, A1 - F.H.Y. Chan, A1 - F.K. Lam, A1 - H.F. Li, PY - 1999 KW - Hartley transform KW - moment KW - fast transform KW - parallel processing KW - systolic array VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

J.G. Liu, Huazhong University of Science & Technology

F.H.Y. Chan, University of Hong Kong

F.K. Lam, University of Hong Kong

H.F. Li, University of Concordia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778936

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this present paper, we propose a novel approach to perform DHT. We transform DHT into a form expressed in discrete moments via a modular mapping and truncating Taylor series expansion and present a completely new formula for computing DHT. We extend the use of our systolic array for fast computation of moments without any multiplications to one that computes DHT with only a few multiplications and without any evaluations of triangular functions. The multiplication number used in our method is O(Nlog2N/log2log2N) superior to O(Nlog2N) in the conventional FDT. The execution time of the systolic array is only O(N log2N/log2log2N) for 1-D DHT and O(Nk) for k-D DHT(k2). The systolic array consists of very simple processing elements and hence it implies an easy and potential hardware/VLSI implementation. The approach is also applicable to DHT inverses.

Index Terms:

Hartley transform, moment, fast transform, parallel processing, systolic array

Citation:

J.G. Liu, F.H.Y. Chan, F.K. Lam, H.F. Li, "A Novel Approach to Fast Discrete Hartley Transform," ispan, pp.178, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.