Codes on Graphs and More

Modern communication systems strive to achieve reliable and efficient information transmission and storage with affordable complexity. Hence, efficient low-complexity channel codes providing low probabilities for erroneous receptions are needed. Interpreting codes as graphs and graphs as codes opens new perspectives for constructing such channel codes. Low-density parity-check (LDPC) codes are one of the most recent examples of codes defined on graphs, providing a better bit error probability than other block codes, given the same decoding complexity. After an introduction to coding theory, different graphical representations for channel codes are reviewed. Based on ideas from graph theory, new algorithms are introduced to iteratively search for LDPC block codes with large girth and to determine their minimum distance. In particular, new LDPC block codes of different rates and with girth up to 24 are presented. Woven convolutional codes are introduced as a generalization of graph-based codes and an asymptotic bound on their free distance, namely, the Costello lower bound, is proven. Moreover, promising examples of woven convolutional codes are given, including a rate 5/20 code with overall constraint length 67 and free distance 120. The remaining part of this dissertation focuses on basic properties of convolutional codes. First, a recurrent equation to determine a closed form expression of the exact decoding bit error probability for convolutional codes is presented. The obtained closed form expression is evaluated for various realizations of encoders, including rate 1/2 and 2/3 encoders, of as many as 16 states. Moreover, MacWilliams-type identities are revisited and a recursion for sequences of spectra of truncated as well as tailbitten convolutional codes and their duals is derived. Finally, the dissertation is concluded with exhaustive searches for convolutional codes of various rates with either optimum free distance or optimum distance profile, extending previously published results

Feedback Communication Systems with Limitations on Incremental Redundancy

This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes. The information-theoretic analysis shows that values of $N$ relatively close to the expected latency yield the same random-coding achievability expansion as with $N = \infty$. However, the penalty introduced in the expansion by limiting decoding times is linear in the interval between decoding times. For binary symmetric channels, the RCSP approximation provides an efficiently-computed approximation of performance that shows excellent agreement with a family of rate-compatible, tail-biting convolutional codes in the short-latency regime. For the additive white Gaussian noise channel, bounded-distance decoding simplifies the computation of the marginal RCSP approximation and produces similar results as analysis based on maximum-likelihood decoding for latencies greater than 200. The efficiency of the marginal RCSP approximation facilitates optimization of the lengths of incremental transmissions when the number of incremental transmissions is constrained to be small or the length of the incremental transmissions is constrained to be uniform after the first transmission. Finally, an RCSP-based decoding error trajectory is introduced that provides target error rates for the design of rate-compatible code families for use in feedback communication systems.Comment: 23 pages, 15 figure

Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases

Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems

Cancelamento de interferência em sistemas celulares distribuídos

