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

Adaptive Equalization and Capacity Analysis for Amplify-and-Forward Relays

Recent research has shown that multiple-input multiple-output (MIMO) systems provide high spectral efficiencies and error performance gains. However, the use of multiple antennas in mobile terminals may not be very practical. Certainly there is limited space and other implementation issues which make this a challenging problem. Therefore, to harness the diversity gains afforded by MIMO transmitter diversity techniques, while maintaining a minimal number of antennas on each handset, cooperative diversity techniques have been proposed. In addition, attention has also been given to combining wireless relaying systems with MIMO techniques to improve capacity, coverage, and obtain better diversity at the expense of increased node complexity. This thesis considers the design and analysis of cooperative diversity systems and MIMO amplify-and-forward relaying systems. In particular, we investigate adaptive time- and frequency-domain equalization techniques for cooperative diversity systems using space-time block codes (STBC). For MIMO relaying systems, we analyze the ergodic capacity of various systems and compare different amplify-and-forward methods in terms of system capacity performance. We propose a new block time-domain adaptive equalization structure for time reversal-space time block coding (TR-STBC) systems, which eliminates the separate decoder and also the need for explicit channel state information (CSI) estimation at the receiver. Our simulation results show that the time-domain adaptive block equalizer performs better than the frequency-domain counterpart but at the cost of increased complexity. Then, we extend this time-domain adaptive equalization scheme to distributed TR-STBC systems. We also develop a frequency-domain counterpart for the distributed systems. Our simulation results show that the adaptive algorithms work well for Protocols I and III proposed by Nabar et al. The time-domain adaptive algorithms perform better than the frequency-domain algorithms, and overall the Protocol I receivers outperform the Protocol III receivers. We also show that, if only the Protocol III receiver is used, it can be susceptible to noise amplification due to a weaker source-to-relay link compared to the relay-to-destination link. This problem can be mitigated by using the Protocol I receivers with some extra complexity but much superior diversity performance. We also present an ergodic capacity analysis of an amplify-and-forward (AF) MIMO two-hop system including the direct link and validate the analysis with simulations. We show that having the direct link improves the capacity due to diversity and quantify this improvement. We also present an ergodic capacity analysis of an AF MIMO two-hop, two relay system. Our results verify the capacity gain of relaying systems with two relays due to the extra diversity compared to a single relaying system. However, the results also show that when one of the source-to-relay links has a markedly higher SNR compared to the other, a single relay system has better capacity than a two relay system. Finally, we compare three types of relay amplification methods: a) average amplification, b) instantaneous channel amplification, and c) instantaneous power amplification. The instantaneous power amplification method has a higher mean capacity but with a higher variance. Also, it requires additional information at the destination and would create enormous overheads compared to the other methods. We also find that the instantaneous channel amplification method has almost no advantage in terms of the mean capacity but its capacity is less variable than the average amplification method. On the other hand, the average amplification method is simpler to implement as it does not require channel estimation at the relaying terminal