PolyU Institutional Repository >
Electrical Engineering >
EE Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||New formulation of fast Discrete Hartley transform with the minimum number of multiplications|
|Authors: ||Chan, Yuk-hee|
|Subjects: ||Computational complexity|
Computerised signal processing
|Issue Date: ||1991 |
|Citation: ||IEEE Pacific Rim Conference on Communications, Computers and Signal Processing : conference proceedings : Victoria, B.C., Canada, May 9-10, 1991, p. 323-326.|
|Abstract: ||The discrete Hartley transfom(DHT) is a real-valued transform closely related to the discrete Fourier transform (DFT) of a
real-valued sequence. It directly maps a real-valued sequence to a real-valued spectrum while preserving some useful properties of the Discrete Fourier Transform. In such case, the Discrete Hartley transform can act as an alternative form to the Fourier Transform for avoiding complex arithmetic, hence it becomes a valuable tool in digital signal processing. In this paper, a simple algorithm is proposed to realize one-dimensional DHT with sequence lengths equal to 2[sup m]. This algorithm achieves the same multiplicative complexity as Malvar’s algorithm which requires the minimum number of multiplications reported in the literature. However, the present approach gives the advantage of requiring a smaller number
of additions compared with the number that required in Malvar’s algorithm.|
|Rights: ||© 1991 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.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||EE Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.