检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子工程学院,合肥230037 [2]安徽省电子制约技术重点实验室,合肥230037
出 处:《电子测量与仪器学报》2015年第5期701-707,共7页Journal of Electronic Measurement and Instrumentation
基 金:国家自然科学基金项目(60972161)资助课题
摘 要:提出一种有效的识别方法,解决了Turbo编码类型的盲识别问题。首先,在理论分析Turbo码固有结构的基础上,通过特定的拆分和组合方式从Turbo编码序列中获取一路递归系统卷积码,和二路线性分组码,从而根据此特性利用秩统计的方法实现Turbo码的判别;然后对递归系统卷积码输出数据进行差分运算,推导出差分后结果仅与寄存器中存放的数据有关,因此通过一阶累积量的方法可以准确获取归零状态的位置,从而实现对Turbo码的归零特性判别。仿真结果表明:该方法能够实现对Turbo编码类型的识别,且具有较好的容错性能,最后也验证了该方法在较高误码条件下具有较好的识别效果。An effective approach of type identification of turbo code is proposed in this paper. Because of the specific structure of the turbo code, a recursive systematic convolutional code and two linear block codes can be obtained by a particular way of splitting and combining from the turbo coding sequences. Therefore, the turbo code is detemined that uses the method of rank statistic from unknow channel codes based on this feature. Then, the output data of the reeursive systematic convolutional code is differential operation. Since the computing result only related with storing data of the register, the position of trilles termination state of turbo code on trellis termination can be caculated accu- rately by a first-order cumulant method. Through this way, turbo code on trellis termination and turbo code with trel- lis termination can be distingushed. The simulation experiment show the correctable results of this recognition method and the approch has better error-tolerance. Consequently, under the case of high BER, this paper also proves that this recognition method holds good performance.
关 键 词:TURBO码 归零状态 类型识别 拆分和组合 一阶累积量
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.240.165