SOO-CHANG PEIKao, Meng-PingMeng-PingKao2018-09-102018-09-102005-0210709908http://scholars.lib.ntu.edu.tw/handle/123456789/317589https://www.scopus.com/inward/record.uri?eid=2-s2.0-13244249658&doi=10.1109%2fLSP.2004.840868&partnerID=40&md5=d165e323780d44302e7d7a03fb2f920aAn efficient method for computing a length-N Discrete Cosine Transform (DCT) from three consecutive length-N/3 DCTs is proposed. This method differs from previous ones in that it reduces considerable 31-38% arithmetic operations and uses only length-N/3 DCTs instead of length-N DCTs. We also find its great applications in fractional scaling of a block DCT-based image by the factor of 1/2α 3β. This would be very useful in high-definition television (HDTV) standard, whose display size is usually 16:9. The comparison with conventional methods is provided in this paper. © 2005 IEEE.application/pdfapplication/pdfDirect DCT domain computation; Fast DCT; Radix-3 DCTAlgorithms; Computational complexity; High definition television; Interpolation; Direct discrete cosine transform domain computation; Fast discrete cosine transform; Cosine transformsjournal article10.1109/LSP.2004.8408682-s2.0-13244249658WOS:000226503700002