解码前传半双工中继信道下基于LDPC码的协作编码方案设计
|
摘要
协作通信技术利用网络中闲置的天线资源为中继协助信源节点与目的端通信，通过空间分集克服信道衰落的影响。与直接转发信源节点信息的协作方式相比，协作编码具有更高的谱效率。目前，点到点信道的LDPC编码、译码、及低复杂度校验矩阵的构造等方法比较成熟。鉴于中继信道的特殊性，传统的基于点到点信道条件设计的LDPC码不能很好的适用于中继信道。本文紧密围绕协作编码技术的实际问题，研究了解码前传半双工中继信道下基于LDPC码的协作编码方案设计方法，基于打孔优化和校验矩阵扩展优化的LDPC协作编码方法，主要成果概括如下：
1、分析了打孔LDPC码和协作编码方法的特点，指出现有打孔协作LDPC码存在的问题，从提高协作编码增益和译码复杂度的角度出发，提出基于打孔协作LDPC码的优化构造与译码方法。第一步，为了提高打孔LDPC码在协作编码系统的编码增益，提出了母码校验矩阵的优化构造方法。在该方法中，首先结合码率兼容条件，采用度分布优化扩展的约束优化算法提高母码渐进性能。然后根据打孔变量节点的恢复树结构，优化母码校验矩阵结构，提高信源节点—中继节点信道上传输打孔子码的误码性能。第二步，针对打孔协作LDPC码的译码迭代次数过高的问题，提出基于打孔变量节点分组优化和串行调度的BP译码算法。首先按消息的可靠度对打孔变量节点进行分组，译码时优先对可靠度较高的变量节点分组进行调度，从而加快译码收敛速度。当译码次数较低时，该译码方法的性能优于BP算法和随机分组洗牌BP算法，特别是当中继靠近目的端时，译码性能改善越明显。
2、为了避免因打孔造成协作编码的性能损失，提出基于校验矩阵扩展优化的协作LDPC (OEPCMC-LDPC)码设计方法。首先从信源LDPC子码和OEPCMC-LDPC码的关系出发，构造了一种具有码率兼容结构的协作LDPC码校验矩阵及其tanner图。接着，为了分析OEPCMC-LDPC码的渐进性能，结合信源节点—中继节点和中继节点—目的端的信道条件，推导了OEPCMC-LDPC码的译码收敛条件。最后，考虑中继传输和不传输自己的信息比特两种情况，结合信源节点LDPC子码和OEPCMC-LDPC码的度分布约束关系，提出了OEPCMC-LDPC码两种具体实现方案（基于动态和固定时隙分配协作LDPC码）的度分布优化设计方法。仿真结果验证了该方法的有效性。
3、针对多信源单中继信道条件，提出一种多边校验节点联合LDPC（PJCMET-LDPC）码的设计方法。首先构造一种具有多边结构的LDPC码校验矩阵及其tanner图。该结构将多个信源节点和中继节点的信息视为一个整体，目的端采用联合译码提升PJCMET-LDPC码的整体编码增益。借鉴传统LDPC码的性能分析方法，结合多个信源节点的LDPC子码和中继校验比特所经历的信道状态，推导了PJCMET-LDPC码的译码收敛条件。在此基础上，采用差分进化算法优化PJCMET-LDPC码的度分布，提高渐进性能。仿真结果表明，PJCMET-LDPC码的误码性能和渐进性能优于独立协作编码方式。
4、从提高中继节点转发软消息的可靠度和协作编码增益的角度出发，提出一种基于软消息建模的低复杂度软译码前传协作LDPC码的设计方法。首先，结合信源子码和协作LDPC码的码率兼容特点，构造一种具有下三角结构的校验矩阵。接着，运用BP迭代译码算法提高中继节点生成软消息的可靠度，结合校验校验矩阵结构特点，采用后向迭代处理方法获得校验比特的软消息。最后，将软消息建模为校验比特经过快衰落信道的输出信号，采用直方图统计方法得到该信道条件下的输入输出转移概率，从而获得一种精确计算MAC(multiple-access channel)模式下目的端LLR(log-likelihood ratio)消息的方法。利用信源节点和中继节点相关传输特性，消除MAC模式下中继节点前传错误软消息对目的端接收LLR的影响，并提出了中继节点的功率控制条件。仿真结果验证了该方法的可行性。
In cooperative communication systems, the idle antennas in the network can beused as relays to assist the communication between the source nodes and the destination,which overcomes the fading effects with spatial diversity. Compared with directlyforwarding the information of the source nodes, cooperative coding has higher spectralefficiency. At present, the study on coding, decoding, and the parity check matrixconstruction for point-to-point channels is quiet mature. As the characteristics of relaychannels are different to that of point-to-point channels, LDPC codes designed bytraditional methods for the point-to-point channels is not suitable for the relay channels.Considering the practical problems confronted in cooperative coding technology, thisdissertation studied the optimizing methods of design LDPC codes for cooperativecommunication systems, which is based on puncturing and Tanner graph extensionunder DF and SDF protocols. Our researching work is mainly focused on theoptimization of the parity check matrix structure, the convergence condition and degreedistribution of the cooperative LDPC codes. The arrangements of this dissertation are asfollows:
1. After an explicit analysis on the features of punctured LDPC codes andcooperative coding method, we point out the problems of puncuring. To improve thecooperative coding gain and reduce decoding complexity, the cooperative LDPC codeson puncturing is optimized by two steps. In the first step, the parity check matrix of themother code is optimized to improve the coding gain of the cooperative coding systems.To improve the asymptotic performance of the mother codes, the degree distribution ofthe mother codes is optimized under the rate-compatible constrains. Based on therecovery-tree of punctured nodes, a new structure of the parity-check matrix to themother codes is devised to facility the puncturing, which will improve the errorperformance of the punctured codes from the source nodes. In the second step, amodified BP algorithm is proposed to accelerate the decoding convergence of the ratecompatible puncturing LDPC codes by a sequential scheduling of the puncturedvariable nodes. The variable nodes with high reliability are priority processed whiledecoding, which will accelerate the speed of convergence. When decoding with lowiterations, this method outperforms both the BP decoding algorithm and randomshuffled BP decoding algorithm, especially when the relay is close to the destinationnode, the performance improvement is more obvious.
2. To avoid the performance losses by puncturing, an optimised extension of parity-check matrix of the LDPC(OEPCMC-LDPC)codes is presented for cooperativecoding. Considering the relationship between the source LDPC codes and theOEPCMC-LDPC codes, the structure of parity-check matrix to the OEPCMC-LDPCcodes and its corresponding tanner graph are derived. Combining two different SNR ofthe source-destination channels and relay-destination channel, we presented a mehod toanalysis the decoding convergence conditions of OEPCMC-LDPC codes. Finally,considering the relays transmitting the information bits of themselves or not, two kindsof cooperative LDPC codes are optimised based on dynamic and fixed time slotallocation, which are called DTSA_LDPC and FTSA_LDPC. The simulation resultsverify the validity of both methods.
3. In order to approach the theoretical limit of decode-and-forward strategy forhalf-duplex multiple access relay channel, a parity jointly coded multi-edge type LDPC(PJCMET-LDPC) coding structure is proposed. Firstly, we presented a tanner graph ofLDPC codes with multi-edge structure, which makes the bits from multi-sources and therelay as parts of the PJCMET-LDPC codes. The overall coding gain of PJCMET-LDPCcodes is improved when the joint structure is used for decoding in the destination.Considering the channel states that different parts of the PJCMET-LDPC codes frommulti-source nodes and the relay node experienced, we derive the decoding convergenceconditions of the PJCMET-LDPC codes. The degree distribution of the PJCMET-LDPCcodes is optimised using differential evolution algrithm, which improves the asymptoticperformance of PJCMET-LDPC codes. The simulation results show thatPJCMET-LDPC codes always outperform the independently cooperative codes.
4. To improve cooperative coding gain and the reliability of soft messages forwardby the relay node, a new type of cooperative LDPC codes under softdecode-and-forward (SDF) protocol is proposed by modeling the soft messages as theoutput of the fast fading channel. Firstly, considering the feature of rate-compatiblebeween the source codes and cooperative LDPC code, we construct the parity-checkmatrix with low triangle structure. Then, reliability of the soft information is improvedby BP iterative decoding algorithm, soft parity bits is derived by simple substitutealgorithm. Finally, in order to improve reliability of the destination LLR (log-likelihoodratio) which receive signal from source and the relay in MAC (multiple-access) mode,the soft information is modeled as the output signal of the fast fading channel using theparity bits as input. The transfer probability of this channel is obtained by usinghistogram statistics method. An accurate calculation of the destination LLR message isobtained under this model. Further more, we conclude that the influence of errormessage forward by the relay node on LLR of the destination message under MAC mode can be controlled by power controlled on the relay nodes. The simulation resultsverify the validity of the method.
1、分析了打孔LDPC码和协作编码方法的特点，指出现有打孔协作LDPC码存在的问题，从提高协作编码增益和译码复杂度的角度出发，提出基于打孔协作LDPC码的优化构造与译码方法。第一步，为了提高打孔LDPC码在协作编码系统的编码增益，提出了母码校验矩阵的优化构造方法。在该方法中，首先结合码率兼容条件，采用度分布优化扩展的约束优化算法提高母码渐进性能。然后根据打孔变量节点的恢复树结构，优化母码校验矩阵结构，提高信源节点—中继节点信道上传输打孔子码的误码性能。第二步，针对打孔协作LDPC码的译码迭代次数过高的问题，提出基于打孔变量节点分组优化和串行调度的BP译码算法。首先按消息的可靠度对打孔变量节点进行分组，译码时优先对可靠度较高的变量节点分组进行调度，从而加快译码收敛速度。当译码次数较低时，该译码方法的性能优于BP算法和随机分组洗牌BP算法，特别是当中继靠近目的端时，译码性能改善越明显。
2、为了避免因打孔造成协作编码的性能损失，提出基于校验矩阵扩展优化的协作LDPC (OEPCMC-LDPC)码设计方法。首先从信源LDPC子码和OEPCMC-LDPC码的关系出发，构造了一种具有码率兼容结构的协作LDPC码校验矩阵及其tanner图。接着，为了分析OEPCMC-LDPC码的渐进性能，结合信源节点—中继节点和中继节点—目的端的信道条件，推导了OEPCMC-LDPC码的译码收敛条件。最后，考虑中继传输和不传输自己的信息比特两种情况，结合信源节点LDPC子码和OEPCMC-LDPC码的度分布约束关系，提出了OEPCMC-LDPC码两种具体实现方案（基于动态和固定时隙分配协作LDPC码）的度分布优化设计方法。仿真结果验证了该方法的有效性。
3、针对多信源单中继信道条件，提出一种多边校验节点联合LDPC（PJCMET-LDPC）码的设计方法。首先构造一种具有多边结构的LDPC码校验矩阵及其tanner图。该结构将多个信源节点和中继节点的信息视为一个整体，目的端采用联合译码提升PJCMET-LDPC码的整体编码增益。借鉴传统LDPC码的性能分析方法，结合多个信源节点的LDPC子码和中继校验比特所经历的信道状态，推导了PJCMET-LDPC码的译码收敛条件。在此基础上，采用差分进化算法优化PJCMET-LDPC码的度分布，提高渐进性能。仿真结果表明，PJCMET-LDPC码的误码性能和渐进性能优于独立协作编码方式。
4、从提高中继节点转发软消息的可靠度和协作编码增益的角度出发，提出一种基于软消息建模的低复杂度软译码前传协作LDPC码的设计方法。首先，结合信源子码和协作LDPC码的码率兼容特点，构造一种具有下三角结构的校验矩阵。接着，运用BP迭代译码算法提高中继节点生成软消息的可靠度，结合校验校验矩阵结构特点，采用后向迭代处理方法获得校验比特的软消息。最后，将软消息建模为校验比特经过快衰落信道的输出信号，采用直方图统计方法得到该信道条件下的输入输出转移概率，从而获得一种精确计算MAC(multiple-access channel)模式下目的端LLR(log-likelihood ratio)消息的方法。利用信源节点和中继节点相关传输特性，消除MAC模式下中继节点前传错误软消息对目的端接收LLR的影响，并提出了中继节点的功率控制条件。仿真结果验证了该方法的可行性。
In cooperative communication systems, the idle antennas in the network can beused as relays to assist the communication between the source nodes and the destination,which overcomes the fading effects with spatial diversity. Compared with directlyforwarding the information of the source nodes, cooperative coding has higher spectralefficiency. At present, the study on coding, decoding, and the parity check matrixconstruction for point-to-point channels is quiet mature. As the characteristics of relaychannels are different to that of point-to-point channels, LDPC codes designed bytraditional methods for the point-to-point channels is not suitable for the relay channels.Considering the practical problems confronted in cooperative coding technology, thisdissertation studied the optimizing methods of design LDPC codes for cooperativecommunication systems, which is based on puncturing and Tanner graph extensionunder DF and SDF protocols. Our researching work is mainly focused on theoptimization of the parity check matrix structure, the convergence condition and degreedistribution of the cooperative LDPC codes. The arrangements of this dissertation are asfollows:
1. After an explicit analysis on the features of punctured LDPC codes andcooperative coding method, we point out the problems of puncuring. To improve thecooperative coding gain and reduce decoding complexity, the cooperative LDPC codeson puncturing is optimized by two steps. In the first step, the parity check matrix of themother code is optimized to improve the coding gain of the cooperative coding systems.To improve the asymptotic performance of the mother codes, the degree distribution ofthe mother codes is optimized under the rate-compatible constrains. Based on therecovery-tree of punctured nodes, a new structure of the parity-check matrix to themother codes is devised to facility the puncturing, which will improve the errorperformance of the punctured codes from the source nodes. In the second step, amodified BP algorithm is proposed to accelerate the decoding convergence of the ratecompatible puncturing LDPC codes by a sequential scheduling of the puncturedvariable nodes. The variable nodes with high reliability are priority processed whiledecoding, which will accelerate the speed of convergence. When decoding with lowiterations, this method outperforms both the BP decoding algorithm and randomshuffled BP decoding algorithm, especially when the relay is close to the destinationnode, the performance improvement is more obvious.
2. To avoid the performance losses by puncturing, an optimised extension of parity-check matrix of the LDPC(OEPCMC-LDPC)codes is presented for cooperativecoding. Considering the relationship between the source LDPC codes and theOEPCMC-LDPC codes, the structure of parity-check matrix to the OEPCMC-LDPCcodes and its corresponding tanner graph are derived. Combining two different SNR ofthe source-destination channels and relay-destination channel, we presented a mehod toanalysis the decoding convergence conditions of OEPCMC-LDPC codes. Finally,considering the relays transmitting the information bits of themselves or not, two kindsof cooperative LDPC codes are optimised based on dynamic and fixed time slotallocation, which are called DTSA_LDPC and FTSA_LDPC. The simulation resultsverify the validity of both methods.
3. In order to approach the theoretical limit of decode-and-forward strategy forhalf-duplex multiple access relay channel, a parity jointly coded multi-edge type LDPC(PJCMET-LDPC) coding structure is proposed. Firstly, we presented a tanner graph ofLDPC codes with multi-edge structure, which makes the bits from multi-sources and therelay as parts of the PJCMET-LDPC codes. The overall coding gain of PJCMET-LDPCcodes is improved when the joint structure is used for decoding in the destination.Considering the channel states that different parts of the PJCMET-LDPC codes frommulti-source nodes and the relay node experienced, we derive the decoding convergenceconditions of the PJCMET-LDPC codes. The degree distribution of the PJCMET-LDPCcodes is optimised using differential evolution algrithm, which improves the asymptoticperformance of PJCMET-LDPC codes. The simulation results show thatPJCMET-LDPC codes always outperform the independently cooperative codes.
4. To improve cooperative coding gain and the reliability of soft messages forwardby the relay node, a new type of cooperative LDPC codes under softdecode-and-forward (SDF) protocol is proposed by modeling the soft messages as theoutput of the fast fading channel. Firstly, considering the feature of rate-compatiblebeween the source codes and cooperative LDPC code, we construct the parity-checkmatrix with low triangle structure. Then, reliability of the soft information is improvedby BP iterative decoding algorithm, soft parity bits is derived by simple substitutealgorithm. Finally, in order to improve reliability of the destination LLR (log-likelihoodratio) which receive signal from source and the relay in MAC (multiple-access) mode,the soft information is modeled as the output signal of the fast fading channel using theparity bits as input. The transfer probability of this channel is obtained by usinghistogram statistics method. An accurate calculation of the destination LLR message isobtained under this model. Further more, we conclude that the influence of errormessage forward by the relay node on LLR of the destination message under MAC mode can be controlled by power controlled on the relay nodes. The simulation resultsverify the validity of the method.
引文
[1] Tarokh V. New directions in wireless communications research[M]. Springer,2009.
[2] Peng M, Wang W, Chen H H. Multiuser pairing-up schemes under power constrain-ts for uplink virtual MIMO networks[J]. Mobile Networks and Applications,2010,15(2):298-309.
[3] Chiu E, Lau V K N. Cellular multiuser two-way MIMO AF Relaying via SignalSpace Alignment: Minimum Weighted SINR Maximization[J]. IEEE Transactionson Signal Processing,2012,60(9):4864-4873.
[4] Jang S, Yang J, Kim D K. Minimum MSE design for multiuser MIMO relay[J].IEEE Communications Letters,2010,14(9):812-814.
[5]熊飞.分布式天线系统中信道测量和MIMO传输技术研究[D].北京邮电大学,2011.
[6]陈丹,李建东,李长乐. MIMO链路adhoc网络中一种新的MAC协议[J].西安电子科技大学学报,2010,37(003):385-390.
[7]程伟明,周新运,盛凌志.个基于层次结构的Ad hoc网络移动模式[J].通信学报,2004,25(2).
[8] Rhee I, Warrier A, Min J, et al. DRAND: distributed randomized TDMA schedulingfor wireless ad-hoc networks[C].Proceedings of the7th ACM international sympos-ium on Mobile ad hoc networking and computing,2006:190-201.
[9]游晓黔,李明隆,杨佳.无线传感器网络LEACH协议的研究与改进[J].重庆邮电大学学报(自然科学版),2011,23(6)746-751.
[10]孙欣尧,王雪,王晟.无线传感网络协同概率多模识别方法[J].通信学报,2011,32(6):141-147.
[11]李姗姗,廖湘科,朱培栋,等.基于网络编码的无线传感网多路径传输方法[J].软件学报,2008,19(10):2638-2647.
[12]Xiao Y, Li H. Local data control and admission control for QoS support in wirelessad hoc networks[J]. IEEE Transactions on Vehicular Technology,2004,53(5):1558-1572.
[13]陈霞,胡宏林.蜂窝通信系统中天线选择在虚拟MIMO的应用[J].电子与信息学报,2008,30(10):2454-2458.
[14]蒋芳,胡艳军,朱传伙,等.无线传感器网络中一种基于OSTBC的高效协作传输技术[J].信号处理,2011,27(3):438-443.
[15]谭学治,徐贵森,刘鑫,等.极大网络寿命的认知无线电网络自组网算法术[J].华南理工大学学报(自然科学版),2010,38(6):29-34.
[16]黄晓燕,毛玉明,吴凡,等.中继增强的无线蜂窝多小区系统的联合调度与功率控制算法[J].电子与信息学报,2012,34(7):1665-1671.
[17]唐德军,陈春林,李云.基于IEEE802.16j的协作中继切换方法[J].重庆邮电大学学报:自然科学版,2010,22(003):283-288.
[18]Lee J, Kim Y, Lee H, et al. Coordinated multipoint transmission and reception inLTE-advanced systems[J]. IEEE Communications Magazine,2012,50(11):44-50.
[19] Zummo S A. Performance analysis of coded cooperation diversity in wireless net-works[J]. Wireless communications and mobile computing,2007,7(4):473-481.
[20]张秋霞,仰枫帆,张顺外,等.中继协作编码系统等效点对点传输模型的研究[J].通信学报,2012,33(12):100-107.
[21]Richardson T and Urbanke R L. The capacity of low-densitypatiry-check codesunder message-passing decoding[J]. IEEE Transactions on Information Theory,2001,47(1):599-618.
[22] Xu J, Chen L, Zeng L, et al.Constuction of low-density parity-check codes bysuperposition. IEEE Transactions on Information Theory,2005,53(2):243-251.
[23]雷菁,高永强,王建辉,贺文辉.基于串行消息传递机制的QC-LDPC码快速译码算法研究[J].电子与信息学报,2008,30(12):2938-2942.
[24]刘晓健,吴晓富,赵春明.准循环LDPC码的两种典型快速译码算法研究[J].电子与信息学报.2009,31(1):79-82.
[25]张桂华,张善旭,李颖.高吞吐量低存储量的LDPC码译码器FPGA实现[J].西安电子科技大学学报.2008,35(03):428-432.
[26]Blanksby A J, Howland C J. A690-mW1-Gb/s1024-b, rate-1/2low-density parity-check code decoder[J]. IEEE Journal of Solid-State Circuits,2002,37(3):404-412.
[27]林永照,吴成柯,刘薇. LT码和q-LDPC码级联方案在深空通信中的应用[J].电子与信息学报,2010,32(8).
[28]黎勇,王琳,魏琴芳,等. GF(2^2)域上的LDPC码在深空通信中的应用研究[J].系统仿真学报,2010,22(4):942-945.
[29]郭锐,胡方宁,刘济林.深空通信中高性能低复杂度的QC-DPC码构造方法[J].空间科学学报,2012,32(4):567-574.
[30]GB20600-2006.数字电视地面广播传输系统帧结构、信道编码和调制[S].中国国家标准化管理委员会,2006.
[31]ETSI E N.302307V1.1.1. Second generation framing structure, channel codingand modulation systems for Broadcasting, Interactive Services, News Gathering andother broadband satellite applications (DVB-S2)[S],2005.
[32]ETSI E N.302755V1.1.1.Digital Video Broadcasting (DVB); Frame structurechannel coding and modulation for a second generation digital terrestrial televisionbroadcasting system (DVB-T2)[S],2008.
[33]Draft E. EN302769V1.1.1.Digital Video Broadcasting (DVB);Frame structurechannel coding and modulation for a second generation digital transmission systemfor cable systems (DVB-C2)[S],2009.
[34]Hunter T E, Nosratinia A. Performance analysis of coded cooperation diversity[C].IEEE International Conference on Communications,2003,:2688-2692.
[35]Hunter T E, Nosratinia A. Diversity through coded cooperation[J]. IEEE Transact-ions on Wireless Communications,2006,5(2):283-289.
[36] Ravanshid A, Lampe L, Huber J B. Dynamic decode-and-forward relaying usingraptor codes[J]. IEEE Transactions on Wireless Communications,2011,10(5):1569-1581.
[37] Razaghi P, Yu W. Bilayer low-density parity-check codes for decode-and-forwardin relay channels[J]. IEEE Transactions on Information Theory,2007,53(10):3723-3739.
[38] Azmi M H, Yuan J, Lechner G, et al. Design of multi-edge-type bilayer-expurgatedLDPC codes for decode-and-forward in relay channels[J]. IEEE Transactions onCommunications,2011,59(11):2993-3006.
[39] Lu H F. Constructions of DMT optimal vector codes for asynchronous cooperativenetworks using decode-and-forward protocols[J]. IEEE Transactions on WirelessCommunications,2010,9(7):2392-2400.
[40] Parvaresh F, Etkin R. Using superposition codebooks and partial decode andforward in low SNR parallel relay networks[J]. IEEE Transactions on InformationTheory,2012,59(3):1704-1723.
[41] Rost P, Fettweis G. Analysis of decode-and-forward, compress-and-forward andcombined protocols for multiterminal half-duplex relay networks with randomschedules[J]. Transactions on Emerging Telecommunications Technologies,2012,24(2):196-211.
[42] Zhang J, Yang L L, Hanzo L. Energy-efficient dynamic resource allocation foropportunistic-relaying-assisted SC-FDMA using Turbo-equalizer-aided softdecode-and-forward[J]. IEEE Transactions on Vehicular Technology,2013,62(1):235-246.
[43] Varodayan D, Aaron A, Girod B. Rate-adaptive codes for distributed sourcecoding[J]. Signal Processing,2006,86(11):3123-3130.
[44] Zhao B, Valenti M C. Distributed Turbo coded diversity for relay channel[J].Elect-ronics letters,2003,39(10):786-787.
[45] Zhang Z,Duman T M.Capacity-approaching Turbo coding for half-duplex relaying[J].IEEE Transactions on Communications,2007,55(10),1895-1906.
[46] Zhang Z, Duman T M. Capacity-approaching Turbo coding and iterative decodingfor relay channels[J].IEEE Transactions on Communications，2005,53(11):1895-1905.
[47]王军.基于于LDPC码的半双工中继协作编码技术[D].西安电子科技大学.2011.
[48]施玉晨.无线中继系统中的编码与协作传输技术研究[D].西安电子科技大学,2012.
[48] Savin V. Split-extended LDPC codes for coded cooperation[C]. IEEE2010Inter-national Symposium on Information Theory and its Applications (ISITA),2010:151-156.
[49] Li C, Yue G, Khojastepour M A, et al. LDPC-coded cooperative relay systems:per-formance analysis and code design[J]. IEEE Transactions on Communications,2008,56(3):485-496.
[50] Duyck D, Boutros J J, Moeneclaey M. Low-density graph codes for coded cooper-ation on slow fading relay channels[J]. IEEE Transactions on Information Theory,2011,57(7):4202-4218.
[51] Chen H, Yu D, Ma X. Cooperative signal constellation for LDPC-coded relaysystem[J]. IEEE Communications Letters,2011,15(7):704-706.
[52] Yang F, Chen J, Zong P, et al. Joint iterative decoding for pragmatic irregularLDPC-coded multi-relay cooperations[J]. International Journal of Electronics,2011,98(10):1383-1397.
[53] Guo Z, Huang J, Wang B, et al. A practical joint network-channel coding schemefor reliable communication in wireless networks[J]. IEEE Transactions on WirelessCommunications,2012,11(6):2084-2094.
[54] Duyck D, Moeneclaey M, Azmi M H, et al. Universal LDPC codes for cooperativecommunications[C].20106th International Symposium on Turbo Codes and Itera-tive Information Processing (ISTC),2010:73-77.
[55] Yan Y, Lee M H. PIC decoding algorithm for Quasi-Orthogonal distributed STBCwith non-binary LDPC code[C]. IEEE Computing, Communications and Applicati-ons Conference (ComComAp),2012:179-183.
[56] Bing D, Jun Z. Design and optimization of joint network-channel LDPC code forwireless cooperative communications[C].11th IEEE Singapore InternationalConference on Communication Systems,2008:1625-1629.
[57]陈婧文.基于LDPC码的协作通信系统及联合迭代译码性能的研究[D].南京航空航天大学,2009.
[58] Xiaojun S U N, Jiang M, Wei X U, et al. Optimizing protograph coded BICM forhalf-duplex DF Relay[J]. IEICE Transactions on Communications,2012,95(4):1397-1401.
[59] James A, Madhukumar A S, Tio S D, et al. Throughput optimization in cooperativecommunications based on incremental relaying[J]. IEEE Transactions on VehicularTechnology,2011,60(1):317-323.
[60] Liu J, Tao M, Xu Y. Pairwise check decoding for LDPC coded two-way relayblock fading channels[J]. IEEE Transactions on Communications,2012,60(8):2065-2076.
[61] Chakrabarti A, Baynast A D, Sabhaarwal A, et al.Low density parity check codesfor the relay channel[J]. IEEE Journal Select Communications,2007,25(2):280-291.
[62] Jun Hu,Duman T.M.Low Density Parity Check Codes over Wireless Relay Chan-nels[J].IEEE Transactions on Wireless Communications,2007,6(9):3384-3394.
[63] Razaghi R,WEI Y. Bilayer low-density parity-check codes for decode-and forwardin relay channels[J]. IEEE Transactions on Information Theory,2007,53(10):3723-3739.
[64] Cances J,Meghdadi V. Optimized low density parity check codes designs for halfduplex relay channels[J]. IEEE Transactions on Wireless Communications,2009,8(7):3390-3395.
[65] Van Nguyen T,Nosratinia A,Divsalar D.Bilayer protograph codes for half-duplexrelay channels[C]. IEEE International Symposium on Information Theory Procee-dings, Texas,USA,2010:948-952.
[66]Wu M, Weitkemper P, Wubben D, et al. Comparison of distributed LDPC codingschemes for decode-and-forward relay channels[C].2010IEEE International ITGWorkshop on Smart Antennas (WSA),2010:127-134.
[67]Sun X, Jiang M, Zhao C, et al.IRA code design for DF-relay via check-splitting[J].Journal on Communications2010,31(2):130-135.
[68]Huang T, Yang T, Yuan J, et al. Design of Irregular Repeat-Accumulate CodedPhysical-Layer Network Coding for Gaussian Two-Way Relay Channels[J]. IEEETransactions on Communications,2013,99(1):1-13.
[69]M.H.Azmi, J.Yuan. Design of multi-edge type bilayer-expurgated LDPC codes [C],in proc. IEEE international symposium on information theory,2009:1988-1992.
[70]Li J, Azmi M H, Malaney R, et al. Design of network-coding based multi-edge typeLDPC codes for multi-source relaying systems[C].6th. International Sym-posiumon Turbo Codes and Iterative Information Processing(ISTC),2010:414-418.
[71] Youssef R, Graell i Amat A. Distributed serially concatenated codes for multi-source cooperative relay networks[J]. IEEE Transactions on Wireless Commun-ications,2011,10(1):253-263.
[72] Jun Li,Jinhong Yuan, Malaney, R, Azmi, M.H. Ming Xiao. Network coded LDPCcode design for a multi-source relaying system[J].IEEE Transactions on Wire-lessCommunications,2011,10(5):1538-1551.
[73] Wang C, Fan Y, Thompson J, et al. A comprehensive study of repetition-codedprotocols in multi-user multi-relay networks[J]. IEEE Transactions on WirelessCommunications,2009,8(8):4329-4339.
[74] Li Y, Song G, Wang L. Design of joint network-low density parity check codesbased on the EXIT charts[J]. IEEE Communication Letter,2009,13(8):600-602.
[75] Li Y, Wang L, Sun Y.The Design of Network Low Density Parity Check Codes forWireless Multiple-Access Relay Networks[C].25th IEEE International Conferenceon Advanced Information Networking and Applications (AINA),Singapore,SINGAPORE,2011:653-658.
[76] Duyck D, Boutros J J, Moeneclaey M. Low-density graph codes for coded coo-peration on slow fading relay channels [J]. IEEE Transactions on InformationTheory,2011,7(57):4202-4218.
[77] Li Y, Song G, Wang L.Analysis of the joint network LDPC codes over orthogonalmulti-access relay channel [J]. IEEE Communication Letter,2010,14(2):184-186.
[78] Rebelatto J L, Uch a-Filho B F, Li Y, et al. Adaptive distributed network-channelcoding[J]. IEEE Transactions on Wireless Communications,2011,10(9):2818-2822.
[79] Duyck D, Boutros J J, Moeneclaey M. Full diversity Random LDPC codes[C].18thIEEE Symposium o Communications and Vehicular Technology in the Benelux,2011:1-6.
[80]郭锐,胡方宁.协作编码MARC上全分集LDPC码的实现与性能分析[J].电路与系统学报,2012,17(2):54-59.
[81]郭锐,胡方宁,刘济林.H-ARQ信道上全分集LDPC码的构造与密度演化分析[J].中国科学(信息科学),2012,42(8):974-987.
[82] Li J, Yuan J, Malancy R, et al. Full-diversity binary frame-wise network coding formultiple-source multiple-relay networks over slow-fading channels[J]. IEEETransactions on Vehicular Technology,2012,61(3):1346-1360.
[83] Zhang S, Yang F, Tang L. An LDPC coded cooperative MIMO scheme overRayleigh fading channels with unknown channel state information[J]. Journal ofZhejiang University SCIENCE C,2013,14(1):30-41.
[84] Ding Z, Leung K K. On the combination of cooperative diversity and networkcoding for wireless uplink transmissions[J]. IEEE Tran-sactions on VehicularTechnology,2011,60(4):1590-1601.
[85] Duyck D, Capirone D, Boutros J J, et al. Analysis and construction of full-diversityjoint network-LDPC codes for cooperative communications[J]. EURASIP Journalon Wireless Communications and Networking,2010,2010-2019.
[86] Kim J, Michalopoulos D S, Schober R. Diversity analysis of multi-user multi-relaynetworks[J]. IEEE Transactions on Wireless Communications,2011,10(7):2380-2389.
[87]Boutros J J. Diversity and coding gain evolution in graph codes[C]. InformationTheory and Applications Workshop,2009:34-43.
[88] Peng M, Liu H, Wang W, et al. Cooperative network coding with MIMO transmis-sion in wireless decode-and-forward relay networks[J]. IEEE Transactions onVehicular Technology,2010,59(7):3577-3588.
[89] Andriyanova I, Biglieri E, Declercq D. Joint channel estimation and decoding ofroot-LDPC codes in block-fading channels[C]. IEEE Global TelecommunicationsConference (GLOBECOM2011),2011:1-4.
[90] Duyck D, Capirone D, Moeneclaey M, et al. A full-diversity joint network-channelcode construction for cooperative communications[C]. IEEE20th InternationalSymposium on Personal, Indoor and Mobile Radio Communications,2009:1282-1286.
[91] Bao X, Li J. Efficient message relaying for wireless user cooperation: decode-amplify-forward (DAF) and hybrid DAF and coded-cooperation[J]. IEEETransactions on Wireless Communications,2007,6(11):3975-3984.
[92] Qi Y, Hoshyar R, Tafazolli R. Performance evaluation of soft decode-and-forwardin fading relay channels. IEEE67TH IEEE VTS Vehicular Technology ConferenceProceedings,2008:1286-1290.
[93] Xue F, Sandhu S. Cooperation in a half-duplex Gaussian diamond relay channel[J].IEEE Transactions on Information Theory,2007,53(10):3806-3814.
[94] Nguyen S L H, Ghrayeb A, Al-Habian G, et al. Mitigating error propagation intwo-way relay channels with network coding[J]. IEEE Transactions on WirelessCommunications,2010,9(11):3380-3390.
[95] Ordentlich O, Zhan J, Erez U, et al. Practical code design forcompute-and-forward[C].2011IEEE International Symposium on InformationTheory Proceedings (ISIT),2011:1876-1880.
[96] Ibi S, Takada N, Sampei S. Bit-Wise Partial Noise Elimination in CooperativeDecode-Amplify-Forward Relay Node[C].2012IEEE75th Vehicular TechnologyConference (VTC Spring),2012:1-5.
[97] Chakrabarti A, Sabharwal A, Aazhang B. Practical quantizer design for half-duplexestimate-and-forward relaying[J]. IEEE Transactions on Communications,2011,59(1):74-83.
[98] Huo P, Cao L. Distributed STBC with soft information relay based on Gaussianapproximation[J]. IEEE Signal Processing Letters,2012,19(10):599-602.
[99]Wang P C, Tsai H L, Lin M C. A design of code-aided channel estimation intwo-way relay networks[C].2012IEEE International Symposium on InformationTheory and its Applications (ISITA),2012:774-778.
[100]Butt M F U, Ng S X, Hanzo L. Self-concatenated code design and its applicationin power-efficient cooperative communications[J]. IEEE Communications Surveys&Tutorials,2012,14(3):858-883.
[101] Chikha H B, Chaoui S, Dayoub I, et al. A parallel concatenated convolutional-based distributed coded cooperation scheme for relay channels[J]. Wireless PersonalCommunications,2012,67(4):951-969.
[102] Zhang J, Yang L L, Hanzo L. Energy-efficient dynamic resource allocation foropportunistic-relaying-assisted SC-FDMA using Turbo-equalizer-aided softdecode-and-forward[J]. IEEE Transactions on Vehicular Technology,2013,62(1):235-246.
[103] Chakrabarti A, de Baynast A, Sabharwal A, et al. Half-duplex estimate-and-forward relaying: bounds and code design[C]. IEEE International Symposium onInformation Theory,2006:1239-1243.
[104] Dabora R, Servetto S D. On the role of estimate-and-forward with time sharing incooperative communication[J]. IEEE Transactions on Information Theory,2008,54(10):4409-4431.
[105] Simoens S, Mu oz O, Vidal J. Achievable rates of compress-and-forwardcooperative relaying on Gaussian vector channels[C]. IEEE InternationalConference on Communications,2007:4225-4231.
[106] Uppal M, Liu Z, Stankovic V, et al. Compress-forward coding with BPSKmodulation for the half-duplex Gaussian relay channel[J]. IEEE Transactions onSignal Processing,2009,57(11):4467-4481.
[107] Weitkemper P, Wubben D, Kammeyer K D. Minimum MSE relaying in codednetworks[C]. International ITG Workshop on Smart Antennas,2008:96-103.
[108] Weitkemper P, Wubben D, Kammeyer K D. Minimum MSE Relaying forArbitrary Signal Constellations in Coded Relay Networks[C]. IEEE69th VehicularTechnology Conference,2009:1-5.
[109] Li Y, Vucetic B, Wong T F, et al. Distributed Turbo coding with soft informationrelaying in multihop relay networks[J]. IEEE Journal on Selected Areas in Comm-unications,2006,24(11):2040-2050.
[110] Thobaben R. On distributed codes with noisy relays[C].200842nd AsilomarConference on Signals, Systems and Computers,2008:1010-1014.
[111] Aziz A A, Iwanami Y, Okamoto E. Efficient combining technique with a low-complexity detect-and-forward relay for cooperative diversity scheme[C].TENCON2009-2009IEEE Region10Conference,2009:1-6.
[112] Abd Aziz A, Iwanami Y, Okamoto E. On the improvement of maximum likeli-hood detection in multiple relay systems[C].2010IEEE Wireless Communicationsand Networking Conference (WCNC),2010:1-6.
[113] Aziz A A, Iwanami Y. A simple symbol estimation for soft information relayingin cooperative relay channels[J]. International Journal of Communications, Networkand System Sciences,2011,4(9):568-577.
[114] Tran D T, Sun S, Kurniawan E. A Low-complexity practical quantize-and-forward scheme for two-hop relay systems[C].2012IEEE75th.VehicularTechnology Conference (VTC Spring),2012:1-5.
[115] Li H, Chen C W. Joint source and channel optimized block TCQ with layeredtransmission and RCPC[C].1998International Conference on Image Processing,1998:644-648.
[116] Ikki S S, Ahmed M H. Performance analysis of incremental-relaying cooperative-diversity networks over Rayleigh fading channels[J]. IET Communications,2011,5(3):337-349.
[117] Noh K L, Serpedin E, Suter B. Optimum cooperation of the cooperative codingscheme for frequency division half-duplex relay channels[J]. IEEE Transactions onWireless Communications,2007,6(5):1654-1658.
[118]Kong H Y, Soo K N. Coded Cooperation Diversity in Wireless Relay Network[C].International Conference on Information and Communication Technology,2007.ICICT'07.2007:123-126.
[119] Maagh S, Sharif M Y. RCPC coding for the dynamic decode-and-forwardchannel[C].2011IEEE International Conference on Microwaves, Communications,Antennas and Electronics Systems (COMCAS),2011:1-6.
[120] Zhao F, Bai Z. Simplified BER analysis of rate-compatible puncturedconvolutional coded cooperative system over slow Rayleigh fading channel[C].9thInternational Symposium on Communications and Information Technology,2009:943-946.
[121]An J, Jia Y, Wu H. A distributed coding protocol for wireless relay networks[C].2010IEEE Youth Conference on Information Computing and Telecommunications(YC-ICT),2010:327-330.
[122] Janani M, Hedayat A, Hunter T E, et al. Coded cooperation in wirelesscommunications: space-time transmission and iterative decoding[J]. IEEETransactions on Signal Processing,2004,52(2):362-371.
[123] Ha J, Kim J, Klinc D, et al. Rate-compatible punctured low-density parity-checkcodes with short block lengths[J]. IEEE Transactions on Information Theory,2006,52(2):728-738.
[124] Shi C Z,Ramamoorthy A.Design and analysis of E2RC codes[J]. IEEE Journal onSelected Areas in Communications,2009,27(6):889-898.
[125] Ha J, Klinc D, Kwon J, et al.Layered BP Decoding for rate-compatiblepunctured LDPC codes[J]. IEEE Communications Letters,2007,11(5):440-442.
[126] Ha J, Kim J, McLaughlin S W. Rate-compatible puncturing of low-densityparity-check codes[J]. IEEE Transactions on Information Theory,2004,50(11):2824-2836.
[127] Vellambi B N, Fekri F. Finite-length rate-compatible LDPC codes: a novelpuncturing scheme[J]. IEEE Transactions on Communications,2009,57(2):297-301.
[128] Benmayor D,Mathiopoulos P,Constantinou P.Rate-compatible IRA codes usingquadratic congruential extension sequences and puncturing[J].IEEE Communicatio-ns Letters,2010,14(5):441-443.
[129] Kim J, Ramamoorthy A, Mclaughlin S W.The Design of efficiently-encodablerate-compatible LDPC codes[J]. IEEE Transactions on Communication,2009,57(2):368-375.
[130] Ardakani M,Kschischang F R.A more accurate one-dimensional analysis anddesign of irregular LDPC codes[J].IEEE Transactions on Communication,2004,52(12):2106-2114.
[131] Wang Y G,Fossorier M.Doubly generalized LDPC codes over the AWGNchannel. IEEE Transactions on Communications,2009,57(5):1312-1319.
[132] Si Z W,Andersson M,Thobaben R, et al.Rate-compatible LDPC convolutionalcodes for capacity-approaching hybrid ARQ[C]. IEEE Information TheoryWorkshop (ITW), Dublin, Ireland,2011:513-517.
[133] Psota E,Pérez L C.Iterative Construction of regular LDPC codes from independ-ent tree-based minimum distance bounds[J]. IEEE Communications Letters,2011,15(3):334-336.
[134] Azmi M, Li J, Yuan J, et al. LDPC codes for soft decode-and-forward in half-duplex relay channels[J].IEEE Journal Selected Areas in Communications,2013,31(8)1:12.
[135] Zhang J,Fossorier M. Shuffled iterative decoding[J].IEEE Transactions onCommunications,2005,53(2):209–213.
[136] Yang Yang, Huang Jian-zhong, Tong Sheng.Replica horizontal-shuffled iterativedecoding of low-density parity-check codes[J]. Journal of China Universities ofPosts and Telecommunications,2010,17(6):32-40.
[137] Cui Z,Wang Z, Zhang X.Reduced-complexity column-layered decoding andimplementation for LDPC codes[J]. IET Communications,2011,5(15)2177-2186.
[138] Sangjoon P,Sunyoung L, Keumchan W.A group shuffled BP decoding forpunctured low-density parity-check codes[J]. IEICE Electronics Express,2010,19(7):1429-1434.
[139] Chung S Y,Richardson T,Urbanke R. Analysis of sum-product decoding oflow-density parity-check codes using a Gaussian approximation[J]. IEEETransactions on Information Theory,2001,47(1):657-670.
[140] Smith B,Ardakani M,Wei Yu,et al.Design of irregular LDPC codes withoptimized performance-complexity tradeoff[J]. IEEE Transactions on Commun-ications,2010,58(2):489-499.
[141] Urbanke R L. LdpcOpt: a fast and accurate degree distribution optimizer forLDPC code ensembles[J]. online: lthcwww. epfs. ch/research/ldpcopt,2007.
[142] Duyck D, Boutros J J, Moeneclaey M. Low density graph codes for codedcooperation on slow fading relay channels [J]. IEEE Transactions on InformationTheory,2011,7(57):4202-4218.
[143]Azmi M H, Yuan J, Lechner G, et al. Design of multi-edge-type bilayer-expurgat-ed LDPC codes for decode-and-forward in relay channels[J]. IEEE Transactions onCommunications,2011,59(11):2993-3006.
[144] Li C, Yue G, Wang X, et al. LDPC code design for half-duplex cooperativerelay[J]. IEEE Transactions on Wireless Communications,2008,7(11):4558-4567.
[145] Aziz A A, Iwanami Y. A Simple Symbol Estimation for Soft Information Relay-ing in Cooperative Relay Channels[J]. International Journal of Communications,Network and System Sciences,2011,4(9):568-577.
[2] Peng M, Wang W, Chen H H. Multiuser pairing-up schemes under power constrain-ts for uplink virtual MIMO networks[J]. Mobile Networks and Applications,2010,15(2):298-309.
[3] Chiu E, Lau V K N. Cellular multiuser two-way MIMO AF Relaying via SignalSpace Alignment: Minimum Weighted SINR Maximization[J]. IEEE Transactionson Signal Processing,2012,60(9):4864-4873.
[4] Jang S, Yang J, Kim D K. Minimum MSE design for multiuser MIMO relay[J].IEEE Communications Letters,2010,14(9):812-814.
[5]熊飞.分布式天线系统中信道测量和MIMO传输技术研究[D].北京邮电大学,2011.
[6]陈丹,李建东,李长乐. MIMO链路adhoc网络中一种新的MAC协议[J].西安电子科技大学学报,2010,37(003):385-390.
[7]程伟明,周新运,盛凌志.个基于层次结构的Ad hoc网络移动模式[J].通信学报,2004,25(2).
[8] Rhee I, Warrier A, Min J, et al. DRAND: distributed randomized TDMA schedulingfor wireless ad-hoc networks[C].Proceedings of the7th ACM international sympos-ium on Mobile ad hoc networking and computing,2006:190-201.
[9]游晓黔,李明隆,杨佳.无线传感器网络LEACH协议的研究与改进[J].重庆邮电大学学报(自然科学版),2011,23(6)746-751.
[10]孙欣尧,王雪,王晟.无线传感网络协同概率多模识别方法[J].通信学报,2011,32(6):141-147.
[11]李姗姗,廖湘科,朱培栋,等.基于网络编码的无线传感网多路径传输方法[J].软件学报,2008,19(10):2638-2647.
[12]Xiao Y, Li H. Local data control and admission control for QoS support in wirelessad hoc networks[J]. IEEE Transactions on Vehicular Technology,2004,53(5):1558-1572.
[13]陈霞,胡宏林.蜂窝通信系统中天线选择在虚拟MIMO的应用[J].电子与信息学报,2008,30(10):2454-2458.
[14]蒋芳,胡艳军,朱传伙,等.无线传感器网络中一种基于OSTBC的高效协作传输技术[J].信号处理,2011,27(3):438-443.
[15]谭学治,徐贵森,刘鑫,等.极大网络寿命的认知无线电网络自组网算法术[J].华南理工大学学报(自然科学版),2010,38(6):29-34.
[16]黄晓燕,毛玉明,吴凡,等.中继增强的无线蜂窝多小区系统的联合调度与功率控制算法[J].电子与信息学报,2012,34(7):1665-1671.
[17]唐德军,陈春林,李云.基于IEEE802.16j的协作中继切换方法[J].重庆邮电大学学报:自然科学版,2010,22(003):283-288.
[18]Lee J, Kim Y, Lee H, et al. Coordinated multipoint transmission and reception inLTE-advanced systems[J]. IEEE Communications Magazine,2012,50(11):44-50.
[19] Zummo S A. Performance analysis of coded cooperation diversity in wireless net-works[J]. Wireless communications and mobile computing,2007,7(4):473-481.
[20]张秋霞,仰枫帆,张顺外,等.中继协作编码系统等效点对点传输模型的研究[J].通信学报,2012,33(12):100-107.
[21]Richardson T and Urbanke R L. The capacity of low-densitypatiry-check codesunder message-passing decoding[J]. IEEE Transactions on Information Theory,2001,47(1):599-618.
[22] Xu J, Chen L, Zeng L, et al.Constuction of low-density parity-check codes bysuperposition. IEEE Transactions on Information Theory,2005,53(2):243-251.
[23]雷菁,高永强,王建辉,贺文辉.基于串行消息传递机制的QC-LDPC码快速译码算法研究[J].电子与信息学报,2008,30(12):2938-2942.
[24]刘晓健,吴晓富,赵春明.准循环LDPC码的两种典型快速译码算法研究[J].电子与信息学报.2009,31(1):79-82.
[25]张桂华,张善旭,李颖.高吞吐量低存储量的LDPC码译码器FPGA实现[J].西安电子科技大学学报.2008,35(03):428-432.
[26]Blanksby A J, Howland C J. A690-mW1-Gb/s1024-b, rate-1/2low-density parity-check code decoder[J]. IEEE Journal of Solid-State Circuits,2002,37(3):404-412.
[27]林永照,吴成柯,刘薇. LT码和q-LDPC码级联方案在深空通信中的应用[J].电子与信息学报,2010,32(8).
[28]黎勇,王琳,魏琴芳,等. GF(2^2)域上的LDPC码在深空通信中的应用研究[J].系统仿真学报,2010,22(4):942-945.
[29]郭锐,胡方宁,刘济林.深空通信中高性能低复杂度的QC-DPC码构造方法[J].空间科学学报,2012,32(4):567-574.
[30]GB20600-2006.数字电视地面广播传输系统帧结构、信道编码和调制[S].中国国家标准化管理委员会,2006.
[31]ETSI E N.302307V1.1.1. Second generation framing structure, channel codingand modulation systems for Broadcasting, Interactive Services, News Gathering andother broadband satellite applications (DVB-S2)[S],2005.
[32]ETSI E N.302755V1.1.1.Digital Video Broadcasting (DVB); Frame structurechannel coding and modulation for a second generation digital terrestrial televisionbroadcasting system (DVB-T2)[S],2008.
[33]Draft E. EN302769V1.1.1.Digital Video Broadcasting (DVB);Frame structurechannel coding and modulation for a second generation digital transmission systemfor cable systems (DVB-C2)[S],2009.
[34]Hunter T E, Nosratinia A. Performance analysis of coded cooperation diversity[C].IEEE International Conference on Communications,2003,:2688-2692.
[35]Hunter T E, Nosratinia A. Diversity through coded cooperation[J]. IEEE Transact-ions on Wireless Communications,2006,5(2):283-289.
[36] Ravanshid A, Lampe L, Huber J B. Dynamic decode-and-forward relaying usingraptor codes[J]. IEEE Transactions on Wireless Communications,2011,10(5):1569-1581.
[37] Razaghi P, Yu W. Bilayer low-density parity-check codes for decode-and-forwardin relay channels[J]. IEEE Transactions on Information Theory,2007,53(10):3723-3739.
[38] Azmi M H, Yuan J, Lechner G, et al. Design of multi-edge-type bilayer-expurgatedLDPC codes for decode-and-forward in relay channels[J]. IEEE Transactions onCommunications,2011,59(11):2993-3006.
[39] Lu H F. Constructions of DMT optimal vector codes for asynchronous cooperativenetworks using decode-and-forward protocols[J]. IEEE Transactions on WirelessCommunications,2010,9(7):2392-2400.
[40] Parvaresh F, Etkin R. Using superposition codebooks and partial decode andforward in low SNR parallel relay networks[J]. IEEE Transactions on InformationTheory,2012,59(3):1704-1723.
[41] Rost P, Fettweis G. Analysis of decode-and-forward, compress-and-forward andcombined protocols for multiterminal half-duplex relay networks with randomschedules[J]. Transactions on Emerging Telecommunications Technologies,2012,24(2):196-211.
[42] Zhang J, Yang L L, Hanzo L. Energy-efficient dynamic resource allocation foropportunistic-relaying-assisted SC-FDMA using Turbo-equalizer-aided softdecode-and-forward[J]. IEEE Transactions on Vehicular Technology,2013,62(1):235-246.
[43] Varodayan D, Aaron A, Girod B. Rate-adaptive codes for distributed sourcecoding[J]. Signal Processing,2006,86(11):3123-3130.
[44] Zhao B, Valenti M C. Distributed Turbo coded diversity for relay channel[J].Elect-ronics letters,2003,39(10):786-787.
[45] Zhang Z,Duman T M.Capacity-approaching Turbo coding for half-duplex relaying[J].IEEE Transactions on Communications,2007,55(10),1895-1906.
[46] Zhang Z, Duman T M. Capacity-approaching Turbo coding and iterative decodingfor relay channels[J].IEEE Transactions on Communications，2005,53(11):1895-1905.
[47]王军.基于于LDPC码的半双工中继协作编码技术[D].西安电子科技大学.2011.
[48]施玉晨.无线中继系统中的编码与协作传输技术研究[D].西安电子科技大学,2012.
[48] Savin V. Split-extended LDPC codes for coded cooperation[C]. IEEE2010Inter-national Symposium on Information Theory and its Applications (ISITA),2010:151-156.
[49] Li C, Yue G, Khojastepour M A, et al. LDPC-coded cooperative relay systems:per-formance analysis and code design[J]. IEEE Transactions on Communications,2008,56(3):485-496.
[50] Duyck D, Boutros J J, Moeneclaey M. Low-density graph codes for coded cooper-ation on slow fading relay channels[J]. IEEE Transactions on Information Theory,2011,57(7):4202-4218.
[51] Chen H, Yu D, Ma X. Cooperative signal constellation for LDPC-coded relaysystem[J]. IEEE Communications Letters,2011,15(7):704-706.
[52] Yang F, Chen J, Zong P, et al. Joint iterative decoding for pragmatic irregularLDPC-coded multi-relay cooperations[J]. International Journal of Electronics,2011,98(10):1383-1397.
[53] Guo Z, Huang J, Wang B, et al. A practical joint network-channel coding schemefor reliable communication in wireless networks[J]. IEEE Transactions on WirelessCommunications,2012,11(6):2084-2094.
[54] Duyck D, Moeneclaey M, Azmi M H, et al. Universal LDPC codes for cooperativecommunications[C].20106th International Symposium on Turbo Codes and Itera-tive Information Processing (ISTC),2010:73-77.
[55] Yan Y, Lee M H. PIC decoding algorithm for Quasi-Orthogonal distributed STBCwith non-binary LDPC code[C]. IEEE Computing, Communications and Applicati-ons Conference (ComComAp),2012:179-183.
[56] Bing D, Jun Z. Design and optimization of joint network-channel LDPC code forwireless cooperative communications[C].11th IEEE Singapore InternationalConference on Communication Systems,2008:1625-1629.
[57]陈婧文.基于LDPC码的协作通信系统及联合迭代译码性能的研究[D].南京航空航天大学,2009.
[58] Xiaojun S U N, Jiang M, Wei X U, et al. Optimizing protograph coded BICM forhalf-duplex DF Relay[J]. IEICE Transactions on Communications,2012,95(4):1397-1401.
[59] James A, Madhukumar A S, Tio S D, et al. Throughput optimization in cooperativecommunications based on incremental relaying[J]. IEEE Transactions on VehicularTechnology,2011,60(1):317-323.
[60] Liu J, Tao M, Xu Y. Pairwise check decoding for LDPC coded two-way relayblock fading channels[J]. IEEE Transactions on Communications,2012,60(8):2065-2076.
[61] Chakrabarti A, Baynast A D, Sabhaarwal A, et al.Low density parity check codesfor the relay channel[J]. IEEE Journal Select Communications,2007,25(2):280-291.
[62] Jun Hu,Duman T.M.Low Density Parity Check Codes over Wireless Relay Chan-nels[J].IEEE Transactions on Wireless Communications,2007,6(9):3384-3394.
[63] Razaghi R,WEI Y. Bilayer low-density parity-check codes for decode-and forwardin relay channels[J]. IEEE Transactions on Information Theory,2007,53(10):3723-3739.
[64] Cances J,Meghdadi V. Optimized low density parity check codes designs for halfduplex relay channels[J]. IEEE Transactions on Wireless Communications,2009,8(7):3390-3395.
[65] Van Nguyen T,Nosratinia A,Divsalar D.Bilayer protograph codes for half-duplexrelay channels[C]. IEEE International Symposium on Information Theory Procee-dings, Texas,USA,2010:948-952.
[66]Wu M, Weitkemper P, Wubben D, et al. Comparison of distributed LDPC codingschemes for decode-and-forward relay channels[C].2010IEEE International ITGWorkshop on Smart Antennas (WSA),2010:127-134.
[67]Sun X, Jiang M, Zhao C, et al.IRA code design for DF-relay via check-splitting[J].Journal on Communications2010,31(2):130-135.
[68]Huang T, Yang T, Yuan J, et al. Design of Irregular Repeat-Accumulate CodedPhysical-Layer Network Coding for Gaussian Two-Way Relay Channels[J]. IEEETransactions on Communications,2013,99(1):1-13.
[69]M.H.Azmi, J.Yuan. Design of multi-edge type bilayer-expurgated LDPC codes [C],in proc. IEEE international symposium on information theory,2009:1988-1992.
[70]Li J, Azmi M H, Malaney R, et al. Design of network-coding based multi-edge typeLDPC codes for multi-source relaying systems[C].6th. International Sym-posiumon Turbo Codes and Iterative Information Processing(ISTC),2010:414-418.
[71] Youssef R, Graell i Amat A. Distributed serially concatenated codes for multi-source cooperative relay networks[J]. IEEE Transactions on Wireless Commun-ications,2011,10(1):253-263.
[72] Jun Li,Jinhong Yuan, Malaney, R, Azmi, M.H. Ming Xiao. Network coded LDPCcode design for a multi-source relaying system[J].IEEE Transactions on Wire-lessCommunications,2011,10(5):1538-1551.
[73] Wang C, Fan Y, Thompson J, et al. A comprehensive study of repetition-codedprotocols in multi-user multi-relay networks[J]. IEEE Transactions on WirelessCommunications,2009,8(8):4329-4339.
[74] Li Y, Song G, Wang L. Design of joint network-low density parity check codesbased on the EXIT charts[J]. IEEE Communication Letter,2009,13(8):600-602.
[75] Li Y, Wang L, Sun Y.The Design of Network Low Density Parity Check Codes forWireless Multiple-Access Relay Networks[C].25th IEEE International Conferenceon Advanced Information Networking and Applications (AINA),Singapore,SINGAPORE,2011:653-658.
[76] Duyck D, Boutros J J, Moeneclaey M. Low-density graph codes for coded coo-peration on slow fading relay channels [J]. IEEE Transactions on InformationTheory,2011,7(57):4202-4218.
[77] Li Y, Song G, Wang L.Analysis of the joint network LDPC codes over orthogonalmulti-access relay channel [J]. IEEE Communication Letter,2010,14(2):184-186.
[78] Rebelatto J L, Uch a-Filho B F, Li Y, et al. Adaptive distributed network-channelcoding[J]. IEEE Transactions on Wireless Communications,2011,10(9):2818-2822.
[79] Duyck D, Boutros J J, Moeneclaey M. Full diversity Random LDPC codes[C].18thIEEE Symposium o Communications and Vehicular Technology in the Benelux,2011:1-6.
[80]郭锐,胡方宁.协作编码MARC上全分集LDPC码的实现与性能分析[J].电路与系统学报,2012,17(2):54-59.
[81]郭锐,胡方宁,刘济林.H-ARQ信道上全分集LDPC码的构造与密度演化分析[J].中国科学(信息科学),2012,42(8):974-987.
[82] Li J, Yuan J, Malancy R, et al. Full-diversity binary frame-wise network coding formultiple-source multiple-relay networks over slow-fading channels[J]. IEEETransactions on Vehicular Technology,2012,61(3):1346-1360.
[83] Zhang S, Yang F, Tang L. An LDPC coded cooperative MIMO scheme overRayleigh fading channels with unknown channel state information[J]. Journal ofZhejiang University SCIENCE C,2013,14(1):30-41.
[84] Ding Z, Leung K K. On the combination of cooperative diversity and networkcoding for wireless uplink transmissions[J]. IEEE Tran-sactions on VehicularTechnology,2011,60(4):1590-1601.
[85] Duyck D, Capirone D, Boutros J J, et al. Analysis and construction of full-diversityjoint network-LDPC codes for cooperative communications[J]. EURASIP Journalon Wireless Communications and Networking,2010,2010-2019.
[86] Kim J, Michalopoulos D S, Schober R. Diversity analysis of multi-user multi-relaynetworks[J]. IEEE Transactions on Wireless Communications,2011,10(7):2380-2389.
[87]Boutros J J. Diversity and coding gain evolution in graph codes[C]. InformationTheory and Applications Workshop,2009:34-43.
[88] Peng M, Liu H, Wang W, et al. Cooperative network coding with MIMO transmis-sion in wireless decode-and-forward relay networks[J]. IEEE Transactions onVehicular Technology,2010,59(7):3577-3588.
[89] Andriyanova I, Biglieri E, Declercq D. Joint channel estimation and decoding ofroot-LDPC codes in block-fading channels[C]. IEEE Global TelecommunicationsConference (GLOBECOM2011),2011:1-4.
[90] Duyck D, Capirone D, Moeneclaey M, et al. A full-diversity joint network-channelcode construction for cooperative communications[C]. IEEE20th InternationalSymposium on Personal, Indoor and Mobile Radio Communications,2009:1282-1286.
[91] Bao X, Li J. Efficient message relaying for wireless user cooperation: decode-amplify-forward (DAF) and hybrid DAF and coded-cooperation[J]. IEEETransactions on Wireless Communications,2007,6(11):3975-3984.
[92] Qi Y, Hoshyar R, Tafazolli R. Performance evaluation of soft decode-and-forwardin fading relay channels. IEEE67TH IEEE VTS Vehicular Technology ConferenceProceedings,2008:1286-1290.
[93] Xue F, Sandhu S. Cooperation in a half-duplex Gaussian diamond relay channel[J].IEEE Transactions on Information Theory,2007,53(10):3806-3814.
[94] Nguyen S L H, Ghrayeb A, Al-Habian G, et al. Mitigating error propagation intwo-way relay channels with network coding[J]. IEEE Transactions on WirelessCommunications,2010,9(11):3380-3390.
[95] Ordentlich O, Zhan J, Erez U, et al. Practical code design forcompute-and-forward[C].2011IEEE International Symposium on InformationTheory Proceedings (ISIT),2011:1876-1880.
[96] Ibi S, Takada N, Sampei S. Bit-Wise Partial Noise Elimination in CooperativeDecode-Amplify-Forward Relay Node[C].2012IEEE75th Vehicular TechnologyConference (VTC Spring),2012:1-5.
[97] Chakrabarti A, Sabharwal A, Aazhang B. Practical quantizer design for half-duplexestimate-and-forward relaying[J]. IEEE Transactions on Communications,2011,59(1):74-83.
[98] Huo P, Cao L. Distributed STBC with soft information relay based on Gaussianapproximation[J]. IEEE Signal Processing Letters,2012,19(10):599-602.
[99]Wang P C, Tsai H L, Lin M C. A design of code-aided channel estimation intwo-way relay networks[C].2012IEEE International Symposium on InformationTheory and its Applications (ISITA),2012:774-778.
[100]Butt M F U, Ng S X, Hanzo L. Self-concatenated code design and its applicationin power-efficient cooperative communications[J]. IEEE Communications Surveys&Tutorials,2012,14(3):858-883.
[101] Chikha H B, Chaoui S, Dayoub I, et al. A parallel concatenated convolutional-based distributed coded cooperation scheme for relay channels[J]. Wireless PersonalCommunications,2012,67(4):951-969.
[102] Zhang J, Yang L L, Hanzo L. Energy-efficient dynamic resource allocation foropportunistic-relaying-assisted SC-FDMA using Turbo-equalizer-aided softdecode-and-forward[J]. IEEE Transactions on Vehicular Technology,2013,62(1):235-246.
[103] Chakrabarti A, de Baynast A, Sabharwal A, et al. Half-duplex estimate-and-forward relaying: bounds and code design[C]. IEEE International Symposium onInformation Theory,2006:1239-1243.
[104] Dabora R, Servetto S D. On the role of estimate-and-forward with time sharing incooperative communication[J]. IEEE Transactions on Information Theory,2008,54(10):4409-4431.
[105] Simoens S, Mu oz O, Vidal J. Achievable rates of compress-and-forwardcooperative relaying on Gaussian vector channels[C]. IEEE InternationalConference on Communications,2007:4225-4231.
[106] Uppal M, Liu Z, Stankovic V, et al. Compress-forward coding with BPSKmodulation for the half-duplex Gaussian relay channel[J]. IEEE Transactions onSignal Processing,2009,57(11):4467-4481.
[107] Weitkemper P, Wubben D, Kammeyer K D. Minimum MSE relaying in codednetworks[C]. International ITG Workshop on Smart Antennas,2008:96-103.
[108] Weitkemper P, Wubben D, Kammeyer K D. Minimum MSE Relaying forArbitrary Signal Constellations in Coded Relay Networks[C]. IEEE69th VehicularTechnology Conference,2009:1-5.
[109] Li Y, Vucetic B, Wong T F, et al. Distributed Turbo coding with soft informationrelaying in multihop relay networks[J]. IEEE Journal on Selected Areas in Comm-unications,2006,24(11):2040-2050.
[110] Thobaben R. On distributed codes with noisy relays[C].200842nd AsilomarConference on Signals, Systems and Computers,2008:1010-1014.
[111] Aziz A A, Iwanami Y, Okamoto E. Efficient combining technique with a low-complexity detect-and-forward relay for cooperative diversity scheme[C].TENCON2009-2009IEEE Region10Conference,2009:1-6.
[112] Abd Aziz A, Iwanami Y, Okamoto E. On the improvement of maximum likeli-hood detection in multiple relay systems[C].2010IEEE Wireless Communicationsand Networking Conference (WCNC),2010:1-6.
[113] Aziz A A, Iwanami Y. A simple symbol estimation for soft information relayingin cooperative relay channels[J]. International Journal of Communications, Networkand System Sciences,2011,4(9):568-577.
[114] Tran D T, Sun S, Kurniawan E. A Low-complexity practical quantize-and-forward scheme for two-hop relay systems[C].2012IEEE75th.VehicularTechnology Conference (VTC Spring),2012:1-5.
[115] Li H, Chen C W. Joint source and channel optimized block TCQ with layeredtransmission and RCPC[C].1998International Conference on Image Processing,1998:644-648.
[116] Ikki S S, Ahmed M H. Performance analysis of incremental-relaying cooperative-diversity networks over Rayleigh fading channels[J]. IET Communications,2011,5(3):337-349.
[117] Noh K L, Serpedin E, Suter B. Optimum cooperation of the cooperative codingscheme for frequency division half-duplex relay channels[J]. IEEE Transactions onWireless Communications,2007,6(5):1654-1658.
[118]Kong H Y, Soo K N. Coded Cooperation Diversity in Wireless Relay Network[C].International Conference on Information and Communication Technology,2007.ICICT'07.2007:123-126.
[119] Maagh S, Sharif M Y. RCPC coding for the dynamic decode-and-forwardchannel[C].2011IEEE International Conference on Microwaves, Communications,Antennas and Electronics Systems (COMCAS),2011:1-6.
[120] Zhao F, Bai Z. Simplified BER analysis of rate-compatible puncturedconvolutional coded cooperative system over slow Rayleigh fading channel[C].9thInternational Symposium on Communications and Information Technology,2009:943-946.
[121]An J, Jia Y, Wu H. A distributed coding protocol for wireless relay networks[C].2010IEEE Youth Conference on Information Computing and Telecommunications(YC-ICT),2010:327-330.
[122] Janani M, Hedayat A, Hunter T E, et al. Coded cooperation in wirelesscommunications: space-time transmission and iterative decoding[J]. IEEETransactions on Signal Processing,2004,52(2):362-371.
[123] Ha J, Kim J, Klinc D, et al. Rate-compatible punctured low-density parity-checkcodes with short block lengths[J]. IEEE Transactions on Information Theory,2006,52(2):728-738.
[124] Shi C Z,Ramamoorthy A.Design and analysis of E2RC codes[J]. IEEE Journal onSelected Areas in Communications,2009,27(6):889-898.
[125] Ha J, Klinc D, Kwon J, et al.Layered BP Decoding for rate-compatiblepunctured LDPC codes[J]. IEEE Communications Letters,2007,11(5):440-442.
[126] Ha J, Kim J, McLaughlin S W. Rate-compatible puncturing of low-densityparity-check codes[J]. IEEE Transactions on Information Theory,2004,50(11):2824-2836.
[127] Vellambi B N, Fekri F. Finite-length rate-compatible LDPC codes: a novelpuncturing scheme[J]. IEEE Transactions on Communications,2009,57(2):297-301.
[128] Benmayor D,Mathiopoulos P,Constantinou P.Rate-compatible IRA codes usingquadratic congruential extension sequences and puncturing[J].IEEE Communicatio-ns Letters,2010,14(5):441-443.
[129] Kim J, Ramamoorthy A, Mclaughlin S W.The Design of efficiently-encodablerate-compatible LDPC codes[J]. IEEE Transactions on Communication,2009,57(2):368-375.
[130] Ardakani M,Kschischang F R.A more accurate one-dimensional analysis anddesign of irregular LDPC codes[J].IEEE Transactions on Communication,2004,52(12):2106-2114.
[131] Wang Y G,Fossorier M.Doubly generalized LDPC codes over the AWGNchannel. IEEE Transactions on Communications,2009,57(5):1312-1319.
[132] Si Z W,Andersson M,Thobaben R, et al.Rate-compatible LDPC convolutionalcodes for capacity-approaching hybrid ARQ[C]. IEEE Information TheoryWorkshop (ITW), Dublin, Ireland,2011:513-517.
[133] Psota E,Pérez L C.Iterative Construction of regular LDPC codes from independ-ent tree-based minimum distance bounds[J]. IEEE Communications Letters,2011,15(3):334-336.
[134] Azmi M, Li J, Yuan J, et al. LDPC codes for soft decode-and-forward in half-duplex relay channels[J].IEEE Journal Selected Areas in Communications,2013,31(8)1:12.
[135] Zhang J,Fossorier M. Shuffled iterative decoding[J].IEEE Transactions onCommunications,2005,53(2):209–213.
[136] Yang Yang, Huang Jian-zhong, Tong Sheng.Replica horizontal-shuffled iterativedecoding of low-density parity-check codes[J]. Journal of China Universities ofPosts and Telecommunications,2010,17(6):32-40.
[137] Cui Z,Wang Z, Zhang X.Reduced-complexity column-layered decoding andimplementation for LDPC codes[J]. IET Communications,2011,5(15)2177-2186.
[138] Sangjoon P,Sunyoung L, Keumchan W.A group shuffled BP decoding forpunctured low-density parity-check codes[J]. IEICE Electronics Express,2010,19(7):1429-1434.
[139] Chung S Y,Richardson T,Urbanke R. Analysis of sum-product decoding oflow-density parity-check codes using a Gaussian approximation[J]. IEEETransactions on Information Theory,2001,47(1):657-670.
[140] Smith B,Ardakani M,Wei Yu,et al.Design of irregular LDPC codes withoptimized performance-complexity tradeoff[J]. IEEE Transactions on Commun-ications,2010,58(2):489-499.
[141] Urbanke R L. LdpcOpt: a fast and accurate degree distribution optimizer forLDPC code ensembles[J]. online: lthcwww. epfs. ch/research/ldpcopt,2007.
[142] Duyck D, Boutros J J, Moeneclaey M. Low density graph codes for codedcooperation on slow fading relay channels [J]. IEEE Transactions on InformationTheory,2011,7(57):4202-4218.
[143]Azmi M H, Yuan J, Lechner G, et al. Design of multi-edge-type bilayer-expurgat-ed LDPC codes for decode-and-forward in relay channels[J]. IEEE Transactions onCommunications,2011,59(11):2993-3006.
[144] Li C, Yue G, Wang X, et al. LDPC code design for half-duplex cooperativerelay[J]. IEEE Transactions on Wireless Communications,2008,7(11):4558-4567.
[145] Aziz A A, Iwanami Y. A Simple Symbol Estimation for Soft Information Relay-ing in Cooperative Relay Channels[J]. International Journal of Communications,Network and System Sciences,2011,4(9):568-577.