DocumentCode :
290541
Title :
On efficient software realization of the prime factor discrete cosine transform
Author :
LUN, Daniel P K
Author_Institution :
Dept. of Electron. Eng., Hong Kong Polytech., Hung Hom, Hong Kong
Volume :
iii
fYear :
1994
fDate :
19-22 Apr 1994
Abstract :
The traditional approach in realizing the prime factor discrete cosine transform (PFDCT) often suffers from two problems. First, although only the Ruritanian mapping is used for input indexing, it requires to perform a series of complicated tests and additions which even outweigh the computational effort of the PFDCT. Second, the additions mentioned above are not carried out in an in-place form. This implies that an auxiliary data array is required to buffer the temporary results generated during the additions. Otherwise, erroneous results will be obtained. We propose an efficient indexing scheme for the computation of the PFDCT. By suitably swapping the data, all the additions can be carried out in an in-place form. Furthermore the number of tests required to perform on the indices of the data is greatly reduced. They are achieved by considering the special properties of the Ruritanian mapping
Keywords :
FORTRAN listings; digital arithmetic; discrete cosine transforms; mathematics computing; PFDCT; Ruritanian mapping; auxiliary data array; in-place additions; input indexing; prime factor discrete cosine transform; software realization; Computational complexity; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Fourier transforms; Indexing; Performance evaluation; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on
Conference_Location :
Adelaide, SA
ISSN :
1520-6149
Print_ISBN :
0-7803-1775-0
Type :
conf
DOI :
10.1109/ICASSP.1994.389989
Filename :
389989
Link To Document :
بازگشت