Abstract
ABSTRACT The prime-factor DCT algorithm of two relatively prime factors decomposing the DCT matrix into skew-circular correlation (SCC) matrices and circular correlation (CC) matrices is generalized to many factors. As a result, the DCT output components are divided into several parts, each part is a sum of many SCC/CC matrix-vector products. The number of matrix-vector products is further reduced since some SCC/CC matrices can be represented by linear combination of other SCC/CC matrices with ± 1 coefficients. Thus the number of multiplications and additions is also reduced achieving less number of multiplications and additions compared with other algorithms. Besides each part of the output components being independent, parallel implementation of the proposed algorithm is feasible.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
