Direct N-point DCT computation from three adjacent N/3 point DCT coefficients
Journal
IEEE Signal Processing Letters
Journal Volume
12
Journal Issue
2
Pages
89-92
Date Issued
2005-02
Author(s)
Kao, Meng-Ping
Abstract
An 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.
Subjects
Direct DCT domain computation; Fast DCT; Radix-3 DCT
Other Subjects
Algorithms; Computational complexity; High definition television; Interpolation; Direct discrete cosine transform domain computation; Fast discrete cosine transform; Cosine transforms
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
83.pdf
Size
161.38 KB
Format
Adobe PDF
Checksum
(MD5):c3b7e1a0b49c993c755d30a714a6431f