Efficient mapping scheme for the prime factor discrete Hartley transform

Wan Chi Siu; Daniel Pak Kong Lun

doi:10.1109/ICASSP.1992.226665

Efficient mapping scheme for the prime factor discrete Hartley transform

Wan Chi Siu, Daniel Pak Kong Lun

The Hong Kong Polytechnic University

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

Abstract

Compared to the complexity for realizing the prime factor discrete Fourier transform (DFT), the prime factor discrete Hartley transform requires some extra arithmetic operations for the realization of the prime factor mapping. These extra arithmetic operations can take up as much as 40% of the total arithmetic operations required. A new prime factor mapping scheme which requires no extra arithmetic operations is proposed for the computation of the discrete Hartley transform. It is achieved by embedding all the extra arithmetic operations into the subsequent short length computations, whereas the arithmetic complexities of these embedded short length modules remain unchanged.

Original language	English
Title of host publication	ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	33-36
Number of pages	4
ISBN (Electronic)	0780305329
DOIs	https://doi.org/10.1109/ICASSP.1992.226665
Publication status	Published - 23 Mar 1992
Event	1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco Marriott, San Francisco, United States Duration: 23 Mar 1992 → 26 Mar 1992

Publication series

Name	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	5
ISSN (Print)	1520-6149

Conference

Conference	1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992
Country/Territory	United States
City	San Francisco
Period	23/03/92 → 26/03/92

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

More information

10.1109/ICASSP.1992.226665

Cite this

Siu, W. C., & Lun, D. P. K. (1992). Efficient mapping scheme for the prime factor discrete Hartley transform. In ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing (pp. 33-36). Article 226665 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 5). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.1992.226665

Siu, Wan Chi ; Lun, Daniel Pak Kong. / Efficient mapping scheme for the prime factor discrete Hartley transform. ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 33-36 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

@inproceedings{4f97bc2dd31a47aba4075eae7fac5f0c,

title = "Efficient mapping scheme for the prime factor discrete Hartley transform",

abstract = "Compared to the complexity for realizing the prime factor discrete Fourier transform (DFT), the prime factor discrete Hartley transform requires some extra arithmetic operations for the realization of the prime factor mapping. These extra arithmetic operations can take up as much as 40% of the total arithmetic operations required. A new prime factor mapping scheme which requires no extra arithmetic operations is proposed for the computation of the discrete Hartley transform. It is achieved by embedding all the extra arithmetic operations into the subsequent short length computations, whereas the arithmetic complexities of these embedded short length modules remain unchanged.",

author = "Siu, {Wan Chi} and Lun, {Daniel Pak Kong}",

year = "1992",

month = mar,

day = "23",

doi = "10.1109/ICASSP.1992.226665",

language = "English",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "33--36",

booktitle = "ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing",

note = "1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 ; Conference date: 23-03-1992 Through 26-03-1992",

}

Siu, WC & Lun, DPK 1992, Efficient mapping scheme for the prime factor discrete Hartley transform. in ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing., 226665, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, vol. 5, Institute of Electrical and Electronics Engineers Inc., pp. 33-36, 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992, San Francisco, United States, 23/03/92. https://doi.org/10.1109/ICASSP.1992.226665

Efficient mapping scheme for the prime factor discrete Hartley transform. / Siu, Wan Chi; Lun, Daniel Pak Kong.
ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing. Institute of Electrical and Electronics Engineers Inc., 1992. p. 33-36 226665 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 5).

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

TY - GEN

T1 - Efficient mapping scheme for the prime factor discrete Hartley transform

AU - Siu, Wan Chi

AU - Lun, Daniel Pak Kong

PY - 1992/3/23

Y1 - 1992/3/23

N2 - Compared to the complexity for realizing the prime factor discrete Fourier transform (DFT), the prime factor discrete Hartley transform requires some extra arithmetic operations for the realization of the prime factor mapping. These extra arithmetic operations can take up as much as 40% of the total arithmetic operations required. A new prime factor mapping scheme which requires no extra arithmetic operations is proposed for the computation of the discrete Hartley transform. It is achieved by embedding all the extra arithmetic operations into the subsequent short length computations, whereas the arithmetic complexities of these embedded short length modules remain unchanged.

AB - Compared to the complexity for realizing the prime factor discrete Fourier transform (DFT), the prime factor discrete Hartley transform requires some extra arithmetic operations for the realization of the prime factor mapping. These extra arithmetic operations can take up as much as 40% of the total arithmetic operations required. A new prime factor mapping scheme which requires no extra arithmetic operations is proposed for the computation of the discrete Hartley transform. It is achieved by embedding all the extra arithmetic operations into the subsequent short length computations, whereas the arithmetic complexities of these embedded short length modules remain unchanged.

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

U2 - 10.1109/ICASSP.1992.226665

DO - 10.1109/ICASSP.1992.226665

M3 - Conference article published in proceeding or book

AN - SCOPUS:85019573237

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 33

EP - 36

BT - ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992

Y2 - 23 March 1992 through 26 March 1992

ER -

Siu WC, Lun DPK. Efficient mapping scheme for the prime factor discrete Hartley transform. In ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing. Institute of Electrical and Electronics Engineers Inc. 1992. p. 33-36. 226665. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). doi: 10.1109/ICASSP.1992.226665

Efficient mapping scheme for the prime factor discrete Hartley transform

Abstract

Publication series

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this