删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

基于零空间矩阵匹配的极化码参数盲识别算法

本站小编 Free考研考试/2022-01-03

张天骐,
胡延平,,
冯嘉欣,
张晓艳
重庆邮电大学信号与信息处理重庆市重点实验室 重庆 400065
基金项目:国家自然科学基金(61671095, 61702065, 61701067, 61771085),信号与信息处理重庆市市级重点实验室建设项目(CSTC2009CA2003),重庆市研究生科研创新项目(CYS19248),重庆市教育委员会科研项目(KJ1600427, KJ1600429)

详细信息
作者简介:张天骐:男,1971年生,博士后,研究方向为扩频信号的盲处理、神经网络实现以及信号的同步处理
胡延平:男,1994年生,硕士生,研究方向为信道编码参数盲识别技术
冯嘉欣:女,1996年生,硕士生,研究方向为卫星扩频信号的捕获
张晓艳:女,1995年生,硕士生,研究方向为语音信号处理、语音增强
通讯作者:胡延平 530129515@qq.com
中图分类号:TN911.7

计量

文章访问数:757
HTML全文浏览量:266
PDF下载量:49
被引次数:0
出版历程

收稿日期:2019-11-21
修回日期:2020-04-16
网络出版日期:2020-07-13
刊出日期:2020-12-08

Blind Identification Algorithm of Polarization Code Parameters Based on Null Space Matrix Matching

Tianqi ZHANG,
Yanping HU,,
Jiaxin FENG,
Xiaoyan ZHANG
Chongqing Key Laboratory of Signal and Information Processing (CQKLS&IP), Chongqing University of Posts and Telecommunications (CQUPT), Chongqing 400065, China
Funds:The National Natural Science Foundation of China (61671095, 61702065, 61701067, 61771085), The Project of Key Laboratory of Signal and Information Processing of Chongqing (CSTC2009CA2003), Chongqing Graduate Research and Innovation Project (CYS19248), The Research Project of Chongqing Educational Commission (KJ1600427, KJ1600429)


摘要
摘要:针对目前极化码参数盲识别问题,该文提出一种基于零空间矩阵匹配的极化码参数盲识别算法。由于极化码生成矩阵的构造是确定的,其生成矩阵都是满秩的方阵,该算法首先利用极化码编码中信道可靠性估计删除生成矩阵中冻结位码字对应的行,再找出该矩阵在二元域中的零空间矩阵作为该码长下的监督矩阵,用不同长度码长的监督矩阵与待检测的码字迭代相乘,根据乘积结果中“1”的比例来判断码字的码长、信息位个数和位置分布。仿真结果表明,针对200组码长64,信息位个数30的极化码,在最大误比特率不超过0.06时,识别率能保持在80%以上。
关键词:非合作信号处理/
极化码/
盲识别
Abstract:To solve the problem of blind identification of polar codes’ parameters, a blind recognition algorithm of polar codes based on zero space matrix matching is proposed. The construction of polar codes’ generation matrix is certain, and all the generation matrices are full rank square matrices, first the rows corresponding to the frozen bit codes are deleted by using the channel reliability estimation in the polar code encoding. Then, the null space matrix of this matrix in the binary field is found out as the supervision matrix under the code length. The code word is iteratively multipied by the supervision matrix of different code lengths, according to the proportion of "1" in the product result, the code length, number and position distribution of information bits of the code word are determined. The simulation results show that for the 200 groups of polar code with 64-code-length and 30-information-bits, the recognition rate can be kept above 80% when the maximum bit error rate is less than 0.06.
Key words:Non-cooperative signal processing/
Polar codes/
Blind recognition



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=64b390e4-18d6-48b1-9972-4140c53392e3
相关话题/信号 信号与信息处理 信息 空间 重庆邮电大学