宇航学报

宇航学报 ›› 2013, Vol. 34 ›› Issue (4): 568-573.doi: 10.3873/j.issn.1000-1328.2013.04.017

• 电子信息 • 上一篇    下一篇

基于求解校验序列的(n,k,m)卷积码盲识别

杨晓静，刘建成，张玉   

  1. 解放军电子工程学院，合肥 230037
  • 收稿日期:2012-03-30 修回日期:2012-06-13 出版日期:2013-04-15 发布日期:2013-04-25

Blind Recognition of (n,k,m) Convolutional Codes Based on Solving Check Sequence

YANG Xiao jing,  LIU Jian cheng,  ZHANG Yu   

  1. Electronic Engineering Institute of PLA, Hefei  230037, China
  • Received:2012-03-30 Revised:2012-06-13 Online:2013-04-15 Published:2013-04-25

PDF

837

摘要：

针对卫星通信和深空探测等采用的(n,k,m)卷积码盲识别问题，提出了一种新的识别方法。首先，根据卷积码本身的线性约束关系改进分析矩阵模型的构造方法，有效地减小了识别所需数据量。在通过矩阵化简识别出码长、码字起始位置和校验序列基础上，提出了由校验序列推导出生成多项式矩阵的方法，进而完成卷积码的识别。仿真实例表明，该识别方法不需要任何先验条件，能够有效识别所有(n,k,m)卷积码。

关键词: 卫星通信, 卷积码盲识别, 分析矩阵, 校验序列, 数据量

Abstract:

A novel method of recognition is proposed to recognize the (n,k,m) convolutional codes applied in satellite communication, deep space exploration and so on. The linear constraint relation between convolutional codes is used to improve constructing the model of analysis matrix, thus reducing the data needed in recognition effectively. On the foundation of having recognized length of code, first location of codes and the check sequence by simplifying the matrix, a method is proposed to deduce the matrix of polynomials generated by the check sequence, and to recognize the convolutional code at last. The examples of simulation show that the method of recognition is able to recognize all (n,k,m) convolutional codes effectively without any known conditions.

Key words: Satellite communication, Blind recognition of convolutional codes, Analysis matrix, Check sequence, Amount of data

中图分类号: