Abstract
This paper presents a new distributed arithmetic (DA) based array for the (1-D) any-length discrete Hartley transform (DHT). The author derives a new algorithm that can formulate the 1-D DHT into cyclic convolution, and realizes it in a DA-based array that utilizes identical ROM modules, and eliminates the accumulation loop in the processing elements (PE's). The proposed approach can be applied to other transforms like DFT, DCT and DST.
| Original language | English |
|---|---|
| Title of host publication | ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings |
| Pages | 662-665 |
| Number of pages | 4 |
| DOIs | |
| State | Published - 1 Dec 2001 |
| Event | 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 - Sydney, NSW, Australia Duration: 6 May 2001 → 9 May 2001 |
Publication series
| Name | ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings |
|---|---|
| Volume | 4 |
Conference
| Conference | 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 |
|---|---|
| Country | Australia |
| City | Sydney, NSW |
| Period | 6/05/01 → 9/05/01 |
Fingerprint Dive into the research topics of 'A new DA-based array for one dimensional discrete Hartley transform'. Together they form a unique fingerprint.
Cite this
Guo, J-I. (2001). A new DA-based array for one dimensional discrete Hartley transform. In ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings (pp. 662-665). [922324] (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 4). https://doi.org/10.1109/ISCAS.2001.922324