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

图标索引 历史查询
 

code-length
相关语句
  码长
     The results show that with input SNRi = - 8dB, the detection probability of the scheme is more than 90% for a PN code with a code-length of 127.
     结果表明,该方法对于码长为127的PN码,在信噪比为-8dB的情况下,其捕获概率在高的门限值上可达90%以上。
短句来源
     And then, the precision of the limit of coding-length, the relation of N and coding efficiency, the impact of word number on the code-length and the limit of typist's average input speed is argued.
     基于上述计算结果,本文还就最短码长精度、码元N与编码效率、词数与码长的关系以及录入员平均输入速度的上限进行了讨论。
短句来源
     We give the value of the code-length n and dimension k , and the lower bound of the minimal distances of the new linear code under some particular condition.
     在某些情况下,我们得到了该类线性码的码长n和维数k的取值以及最小距离d的下限。
短句来源
     The result indicates that ST-OOC has excellent performance and characters,such as the lowest cross-correlation,large cardinality and flexibility to choose code-length and code-weight,therefore ST-OOC is very appropriate to OCDMA system.
     分析了ST-OOC的码字性能和特点和灵活的码长码重对应关系;
短句来源
     In this paper, we discuss the design of frequency hopping multiple-access code for the establishment of spread spectrum communication network. The relation between code-length, number of channels and number of networks is derived.
     本文从扩频通信组网的角度出发,对网络跳频地址码的设计问题作了些探讨,得出了地址码码长、可用频道数及网络数之间的关系。
短句来源
更多       
  “code-length”译为未确定词的双语例句
     One special address codeword which is a“0/1”sequence of certain code-length is assigned to each user in advance.
     在OCDMA系统中,每一个用户预先被分配一个特定的地址码,即一个字长的0/1序列。
短句来源
     A time-frequency analysis method for reconnaissance signal recognition of PN and LFM is studied. Wigner time-frequency distribution function for PRBC-LFM reconnaissance signal is deduced. By WVD analysis, features related to carrier frequency, FM slope and PN parameters such as sub-pulse width, code-length and pulse cycle are extracted.
     研究了伪码-线性调频复合体制侦察信号识别的时频分析方法,推导了PRBC-LFM侦察信号的Wigner时频分布函数,通过对ω=ω0+Kt截面上WVD分析,从中提取了与载频、调频斜率和伪码参数(子脉冲宽度、编码位数、脉冲周期等)有关的特性,设计了参数估计方法,最后在高斯噪声环境下对分析的结果进行了仿真。
短句来源
     The results show that the proposed fingerprinting has both shorter code-length and faster traitor searching.
     结果表明该方法具有更短的码长和更快的叛逆者搜索性能.
短句来源
  相似匹配句对
     Every code has the same length of 8 bits.
     各码码长相等(均为8bit);
短句来源
     Data Encrypting Method Using Length Variable Code
     利用不等长编码对数据加密的方法
短句来源
     A new run-length limited code is introduced.
     介绍了一种新的用于高密度光盘存储的游程长度受限码。
短句来源
     Run-Length-Limited code used in Optical storage
     光盘记录中应用的游程长度受限编码
短句来源
     Character oriented Text Process on Variable-length Code
     基于变长码的面向字符文本处理方法
短句来源
查询“code-length”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  code-length
We then present a new numbering scheme that not only requires minimal code-length in comparison with existing numbering schema but also improves update performance when XML data is frequently updated at arbitrary positions.
      


In this paper two methods of high-speed decoding of Fire codes for disc error-correction are presented.Method I. For determination of erroneous address, high-speed backward shift circuits are used to perform the cyclic shift of P(x). The maximum number of times of shifting operation for the decoding with a code length N is less than (c + N/C). The erroneous address will directly be given by the counter.Method II. On the basis of Chinese remainder theorem, the erroneous address will directly be given by the counter...

In this paper two methods of high-speed decoding of Fire codes for disc error-correction are presented.Method I. For determination of erroneous address, high-speed backward shift circuits are used to perform the cyclic shift of P(x). The maximum number of times of shifting operation for the decoding with a code length N is less than (c + N/C). The erroneous address will directly be given by the counter.Method II. On the basis of Chinese remainder theorem, the erroneous address will directly be given by the counter when P(x) and C are properly chosen. The maximum number of times of decoding shift is less than (e + c).Both methods are suitable for high-speed decoding in the disc storage system where arithmetic operation functions are not available and the zerofilling operation is not necessary. It is also suitable for arbitrary code length.

本文介绍磁盘纠错用法尔码的两种快速译码方法。 方法Ⅰ:在确定错误地址时,P(x)电路的循环移位采用快速反向移位电路,码长为N的最大译码移位操作次数小于(C+N/C)次,错误地址直接由计数器得到。 方法Ⅱ:根据孙子定理并加简化和推广应用,在适当选择P(x)和C后,错误地址直接由计数器得到。最大译码移位次数小于(e+C)次。 两者适用于不具备算术运算功能的磁盘存储器系统的快速译码,不需要补0操作,适用于随机码长。

The error-correcting capability of the Reed-Solomon codes is quite good,but its utilization is limited by its complex decoding.The fast decoding of Reed-Solomon codes by using the FFT algorithm is discussed in this paper.In addition,the continued fractions method is used for solving the Berlekamp's algorithm,because it can be easily implemented in a computer.The improved efficiency of decoding enable us to use longer code lengths of the R S codes of which the error-correcting capability is more powerful.The...

The error-correcting capability of the Reed-Solomon codes is quite good,but its utilization is limited by its complex decoding.The fast decoding of Reed-Solomon codes by using the FFT algorithm is discussed in this paper.In addition,the continued fractions method is used for solving the Berlekamp's algorithm,because it can be easily implemented in a computer.The improved efficiency of decoding enable us to use longer code lengths of the R S codes of which the error-correcting capability is more powerful.The factorization of a binomail xn-1 over Galois field GF(Fn) on which the FFT algorithm is based is also analysed.The root a of RS codes is discussed,for the code length and the complexity of calculation depends on it.It is known that,a=3 is the primitive element of GF(Fn),for n=2,3,4.But the multiplications are simpler when 2,21/2,21/4,21/8 are chosen for the root a.The whole procedure of the fast decoding of RS codes together with an example,is embodied in this paper.

Reed-Solomon码(RS码)的纠错能力强,但由于解码算法比较复杂,它的实用性颇受限制。本文研究的RS码快速解码法,其主要特点是采用了FFT算法。另外,在解码过程中用连分数方法来做Berlekamp算法,使之更为适合于计算机迭代计算。解码效率提高了,这也为使用更长的RS码创造条件,而较长的码,纠错能力更强。文中研究了伽罗华域GF(F_n)上的二项式x~N-1的分解,这是RS码能够使用FFT算法的依据。并分析了RS码的根α,码长等于α的阶,已知α=3,是GF(F_n),n=2,3,4的本原元素。但选择α为2,2~(1/2),2~(1/4),或2~(1/8)时乘法运算更为简单。全文包括了一个完整的RS码快速解码的全过程,还附有例子。

Reed-Solomon codes (RS codes) are nonbinary BCH codes.But the error correcting capability of RS codes is more powerful than that of binary BCH codes.Therefore,RS codes are particularly applicable to the anti-jamming communication systems and attract more attention recently.The implementation of the fast decoding of RS codes is discussed in this paper.RS codes can be decoded effectively by using the FFT algorithm provided that the Fourrier Transformis over Galois field GF(q) and q equals Fn,the Fermat prime,Fn...

Reed-Solomon codes (RS codes) are nonbinary BCH codes.But the error correcting capability of RS codes is more powerful than that of binary BCH codes.Therefore,RS codes are particularly applicable to the anti-jamming communication systems and attract more attention recently.The implementation of the fast decoding of RS codes is discussed in this paper.RS codes can be decoded effectively by using the FFT algorithm provided that the Fourrier Transformis over Galois field GF(q) and q equals Fn,the Fermat prime,Fn = 22n+1 n = 1,2,3,4. .In this paper,the selecting of the root a of RS codes is discussed in.detail.The problem of overflowing in a computer is solved,and no round-off error is assured.In order to show the whole procedure of the fast decoding,the flow chart of the program and examples are presented.Finally,the paper points out that the improved efficiency of decoding enable us to use longer code lengths of RS codes,of which the error-correcting capability is more powerful.

Reed-Solomon码(RS码)是一种多进制的BCH码,但它的纠错能力比二进制的BCH码强得多。特别适用于抗干扰能力强的通信。近年来,逐渐受到重视,但它的实用性往往取决于解码的实现方法。本文研究RS码快速解码的实现问题。 快速解码的主要特点是采用数论变换的FFT算法,在伽罗华域GF((?))上进行富哀里变换: A_k=sum from m=0 to (N-1) α_nα~(km) k=0,1,…,N-1当q为Fermat素数 F_n=2~(2n)+1 n=1,2,3,4时,可以运用FFT算法,从而大大地提高了运算的速度。 本文详细讨论了RS码的根α的选择。还解决了计算机溢出的问题,保证运算无截尾误差。 本文还介绍了解码过程中的Berlekamp算法,它采用连分数的方法运算,从而使解码过程更适合计算机。用一个例子说明这种快速解码的全过程,并介绍了程序流程图。最后还指出由于实现解码效率的提高,从而提供了使用较长RS码的可能性,使之具有更大的纠错能力。

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

 


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

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