助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   average code length 在 电信技术 分类中 的翻译结果: 查询用时:0.21秒
图标索引 在分类学科中查询
所有学科
电信技术
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

average code length    
相关语句
  平均码长
    Through the analysis of the UVLC, a quotient-residue variable lengh coding scheme is proposed which conforms to the distribution of the syntax value in real video coding and its average code length is shorter. Through the real test, its coding efficiency is higher than that in the standard.
    最后我们对于标准中的变长编码和算术编码进行了比较分析,选择耗时相对较少的变长编码进行深入研究,通过对标准中变长编码UVLC的分析,提出了一种商-余数变长编码方案,它符合实际视频编码中语法元素值的分布规律,平均码长较短,通过实际测试,它的编码效率要高于标准中的变长编码方案。
短句来源
    This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length.
    该方法应用线性预测原理减少数据的冗余度并应用Huffman编码以实现最佳平均码长
短句来源
    The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword selection mechanism and easy realization.
    实验表明,该算法能够得到较小的平均码长,并具有码字选取机制简单、实现复杂度小等优点.
短句来源
    A novel method is produced by utilizing MOCPM in ABAC,which is more effective than traditional methods. It enables to shorten average code length and makes the coded symbol almost its entropy rate,so a notable improvement is achieved in the data compression of binary arithmetic coding. The data compression ratio can be as high as 90 %.
    将此模型应用到二进制算术编码中,形成了一种比传统二进制算术编码更有效的方法,能让平均码长变短并使得码字的信息量逼近符号的熵率,从而显著提高二进制算术编码的数据压缩比(可高达90%).
短句来源
  平均码长
    Through the analysis of the UVLC, a quotient-residue variable lengh coding scheme is proposed which conforms to the distribution of the syntax value in real video coding and its average code length is shorter. Through the real test, its coding efficiency is higher than that in the standard.
    最后我们对于标准中的变长编码和算术编码进行了比较分析,选择耗时相对较少的变长编码进行深入研究,通过对标准中变长编码UVLC的分析,提出了一种商-余数变长编码方案,它符合实际视频编码中语法元素值的分布规律,平均码长较短,通过实际测试,它的编码效率要高于标准中的变长编码方案。
短句来源
    This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length.
    该方法应用线性预测原理减少数据的冗余度并应用Huffman编码以实现最佳平均码长
短句来源
    The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword selection mechanism and easy realization.
    实验表明,该算法能够得到较小的平均码长,并具有码字选取机制简单、实现复杂度小等优点.
短句来源
    A novel method is produced by utilizing MOCPM in ABAC,which is more effective than traditional methods. It enables to shorten average code length and makes the coded symbol almost its entropy rate,so a notable improvement is achieved in the data compression of binary arithmetic coding. The data compression ratio can be as high as 90 %.
    将此模型应用到二进制算术编码中,形成了一种比传统二进制算术编码更有效的方法,能让平均码长变短并使得码字的信息量逼近符号的熵率,从而显著提高二进制算术编码的数据压缩比(可高达90%).
短句来源
查询“average code length”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  average code length
The average code length c is defined by c=\sumi=1n pi li .
      
In the first and second method the average code length found after application of the Huffmann encoding has been found to be about 4 bits sample-1.
      
Moreover, this best code can be modified to ensure that the almost sure version of the code length has asymptotically the same behavior as its expected value, i.e., the average code length.
      
Secondly, we deal with the problem: what is the "best" achievable average code length with underlying density functionf? Minimax lower bounds are derived for the average code length over certain smooth classes of underlying densitiesf.
      
Without encryption, the average code length for encoding DCs is 5.78 bits.
      
更多          


The paper describes a real-time lossless data compression algorithm for both individual band and multi-spectral remote sensing images. This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length. Several kinds of predictions were studied and the 2-D prediction was selected. Some simplifications were taken in the Huffman coding for real-time use. A comparison between the coding methods was discussed. The scheme was applied to the 8 bits/pixel, original...

