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

图标索引 历史查询
 

code word length     
相关语句
  码字长度
     2) to improve a powerful noise immunity at higher orror bit rate, a new code table for DCT coefficients is set, where the codeword length is an integer multiple of four bits, and odd-ever check function is provided.
     2)字长有规律的可变字长偏码,提出码字长度为4比特的整倍数并且具有奇偶校验能力的DCT系数码表构造,使误码率较高时系统的抗干扰能力显著增强。
短句来源
     Experimental results show that its average codeword length is closer to the theoretic lower bound of source coding than many popular rapid coders.
     实验结果显示其平均码字长度比常用的快速编码器更接近于源编码理论的理论下限。
短句来源
     This algorithm perfectly deals with the conflict between the performance of coding and the codeword length after coding.
     该编译码算法较好地解决了编码性能与编码后码字长度的矛盾.
短句来源
     Being sure of the codeword length, its performance approximated its optimum performance,making it a pragmatic coding and decoding algorithm.
     实验结果表明,在保证编码后码字长度尽量短的条件下,其性能逼近最佳性能,是一种十分实用的编译码算法.
短句来源
     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 upper and lower bounds of the average codeword length of Golomb codes for arbitrary probability distributions as well as an optimal rule for choosing parameters are given in terms of the mean of sources.
     以信源的平均值给出了任意概率分布下Golomb码的平均码长的上下界和最优的参数选择准则。
短句来源
     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.
     该方法通过分析序列中某一时刻某个码字出现的概率,以及该码字发生错误后正好变成与该码字同码长的另一码字的概率,得到该时刻不发生误码扩散的概率.
短句来源
  “code word length”译为未确定词的双语例句
     Using Visual C++ we simulate the performance with code word length N=3072 and 49152.The simulation results indicate that when N=49152,code rate R=1/3,the distance from Shannon's limit are 0.67dB,0.72dB and 0.91dB for AWGN,Rician and Raylrigh channels,respectively,LDPC codes having nice interleaving performance and anti-fading capability,and better performance of LDPC than Turbo codes in some area of SNR.
     仿真结果表明LDPC码在码长N =4 95 12、码率R =1/3时 ,与Shannon限相差 1dB以内、在低信噪比时其性能优于Turbo码 ,以及LDPC码本身有很好的交织特性和抗衰落的能力 ;
短句来源
     For balanced coding based on Huffman's code,by keeping the same average code word length,the method in this paper is optimum.
     对基于Huffman码的平衡编码,在保持平均码长不变的情况下,本文给出的方法使0与1的平衡性达到最优。
短句来源
查询“code word length”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  code word length
The algorithm is shown also to solve the problem of constructing optimal, prefix codes with restricted maximal length and with all code word lengths restricted to multiples of the shortest code word length.
      
The dialog box of the block allows the user to set the code rate and code word length.
      


This paper gives a method of balanced coding for discrete memoryless sources such that the output sequence of the source has best balance,i.e.,the probabilities of the appearance of 0 and 1 are almost the same.For fixed-length coding,the method proposed in this paper is step-optimum.For balanced coding based on Huffman's code,by keeping the same average code word length,the method in this paper is optimum.Moreover,the application of balanced coding in stream Ciphers is also discussed.

本文对离散无记忆信源给出了一种编码方法,它使编码后信源输出有着最好的平衡性,即0与1的数目最大程度地接近。对等长编码,本文给出的方法是步优的;对基于Huffman码的平衡编码,在保持平均码长不变的情况下,本文给出的方法使0与1的平衡性达到最优。因为一般信源字符的频率是一个统计数字,这里的平衡性也是从统计角度来说的。最后我们还讨论了这种平衡编码对流密码中的非线性组合器在防止相关攻击方面的防护作用。

This paper analyzes and simulates the performance of irregular low density parity check (LDPC) codes on Rician fading channels and the others,and modifies BP decoding algorithm,proves the symmetry and shows the stability conditions on Rician channels,calculates the Shannon limit of Rician channels.Using Visual C++ we simulate the performance with code word length N=3072 and 49152.The simulation results indicate that when N=49152,code rate R=1/3,the distance from Shannon's limit are 0.67dB,0.72dB...

This paper analyzes and simulates the performance of irregular low density parity check (LDPC) codes on Rician fading channels and the others,and modifies BP decoding algorithm,proves the symmetry and shows the stability conditions on Rician channels,calculates the Shannon limit of Rician channels.Using Visual C++ we simulate the performance with code word length N=3072 and 49152.The simulation results indicate that when N=49152,code rate R=1/3,the distance from Shannon's limit are 0.67dB,0.72dB and 0.91dB for AWGN,Rician and Raylrigh channels,respectively,LDPC codes having nice interleaving performance and anti-fading capability,and better performance of LDPC than Turbo codes in some area of SNR.Therefore the performance of LDPC codes is also very effective on all kind of channels,including Rician channels.

本文对非规则LDPC码在RICE信道的性能进行了分析和仿真 ,修正了BP译码算法 ,证明了RICE信道满足对称性 ,给出了RICE信道译码稳定性条件 ,推导出了RICE信道的Shannon容量限 ,采用VC编程对码长N =4 95 12和 30 72进行了仿真 ,同时与同码长的Turbo码进行了比较 ;仿真结果表明LDPC码在码长N =4 95 12、码率R =1/3时 ,与Shannon限相差 1dB以内、在低信噪比时其性能优于Turbo码 ,以及LDPC码本身有很好的交织特性和抗衰落的能力 ;这进一步表明了LDPC码在包括RICE信道在内的各种信道中的性能都是非常优良的 .

 
图标索引 相关查询

 


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

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