计算机科学 ›› 2018, Vol. 45 ›› Issue (6A): 310-313.

• 网络与通信 • 上一篇    下一篇

一种变步长梯度寻优的RSC码识别算法

吴昭军1,张立民1,钟兆根2   

  1. 海军航空大学航空作战勤务学院 山东 烟台2640011
    海军航空大学航空基础学院 山东 烟台2640012
  • 出版日期:2018-06-20 发布日期:2018-08-03
  • 作者简介:吴昭军(1992-),男,博士生,主要研究方向为信道编码识别,E-mail:wuzhaojun1992@qq.com;张立民(1966-),男,博士,教授,主要研究方向为卫星信号处理及应用,E-mail:iamzlm@163.com;钟兆根(1984-),男,博士,讲师,主要研究方向为通信信号盲分离与统计信号处理,E-mail:zhongzhaogen@163.com。
  • 基金资助:
    国家自然基金重大研究计划(91538201),泰山学者工程专项经费(ts201511020)资助

Blind Recognition of RSC Code Generated Polynomial Based on Variable Step Size of Gradient Search

WU Zhao-jun1,ZHANG Li-min1, ZHONG Zhao-gen2   

  1. The Academy of Air Combat Service,Naval Aviation University,Yantai,Shandong 264001,China1
    The Academy of Aviation Foundation,Naval Aviation University,Yantai,Shandong 264001,China2
  • Online:2018-06-20 Published:2018-08-03

摘要: 针对RSC码的编码器生成多项式的盲识别问题,在分析信号模型的基础上,基于EM算法的思想,在M步骤中,通过建立步长大小与当前梯度的非线性函数关系,提出了一种变步长梯度寻优算法。该算法相比于定步长算法而言,参数的估计值收敛到真实值的速度更快,且具有较强的抗噪声能力。仿真结果表明:同等条件下,所提算法在第4次迭代就收敛到了真实值,而定步长算法则需要迭代20次以上;在抗噪声性能方面,蒙特卡洛实验结果表明,所提算法在信噪比为0dB时,其参数的识别概率都能够达到80%以上。

关键词: M算法, RSC码, 变步长, 盲识别, 生成多项式

Abstract: According to blind recognition of RSC code generated polynomial,the nonlinear function between step size and gradient was established in M step based on EM algorithm.As a result,a novel algorithm of variable step size of gradient search was proposed based on analysis of the signal model.Compared with the fixed step algorithm,the new algorithm has better cognitional performance on the condition of low SNR and has a strong ability to resist noise.Besides,the convergence of parameter estimation curve is rather faster.The computer simulation results show that the proposed algorithm can converge at real value at 4th iteration,while for fixed step size algorithm,more than 20 iterations are needed.In terms of performance of noise resistance,the Monte Carlo trial results show that the correct ratio of recognition can reach more than 80% at SNR of 0dB.

Key words: Blind recognition, EM algorithm, Generated polynomial, RSC codes, Variable step size

中图分类号: 

  • TN911.72
[1]王兆伟,王永达,李秉权.Turbo码应用于机载通信信道编码的研究[J].移动通信,2015,39(16):55-59.
[2]谢辉,黄知涛,王峰华.信道编码盲识别技术研究进展[J].电子学报,2013,41(6):1166-1176.
[3]任亚博,张健,刘以农.高误码率下Turbo码交织器的恢复方法[J].电子与信息学,2015,37(8):1927-1930.
[4]BARBIER J.Reconstruction of turbo-code encoders[J].Defense & Security,2005,5819:463-473.
[5]解辉,王峰华,黄知涛,等.基于改进欧几里得算法的卷积码快速盲识别算法[J].国防科技大学报,2012,34(6):159-162.
[6]刘健,王晓军,周希元.基于Walsh-Hadamard变换的卷积码盲识别[J].电子与信息学报,2010,32(4):884-888.
[7]于沛东,李静,彭华.一种利用软判决的信道编码识别新算法[J].电子学报,2013,41(2):302-305.
[8]MOON T K.Maximum-likelihood binary shift register synthesis from noisy observation[J].Information Theory IEEE Transactions on,2002,48(7):2096-2104.
[9]DEBESSU Y G,WU H C,JIANG H.Novel Blind Encoder Parameter Estimation for Turbo Codes[J].IEEE Communications Letters,2012,16(16):1917-1920.
[10]张旻,陆凯,李歆昊,等.归零Turbo码的盲识别方法[J].系统工程与电子技术,2016,38(6):1424-1427.
[11]张旻,陆凯,李歆昊.Turbo编码类型的盲识别方法[J].电子测量与仪器学报,2015,29(5):701-707.
[12]DING J,HANGENAUER J.Parameter estimation of a convolutional encoder from noisy observations[C]∥Proc. IEEE International Symposium on Information Theroy.2007:1776-1780.
[13]LEEE L R R F.A Tutorial on Hidde Markov Models and Selected Applications in Speech Recognition[J].Proceedings of the IEEE,1989,77(2):257-286 [14]高鹰,谢胜利.一种变步长LMS自适应滤波算法及其分析[J].电子学报,2001,29(8):1094-1097.
[1] 刘卫明, 安冉, 毛伊敏.
基于聚类和WOA的并行支持向量机算法
Parallel Support Vector Machine Algorithm Based on Clustering and WOA
计算机科学, 2022, 49(7): 64-72. https://doi.org/10.11896/jsjkx.210500040
[2] 马思琪, 车啸平, 于淇, 岳晨峰.
基于事件的虚拟现实用户体验评估方法研究
Event-based User Experience Evaluation Method for Virtual Reality Applications
计算机科学, 2021, 48(2): 167-174. https://doi.org/10.11896/jsjkx.200100065
[3] 王卫东, 徐金慧, 张志峰, 杨习贝.
基于密度峰值聚类的高斯混合模型算法
Gaussian Mixture Models Algorithm Based on Density Peaks Clustering
计算机科学, 2021, 48(10): 191-196. https://doi.org/10.11896/jsjkx.200800191
[4] 杨紫淇, 蔡英, 张皓晨, 范艳芳.
基于负载均衡的VEC服务器联合计算任务卸载方案
Computational Task Offloading Scheme Based on Load Balance for Cooperative VEC Servers
计算机科学, 2021, 48(1): 81-88. https://doi.org/10.11896/jsjkx.200800220
[5] 陈曦, 冯梅, 江波.
Kaminsky攻击及其异常行为分析
Analysis of Kaminsky Attack and Its Abnormal Behavior
计算机科学, 2020, 47(11A): 396-401. https://doi.org/10.11896/jsjkx.200100060
[6] 张征, 王宏志, 丁小欧, 李建中, 高宏.
社交网络中同一用户的识别
Identification of Same User in Social Networks
计算机科学, 2019, 46(9): 93-98. https://doi.org/10.11896/j.issn.1002-137X.2019.09.012
[7] 王卫红, 陈骁, 吴炜, 高星宇.
高分影像复杂背景下的城市水体自动提取方法
Method of Automatically Extracting Urban Water Bodies from High-resolution Images with Complex Background
计算机科学, 2019, 46(11): 277-283. https://doi.org/10.11896/jsjkx.181001985
[8] 魏万银,杜小妮,李芝霞,万韫琦.
周期为pq的四元广义分圆序列的线性复杂度
Linear Complexity of Quaternary Generalized Cyclotomic Sequences with Period pq
计算机科学, 2017, 44(6): 174-176. https://doi.org/10.11896/j.issn.1002-137X.2017.06.029
[9] 王兰勋,贾层娟,熊政达.
一种循环码参数的全盲识别方法
Blind Recognition Method of Cyclic Codes Parameters
计算机科学, 2017, 44(3): 283-287. https://doi.org/10.11896/j.issn.1002-137X.2017.03.058
[10] 瞿中,李秀丽.
基于改进IGG模型的全景图像拼接缝消除算法
Algorithm of Eliminating Image Stitching Line Based on Improved IGG Model
计算机科学, 2017, 44(12): 274-278. https://doi.org/10.11896/j.issn.1002-137X.2017.12.049
[11] 张星航,郭艳,李宁,孙保明.
基于无网格压缩感知的DOA估计算法
DOA Estimating Algorithm Based on Grid-less Compressive Sensing
计算机科学, 2017, 44(10): 99-102. https://doi.org/10.11896/j.issn.1002-137X.2017.10.019
[12] 张婷婷,张德平,刘国强.
基于EM方法的隐Markov软件可靠性模型
Hidden Markov Software Reliability Model with EM Method
计算机科学, 2016, 43(8): 159-164. https://doi.org/10.11896/j.issn.1002-137X.2016.08.033
[13] 朱永强,秦志光.
一种基于编码关联的快速多模式匹配算法
Multi-pattern Matching Algorithm Based on Coding Association
计算机科学, 2016, 43(2): 26-30. https://doi.org/10.11896/j.issn.1002-137X.2016.02.005
[14] 朱旭辉,倪志伟,程美英.
变步长自适应的改进人工鱼群算法
Self-adaptive Improved Artificial Fish Swarm Algorithm with Changing Step
计算机科学, 2015, 42(2): 210-216. https://doi.org/10.11896/j.issn.1002-137X.2015.02.044
[15] 谢东,龚劬,陈小彪.
基于KFCM与改进CV模型的Split Bregman图像分割方法
Split Bregman Method of Image Segmentation Based on KFCM and Improved CV Model
计算机科学, 2014, 41(Z6): 153-155.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!