In this paper, a modified a posteriori probability (APP) based algorithm for the decoding of low-density parity-check (LDPC) codes is proposed. The modified APP-based algorithm utilizes an additional processing in the...
详细信息
ISBN:
(纸本)9781424462520
In this paper, a modified a posteriori probability (APP) based algorithm for the decoding of low-density parity-check (LDPC) codes is proposed. The modified APP-based algorithm utilizes an additional processing in the bit nodes to improve the accuracy instead of the check nodes normalization performed in normalized APP-based algorithm. The modified APP-based algorithm yields desirable trade-off between performance and decoding complexity.
This paper presents an improvement of the reliability-based iterative majority-logic decodingalgorithms for regular low-density parity-check (LDPC) codes proposed by Huang et al. We improve the computation of the ext...
详细信息
ISBN:
(纸本)9781424456383
This paper presents an improvement of the reliability-based iterative majority-logic decodingalgorithms for regular low-density parity-check (LDPC) codes proposed by Huang et al. We improve the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration with some kind of reliability measures of the check-sums that are orthogonal on the considered bit. The improved algorithm achieves a significant gain over the standard one with only a modest increase in computational complexity.
One of the unexpected breakdowns in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential fo...
详细信息
ISBN:
(纸本)9781457705953
One of the unexpected breakdowns in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for a quantum turbo code to have an unbounded minimum distance and for its iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm gives a theoretical and simulated "turbo boost" to these codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties, and simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 5.5 dB beyond that of standard quantum turbo codes. Entanglement is the resource that enables a convolutional encoder to satisfy both properties because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them. Simulation results demonstrate that interleaved serial concatenation of EAQ convolutional encoders leads to a powerful code construction with excellent performance on a memoryless depolarizing channel.
Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decodingalgorithm of subcodes. In this paper, we propose a class of GLDPC codes with f...
详细信息
Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decodingalgorithm of subcodes. In this paper, we propose a class of GLDPC codes with fast parallel decodingalgorithm. The parity-check matrices of the newly constructed subcodes are composed of several square matrices, which can be viewed as elements of a finite field. Therefore the FFT-based a posteriori probability (APP) algorithm for nonbinary codes can be applied to decode the subcodes. When compared with the trellis-based APP algorithm, the FFT based APP algorithm can be implemented in parallel and has lower complexity. Simulation results show that the proposed GLDPC codes perform well on AWGN channels.
We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate the a posteriori probabilities (APP) by a set of few sequences, and to reduce the size of this set with iterations. ...
详细信息
ISBN:
(纸本)0780382803
We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate the a posteriori probabilities (APP) by a set of few sequences, and to reduce the size of this set with iterations. According to the numerical results on the bit error rate (BER) performance and the convergence behavior by extrinsic information transfer (EXIT) chart analysis, the algorithm could obtain a good balance between performance and complexity.
A simple stopping criterion for iterativedecoding based on min-sum processing is presented. While most stopping criteria suggested in the literature are based on cross entropy (CE) and its simplification, the propose...
详细信息
A simple stopping criterion for iterativedecoding based on min-sum processing is presented. While most stopping criteria suggested in the literature are based on cross entropy (CE) and its simplification, the proposed stopping criterion is to check whether a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves memory.
This work presents an ensemble of irregular low-density parity check (LDPC) codes based on an ensemble of bipartite graphs, which formulated the average weight distribution. An analysis of the error performance of LDP...
详细信息
ISBN:
(纸本)0780382803
This work presents an ensemble of irregular low-density parity check (LDPC) codes based on an ensemble of bipartite graphs, which formulated the average weight distribution. An analysis of the error performance of LDPC codes over a binary erasure channel together with an iterative decoding algorithm based on belief propagation has been clarified that a notion of stopping sets and their distribution with the asymptotic expression are derived. An irregular LDPC code ensemble that exhibits better performance in the sense of threshold is obtained by density evolution and explicitly formulates weight and stopping set distributions are defined.
A new hard iterative decoding algorithm to decode the serial concatenation of two block codes separated by an inter-leaver is presented. The new scheme is based on the use of erasures as a sort of extrinsic informatio...
详细信息
A new hard iterative decoding algorithm to decode the serial concatenation of two block codes separated by an inter-leaver is presented. The new scheme is based on the use of erasures as a sort of extrinsic information to be exchanged between the two decoders. Extensive simulations highlight the coding gain of the new algorithm with respect to standard hard iterativedecoding.
暂无评论