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

图标索引 历史查询
 

code length     
相关语句
  码长
     and still more, cyclic codes can be used without subjecting to the limit of code length n = 2λ-1.
     此外,循环码可以不受码长为n=2~λ-1的限制。
短句来源
     The performance targets of acquisition and tracking: the code rate of pseudorandom signals is 1M-5MHz, the code length is 255. 511, the receiving sensitivity is -118dBm,the dynamic range is 70dB. the Doppler of carrier is 75kHz,the time that 10 targets are captured within 0.2s.
     捕获和跟踪的性能指标:伪随机信号码率1M~5M比特/秒,码长是255、511,接收灵敏度是-118dB,信号动态范围是70dB载波普勒是±75kHz,目标捕获在0.2秒内。
短句来源
     It is proved that shortened cyclic codes with code length n<128 generated by g(x) = 15B93 have Hamming Distance 6 and those codes with shorter code length have less residual probability.
     说明了用g(x)=15B93生成的缩短循环码码长在128以内有海明距离6,短码时,不可检测错误概率比较小。
短句来源
     The average code length of the proposed one in this paper is 1.7651bits, which is shorter than that of 8 orientations Freeman chain code or Freeman differential chain code whose average code length is 3 bits.
     其平均码长为1.7651bits,低于8方向Freeman链码或者Freeman差分链码的3bits的平均码长
短句来源
     RS Encoding of Arbitrary Code Length and Algorithm Optimization Based on DSP
     基于DSP的任意码长RS编码及算法优化
短句来源
更多       
  代码长度
     If the byte length is b, the length of checking part of the code is m bytes, the length of information part of the code is k bytes, then the maximal code length will be n=m+k=2m-2 (2b-1+1) bytes.
     设字节长度为b位,该代码的校验部分长度为m字节,信息部分长度为k字节,则最大代码长度为n=2~(m-2)(2~(b-1)+1)字节。
短句来源
     Staring from developing the bar code certificate with students' messages, the design conditions of the code order, the code length and the proofreader's mark etc.
     从开发带有学生信息的条码证件这个应用角度出发 ,介绍了在研制开发学生证件过程中条码的码制、代码长度和校验符等设计条件的要求 ;
短句来源
     In order to reduce the code length and complexity in image processing soft exploitation, according to the theory of the interface between VC and Matlab, the paper adopts the method of linking the Matlab engine library and VC6.0, studies the conversion of image format in the different condition, and transfers the image processing function of Matlab successfully.
     以数字图像处理软件开发中降低代码长度和复杂性为目的,依据Matlab与VC接口原理,采用Matlab引擎库和VC6.0相链接的方法,研究了两种不同环境下图像格式的转化问题,并在VC6.0环境中成功调用了Matlab图像处理函数.
短句来源
     Giving an example of FFT through transferring Matlab library function, the code length becomes 7 from 78, thus shortening the exploitation period of application.
     结果表明,以图像的傅立叶变换为例,通过调用Matlab库函数,代码长度由78行变为7行,极大缩短了应用程序的开发周期.
短句来源
     This paper discusses the details of design methods of high efficiency C program based on the ARM(Advanced RSIC Machines) embedded system. The design methods make the program utilize software and hardware resources sufficiently,and moreover,on the basis of the actual requirements,they can optimize the performance of the speed as well as the performance of code length in order to enable the two performances to be at their best.
     文章讨论了在基于ARM嵌入式系统中编写高效C程序的几种设计方法,这些设计方法使程序充分利用软硬件资源,根据实际需求,优化其速度性能和代码长度性能,并使得这两个性能达到最佳.
短句来源
  编码长度
     In this paper the LZW compress algorithmic is realized in language C, and the algorithmic of dynamic code length improving Huffman Compress of LZW algorithmic is proposed, and illuminate conclusion of reducing transmit band width and decrease store spaces can be achieved.
     本文用C语言实现了LZW压缩方法,提出了LZW算法动态编码长度的Huffman编码改进压缩算法,得出了采用LZW算法可以达到降低传输带宽和减少存储空间的效果的结论。
