Please use this identifier to cite or link to this item:
Title: Mixed-radix discrete cosine transform
Authors: Chan, Yuk-hee
Siu, Wan-chi
Subjects: Algorithms
Mathematical transformations
Issue Date: Nov-1993
Publisher: IEEE
Source: IEEE transactions on signal processing, Nov. 1993, v. 41, no. 11, p. 3157-3161.
Abstract: This note presents two new fast discrete cosine transform computation algorithm: a radix-3 and a radix-6 algorithm. These two new algorithms are superior to the conventional radix-2 algorithm as they i) require less computational complexity in terms of the number of multiplications per point, ii) provide a wider choice of the sequence length for which the DCT can be realized and, iii) support the prime factor-decomposed computation algorithm to realize the 2[sup m]3ⁿ-point DCT. Furthermore, a mixed-radix algorithm is also proposed such that an optimal performance can be achieved by applying the proposed radix-3 and radix-6 and the well-developed radix-2 decomposition techniques in a proper sequence.
Rights: © 1993 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Type: Journal/Magazine Article
DOI: 10.1109/78.257281
ISSN: 1053-587X
Appears in Collections:EE Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
Mixed-radix discrete cosine_93.pdf452.9 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.