Radix-2 x 2 x 2 algorithm for the 3-D discrete hartley transform

被引：21

作者：

Boussakta, S ^{[1
]}

Alshibami, OH ^{[1
]}

Aziz, MY ^{[1
]}

机构：

[1] Univ Leeds, Sch Elect & Elect Engn, Inst Integrated Informat Syst, Leeds LS2 9JT, W Yorkshire, England

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 2001年 / 49卷 / 12期

基金：

英国工程与自然科学研究理事会;

关键词：

3-D filtering; 3-D Hartley transform; 3-D image processing; 3-D radix-2 x 2 x 2; 3-D spectrum analysis;

D O I：

10.1109/78.969521

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The discrete Hartley transform (DHT) has proved to be a valuable tool, in digital signal/image processing and communications and has also attracted research interests in many multidimensional applications. Although many fast algorithms have been developed for the calculation of one- and two-dimensional (1-D and 2-D) DHT, the development of multidimensional algorithms in three and more dimensions is stili unexplored and has not been given similar, attention; hence, the multidimensional Hartley transform is usually calculated through the row-column approach. However, proper multidimensional algorithms can be more efficient than the row-column method and heed to be developed. Therefore, it is the aim of this paper to introduce the concept and derivation of the three-dimensional (3-D) radix-2 x 2 x 2 algorithm tor fast calculation of the 3-D discrete Hartley transform. The proposed algorithm is based on the principles of the divide-and, conquer approach applied directly in 3-D. It has a simple butterfly structure and has been found to offer significant savings in arithmetic operations compared with the row-column approach based on similar algorithms.

引用

页码：3145 / 3156

页数：12

共 50 条

[41] Implementation of the DFT using radix-2 and paired transform algorithms
Ranganadh, N
Patel, P
Grigoryan, AM
[J]. COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2004, : 148 - 153
[42] A New Architecture For Radix-2 New Mersenne Number Transform
Nibouche, Omar
Boussakta, Said
Darnell, Mike
[J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 3219 - 3222
[43] Pipeline Architectures for Radix-2 New Mersenne Number Transform
Nibouche, Omar
Boussakta, Said
Darnell, Michael
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2009, 56 (08) : 1668 - 1680
[44] Three algorithms for computing the 2-D discrete Hartley transform
Grigoryan, AM
Agaian, SS
[J]. 2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL II, PROCEEDINGS, 2000, : 359 - 362
[45] A systolic array architecture for 2-D discrete Hartley transform
Karimi, B
Baradaran-seyed, T
[J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XIII, PROCEEDINGS: CONCEPTS AND APPLICATIONS OF SYSTEMICS, CYBERNETICS AND INFORMATICS III, 2002, : 434 - 440
[46] 3-D vector radix algorithm for the 3-D new Mersenne number transform
Boussakta, S
Alshibami, O
Aziz, M
Holt, AGJ
[J]. IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 2001, 148 (02): : 115 - 125
[47] NEW FAST ALGORITHM TO COMPUTE 2-DIMENSIONAL DISCRETE HARTLEY TRANSFORM
YANG, DK
[J]. ELECTRONICS LETTERS, 1989, 25 (25) : 1705 - 1706
[48] NEW RADIX-BASED FHT ALGORITHM FOR COMPUTING THE DISCRETE HARTLEY TRANSFORM
Hamood, M. T.
Boussakta, S.
[J]. 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 1581 - 1584
[49] The Discrete Fourier Transform, Part 2: Radix 2 FFT
Lyon, Douglas
[J]. JOURNAL OF OBJECT TECHNOLOGY, 2009, 8 (05): : 21 - 33
[50] A 3-D discrete hartley transform coder for compression of Magnetic Resonance images
Sunder, R. Shyam
Eswaran, C.
Sriraam, N.
[J]. 2005 IEEE INTERNATIONAL CONFERENCE ON ELECTRO/INFORMATION TECHNOLOGY (EIT 2005), 2005, : 464 - 469

← 1 2 3 4 5 →