DocumentCode :
1282231
Title :
Prime-factor algorithms for generalised discrete Hartley transform
Author :
Bi, Guoan ; Lu, Chao
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
Volume :
35
Issue :
20
fYear :
1999
fDate :
9/30/1999 12:00:00 AM
Firstpage :
1708
Lastpage :
1710
Abstract :
A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity
Keywords :
computational complexity; digital arithmetic; discrete Hartley transforms; arithmetic operations; computational structure; generalised discrete Hartley transform; implementation complexity; index mapping method; prime-factor algorithms;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19991208
Filename :
811133
Link To Document :
بازگشت