DocumentCode
2647154
Title
A split radix algorithm of discrete Hartley transform
Author
Bi, Guoan
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fYear
1994
fDate
29 Nov-2 Dec 1994
Firstpage
165
Lastpage
168
Abstract
The article presents an improved split radix fast algorithm of the discrete Hartley transform which reduces the number of multiplications required by a previously reported split radix algorithm. In comparison with others, the new algorithm uses a minimum number of arithmetic operations, i.e. reducing the total number of multiplications and additions
Keywords
Hartley transforms; computational complexity; digital arithmetic; arithmetic operations; discrete Hartley transform; improved split radix fast algorithm; minimum number; multiplications; split radix algorithm; Arithmetic; Bismuth; Computational complexity; Content addressable storage; Discrete transforms; Equations; Indexing; Signal processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Information Systems,1994. Proceedings of the 1994 Second Australian and New Zealand Conference on
Conference_Location
Brisbane, Qld.
Print_ISBN
0-7803-2404-8
Type
conf
DOI
10.1109/ANZIIS.1994.396928
Filename
396928
Link To Document