Bilayer low-density parity-check （LDPC） codes are an effective coding technique for decode-and-forward relaying, where the relay forwards extra parity bits to help the destination to decode the source bits correctly...Bilayer low-density parity-check （LDPC） codes are an effective coding technique for decode-and-forward relaying, where the relay forwards extra parity bits to help the destination to decode the source bits correctly. In the existing bilayer coding scheme, these parity bits are protected by an error correcting code and assumed reliably available at the receiver. We propose an uneoded relaying scheme, where the extra parity bits are forwarded to the destination without any protection. Through density evolution analysis and simulation results, we show that our proposed scheme achieves better performance in terms of bit erasure probability than the existing relaying scheme. In addition, our proposed scheme results in lower complexity at the relay.展开更多
In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is a...In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.展开更多
This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,whic...This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,which consists of the original bilayer graph and the extra added relaygenerated parity check bits.To build up our proposed optimized algorithm,we present a modified Gaussian approximation algorithm for the expanded structure of the BL-LDPC code.Then using the proposed optimized algorithm,we find the optimum overall expanded graph of the BL-LDPC code.Simulation results show that the BL-LDPC codes obtained by our proposed optimized algorithm have excellent bit-error-rate performances and small gaps between the convergence thresholds and the theoretical limits when transmitted over the additive white Gaussian noise channels.展开更多
低密度奇偶校验码(LDPC,Low Density Parity Check Codes)具有编码增益高、译码速度快、性能接近香农(Shannon)的优点。首先简要地介绍了LDPC码的译码原理,然后提出了一种基于坐标旋转数字计算机(CORDIC,COordinate Rotation DIgital Co...低密度奇偶校验码(LDPC,Low Density Parity Check Codes)具有编码增益高、译码速度快、性能接近香农(Shannon)的优点。首先简要地介绍了LDPC码的译码原理,然后提出了一种基于坐标旋转数字计算机(CORDIC,COordinate Rotation DIgital Computer)的简易译码算法,最后与几种常见的译码算法进行性能对比分析,结果显示该译码算法具有与和积算法(SPA,Sum of Product Algorithm,是性能最优的软判决算法)相同的性能,且该译码算法复杂度有很大程度的降低,只需要简单的加法和移位,具有易于硬件实现的特点。展开更多
文摘Bilayer low-density parity-check （LDPC） codes are an effective coding technique for decode-and-forward relaying, where the relay forwards extra parity bits to help the destination to decode the source bits correctly. In the existing bilayer coding scheme, these parity bits are protected by an error correcting code and assumed reliably available at the receiver. We propose an uneoded relaying scheme, where the extra parity bits are forwarded to the destination without any protection. Through density evolution analysis and simulation results, we show that our proposed scheme achieves better performance in terms of bit erasure probability than the existing relaying scheme. In addition, our proposed scheme results in lower complexity at the relay.
基金supported in part by the National Natural Science Foundation of China under Grant 61201187by the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions under Grant YETP0110+2 种基金by the Tsinghua University Initiative Scientific Research Program under Grant 20121088074by the Foundation of Zhejiang Educational Committee under Grant Y201121579by the Visiting Scholar Professional Development Project of Zhejiang Educational Committee under Grant FX2014052
文摘In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.
基金Supported by the National Basic Research Program of China(No.2012CB316100)the National Natural Science Foundation of China(No.61072064,61201140,61301177)
文摘This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,which consists of the original bilayer graph and the extra added relaygenerated parity check bits.To build up our proposed optimized algorithm,we present a modified Gaussian approximation algorithm for the expanded structure of the BL-LDPC code.Then using the proposed optimized algorithm,we find the optimum overall expanded graph of the BL-LDPC code.Simulation results show that the BL-LDPC codes obtained by our proposed optimized algorithm have excellent bit-error-rate performances and small gaps between the convergence thresholds and the theoretical limits when transmitted over the additive white Gaussian noise channels.
文摘LDPC(Lowdensity parity code)码是逼近香农界的信道码。为了逼近香农界,其优化一般采用硬门限准则。但当信道容量小于编码码率时,LDPC无法正确译码。因此,提出从软门限的角度优化LDPC码,使得在码率超过信道容量时,接收端仍可以部分译码,并将该LDPC码用于单中继信道中,解决使用解码前传(DF,decode and forward)的中继信道容量瓶颈问题,进而提高信道容量。还考虑中继节点使用Slepian-Wolf信源编码,降低中继节点到目的节点的信道质量要求的同时,仍能保证无失真译码。
文摘低密度奇偶校验码(LDPC,Low Density Parity Check Codes)具有编码增益高、译码速度快、性能接近香农(Shannon)的优点。首先简要地介绍了LDPC码的译码原理,然后提出了一种基于坐标旋转数字计算机(CORDIC,COordinate Rotation DIgital Computer)的简易译码算法,最后与几种常见的译码算法进行性能对比分析,结果显示该译码算法具有与和积算法(SPA,Sum of Product Algorithm,是性能最优的软判决算法)相同的性能,且该译码算法复杂度有很大程度的降低,只需要简单的加法和移位,具有易于硬件实现的特点。
