Algebraic superposition of LDGM codes for cooperative diversity

Abstract-This paper presents a technique for achieving cooperative spatial diversity using serially concatenated low density generator matrix (LDGM) codes. Specifically, we consider a scenario in which a pair of transceivers employ algebraic superposition of error control codes to effect spatial diversity at their common destination. The construction of LDGM codes from a sparse generator matrix makes them a natural fit for such a cooperative diversity scheme. The simple decoder structure for graph based codes reduces the complexity at the destination compared with previously-proposed schemes using algebraic superposition of convolutional codes and turbo-like decoding. The result is a system with low encoding and decoding complexity and improved error performance

Polar Coding Schemes for Cooperative Transmission Systems

: In this thesis, a serially-concatenated coding scheme with a polar code as the outer code and a low density generator matrix (LDGM) code as the inner code is firstly proposed. It is shown that that the proposed scheme provides a method to improve significantly the low convergence of polar codes and the high error floor of LDGM codes while keeping the advantages of both such as the low encoding and decoding complexity. The bit error rate results show that the proposed scheme by reasonable design have the potential to approach a performance close to the capacity limit and avoid error floor effectively. Secondly, a novel transmission protocol based on polar coding is proposed for the degraded half-duplex relay channel. In the proposed protocol, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. It is proved that the scheme can achieve the capacity of the half-duplex relay channel while enjoying low encoding/decoding complexity. By modeling the practical system, we verify that the proposed scheme outperforms the conventional scheme designed by low-density parity-check codes by simulations. Finally, a generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components (MRN-ORCs). In such a protocol, each relay node decodes the received source message with the help of partial information from previous nodes and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. For the design of polar codes, the nested structures are constructed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. It is proved that the proposed scheme achieves the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes

Design of Network Coding Schemes and RF Energy Transfer in Wireless Communication Networks

This thesis focuses on the design of network coding schemes and radio frequency (RF) energy transfer in wireless communication networks. During the past few years, network coding has attracted significant attention because of its capability to transmit maximum possible information in a network from multiple sources to multiple destinations via a relay. Normally, the destinations are only able to decode the information with sufficient prior knowledge. To enable the destinations to decode the information in the cases with less/no prior knowledge, a pattern of nested codes with multiple interpretations using binary convolutional codes is constructed in a multi-source multi-destination wireless relay network. Then, I reconstruct nested codes with convolutional codes and lattice codes in multi-way relay channels to improve the spectrum efficiency. Moreover, to reduce the high decoding complexity caused by the adopted convolutional codes, a network coded non-binary low-density generator matrix (LDGM) code structure is proposed for a multi-access relay system. Another focus of this thesis is on the design of RF-enabled wireless energy transfer (WET) schemes. Much attention has been attracted by RF-enabled WET technology because of its capability enabling wireless devices to harvest energy from wireless signals for their intended applications. I first configure a power beacon (PB)-assisted wireless-powered communication network (PB-WPCN), which consists of a set of hybrid access point (AP)-source pairs and a PB. Both cooperative and non-cooperative scenarios are considered, based on whether the PB is cooperative with the APs or not. Besides, I develop a new distributed power control scheme for a power splitting-based interference channel (IFC) with simultaneous wireless information and power transfer (SWIPT), where the considered IFC consists of multiple source-destination pairs

Nested turbo codes for the costa problem

Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has lately become a very active research area. In this paper, we first offer code design guidelines in terms of source- channel coding for algebraic binning. We then address practical code design based on nested lattice codes and propose nested turbo codes using turbo-like trellis-coded quantization (TCQ) for source coding and turbo trellis-coded modulation (TTCM) for channel coding. Compared to TCQ, turbo-like TCQ offers structural similarity between the source and channel coding components, leading to more efficient nesting with TTCM and better source coding performance. Due to the difference in effective dimensionality between turbo-like TCQ and TTCM, there is a performance tradeoff between these two components when they are nested together, meaning that the performance of turbo-like TCQ worsens as the TTCM code becomes stronger and vice versa. Optimization of this performance tradeoff leads to our code design that outperforms existing TCQ/TCM and TCQ/TTCM constructions and exhibits a gap of 0.94, 1.42 and 2.65 dB to the Costa capacity at 2.0, 1.0, and 0.5 bits/sample, respectively

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