Doutoramento em Engenharia ElectrotécnicaO tema principal desta tese é o problema de cancelamento de interferência para sistemas multi-utilizador, com antenas distribuídas. Como tal, ao iniciar, uma visão geral das principais propriedades de um sistema de antenas distribuídas é apresentada. Esta descrição inclui o estudo analítico do impacto da ligação, dos utilizadores do sistema, a mais antenas distribuídas. Durante essa análise é demonstrado que a propriedade mais importante do sistema para obtenção do ganho máximo, através da ligação de mais antenas de transmissão, é a simetria espacial e que os utilizadores nas fronteiras das células são os mais bene ciados. Tais resultados são comprovados através de simulação. O problema de cancelamento de interferência multi-utilizador é considerado tanto para o caso unidimensional (i.e. sem codi cação) como para o multidimensional (i.e. com codi cação). Para o caso unidimensional um algoritmo de pré-codi cação não-linear é proposto e avaliado, tendo como objectivo a minimização da taxa de erro de bit. Tanto o caso de portadora única como o de multipla-portadora são abordados, bem como o cenário de antenas colocadas e distribuidas. É demonstrado que o esquema proposto pode ser visto como uma extensão do bem conhecido esquema de zeros forçados, cuja desempenho é provado ser um limite inferior para o esquema generalizado. O algoritmo é avaliado, para diferentes cenários, através de simulação, a qual indica desempenho perto do óptimo, com baixa complexidade. Para o caso multi-dimensional um esquema para efectuar "dirty paper coding" binário, tendo como base códigos de dupla camada é proposto. No desenvolvimento deste esquema, a compressão com perdas de informação, é considerada como um subproblema. Resultados de simulação indicam transmissão dedigna proxima do limite de Shannon.This thesis focus on the interference cancellation problem for multiuser distributed antenna systems. As such it starts by giving an overview of the main properties of a distributed antenna system. This overview includes, an analytical investigation of the impact of the connection of additional distributed antennas, to the system users. That analysis shows that the most important system property to reach the maximum gain, with the connection of additional transmit antennas, is spatial symmetry and that the users at the cell borders are the most bene ted. The multiuser interference problem has been considered for both the one dimensional (i.e. without coding) and multidimensional (i.e. with coding) cases. In the unidimensional case, we propose and evaluate a nonlinear precoding algorithm for the minimization of the bit-error-rate, of a multiuser MIMO system. Both the single-carrier and multi-carrier cases are tackled as well as the co-located and distributed scenarios. It is demonstrated that the proposed scheme can be viewed as an extension of the well-known zero-forcing, whose performance is proven to be a lower bound for the generalized scheme. The algorithm was validated extensively through numerical simulations, which indicate a performance close to the optimal, with reduced complexity. For the multi-dimensional case, a binary dirty paper coding scheme, base on bilayer codes, is proposed. In the development of this scheme, we consider the lossy compression of a binary source as a sub-problem. Simulation results indicate reliable transmission close to the Shannon limit

Nouvelle forme d'onde et récepteur avancé pour la télémesure des futurs lanceurs

Les modulations à phase continue (CPMs) sont des méthodes de modulations robuste à la noncohérence du canal de propagation. Dans un contexte spatial, les CPM sont utilisées dans la chaîne de transmission de télémesure de la fusée. Depuis les années 70, la modulation la plus usitée dans les systèmes de télémesures est la modulation CPFSK continuous phase frequency shift keying filtrée. Historiquement, ce type de modulation est concaténée avec un code ReedSolomon (RS) afin d'améliorer le processus de décodage. Côté récepteur, les séquences CPM non-cohérentes sont démodulées par un détecteur Viterbi à sortie dure et un décodeur RS. Néanmoins, le gain du code RS n'est pas aussi satisfaisant que des techniques de codage moderne capables d'atteindre la limite de Shannon. Actualiser la chaîne de communication avec des codes atteignant la limite de Shannon tels que les codes en graphe creux, implique deremanier l’architecture du récepteur usuel pour un détecteur à sortie souple. Ainsi, on propose dans cette étude d' élaborer un détecteur treillis à sortie souple pour démoduler les séquences CPM non-cohérentes. Dans un deuxième temps, on concevra des schémas de pré-codages améliorant le comportement asymptotique du récepteur non-cohérent et dans une dernière étape on élabora des codes de parité à faible densité (LDPC) approchant la limite de Shannon

Modeling BLER Performance of Punctured Turbo Codes

In this thesis the author constructed a mathematical model using a continuous and differentiable expression, that approximates the BLER (Block Error Rate) performance of punctured turbo codes for different (SNR) Signal to Noise ratios, block lengths and MCS (Modulation and Coding Schemes) rates. The model can be used for two different purposes. First, the model can be used to replace look-up tables in system level simulators; bringing the advantage of introducing a continuous set of block lengths and MCS rates, not available in look-up tables. Second, with the help of this function communications systems can be optimized using analytical methods based on differentiation. The construction of the mathematical model was developed for the particular case of the Turbo Code (13, 15)8 and QPSK modulation; but the derivation of the model can be generalized to other Turbo Codes and modulation types. The model was also applied to a different link configuration using 16 QAM modulation

Formes d'ondes avancées et traitements itératifs pour les canaux non linéaires satellites

