This note presents two new fast discrete cosine transform computation algorithms: 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 primefactor-decomposed computation algorithm to realize the 2m3n-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.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering