By Topic

On efficient software realization of the prime factor discrete cosine transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. P. K. Lun ; Dept. of Electron. Eng., Hong Kong Polytech., Hung Hom, Hong Kong

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

Published in:

Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on  (Volume:iii )

Date of Conference:

19-22 Apr 1994