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

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

Iterative multiuser detection with integrated channel estimation for turbo coded DS-CDMA.

In present days the demand of high bandwidth and data rate in wireless communications is increasing rapidly to accommodate multimedia applications, including services such as wireless video and high-speed Internet access. In this thesis, we propose a receiver algorithm for mobile communications systems which apply CDMA (Code division multiple access) as multiple access technique. Multiuser Detection and turbo coding are the two most powerful techniques for enhancing the performance of future wireless services. The standardization of direct sequence CDMA (DS-CDMA) systems in the third generation of mobile communication system has raised the interest in exploiting the capabilities and capacity of this type of Technology. However the conventional DS-CDMA system has the major drawback of multiple Access Interference (MAI). The MAI is unavoidable because receivers deal with the information which is transmitted not by a single information source but by several uncoordinated and geographically separated sources. To overcome this problem MUD is a promising approach to increase capacity. (Abstract shortened by UMI.)Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .C465. Source: Masters Abstracts International, Volume: 45-01, page: 0404. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Iterative Receiver for MIMO-OFDM System with ICI Cancellation and Channel Estimation

As a multi-carrier modulation scheme, Orthogonal Frequency Division Multiplexing (OFDM) technique can achieve high data rate in frequency-selective fading channels by splitting a broadband signal into a number of narrowband signals over a number of subcarriers, where each subcarrier is more robust to multipath. The wireless communication system with multiple antennas at both the transmitter and receiver, known as multiple-input multiple-output (MIMO) system, achieves high capacity by transmitting independent information over different antennas simultaneously. The combination of OFDM with multiple antennas has been considered as one of most promising techniques for future wireless communication systems. The challenge in the detection of a space-time signal is to design a low-complexity detector, which can efficiently remove interference resulted from channel variations and approach the interference-free bound. The application of iterative parallel interference canceller (PIC) with joint detection and decoding has been a promising approach. However, the decision statistics of a linear PIC is biased toward the decision boundary after the first cancellation stage. In this thesis, we employ an iterative receiver with a decoder metric, which considerably reduces the bias effect in the second iteration, which is critical for the performance of the iterative algorithm. Channel state information is required in a MIMO-OFDM system signal detection at the receiver. Its accuracy directly affects the overall performance of MIMO-OFDM systems. In order to estimate the channel in high-delay-spread environments, pilot symbols should be inserted among subcarriers before transmission. To estimate the channel over all the subcarriers, various types of interpolators can be used. In this thesis, a linear interpolator and a trigonometric interpolator are compared. Then we propose a new interpolator called the multi-tap method, which has a much better system performance. In MIMO-OFDM systems, the time-varying fading channels can destroy the orthogonality of subcarriers. This causes serious intercarrier interference (ICI), thus leading to significant system performance degradation, which becomes more severe as the normalized Doppler frequency increases. In this thesis, we propose a low-complexity iterative receiver with joint frequency- domain ICI cancellation and pilot-assisted channel estimation to minimize the effect of time-varying fading channels. At the first stage of receiver, the interference between adjacent subcarriers is subtracted from received OFDM symbols. The parallel interference cancellation detection with decision statistics combining (DSC) is then performed to suppress the interference from other antennas. By restricting the interference to a limited number of neighboring subcarriers, the computational complexity of the proposed receiver can be significantly reduced. In order to construct the time variant channel matrix in the frequency domain, channel estimation is required. However, an accurate estimation requiring complete knowledge of channel time variations for each block, cannot be obtained. For time- varying frequency-selective fading channels, the placement of pilot tones also has a significant impact on the quality of the channel estimates. Under the assumption that channel variations can be approximated by a linear model, we can derive channel state information (CSI) in the frequency domain and estimate time-domain channel parameters. In this thesis, an iterative low-complexity channel estimation method is proposed to improve the system performance. Pilot symbols are inserted in the transmitted OFDM symbols to mitigate the effect of ICI and the channel estimates are used to update the results of both the frequency domain equalizer and the PICDSC detector in each iteration. The complexity of this algorithm can be reduced because the matrices are precalculated and stored in the receiver when the placement of pilots symbols is fixed in OFDM symbols before transmission. Finally, simulation results show that the proposed MIMO-OFDM iterative receiver can effectively mitigate the effect of ICI and approach the ICI-free performance over time-varying frequency-selective fading channels

Soft information based protocols in network coded relay networks

Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol

Space-Time Codes Concatenated with Turbo Codes over Fading Channels

The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suffers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on efficient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and differential space-time codes. First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation. The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived. Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate differential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC offers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed

Soft information based protocols in network coded relay networks

Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol