ﻻ يوجد ملخص باللغة العربية
It is speculated that the most probable channel noise realizations (instantons) that cause the iterative decoding of low-density parity-check codes to fail make the decoding not to converge. The Wibergs formula is generalized for the case when the part of a computational tree that contributes to the output at its center is ambiguous. Two methods of finding the instantons for large number of iterations are presented and tested on Tanners [155, 64, 20] code and Gaussian channel. The inherently dynamic instanton with effective distance of 11.475333 is found.
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit error correc
In this work, with combined belief propagation (BP), mean field (MF) and expectation propagation (EP), an iterative receiver is designed for joint phase noise (PN) estimation, equalization and decoding in a coded communication system. The presence of
`Tree pruning (TP) is an algorithm for probabilistic inference on binary Markov random fields. It has been recently derived by Dror Weitz and used to construct the first fully polynomial approximation scheme for counting independent sets up to the `t
Although the sphere decoder (SD) is a powerful detector for multiple-input multiple-output (MIMO) systems, it has become computationally prohibitive in massive MIMO systems, where a large number of antennas are employed. To overcome this challenge, w