155 research outputs found
A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees
Low-density parity-check codes, a class of capacity-approaching linear codes,
are particularly recognized for their efficient decoding scheme. The decoding
scheme, known as the sum-product, is an iterative algorithm consisting of
passing messages between variable and check nodes of the factor graph. The
sum-product algorithm is fully parallelizable, owing to the fact that all
messages can be update concurrently. However, since it requires extensive
number of highly interconnected wires, the fully-parallel implementation of the
sum-product on chips is exceedingly challenging. Stochastic decoding
algorithms, which exchange binary messages, are of great interest for
mitigating this challenge and have been the focus of extensive research over
the past decade. They significantly reduce the required wiring and
computational complexity of the message-passing algorithm. Even though
stochastic decoders have been shown extremely effective in practice, the
theoretical aspect and understanding of such algorithms remains limited at
large. Our main objective in this paper is to address this issue. We first
propose a novel algorithm referred to as the Markov based stochastic decoding.
Then, we provide concrete quantitative guarantees on its performance for
tree-structured as well as general factor graphs. More specifically, we provide
upper-bounds on the first and second moments of the error, illustrating that
the proposed algorithm is an asymptotically consistent estimate of the
sum-product algorithm. We also validate our theoretical predictions with
experimental results, showing we achieve comparable performance to other
practical stochastic decoders.Comment: This paper has been submitted to IEEE Transactions on Information
Theory on May 24th 201
Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance
Parameters of LDPC codes, such as minimum distance, stopping distance,
stopping redundancy, girth of the Tanner graph, and their influence on the
frame error rate performance of the BP, ML and near-ML decoding over a BEC and
an AWGN channel are studied. Both random and structured LDPC codes are
considered. In particular, the BP decoding is applied to the code parity-check
matrices with an increasing number of redundant rows, and the convergence of
the performance to that of the ML decoding is analyzed. A comparison of the
simulated BP, ML, and near-ML performance with the improved theoretical bounds
on the error probability based on the exact weight spectrum coefficients and
the exact stopping size spectrum coefficients is presented. It is observed that
decoding performance very close to the ML decoding performance can be achieved
with a relatively small number of redundant rows for some codes, for both the
BEC and the AWGN channels
Turbo EP-based Equalization: a Filter-Type Implementation
This manuscript has been submitted to Transactions on Communications on
September 7, 2017; revised on January 10, 2018 and March 27, 2018; and accepted
on April 25, 2018
We propose a novel filter-type equalizer to improve the solution of the
linear minimum-mean squared-error (LMMSE) turbo equalizer, with computational
complexity constrained to be quadratic in the filter length. When high-order
modulations and/or large memory channels are used the optimal BCJR equalizer is
unavailable, due to its computational complexity. In this scenario, the
filter-type LMMSE turbo equalization exhibits a good performance compared to
other approximations. In this paper, we show that this solution can be
significantly improved by using expectation propagation (EP) in the estimation
of the a posteriori probabilities. First, it yields a more accurate estimation
of the extrinsic distribution to be sent to the channel decoder. Second,
compared to other solutions based on EP the computational complexity of the
proposed solution is constrained to be quadratic in the length of the finite
impulse response (FIR). In addition, we review previous EP-based turbo
equalization implementations. Instead of considering default uniform priors we
exploit the outputs of the decoder. Some simulation results are included to
show that this new EP-based filter remarkably outperforms the turbo approach of
previous versions of the EP algorithm and also improves the LMMSE solution,
with and without turbo equalization
Sparse Regression LDPC Codes
This article introduces a novel concatenated coding scheme called sparse
regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer
non-binary LDPC code and an inner sparse regression code (SPARC) whose
respective field size and section sizes are equal. For such codes, an efficient
decoding algorithm is proposed based on approximate message passing (AMP) that
dynamically shares soft information between inner and outer decoders. This
dynamic exchange of information is facilitated by a denoiser that runs belief
propagation (BP) on the factor graph of the outer LDPC code within each AMP
iteration. It is shown that this denoiser falls within the class of
non-separable pseudo-Lipschitz denoising functions and thus that state
evolution holds for the proposed AMP-BP algorithm. Leveraging the rich
structure of SR-LDPC codes, this article proposes an efficient low-dimensional
approximate state evolution recursion that can be used for efficient
hyperparameter tuning, thus paving the way for future work on optimal code
design. Finally, numerical simulations demonstrate that SR-LDPC codes
outperform contemporary codes over the AWGN channel for parameters of practical
interest. SR-LDPC codes are shown to be viable means to obtain shaping gains
over the AWGN channel.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible. arXiv admin note: substantial text overlap with
arXiv:2301.0189
On Universal Properties of Capacity-Approaching LDPC Ensembles
This paper is focused on the derivation of some universal properties of
capacity-approaching low-density parity-check (LDPC) code ensembles whose
transmission takes place over memoryless binary-input output-symmetric (MBIOS)
channels. Properties of the degree distributions, graphical complexity and the
number of fundamental cycles in the bipartite graphs are considered via the
derivation of information-theoretic bounds. These bounds are expressed in terms
of the target block/ bit error probability and the gap (in rate) to capacity.
Most of the bounds are general for any decoding algorithm, and some others are
proved under belief propagation (BP) decoding. Proving these bounds under a
certain decoding algorithm, validates them automatically also under any
sub-optimal decoding algorithm. A proper modification of these bounds makes
them universal for the set of all MBIOS channels which exhibit a given
capacity. Bounds on the degree distributions and graphical complexity apply to
finite-length LDPC codes and to the asymptotic case of an infinite block
length. The bounds are compared with capacity-approaching LDPC code ensembles
under BP decoding, and they are shown to be informative and are easy to
calculate. Finally, some interesting open problems are considered.Comment: Published in the IEEE Trans. on Information Theory, vol. 55, no. 7,
pp. 2956 - 2990, July 200
Expectation propagation as a solution for digital communication systems.
In the context of digital communications, a digital receiver is required to provide an estimation of the transmitted symbols. Nowadays channel decoders highly benefit from soft (probabilistic) estimates for each transmitted symbol rather than from hard decisions. For this reason, digital receivers must be designed to provide the probability that each possible symbol was transmitted based on the received corrupted signal. Since exact inference might be unfeasible in terms of complexity for high-order scenarios, it is necessary to resort to approximate inference, such as the linear minimum mean square error (LMMSE) criterion. The LMMSE approximates the discrete prior information of the transmitted symbols with a Gaussian distribution, which causes a degradation in its performance. In this thesis, an alternative approximate statistical technique is applied to the design of a digital
probabilistic receiver in digital communications. Specifically, the expectation
propagation (EP) algorithm is investigated to find the Gaussian posterior probability density function (pdf) that minimizes the Kullback-Leibler (KL) divergence with respect to the true posterior pdf. Two different communication system scenarios are studied: a single-input singleoutput (SISO) digital communication system with memory channel and a multipleinput multiple-output (MIMO) system with memoryless channel. In the SISO scenario, three different designs of a soft standalone and turbo equalizer based on the EP algorithm are developed: the block or batch approach, the filter-type
version that emulates theWiener filter behavior and the smoothing equalizer which proceeds similarly to a Kalman smoother. Finally, the block EP implementation is also adapted to MIMO scenarios with feedback from the decoder. In both scenarios, the EP is applied iteratively, including a damping mechanism and a control to avoid negative values of variances, which would lead to instabilities (specially for high-order constellations). Experimental results included through the thesis show that the EP algorithm applied to communication systems greatly improves the performance of previous approaches found in the literature with a complexity slightly increased but still proportional to that of the LMMSE. These results also show the robustness of the algorithm even for high-order modulations, large memory channels and high number of antennas. Major contributions of this dissertation have been published in four journal (one of them is still under review) and two conference papers. One more paper will be submitted to a journal soon. All these papers are listed below:
• Irene Santos, Juan José Murillo-Fuentes, Rafael Boloix-Tortosa, Eva Arias
de Reyna and Pablo M. Olmos, "Expectation Propagation as Turbo Equalizer
in ISI Channels," IEEE Transactions on Communications, vol. 65, no.1, pp.
360-370, Jan 2017.
• Irene Santos, Juan José Murillo-Fuentes, Eva Arias de Reyna and Pablo M.
Olmos, "Turbo EP-based Equalization: a Filter-Type Implementation," IEEE
Transactions on Communications, Sep 2017, Accepted. [Online] Available:
https://ieeexplore.ieee.org/document/8353388/
• Irene Santos, Juan José Murillo-Fuentes, Eva Arias-de-Reyna and Pablo M.
Olmos, "Probabilistic Equalization With a Smoothing Expectation Propagation
Approach," IEEE Transactions on Wireless Communications, vol. 16,
no. 5, pp. 2950-2962, May 2017.
• Irene Santos, Juan José Murillo-Fuentes and Eva Arias-de-Reyna, "Equalization
with Expectation Propagation at Smoothing Level," To be submitted.
[Online] Available: https://arxiv.org/abs/1809.00806
• Irene Santos and Juan José Murillo-Fuentes, "EP-based turbo detection for
MIMO receivers and large-scale systems," IEEE Transactions on Vehicular
Technology, May 2018, Under review. [Online] Available:
https://arxiv.org/abs/1805.05065
• Irene Santos, Juan José Murillo-Fuentes, and Pablo M. Olmos, "Block
expectation propagation equalization for ISI channels," 23rd European Signal
Processing Conference (EUSIPCO 2015), Nice, 2015, pp. 379-383.
• Irene Santos, and Juan José Murillo-Fuentes, "Improved probabilistic EPbased receiver for MIMO systems and high-order modulations," XXXIII
Simposium Nacional de la Unión Científica Internacional de Radio (URSI
2018), Granada, 2018.En el ámbito de las comunicaciones digitales, es necesario un receptor digital que proporcione una estimación de los símbolos transmitidos. Los decodificadores de canal actuales se benefician enormemente de estimaciones suaves (probabilísticas) de cada símbolo transmitido, en vez de estimaciones duras. Por este motivo, los receptores digitales deben diseñarse para proporcionar la probabilidad de cada posible símbolo que fue transmitido en base a la señal recibida y corrupta. Dado que la inferencia exacta puede no ser posible en términos de complejidad para escenarios de alto orden, es necesario recurrir a inferencia aproximada, como por
ejemplo el criterio de linear minimum-mean-square-error (LMMSE). El LMMSE aproxima la información a priori discreta de los símbolos transmitidos con una distribución Gaussiana, lo cual provoca una degradación en su resultado. En esta tesis, se aplica una técnica alternativa de inferencia estadística para diseñar un receptor digital probabilístico de comunicaciones digitales. En concreto, se investiga el algoritmo expectation propagation (EP) con el objetivo de encontrar la función densidad de probabilidad (pdf) a posteriori Gaussiana que minimiza la divergencia de Kullback-Leibler (KL) con respecto a la pdf a posteriori verdadera. Se estudian dos escenarios de comunicaciones digitales diferentes: un sistema de comunicaciones single-input single-output (SISO) con canales con memoria y un sistema multiple-input multiple-output (MIMO) con canales sin memoria. Para el
escenario SISO se proponen tres diseños diferentes para un igualador probabilístico, tanto simple como turbo, que está basado en el algoritmo EP: una versión bloque, una versión filtrada que emula el comportamiento de un filtroWiener y una versión smoothing que funciona de forma similar a un Kalman smoother. Finalmente, la implementación del EP en bloque se adapta también para escenarios MIMO con realimentación desde el decodificador. En ambos escenarios, el EP se aplica de forma iterativa, incluyendo un mecanismo de damping y un control para evitar valores de varianzas negativas, que darían lugar a inestabilidades (especialmente, en
constelaciones de alto orden). Los resultados experimentales que se incluyen en la tesis muestran que, cuando el algoritmo EP se aplica a sistemas de comunicaciones, se mejora notablemente el resultado de otras propuestas anteriores que existen en la literatura, con un pequeño incremento de la complejidad que es proporcional a la carga del LMMSE. Estos resultados también demuestran la robustez del algoritmo incluso para modulaciones de alto orden, canales con bastante memoria y un gran número de antenas.
Las principales contribuciones de esta tesis se han publicado en cuatro artículos de revista (uno de ellos todavía bajo revisión) y dos artículos de conferencia. Otro artículo adicional se encuentra en preparación y se enviaría próximamente a una revista. Estos se citan a continuación:
• Irene Santos, Juan José Murillo-Fuentes, Rafael Boloix-Tortosa, Eva Arias
de Reyna and Pablo M. Olmos, "Expectation Propagation as Turbo Equalizer
in ISI Channels," IEEE Transactions on Communications, vol. 65, no.1, pp.
360-370, Jan 2017.
• Irene Santos, Juan José Murillo-Fuentes, Eva Arias de Reyna and Pablo
M. Olmos, "Turbo EP-based Equalization: a Filter-Type Implementation,"
IEEE Transactions on Communications, Sep 2017, Aceptado. [Online]
Disponible: https://ieeexplore.ieee.org/document/8353388/
• Irene Santos, Juan José Murillo-Fuentes, Eva Arias-de-Reyna and Pablo M.
Olmos, "Probabilistic Equalization With a Smoothing Expectation Propagation
Approach," IEEE Transactions on Wireless Communications, vol. 16,
no. 5, pp. 2950-2962, May 2017.
• Irene Santos, Juan José Murillo-Fuentes and Eva Arias-de-Reyna, "Equalization with Expectation Propagation at Smoothing Level," En preparación. [Online] Disponible: https://arxiv.org/abs/1809.00806
• Irene Santos and Juan José Murillo-Fuentes, "EP-based turbo detection for
MIMO receivers and large-scale systems," IEEE Transactions on Vehicular
Technology, May 2018, En revisión. [Online] Disponible: https://arxiv.org/abs/1805.05065
• Irene Santos, Juan José Murillo-Fuentes, and Pablo M. Olmos, "Block
expectation propagation equalization for ISI channels," 23rd European Signal
Processing Conference (EUSIPCO 2015), Nice, 2015, pp. 379-383.
• Irene Santos, and Juan José Murillo-Fuentes, "Improved probabilistic EPbased receiver for MIMO systems and high-order modulations," XXXIII Simposium Nacional de la Unión Científica Internacional de Radio (URSI
2018), Granada, 2018
- …