File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: A novel approach to fast discrete Hartley transform
Title | A novel approach to fast discrete Hartley transform |
---|---|
Authors | |
Keywords | Computers Computer systems |
Issue Date | 1999 |
Publisher | IEEE. |
Citation | The 4th International Symposium on Parallel Architectures, Algorithms, and Networks, Perth/Fremantle, WA, Australia, 23-25 June 1999, p. 178-183 How to Cite? |
Abstract | The Discrete Hartley transform (DHT) is an important tool in digital signal processing. 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(Nlog 2N) in the conventional FDT. The execution time of the systolic array is only O(Nlog2N/log2log2N) for 1-D DHT and O(N k) for k-D DHT (k⩾2). 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. |
Persistent Identifier | http://hdl.handle.net/10722/46134 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, JG | en_HK |
dc.contributor.author | Chan, FHY | en_HK |
dc.contributor.author | Lam, FK | en_HK |
dc.contributor.author | Li, HF | en_HK |
dc.date.accessioned | 2007-10-30T06:43:14Z | - |
dc.date.available | 2007-10-30T06:43:14Z | - |
dc.date.issued | 1999 | en_HK |
dc.identifier.citation | The 4th International Symposium on Parallel Architectures, Algorithms, and Networks, Perth/Fremantle, WA, Australia, 23-25 June 1999, p. 178-183 | en_HK |
dc.identifier.issn | 1087-4089 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46134 | - |
dc.description.abstract | The Discrete Hartley transform (DHT) is an important tool in digital signal processing. 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(Nlog 2N) in the conventional FDT. The execution time of the systolic array is only O(Nlog2N/log2log2N) for 1-D DHT and O(N k) for k-D DHT (k⩾2). 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. | en_HK |
dc.format.extent | 978276 bytes | - |
dc.format.extent | 13817 bytes | - |
dc.format.extent | 8841 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | International Symposium on Parallel Architectures, Algorithms, and Networks | - |
dc.rights | ©1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Computers | en_HK |
dc.subject | Computer systems | en_HK |
dc.title | A novel approach to fast discrete Hartley transform | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1087-4089&volume=&spage=178&epage=183&date=1999&atitle=A+novel+approach+to+fast+discrete+Hartley+transform | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ISPAN.1999.778936 | en_HK |
dc.identifier.hkuros | 45501 | - |
dc.identifier.issnl | 1087-4089 | - |