IN-PLACE BUTTERFLY-STYLE FFT OF 2-D REAL SEQUENCES

被引：17

作者：

MOU, ZJ

DUHAMEL, P

机构：

[1] CNET, Issy-les-Moulineaux, Fr

来源：

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING | 1988年 / 36卷 / 10期

关键词：

MATHEMATICAL TECHNIQUES -- Algorithms - SIGNAL PROCESSING -- Digital Techniques;

D O I：

10.1109/29.7552

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

Methodologies for constructing fast algorithms to compute the discrete Fourier transform (DFT) of a 2-D real sequence are introduced. The resulting algorithms are shown to be in-place and butterfly-style as well as the usual 1-D FFT algorithms. Above all, the computatioanal load of these algorithms is reduced to less than one-half of their complex counterparts. Due to the in-place property, the storage requirement is exactly halved. A comparison is made on the basis of arithmetic complexity, storage, and input/output requirements.

引用

页码：1642 / 1650

页数：9

共 16 条

[1]

ARAMBEPOLA B, 1980, IEE P LONDON F APR, P48

[2]

Burrus C. S, 1985, DFT FFT CONVOLUTION

[3]

Dudgeon D.E., 1984, MULTIDIMENSIONAL DIG, P1

[4] SPLIT RADIX FFT ALGORITHM [J].

DUHAMEL, P ;

HOLLMANN, H .

ELECTRONICS LETTERS, 1984, 20 (01) :14-16

[5] IMPROVED FOURIER AND HARTLEY TRANSFORM ALGORITHMS - APPLICATION TO CYCLIC CONVOLUTION OF REAL DATA [J].

DUHAMEL, P ;

VETTERLI, M .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1987, 35 (06) :818-824

[6] IMPLEMENTATION OF SPLIT-RADIX FFT ALGORITHMS FOR COMPLEX, REAL, AND REAL-SYMMETRICAL DATA [J].

DUHAMEL, P .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1986, 34 (02) :285-295

[7] FAST COMPUTER METHOD FOR MATRIX TRANSPOSING [J].

EKLUNDH, JO .

IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (07) :801-&

[8]

HARRIS DB, 1977, P IEEE INT C AC SPEE, P548

[9]

HOYER EA, 1977, IEEE C ASSP, P552

[10]

MERSEREAU RM, 1971, P IEEE, V63, P610

← 1 2 →