In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDP...In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDPC codes. Notice that the parity-check matrix H of the resulting code is square and not of full rank, and its row weight and column weight are the same. By replacing the ones in the same column of H with a nonzero element of fi nite fi elds GF(q), a class of NB-LDPC codes over GF(q) is obtained. Numerical results show that the constructed codes perform well over the AWGN channel and have fast decoding convergence. Therefore, the proposed NB-LDPC codes provide a promising coding scheme for low-latency and high-reliability communications.展开更多
In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase ...In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase Shift Keying (MPSK) symbols over a Rayleigh fading channel. Based on the dual-metric,a Chase-type soft decoding algorithm,which is called erased-Chase algorithm,is developed for Reed-Solomon (RS) coded MPSK schemes. The proposed algorithm treats the unre-liable symbols with small maximum SEDI as erasures,and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure,much more reduction in the decoding complexity can be achieved. Simulation results of the RS(63,42,22)-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally,an adaptive scheme for the number of erasures is introduced into the decoding algorithm.展开更多
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.展开更多
基金supported in part by National Natural Science Foundation of China under Grants 61372074,91438101,61103143,U1504601,and U1404622Key Scientific and Technological Project of Henan under Grants 162102310589 and 172102310124
文摘In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDPC codes. Notice that the parity-check matrix H of the resulting code is square and not of full rank, and its row weight and column weight are the same. By replacing the ones in the same column of H with a nonzero element of fi nite fi elds GF(q), a class of NB-LDPC codes over GF(q) is obtained. Numerical results show that the constructed codes perform well over the AWGN channel and have fast decoding convergence. Therefore, the proposed NB-LDPC codes provide a promising coding scheme for low-latency and high-reliability communications.
基金the National Natural Science Foundation of China (No.60272057).
文摘In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase Shift Keying (MPSK) symbols over a Rayleigh fading channel. Based on the dual-metric,a Chase-type soft decoding algorithm,which is called erased-Chase algorithm,is developed for Reed-Solomon (RS) coded MPSK schemes. The proposed algorithm treats the unre-liable symbols with small maximum SEDI as erasures,and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure,much more reduction in the decoding complexity can be achieved. Simulation results of the RS(63,42,22)-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally,an adaptive scheme for the number of erasures is introduced into the decoding algorithm.
基金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.
