DocumentCode
1565379
Title
New Fast Hartley Transform with Linear Multiplicative Complexity
Author
Agaian, Sos S. ; Caglayan, Ozan
Author_Institution
Multimedia & Mobile Signal Process. Lab., Texas Univ., San Antonio, TX, USA
fYear
2006
Firstpage
377
Lastpage
380
Abstract
In this paper, we introduced a new Hartley transform algorithm with linear multiplicative complexity. The proposed algorithm not only minimizes the number of multiplications, but also reduces the total number of operations (arithmetic complexity, or the number of multiplications and additions) compared to the existing and recently published methods.
Keywords
Hartley transforms; Hartley transform; linear multiplicative complexity; Arithmetic; Bismuth; Computational complexity; Discrete Fourier transforms; Discrete transforms; Fourier transforms; Laboratories; Mathematics; Matrix decomposition; Signal processing algorithms; Discrete Hartley Transform; arithmetical complexity; matrix decomposition; sparse;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 2006 IEEE International Conference on
Conference_Location
Atlanta, GA
ISSN
1522-4880
Print_ISBN
1-4244-0480-0
Type
conf
DOI
10.1109/ICIP.2006.312472
Filename
4106545
Link To Document