检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邸志雄[1] 史江义[1] 刘凯[2] 李云松[2] 马佩军[1] 郝跃[1]
机构地区:[1]西安电子科技大学宽带隙半导体技术国家重点学科实验室,陕西西安710071 [2]西安电子科技大学ISN重点实验室,陕西西安710071
出 处:《电子学报》2013年第5期918-925,共8页Acta Electronica Sinica
基 金:陕西省自然科学基金(No.2010JM8015)
摘 要:MQ(Multiple Quantization)编码器由于效率低下已经成为JPEG2000的性能瓶颈.本文对MQ编码算法中的上下文关系进行了提取,对索引表中的启动态和非暂态进行了分离,并提出一种用于预测索引值的方法.同时,对重归一化运算中出现的大概率事件和小概率事件进行分离,使其可并行对2个上下文完成编码.依据该算法,本文提出了一种多上下文并行处理的MQ编码器VLSI结构.实验结果表明,本文提出的MQ编码器能够工作在286.80MHz,吞吐量为573.60 Msymbols/sec,相比Dyer提出的Brute Force with Modified Byteout结构,本文的吞吐量提升约35%,且面积减小78%.MQ-encoder is a key bottleneck in the JPEG2000 image compression system.In this paper,the dependence between contexts in the MQ-encoder has been extracted;and an improved mechanism has been proposed to acquire indexes by separating the "start-up" states and remaining states.Besides,a prediction method has been proposed to resolve the stall problem when the current context is the same as the previous context.Also the probabilities of MPS and LPS coding events in the renormalization procedure have been analyzed;and either of the MPS and LPS coding events has been optimized.Based on this improved arithmetic,a VLSI architecture for Two-context MQ-encoder is proposed.Synthesis result shows that the processing speed of the MQ-encoder could reach as high as 286.80MHz with a throughput of 573.60Msymbols/sec.Compared with the "Brute force with modified byteout" architecture,the throughput obtained in this work has been improved by 35% and the area has been reduced by 78%.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90