基于求解校验序列的(n,1,m)卷积码盲识别
doi: 10.3724/SP.J.1146.2012.00497
Blind Recognition of (n,1,m) Convolutional CodeBased on Solving Check-sequence
-
摘要: 伴随信息对抗和智能通信的快速发展，信道编码识别已成为信息恢复领域一个重要的课题。针对(n,1,m)卷积码盲识别问题，该文提出一种新的识别方法，该方法首先提出了校验序列的概念，通过改进后的矩阵模型求解出校验序列，进而由校验序列构造方程求解出生成多项式矩阵，完成识别。最后，通过实例仿真验证了该方法能够在参数n和码字起始位置都未知情况下有效识别出(n,1,m)卷积码。Abstract: In view of the fast development of information countermeasure and intelligent communication, recognition of channel coding has been a vital issue in information interception. This paper proposes a new method of recognition in order to recognize the(n,1,m) convolutional codes. Firstly, this method defines the notion of check-sequence, and solves it by an advanced model of matrix, then deduces the matrix of generator polynomial, having recognized the convolutional code, by check-sequence. Finally, examples of simulation show that this method is able to recognize, neither knowing the parameter of code n nor the begin location of coding, all (n,1,m)convolutional codes effectively.
-
计量
- 文章访问数: 2338
- HTML全文浏览量: 114
- PDF下载量: 666
- 被引次数: 0
下载:
