高效QC-LDPC预编码Raptor编码协作方案
发布时间：2018-10-26 12:49
【摘要】：传统协作通信常采用译码转发(DF)协议。而该协议在源-中继节点链路通信质量较差情况下,易出现误码传播现象。为了改进该问题,该文提出可应用于编码协作(CC)机制的Raptor编码协作方案,其可在高信噪比下获得较大编码增益和满分集增益。它在源节点和中继节点使用不同Raptor编码,使中继节点新编码码字为源节点码字的部分校验信息,使接收端所得码字独立不等。因此,目的节点在分别接收来自不同独立链路消息后,可根据码字间固有关系联合译码,以获得额外发送空间分集增益。为了降低复杂度,Raptor码的预编码还可采用整数序列构造的准循环低密度奇偶校验(QC-LDPC)码,从而获得较低线性预编码复杂度。仿真表明:在误比特率(BER)为10-4时,所提Raptor编码协作方案较传统DF协议Raptor方案,Raptor与分布式空时分组码(DSTBC)结合方案,分别有2 d B和1 dB增益。此外,当中断概率为10~(-2)时,其性能较CC,DF协作方案提高了约2 dB和7 d B。
[Abstract]:Traditional cooperative communication often adopts decoding and forwarding (DF) protocol. The protocol is prone to error propagation when the communication quality of the source-relay link is poor. In order to improve this problem, this paper proposes a Raptor coding cooperation scheme which can be applied to the coding cooperative (CC) mechanism. It can obtain large coding gain and full diversity gain under high SNR. It uses different Raptor codes in the source node and the relay node so that the new coded codeword of the relay node is part of the check information of the source node codeword so that the received codeword varies independently. Therefore, after receiving the messages from different independent links separately, the destination node can be decoded jointly according to the inherent relationship between the codewords to obtain additional transmit space diversity gain. In order to reduce the complexity, the precoding of Raptor codes can also use quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by integer sequences to obtain lower linear precoding complexity. Simulation results show that when the bit error rate (BER) is 10 ~ (-4), the proposed Raptor coding cooperation scheme has 2 dB and 1 dB gain, respectively, compared with the traditional DF protocol Raptor scheme, Raptor and distributed space-time block code (DSTBC) scheme. In addition, when the outage probability is 10 ~ (-2), its performance is about 2 dB and 7 dB higher than that of CC,DF.
【作者单位】： 杭州电子科技大学通信工程学院;东南大学移动通信国家重点实验室;
【基金】：浙江省自然科学基金(LZ14F010003,LY15 F010008) 国家自然科学基金(61471152) 东南大学移动通信国家重点实验室开放研究基金(2014D02) 浙江省公益性技术应用研究计划(2015C31103)~~
【分类号】：TN911.22
本文编号：2295775
[Abstract]:Traditional cooperative communication often adopts decoding and forwarding (DF) protocol. The protocol is prone to error propagation when the communication quality of the source-relay link is poor. In order to improve this problem, this paper proposes a Raptor coding cooperation scheme which can be applied to the coding cooperative (CC) mechanism. It can obtain large coding gain and full diversity gain under high SNR. It uses different Raptor codes in the source node and the relay node so that the new coded codeword of the relay node is part of the check information of the source node codeword so that the received codeword varies independently. Therefore, after receiving the messages from different independent links separately, the destination node can be decoded jointly according to the inherent relationship between the codewords to obtain additional transmit space diversity gain. In order to reduce the complexity, the precoding of Raptor codes can also use quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by integer sequences to obtain lower linear precoding complexity. Simulation results show that when the bit error rate (BER) is 10 ~ (-4), the proposed Raptor coding cooperation scheme has 2 dB and 1 dB gain, respectively, compared with the traditional DF protocol Raptor scheme, Raptor and distributed space-time block code (DSTBC) scheme. In addition, when the outage probability is 10 ~ (-2), its performance is about 2 dB and 7 dB higher than that of CC,DF.
【作者单位】： 杭州电子科技大学通信工程学院;东南大学移动通信国家重点实验室;
【基金】：浙江省自然科学基金(LZ14F010003,LY15 F010008) 国家自然科学基金(61471152) 东南大学移动通信国家重点实验室开放研究基金(2014D02) 浙江省公益性技术应用研究计划(2015C31103)~~
【分类号】：TN911.22
【相似文献】
相关期刊论文 前3条
1 刘琴涛;刘宏波;马俊凯;;Raptor码在卫星通信中抗干扰性能研究[J];计算机与数字工程;2013年07期
2 李青;王峰;崔慧娟;唐昆;;信源反馈条件下Raptor码的一种解码算法[J];信息技术;2012年08期
3 ;[J];;年期
相关硕士学位论文 前2条
1 田金超;基于RAPTOR容错模型的网络可生存性研究[D];哈尔滨工程大学;2006年
2 刘琼;基于Raptor码的多媒体推送系统的设计与实现[D];北京邮电大学;2014年
，本文编号：2295775
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2295775.html