The paper describes a real-time lossless data compression algorithm for both individual band and multi-spectral remote sensing images. This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length. Several kinds of predictions were studied and the 2-D prediction was selected. Some simplifications were taken in the Huffman coding for real-time use. A comparison between the coding methods was discussed. The scheme was applied to the 8 bits/pixel, original images of LANDSAT TM, SPOT HRV, AIR SAR and imaging spectrometer by software emulation. An average compression ratio of 2, with the highest value of 3.1 and the lowest value of 1.2 for the radar images, was achieved.

讨论了对单波段遥感图像和多波段遥感图像都适用的一种实时无失真数据压缩的方法。该方法应用线性预测原理减少数据的冗余度并应用Huffman编码以实现最佳平均码长。文中讨论和比较了几种预测的方法,并选用了2-D空间预测。为方便实现实时的数据压缩,本文对Huffman编码作了必要的简化。对于不同编码技术的结果,文中也进行了讨论。本方法将软件仿真应用于LANDSAT TM,SPOT HRV,AIR SAR以及中科院上海技术物理研究所研制的航空成像光谱仪的8bit/像元遥感数据,平均压缩比为2,其中最高的为3.1,最低的为1.2。

A novel construction algorithm for symmetrical Reversible Variable Length Codes(RVLC) is proposed based on the analysis of the symmetrical RVLC code tree,which is independent of the Huffman code.The algorithm adds all candidate codes into the queue after the minimum codeword length is obtained according to the symbol probability,then selects those which satisfy the codeword mechanism as symmetrical RVLCs.The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword...

A novel construction algorithm for symmetrical Reversible Variable Length Codes(RVLC) is proposed based on the analysis of the symmetrical RVLC code tree,which is independent of the Huffman code.The algorithm adds all candidate codes into the queue after the minimum codeword length is obtained according to the symbol probability,then selects those which satisfy the codeword mechanism as symmetrical RVLCs.The result shows it can lead to a smaller average code length,and has the advantages of flexible codeword selection mechanism and easy realization.

在分析对称可逆变长码码树结构的基础上,提出了一种独立于Huffman码的对称可逆变长码构造算法.该算法根据符号概率求得对称可逆变长码的最小码字长度后,将所有候选码字依次存放到队列,选择其中符合码字选取机制的候选码字作为对称可逆变长码码字.实验表明,该算法能够得到较小的平均码长,并具有码字选取机制简单、实现复杂度小等优点.

The analysis of error resiliency of variable length codes(VLC) by Discrete Memoryless Source model is proposed.The probability of error resiliency was counted at the time when the appearing probability of one codeword in the code sequence at a fixed time and the transition probability from this codeword to other codeword with same codeword length to this codeword were analyzed.The error resiliency probability of whole code sequence is the code sequence length power of this transition probability.The simulation...

The analysis of error resiliency of variable length codes(VLC) by Discrete Memoryless Source model is proposed.The probability of error resiliency was counted at the time when the appearing probability of one codeword in the code sequence at a fixed time and the transition probability from this codeword to other codeword with same codeword length to this codeword were analyzed.The error resiliency probability of whole code sequence is the code sequence length power of this transition probability.The simulation results show that the VLC with best error resiliency could be picked out in the VLCs which possesses the same average code length and codeword variance by the method.

给出了一种基于离散无记忆信源模型的分析变长码抗误码扩散能力.该方法通过分析序列中某一时刻某个码字出现的概率,以及该码字发生错误后正好变成与该码字同码长的另一码字的概率,得到该时刻不发生误码扩散的概率.而整个序列不发生误码的概率为该概率的序列长次幂.模拟计算结果显示,该方法可在不增加平均码长和码方差的情况下,选择出抗误码扩散能力最好的码组.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关average code length的内容
在知识搜索中查有关average code length的内容
在数字搜索中查有关average code length的内容
在概念知识元中查有关average code length的内容
在学术趋势中查有关average code length的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社