L'augmentation de l'efficacité spectrale des transmissions mono-porteuses sur un lien de diffusion par satellite est devenu un défi d'envergure afin de pallier la demande croissante en débits de transmission. Si des techniques émergentes de transmissions encouragent l'utilisation de modulations à ordre élevé telles que les modulations de phase et d'amplitude (APSK), certaines dégradations sont encourues lors du traitement à bord du satellite. En effet, en raison de l'utilisation d'amplificateurs de puissance ainsi que de filtres à mémoires, les modulations d'ordre élevé subissent des distorsions non-linéaires dues à la fluctuation de leur enveloppe, ce qui nécessite des traitements au sein de l'émetteur ou bien au sein du récepteur. Dans cette thèse, nous nous intéressons au traitement de l'interférence non-linéaire au sein du récepteur, avec une attention particulière aux égaliseurs itératifs qui améliorent les performances du système au prix d'une complexité élevée. A partir du modèle temporel des interférences non-linéaires induites par l'amplificateur de puissance, des algorithmes de réception optimaux et sous optimaux sont dérivés, et leurs performances comparées. Des égaliseurs à complexité réduite sont aussi étudiés dans le but d'atteindre un compromis performances-complexité satisfaisant. Ensuite, un modèle des non-linéarités est dérivé dans le domaine fréquentiel, et les égaliseurs correspondants sont présentés. Dans un second temps, nous analysons et dérivons des récepteurs itératifs pour l'interférence entre symboles non linéaire. L'objectif est d'optimiser les polynômes de distributions d'un code externe basé sur les codes de contrôle de parité à faible densité (LDPC) afin de coller au mieux à la sortie de l'égaliseur. Le récepteur ainsi optimisé atteint de meilleures performances comparé à un récepteur non optimisé pour le canal non-linéaire. Finalement, nous nous intéressons à une classe spécifique de techniques de transmissions mono-porteuse basée sur le multiplexage par division de fréquence (SC-OFDM) pour les liens satellites. L'avantage de ces formes d'ondes réside dans l'efficacité de leur égaliseur dans le domaine fréquentiel. Des formules analytiques de la densité spectrale de puissance et du rapport signal sur bruit et interférence sont dérivées et utilisées afin de prédire les performances du système. ABSTRACT : Increasing both the data rate and power efficiency of single carrier transmissions over broadcast satellite links has become a challenging issue to comply with the urging demand of higher transmission rates. If emerging transmission techniques encourage the use of high order modulations such as Amplitude and Phase Shift Keying (APSK) and Quadrature Amplitude Modulation (QAM), some channel impairments arise due to onboard satellite processing. Indeed, due to satellite transponder Power Amplifiers (PA) as well as transmission filters, high order modulations incur non linear distortions due to their high envelope fluctuations which require specific processing either at the transmitter or at the receiver. In this thesis, we investigate on non linear interference mitigation at the receiver with a special focus on iterative equalizers which dramatically enhance the performance at the cost of additional complexity. Based on the time domain model of the non linear interference induced by the PA, optimal and sub-optimal receiving algorithms are proposed and their performance compared. Low complexity implementations are also investigated for the sake of a better complexity-performance trade-off. Then, a non linear frequency domain model is derived and the corresponding frequency equalizers are investigated. In the second part, we analyse and design an iterative receiver for the non linear Inter Symbol Interference (ISI) channel. The objective is to optimize an outer Low Density Parity Check (LDPC) code distribution polynomials so as to best fit the inner equalizer Extrinsic information. The optimized receiver is shown to achieve better performance compared to a code only optimized for linear ISI channel. Finally, we investigate on a specific class of single carrier transmissions relying on Single Carrier Orthogonal Frequency Division Multiplexing (SCO-FDM) for satellite downlink. The advantage of such waveforms lies in their practical receiver implementation in the frequency domain. General analytical formulas of the power spectral density and signal to noise and interference ratio are derived and used to predict the bit error rate for frequency selective multiplexers