针对该问题，基于具有线性编码复杂度的迭代编码算法，提出了一种改进的PEG构造算法。
To solve such a problem, this paper presents an improved PEG algorithm which can be encoded by the iterative encoding algorithm with linear coding complexity.
针对多输入多输出系统中现有的线性分散(LD)空时码编、解码复杂度高的问题，提出了一类正交线性分散(old)空时编码。
Focusing on the problem that existing linear dispersion (LD) space-time codes have a high encoding and decoding complexity, a type of orthogonal linear dispersion (OLD) space-time codes is proposed.
首先回顾了LDPC码的有效编码，然后在此基础上提出了一种应用于不等错误保护的线性复杂度编码方法。
This paper firstly overviews the efficient encoding of LDPC codes, based on which we proposes a linear encoding for UEP.
针对LDPC码通用编码算法的复杂度与码长的平方成正比的问题，重点研究了LDPC码的快速编码方法，总结出了使LDPC码能够达到线性编码的途径。
The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.
针对LDPC码通用编码算法的复杂度与码长的平方成正比的问题，重点研究了LDPC码的快速编码方法，总结出了使LDPC码能够达到线性编码的途径。
The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.
应用推荐