首页 | 本学科首页   官方微博 | 高级检索  
     

基于SWIPT的乘积Polar编码协作构造与分析
引用本文:张顺外,夏子寒.基于SWIPT的乘积Polar编码协作构造与分析[J].北京邮电大学学报,2022,45(5):54-59.
作者姓名:张顺外  夏子寒
作者单位:1.南京邮电大学 通信与信息工程学院 2.南京邮电大学 宽带无线通信与传感网技术教育部重点实验室

基金项目:江苏省高等学校自然科学研究面上项目;南京邮电大学宽带无线通信与传感网技术教育部重点实验室开放研究基金项目
摘    要:为实现绿色可靠通信,提出了基于无线信息与能量同传(SWIPT)技术的乘积极化( Polar)编码协作系统。 首先,建立基于 SWIPT 的乘积 Polar 编码协作系统模型;其次,将 Polar 码作为乘积码的分量码构建乘积 Polar 码,分别在信源节点和中继节点对其行编码和列编码;最后,在目的节点提出一种低译码时延的两步译码算法,第一步对接收到乘积 Polar 码的码字矩阵分别进行串行相消(SC)译码与列 SC 译码,若第一步译码失败,则执行第二步译码,即将乘积 Polar 码的码字矩阵变换为单行 Polar 码,再 SC 译码。 理论分析与仿真表明,相比点对点系统,基于 SWIPT的乘积 Polar 编码协作大大降低了译码时延;与采用置信度传播译码算法的乘积低密度奇偶校验编码协作系统相比,所提系统误码性能更优。

收稿时间:2021-10-05
修稿时间:2021-11-01

Construction and Performance Analysis of SWIPT-Based Product Polar Coded Cooperation
Abstract:In order to achieve green reliable communication, a product polar coded cooperation systembased on simultaneous wireless information and power transfer (SWIPT) is proposed. Firstly, the productpolar coded cooperation model based on SWIPT is established. Secondly, the polar code is used as thecomponent code of the product code to construct the product polar code, which is row coded at the sourcenode and column coded at the relay node. Finally, a two-step decoding algorithm with low decoding delayis proposed at the destination node. In the first step, row successive cancellation ( SC) decoding andcolumn SC decoding are performed on the codeword matrix of the received product polar code. If the firststep decoding fails, the second step decoding is performed, in which the codeword matrix of the productpolar code is transformed into a single line polar code, and then decoded by SC. Theoretical analysis andsimulation show that compared with point-to-point system, the product polar coded cooperation based onSWIPT greatly reduces the decoding delay. Compared with the product low density parity check codedcooperative system that uses the belief propagation decoding algorithm, the proposed system has better biterror performance.
Keywords:
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号