Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Relay-Induced Error Propagation Reduction for Decode-and-Forward Cooperative Communications

An attractive hybrid method of mitigating the effects of error propagation that may be imposed by the relay node (RN) on the destination node (DN) is proposed. We selected the most appropriate relay location for achieving a specific target Bit Error Ratio (BER) at the relay and signalled the RN-BER to the DN. The knowledge of this BER was then exploited by the decoder at the destination. Our simulation results show that when the BER at the RN is low, we do not have to activate the RN-BER aided decoder at the DN. However, when the RN-BER is high, significant system performance improvements may be achieved by activating the proposed RN-BER based decoding technique at the DN. For example, a power-reduction of up to about 19dB was recorded at a DN BER of 10-4

Distributed Self-Concatenated Coding for Cooperative Communication

In this paper, we propose a power-efficient distributed binary self-concatenated coding scheme using iterative decoding (DSECCC-ID) for cooperative communications. The DSECCC-ID scheme is designed with the aid of binary extrinsic information transfer (EXIT) charts. The source node transmits self-concatenated convolutional coded (SECCC) symbols to both the relay and destination nodes during the first transmission period. The relay performs SECCC-ID decoding, where it mayor may not encounter decoding errors. It then reencodes the information bits using a recursive systematic convolutional (RSC) code during the second transmission period. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel concatenated encoder. At the destination node, three-component DSECCC-ID decoding is performed. The EXIT chart gives us an insight into operation of the distributed coding scheme, which enables us to significantly reduce the transmit power by about 3.3 dB in signal-to-noise ratio (SNR) terms, as compared with a noncooperative SECCC-ID scheme at a bit error rate (BER) of 10-5. Finally, the proposed system is capable of performing within about 1.5 dB from the two-hop relay-aided network’s capacity at a BER of 10-5 , even if there may be decoding errors at the relay

Quasi-orthogonal space-frequency coding in non-coherent cooperative broadband networks

© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.So far, complex valued orthogonal codes have been used differentially in cooperative broadband networks. These codes however achieve less than unitary code rate when utilized in cooperative networks with more than two relays. Therefore, the main challenge is how to construct unitary rate codes for non-coherent cooperative broadband networks with more than two relays while exploiting the achievable spatial and frequency diversity. In this paper, we extend full rate quasi-orthogonal codes to differential cooperative broadband networks where channel information is unavailable. From this, we propose a generalized differential distributed quasi-orthogonal space-frequency coding (DQSFC) protocol for cooperative broadband networks. Our proposed scheme is able to achieve full rate, and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of our scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, we derive sufficient conditions for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity.Peer reviewe

Self-concatenated coding for wireless communication systems

In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput

Multiple-Access Relaying with Network Coding: Iterative Network/Channel Decoding with Imperfect CSI

International audienceIn this paper, we study the performance of the four-node multiple-access relay channel with binary Network Coding (NC) in various Rayleigh fading scenarios. In particular, two relay protocols, decode-and-forward (DF) and demodulate-and-forward (DMF) are considered. In the first case, channel decoding is performed at the relay before NC and forwarding. In the second case, only demodulation is performed at the relay. The contributions of the paper are as follows: (1) two joint network/channel decoding (JNCD) algorithms, which take into account possible decoding error at the relay, are developed in both DF and DMF relay protocols; (2) both perfect channel state information (CSI) and imperfect CSI at receivers are studied. In addition, we propose a practical method to forward the relays error characterization to the destination (quantization of the BER). This results in a fully practical scheme. (3) We show by simulation that the number of pilot symbols only affects the coding gain but not the diversity order, and that quantization accuracy affects both coding gain and diversity order. Moreover, when compared with the recent results using DMF protocol, our proposed DF protocol algorithm shows an improvement of 4 dB in fully interleaved Rayleigh fading channels and 0.7 dB in block Rayleigh fading channels

Two–Way Relaying Communications with OFDM and BICM/BICM-ID

Relay-aided communication methods have gained strong interests in academic community and been applied in various wireless communication scenarios. Among different techniques in relay-aided communication system, two-way relaying communication (TWRC) achieves the highest spectral efficiency due to its bi-directional transmission capability. Nevertheless, different from the conventional point-to-point communication system, TWRC suffers from detection quality degradation caused by the multiple-access interference (MAI). In addition, because of the propagation characteristics of wireless channels, fading and multipath dispersion also contribute strongly to detection errors. Therefore, this thesis is mainly concerned with designing transmission and detection schemes to provide good detection quality of TWRC while taking into account the negative impacts of fading, multipath dispersion and multiple-access interference. First, a TWRC system operating over multipath fading channels is considered and orthogonal frequency-division multiplexing (OFDM) is adopted to handle the inter-symbol interference (ISI) caused by the multipath dispersion. In particular, adaptive physical-layer network coding (PNC) is employed to address the MAI issue. By analyzing the detection error probability, various adaptive PNC schemes are discussed for using with OFDM and the scheme achieving the best trade-off among performance, overhead and complexity is suggested. In the second part of the thesis, the design of distributed precoding in TWRC using OFDM under multipath fading channels is studied. The objective is to design a distributed precoding scheme which can alleviate MAI and achieve multipath diversity to combat fading. Specifically, three types of errors are introduced when analyzing the error probability in the multiple access (MA) phase. Through analysis and simulation, the scheme that performs precoding in both time and frequency domains is demonstrated to achieve the maximum diversity gains under all types of errors. Finally, the last part of the thesis examines a communication system incorporating forward error correction (FEC) codes. Specifically, bit-interleaved code modulation (BICM) without and with iterative decoding (BICM-ID) are investigated in a TWRC system. Distributed linear constellation precoding (DLCP) is applied to handle MAI and the design of DLCP in a TWRC system using BICM/BICM-ID is discussed. Taking into account the multiple access channel from the terminal nodes to the relay node, decoding based on the quaternary code representation is introduced. Several error probability bounds are derived to aid in the design of DLCP. Based on these bounds, optimal parameters of DLCP are obtained through analysis and computer search. It is also found that, by combining XORbased network coding with successful iterative decoding, the MAI is eliminated and thus DLCP is not required in a BICM-ID system