Please use this identifier to cite or link to this item:
|標題:||Fast algorithm designs for low-complexity 4 x 4 discrete cosine transform||作者:||Fan, C.P.
|關鍵字:||discrete cosine transform;fast algorithm;digital signal processing;computation;dct||Project:||Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences||期刊/報告no：:||Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, Volume E88A, Issue 11, Page(s) 3225-3229.||摘要:||
In the letter, the fast one-dimensional (I-D) and two-dimensional (2-D) algorithms for realizing low-complexity 4 x 4 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 4 x 4 DCT algorithm can be developed from the proposed fast 1-D 4 x 4 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 4 x 4 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.
|Appears in Collections:||電機工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.