摘要
针对JPEG2 0 0 0位平面编码的VLSI实现 ,提出一种基于多级查询表的扫描优化方法 .该方法以树型查找表为基准 ,在有效性传播通道中提前记录编码必要性信息 ,实现了后续通道的启发式扫描 .与K′Chen等人提出的GOCS方法比较 ,不仅消除了扫描中出现的冗余组 ,而且消除了冗余列 ,进一步提高了扫描速率 .该方法的另一优点是可以完成通道扫描和状态变量的并行刷新 ,支持YHsia存储优化技术而不影响系统整体效率 .实验结果表明 ,在VLSI设计中引入该方法 ,位平面编码的扫描时间可缩短 2 5 % ,存储资源将节省 8.72 % .
Aiming at VLSI implementation of the bit-plane encoding in JPEG2000,a new structure,CBQT (Column-Based Query Table),and its corresponding scanning method,are presented.The main idea is to record the NBC(Need-Block-Coding) messages of pass 2 and 3 in advance by a certain polling tree,so heuristic search can be fufilled in the subsequent pass-scanning.Compared with K.Chen′s GOCS scheme,this method achieved the single-column-skipping.Another advantage is that CBQT could manipulate pass-coding and state-updating simultaneously,so Y.Hsia′s memory saving technique was imported without affecting system′s coding efficiency.Experimental results show that whole time of bit-plane scanning is reduced by 25% of the original,and 8.72% required memory space is curtailed as well.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2004年第5期810-813,共4页
Acta Electronica Sinica
基金
国家 8 63计划超大规模集成电路专项基金 (No .2 0 0 2AA1Z1 4 4 0 )
西安市科技局创新工程基金 (No .CX2 0 0 2 1 0 )