(n,1,m)RSC码的盲识别  

Blind recognition of (n,1,m) RSC code

作　　者：刘建成[1] 杨晓静[1] 

机构地区：[1]解放军电子工程学院,安徽合肥230037

出　　处：《电路与系统学报》2012年第6期84-88,共5页Journal of Circuits and Systems

摘　　要：(n,1,m)递归系统卷积码(RSC)是Turbo码分量编码采用最多的一种编码方式。针对RSC提出了基于改进欧几里德算法的识别方法,为Turbo码的识别奠定了基础。该方法首先将(2,1,m)卷积码的识别模型应用推广至(n,1,m)卷积码,即求解n个多项式的最高公因式,进而利用改进的欧几里德算法识别生成多项式。最后,实例仿真验证了该方法的有效性。（n, 1,m） recursive system convolutional codes （RSC） are the most common sub-coding method of Turbo codes. The recognition method based on the improved Euclidean algorithm is proposed in order to recognize RSC, which lays the foundation for recognition of Turbo codes. This method firstly spreads the recognizing model of （2,1,m） convolutional codes to （n,l,m） convolutional codes, which is to calculate the highest common factor of n polynomials, then recognizes generator polynomials by the improved Euclidean algorithm. At last, the simulation shows the efficient property of this recognition method.

关 键 词：RSC码 盲识别 欧几里德算法 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]