Please use this identifier to cite or link to this item:
|標題:||Fast 2-dimensional 8 x 8 integer transform algorithm design for H.264/AVC fidelity range extensions||作者:||Fan, C.P.
|關鍵字:||H.264;fidelity range extensions (FRExt);integer transform;fast;algorithm||Project:||Ieice Transactions on Information and Systems||期刊/報告no：:||Ieice Transactions on Information and Systems, Volume E89D, Issue 12, Page(s) 3006-3011.||摘要:||
In this letter, efficient two-dimensional (2-D) fast algorithms for realizations of 8 x 8 forward and inverse integer transforms in H.264/AVC fidelity range extensions (FRExt) are proposed. Based on matrix factorizations with Kronecker product and direct sum operations, efficient fast 2-D 8 x 8 forward and inverse integer transforms can be derived from the one-dimensional (1-D) fast 8 x 8 forward and inverse integer transforms through matrix operations. The proposed fast 2-D 8 x 8 forward and inverse integer transform designs don't require transpose memory in hardware realizations. The fast 2-D 8 x 8 integer transforms require fewer latency delays and provide a larger throughput rate than the row-column based method. With regular modularity, the proposed fast algorithms are suitable for VLSI implementations to achieve H.264/AVC,FRExt high-profile signal processing.
|Appears in Collections:||電機工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.