Near-capacity fixed-rate and rateless channel code constructions

Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder

Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying strategy by incorporating relay-generated information bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at the destination. To analyze the performance of bilayer LDPC codes, bilayer density evolution is devised as an extension of the standard density evolution algorithm. Based on bilayer density evolution, a design methodology is developed for the bilayer codes in which the degree distribution is iteratively improved using linear programming. Further, in order to approach the theoretical decode-and-forward rate for a wide range of channel parameters, this paper proposes two different forms bilayer codes, the bilayer-expurgated and bilayer-lengthened codes. It is demonstrated that a properly designed bilayer LDPC code can achieve an asymptotic infinite-length threshold within 0.24 dB gap to the Shannon limits of two different channels simultaneously for a wide range of channel parameters. By practical code construction, finite-length bilayer codes are shown to be able to approach within a 0.6 dB gap to the theoretical decode-and-forward rate of the relay channel at a block length of $10^5$ and a bit-error probability (BER) of $10^{-4}$. Finally, it is demonstrated that a generalized version of the proposed bilayer code construction is applicable to relay networks with multiple relays.Comment: Submitted to IEEE Trans. Info. Theor

Communication coopérative, codage distribué, réseaux sans fil de relais

With the rapid growth of wireless technologies, devices and mobile applications, the quest of high throughput and omnipresent connectivity in wireless networks increases rapidly as well. It is well known that cooperation increases significantly the spectral efficiency (coding gain) and the reliability (diversity gain) of the transmission between the nodes. The concept of cooperation in wireless relays network is still one of the most active research topics in wireless communication, scientists are still searching for the optimal cooperation strategies that make the possible gains at the maximum. Cooperation results when nodes in a network share their power and/or bandwidth resources to mutually enhance their transmissions and receptions. In wireless relay networks, the relays are special nodes that are used to improve the quality of communication between the source nodes and the destination nodes. In particular, the use of relays guarantees more efficient and reliable networks. In this work, we focus on a special wireless relay network where a set of sources (mobiles) want to communicate their messages to a common destination (base station) with the help of a set of relaysAt the beginning of this work, we focused on the cooperative scheme where the relay, after a fixed portion of time, tries to understand (decode) the source’s messages and forwards helpful signals for the correctly decoded ones. One of the limitations of the previous cooperative scheme is the fixe listening time of the relays, which cannot be adapted to the quality of the instantaneous sources-relays links. To solve this problem we propose a more advanced cooperative scheme where the listening time of each relay can be dynamic and not fixed in advanced. So the relay that has strong links with the sources can start cooperating earlier than the other relays with weak links. Currently, we are investigating other directions of possible improvements, for example, how can we use feedback signals to improve the efficiency of the network.Avec la croissance rapide des appareils et des applications mobiles, les besoins en débit et en connectivité dans les réseaux sans fil augmentent rapidement. Il est prouvé que les communications coopératives peuvent augmenter significativement l’efficacité spectrale et la fiabilité des transmissions entre les nœuds extrémaux. Le concept de coopération dans un réseau sans fil compte parmi les sujets de recherche les plus actifs en télécommunications, le but étant d'identifier les stratégies de coopération qui maximiseraient les gains en efficacité spectrale et en puissance d'émission. Pour coopérer, les nœuds du réseau partagent leurs ressources (énergie, bande de fréquence, etc. ...) pour améliorer mutuellement leurs transmissions et leurs réceptions. Dans les réseaux sans fil avec relais, les relais sont des nœuds dédiés à améliorer la qualité de la communication entre les nœuds sources et destination.Dans la première partie de la thèse, nous nous concentrons sur un réseau sans fil avec relais spécifique où l'ensemble de sources (mobiles) veulent communiquer leurs messages à une destination commune (station de base) avec l'aide d'un ensemble de relais (contexte cellulaire, sens montant). Nous étudions, sur les plans théorique et pratique, un schéma coopératif dans lequel les relais, après une durée d'écoute fixée a priori, essayent de décoder les messages des sources et commencent à transmettre des signaux utiles pour ceux qui sont décodés correctement. Ces signaux utiles sont le résultat d'un codage canal-réseau conjoint.Une des limitations du système coopératif précédent est précisément que le temps d'écoute des relais est figé et ne peut pas être adapté à la qualité fluctuante (aléatoire) des liens instantanés sources-relais. Pour pallier cette difficulté, nous proposons et analysons, dans une seconde partie de la thèse, un schéma de coopération plus avancé où le temps d'écoute de chaque relais peut être dynamique. Dans ces conditions, un relais bénéficiant d'une meilleure qualité de réception des sources peut commencer à coopérer plus tôt que d'autres relais ayant une qualité de réception moindre.Enfin, dans la troisième et dernière partie de la thèse, nous considérons la présence d'une information de retour limitée (limited feedback) entre la destination et les sources et les relais, et tentons de caractériser l'efficacité spectrale d'un tel système