短句来源
     relation between error probability and code length when anti different collusion size is given.
     在不同的应用场合,对于给定的任意小的错误概率,可以通过适当选取编码长度,使得在抗一定合谋攻击强度的情况下,错误概率满足应用要求.
短句来源
     Finally the system is simulated and its performance is analyzed. The coded PCM-FM based on convolutional codes,based on LDPC and uncoded PCM-FM are compared. The effects of different parameters,such as code length and generation matrix,were analyzed.
     首先介绍接近Shannon限的先进的信道编码技术———低密度校验码(LDPC)信道纠错编码原理和解码算法,而后给出基于LDPC的编码PCM/FM系统方案,最后详细分析并仿真该系统的性能,着重比较未编码、卷积编码和LDPC编码三种系统的性能差异,还对比LDPC的各种不同参数(编码长度、校验矩阵等)对系统性能的影响。
短句来源
     The code length is specified with a desired time delay for correlation. The pulse has an additional autocorrelation peak at a predetermined time lag to give a function of dual peaks. Trade-off between pulse width and pulse interval is thus obtained.
     单脉冲脉内采用相位编码,减少了测速噪声的影响,通过一个满足相关寻优准则的编码搜寻程序进行伪随机编码,编码长度与声相关延迟时间相一致,所产生编码的自相关函数具有双相关峰特性,这与双脉冲发射的测速体制相对应,解决了双脉冲发射体制测速中脉冲宽度和脉冲间隔时间之间的矛盾。
短句来源
     It was proved that the quadrant ambiguity has been solved,the code length gets shorter and the storage space is saved.
     实验表明,QuaPA+编码解决了象限二义性问题,缩短了编码长度,节省了存储空间。
短句来源
更多       
  “code length”译为未确定词的双语例句
     The Q-matrix LDPC code has high flexibility concerning design of code length and rate,which makes it compatible with the existed standard.
     Q矩阵LDPC码不同于现有其它结构LDPC码的独特之处在于,对码长和码率参数的设计具有高度灵活性,使其能与现有标准兼容.
短句来源
     Construction of a Pseudorandon Numbers Sequence of 4t+1 Prime Number Code Length
     一种4t+1型素数码长伪随机序列的构造
短句来源
     (2,1,7) nonsystematic convolutional codes are optimal convolutional codes on the same code length and information bit length condition, so they are adopted as space standard codes by CCSDS(Consultative Committee for Space Data Systems).
     (2,1,7)非系统卷积码在相同的码长和信息长度下为最佳卷积码,因此被CCSDS(空间数据系统咨询委员会)采纳为空间标准码。
短句来源
     The difference in anti - jamming performance between GPS C/A and P(Y) - code due to code length difference is analyzed in the chapter two. That is important for the conclusion made from studing GPS C/A - code used for evaluating GPS P(Y) - code .
     以对GPS C/A码信号及GPS C/A码接收机的研究结果来类推GPS P(Y)码信号及GPSP(Y)码接收机的类似问题是研究GPS对抗问题的一种有效方法,但应注意P(Y)码与C/A码的区别。
短句来源
     At the same time,by selecting appropriate code length and code weight,the customer numbers of the system can reach up to more than 200,while BER is less than 1×10~(-9).
     同时通过适当选择码长和码重,系统满足1×10-9的误码率要求,并发用户数可以高达200以上。
短句来源
更多       
查询“code length”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  code length
Besides, a code extension technique is adopted for improving compression efficiency with keeping decompressor circuits simple in the manner that the code length for infrequent scan vectors is designed as double of that for frequent ones.
      
The results are for a PN code length of 64 code chips and assumes a Gaussian channel with the receiver detection threshold set to obtain a constant false alarm rate.
      
In this paper we describe a coding methodology that not only exploits component-level redundancy to reduce code length but also supports efficient data access.
      
Numerical results are presented for a set of Gold code of code length 127.
      
The characterization of a sparse code gets more complicated as code length increases: Access patterns change from loop to loop, thus making necessary to redefine the parallelization strategy.
      
更多          


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...

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...

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...

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) 中国学术期刊(光盘版)电子杂志社