Dissemin is shutting down on January 1st, 2025

Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Circuits and Systems II: Express Briefs, 6(55), p. 566-570, 2008

DOI: 10.1109/tcsii.2007.916796

Links

Tools

Export citation

Search in Google Scholar

Radix-3$\,\times\,$3 Algorithm for The 2-D Discrete Hartley Transform

Journal article published in 2008 by J. S. Wu, H. Z. Shu, L. Senhadji ORCID, L. M. Luo
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Abstract—In this correspondence, we propose a vector-radix algorithm for the fast computation of two-dimensional (2-D) discrete Hartley transform (DHT). For data sequences whose length is power of three, a radix-3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N DHT into nine length-(N/3)×(N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.