Density Evolution for Asymmetric Memoryless Channels

Density evolution is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution (DE) has been widely and successfully applied to different channels, including binary erasure channels, binary symmetric channels, binary additive white Gaussian noise channels, etc. This paper generalizes density evolution for non-symmetric memoryless channels, which in turn broadens the applications to general memoryless channels, e.g. z-channels, composite white Gaussian noise channels, etc. The central theorem underpinning this generalization is the convergence to perfect projection for any fixed size supporting tree. A new iterative formula of the same complexity is then presented and the necessary theorems for the performance concentration theorems are developed. Several properties of the new density evolution method are explored, including stability results for general asymmetric memoryless channels. Simulations, code optimizations, and possible new applications suggested by this new density evolution method are also provided. This result is also used to prove the typicality of linear LDPC codes among the coset code ensemble when the minimum check node degree is sufficiently large. It is shown that the convergence to perfect projection is essential to the belief propagation algorithm even when only symmetric channels are considered. Hence the proof of the convergence to perfect projection serves also as a completion of the theory of classical density evolution for symmetric memoryless channels.Comment: To appear in the IEEE Transactions on Information Theor

An Iteratively Decodable Tensor Product Code with Application to Data Storage

The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC's tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC's tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity.Comment: Hakim Alhussien, Jaekyun Moon, "An Iteratively Decodable Tensor Product Code with Application to Data Storage

Advanced Coding And Modulation For Ultra-wideband And Impulsive Noises

The ever-growing demand for higher quality and faster multimedia content delivery over short distances in home environments drives the quest for higher data rates in wireless personal area networks (WPANs). One of the candidate IEEE 802.15.3a WPAN proposals support data rates up to 480 Mbps by using punctured convolutional codes with quadrature phase shift keying (QPSK) modulation for a multi-band orthogonal frequency-division multiplexing (MB-OFDM) system over ultra wideband (UWB) channels. In the first part of this dissertation, we combine more powerful near-Shannon-limit turbo codes with bandwidth efficient trellis coded modulation, i.e., turbo trellis coded modulation (TTCM), to further improve the data rates up to 1.2 Gbps. A modified iterative decoder for this TTCM coded MB-OFDM system is proposed and its bit error rate performance under various impulsive noises over both Gaussian and UWB channel is extensively investigated, especially in mismatched scenarios. A robust decoder which is immune to noise mismatch is provided based on comparison of impulsive noises in time domain and frequency domain. The accurate estimation of the dynamic noise model could be very difficult or impossible at the receiver, thus a significant performance degradation may occur due to noise mismatch. In the second part of this dissertation, we prove that the minimax decoder in \cite, which instead of minimizing the average bit error probability aims at minimizing the worst bit error probability, is optimal and robust to certain noise model with unknown prior probabilities in two and higher dimensions. Besides turbo codes, another kind of error correcting codes which approach the Shannon capacity is low-density parity-check (LDPC) codes. In the last part of this dissertation, we extend the density evolution method for sum-product decoding using mismatched noises. We will prove that as long as the true noise type and the estimated noise type used in the decoder are both binary-input memoryless output symmetric channels, the output from mismatched log-likelihood ratio (LLR) computation is also symmetric. We will show the Shannon capacity can be evaluated for mismatched LLR computation and it can be reduced if the mismatched LLR computation is not an one-to-one mapping function. We will derive the Shannon capacity, threshold and stable condition of LDPC codes for mismatched BIAWGN and BIL noise types. The results show that the noise variance estimation errors will not affect the Shannon capacity and stable condition, but the errors do reduce the threshold. The mismatch in noise type will only reduce Shannon capacity when LLR computation is based on BIL

Factor Graph Based Detection Schemes for Mobile Terrestrial DVB Systems with Long OFDM Blocks

