A cost-effective VLD architecture for MPEG-2 and AVS | |
Qu, Yanmei ; Mei, Shunliang ; He, Yun | |
2010-05-06 ; 2010-05-06 | |
关键词 | VLC CA-2D-VLC VLD MPEG-2 AVS inverse quantisation Computer Science, Information Systems Engineering, Electrical & Electronic |
中文摘要 | In this paper, we propose a cost-effective architecture of variable length decoder (VLD) for MPEG-2 and AVS. In order to save the buffer memory between VLD and IDCT and accelerate decoding speed, block-based pipeline buffers are adopted. Inverse scan (IScan) and inverse quantisation (IQ) are also merged into this architecture for cost-effective implementation and for easier system integration. A novel group-based architecture with the optimized look-up table is used for MPEG-2 and a new memory-efficient architecture with mixed memory organization is used for AVS. We use shared modules in both MPEG-2 and AVS as much as possible, such as the flush unit, the buffer controller and the buffers. Moreover, we propose merged IQ scheme and merged RAMs scheme. Based on 0.18 mu m CMOS technology, the proposed design consumes about 11.5 K gates at a clock constrain of 125 MHz. The simulation results show that it can achieve real-time decoding, such as HD1080i (1,920 x 1,088 at 30 MHz) format video of AVS and MPEG-2. Furthermore, we propose an effective design of the buffers between VLD and IDCT according to the IDCT architecture, a cost-efficient IQ architecture with full flexibility and an efficient scheme for accelerating VLC decoding. |
语种 | 英语 ; 英语 |
出版者 | SPRINGER ; NEW YORK ; 233 SPRING ST, NEW YORK, NY 10013 USA |
内容类型 | 期刊论文 |
源URL | [http://hdl.handle.net/123456789/10739] ![]() |
专题 | 清华大学 |
推荐引用方式 GB/T 7714 | Qu, Yanmei,Mei, Shunliang,He, Yun. A cost-effective VLD architecture for MPEG-2 and AVS[J],2010, 2010. |
APA | Qu, Yanmei,Mei, Shunliang,&He, Yun.(2010).A cost-effective VLD architecture for MPEG-2 and AVS.. |
MLA | Qu, Yanmei,et al."A cost-effective VLD architecture for MPEG-2 and AVS".(2010). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论