.png){kind=icon}
返回
Fast 2-dimensional 4x4 forward integer transform implementation for H.264/AVC
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2005.858748.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the novel two-dimensional (2-D) fast algorithm for realization of 4 x 4 forward integer transform in H.264 is proposed. Based on matrix operations with Kronecker product and direct sum, the efficient fast 2-D 4 x 4 forward integer transform can be derived from the proposed one-dimensional fast 4 x 4 forward integer transform through matrix decompositions. The proposed fast 2-D 4 x 4 forward integer transform design doesn't need transpose memory for direct parallel pipelined architecture. The fast 2-D 4 x 4 forward integer transform requires fewer latency delays than the state-of-the-art methods. With regular modularity, the proposed fast algorithm is suitable for VLSI implementation to achieve real-time H.264/advanced video coding (AVC) signal processing.
Keyword:
discrete cosine transform (DCT)
fast algorithm
integer transform
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容