This PhD dissertation analyzes the performance of second generation digital video broadcasting (DVB) systems in mobile terrestrial environments and proposes an iterative detection algorithm based on factor graphs (FG) to reduce the distortion caused by the time variation of the channel, providing error-free communication in very severe mobile conditions. The research work focuses on mobile scenarios where the intercarrier interference (ICI) is very high: high vehicular speeds when long orthogonal frequency-division multiplexing (OFDM) blocks are used. As a starting point, we provide the theoretical background on the main topics behind the transmission and reception of terrestrial digital television signals in mobile environments, along with a general overview of the main signal processing techniques included in last generation terrestrial DVB systems. The proposed FG-based detector design is then assessed over a simpli ed bit-interleaved coded modulation (BICM)-OFDM communication scheme for a wide variety of mobile environments. Extensive simulation results show the e ectiveness of the proposed belief propagation (BP) algorithm over the channels of interest in this research work. Moreover, assuming that low density parity-check (LDPC) codes are decoded by means of FG-based algorithms, a high-order FG is de ned in order to accomplish joint signal detection and decoding into the same FG framework, o ering a fully parallel structure very suitable when long OFDM blocks are employed. Finally, the proposed algorithms are analyzed over the physical layer of DVB-T2 speci cation. Two reception schemes are proposed which exploit the frequency and time-diversity inherent in time-varying channels with the aim of achieving a reasonable trade-o among performance, complexity and latency.Doktoretza tesi honek bigarren belaunaldiko telebista digitalaren eraginkortasuna aztertzen du eskenatoki mugikorrean, eta faktoreen grafoetan oinarritzen den hartzaile iteratibo bat proposatzen du denboran aldakorra den kanalak sortzen duen distortsioa leundu eta seinalea errorerik gabe hartzea ahalbidetzen duena. Proposatutako detektorea BICM-OFDM komunikazio eskema orokor baten gainean ebaluatu da lurreko broadcasting kanalaren baldintzak kontutan hartuz. Simulazio emaitzek algoritmo honen eraginkortasuna frogatzen dute Doppler frekuentzia handietan. Ikerketa lanaren bigarren zatian, faktoreen grafoetan oinarritutako detektorea eskema turbo zabalago baten baitan txertatu da LDPC dekodi katzaile batekin batera. Hartzaile diseinu honen abantaila nagusia da OFDM simbolo luzeetara ondo egokitzen dela. Azkenik, proposatutako algoritmoa DVB-T2 katearen baitan inplementatu da, bi hartzaile eskema proposatu direlarik seinaleak duen dibertsitate tenporal eta frekuentziala probesteko, beti ere eraginkortasunaren, konplexutasunaren eta latentziaren arteko konpromisoa mantenduz.Este trabajo de tesis analiza el rendimiento de la segunda generación de la televisión digital terreste en escenarios móviles y propone un algoritmo iterativo basado en grafos de factores para la detección de la señal y la reducción de la distorsión causada por la variación temporal del canal, permitiendo así recibir la señal libre de errores. El detector basado en grafos de factores propuesto es evaluado sobre un esquema de comunicaciones general BICM-OFDM en condiciones de transmisión propios de canales de difusión terrestres. Los resultados de simulación presentados muestran la e ciencia del algoritmo de detección propuesto en presencia de frecuencias Doppler muy altas. En una segunda parte del trabajo de investigación, el detector propuesto es incorporado a un esquema turbo junto con un decodi cador LDPC, dando lugar a un receptor iterativo que presenta características especialmente apropiadas para su implementación en sistemas OFDM con longitudes de símbolo elevadas. Por último, se analiza la implementación del algoritmo propuesto sobre la cadena de recepción de DVB-T2. Se presentan dos esquemas de recepción que explotan la diversidad temporal y frecuencial presentes en la señal afectada por canales variantes en el tiempo, consiguiendo un compromiso razonable entre rendimiento, complejidad y latencia

Bandwidth-efficient communication systems based on finite-length low density parity check codes

Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part

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