Parallel memories in video encoding

Jarno K. Tanskanen, J. Niittylahti
{"title":"Parallel memories in video encoding","authors":"Jarno K. Tanskanen, J. Niittylahti","doi":"10.1109/DCC.1999.785709","DOIUrl":null,"url":null,"abstract":"Summary form only given. A novel architecture with parallel memories suitable for hybrid video coding is presented. It efficiently relieves the memory bandwidth bottleneck in motion estimation, DCT, and IDCT involved in the real-time low-bit rate ITU-T H.263 video compression standard. There are four parallel processing elements and eight parallel memory blocks in the system. The address space is divided into three areas. Coordinate areas 0 and 1 can be accessed simultaneously for row or column formats, needed in the motion estimation, DCT, and IDCT. Alternatively, the area 2 can be accessed for a more complex formats. Such formats are needed, for example, in zigzag scanning and interpolation. The module assignment function S(i,j), expresses how data is stored in the memory modules. We can describe the memory space as a 2D coordinate system with horizontal and vertical coordinates (i,j). The coordinate values are restricted to positive values, and (0,0) is fixed to the uppermost left corner of the coordinate area. The function S(i,j) simply describes the memory block, where the value of coordinate point (i,j) is stored. Memory addresses are described by the address function a(i,j). The coordinate area 0 deals with the memory blocks 0...3, the area 1 with the blocks 4...7 and the area 2 with the blocks 0...7. The constants a/sub 0max/ and a/sub 1max/ are the maximum addresses of the coordinate areas 0 and 1, respectively. The width of the coordinate area is given by L/sub i/. The processing power increases linearly with the number of parallel processing elements. Using more parallel memory blocks enables use of more access formats.","PeriodicalId":103598,"journal":{"name":"Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1999.785709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Summary form only given. A novel architecture with parallel memories suitable for hybrid video coding is presented. It efficiently relieves the memory bandwidth bottleneck in motion estimation, DCT, and IDCT involved in the real-time low-bit rate ITU-T H.263 video compression standard. There are four parallel processing elements and eight parallel memory blocks in the system. The address space is divided into three areas. Coordinate areas 0 and 1 can be accessed simultaneously for row or column formats, needed in the motion estimation, DCT, and IDCT. Alternatively, the area 2 can be accessed for a more complex formats. Such formats are needed, for example, in zigzag scanning and interpolation. The module assignment function S(i,j), expresses how data is stored in the memory modules. We can describe the memory space as a 2D coordinate system with horizontal and vertical coordinates (i,j). The coordinate values are restricted to positive values, and (0,0) is fixed to the uppermost left corner of the coordinate area. The function S(i,j) simply describes the memory block, where the value of coordinate point (i,j) is stored. Memory addresses are described by the address function a(i,j). The coordinate area 0 deals with the memory blocks 0...3, the area 1 with the blocks 4...7 and the area 2 with the blocks 0...7. The constants a/sub 0max/ and a/sub 1max/ are the maximum addresses of the coordinate areas 0 and 1, respectively. The width of the coordinate area is given by L/sub i/. The processing power increases linearly with the number of parallel processing elements. Using more parallel memory blocks enables use of more access formats.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
视频编码中的并行存储器
只提供摘要形式。提出了一种适用于混合视频编码的并行存储结构。它有效地缓解了实时低比特率ITU-T H.263视频压缩标准中运动估计、DCT和IDCT的内存带宽瓶颈。系统中有4个并行处理单元和8个并行存储块。地址空间分为三个区域。坐标区域0和1可以同时访问行或列格式,需要在运动估计,DCT和IDCT。另外,可以访问区域2以获取更复杂的格式。这样的格式是需要的,例如,在之字形扫描和插值。模块分配函数S(i,j)表示数据如何存储在内存模块中。我们可以将存储空间描述为具有水平和垂直坐标(i,j)的二维坐标系。坐标值被限制为正值,(0,0)固定在坐标区域的左上角。函数S(i,j)简单地描述了存储坐标点(i,j)的值的内存块。内存地址由地址函数a(i,j)描述。坐标区域0处理内存块0…3、有街区的区域7和2块0…7。常数a/sub 0max/和a/sub 1max/分别是坐标区域0和1的最大地址。坐标区域的宽度由L/下标i/给出。处理能力随着并行处理单元的数量线性增加。使用更多的并行内存块可以使用更多的访问格式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Real-time VBR rate control of MPEG video based upon lexicographic bit allocation Performance of quantizers on noisy channels using structured families of codes SICLIC: a simple inter-color lossless image coder Protein is incompressible Encoding time reduction in fractal image compression
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1