Labeling Diversity for 2x2 WLAN Coded-Cooperative Networks

Labelling diversity is an efficient technique recently proposed in the literature and aims to improve the bit error rate(BER) performance of wireless local area network (WLAN) systems with two transmit and two receive antennas without increasing the transmit power and bandwidth requirements. In this paper, we employ labelling diversity with different space-time channel codes such as convolutional, turbo and low density parity check (LDPC) for both point-to-point and coded-cooperative communication scenarios. Joint iterative decoding schemes for distributed turbo and LDPC codes are also presented. BER performance bounds at an error floor (EF) region are derived and verified with the help of numerical simulations for both cooperative and non-cooperative schemes. Numerical simulations show that the coded-cooperative schemes with labelling diversity achieve better BER performances and use of labelling diversity at the source node significantly lowers relay outage probability and hence the overall BER performance of the coded-cooperative scheme is improved manifolds

Turbo Detection of Symbol-Based Non-Binary LDPC-Coded Space-time Signals using Sphere Packing Modulation

A recently proposed space-time signal construction method that combines orthogonal design with sphere packing, referred to here as (STBC-SP), has shown useful performance improvements over Alamouti’s conventional orthogonal design. As a further advance, non-binary LDPC codes have been capable of attaining substantial performance improvements over their binary counterparts. In this paper, we demonstrate that the performance of STBC-SP systems can be further improved by concatenating sphere packing aided modulation with non-binary LDPC codes and performing symbolbased turbo detection. We present simulation results for the proposed scheme communicating over a correlated Rayleigh fading channel. At a BER of 10?6, the proposed symbolbased turbo-detected STBC-SP scheme was capable of achieving a coding gain of approximately 26.6dB over the identical throughput 1 bit/symbol uncoded STBC-SP benchmarker scheme. The proposed scheme also achieved a coding gain of approximately 3dB at a BER of 10?6 over a recently proposed bit-based turbo-detected STBC-SP benchmarker scheme

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

Turbo-Detected Unequal Protection MPEG-4 Wireless Video Telephony using Multi-Level Coding, Trellis Coded Modulation and Space-Time Trellis Coding

Most multimedia source signals are capable of tolerating lossy, rather than lossless delivery to the human eye, ear and other human sensors. The corresponding lossy and preferably low-delay multimedia source codecs however exhibit unequal error sensitivity, which is not the case for Shannon’s ideal entropy codec. This paper proposes a jointly optimised turbo transceiver design capable of providing unequal error protection for MPEG-4 coding aided wireless video telephony. The transceiver investigated consists of space-time trellis coding (STTC) invoked for the sake of mitigating the effects of fading, in addition to bandwidth efficient trellis coded modulation or bit-interleaved coded modulation, combined with a multi-level coding scheme employing either two different-rate non-systematic convolutional codes (NSCs) or two recursive systematic convolutional codes for yielding a twin-class unequal-protection. A single-class protection based benchmark scheme combining STTC and NSC is used for comparison with the unequal-protection scheme advocated. The video performance of the various schemes is evaluated when communicating over uncorrelated Rayleigh fading channels. It was found that the proposed scheme requires about 2.8 dBs lower transmit power than the benchmark scheme in the context of the MPEG-4 videophone transceiver at a similar decoding complexity

Near-Capacity Turbo Trellis Coded Modulation Design

Bandwidth efficient parallel-concatenated Turbo Trellis Coded Modulation (TTCM) schemes were designed for communicating over uncorrelated Rayleigh fading channels. A symbol-based union bound was derived for analysing the error floor of the proposed TTCM schemes. A pair of In-phase (I) and Quadrature-phase (Q) interleavers were employed for interleaving the I and Q components of the TTCM coded symbols, in order to attain an increased diversity gain. The decoding convergence of the IQ-TTCM schemes was analysed using symbol based EXtrinsic Information Transfer (EXIT) charts. The best TTCM component codes were selected with the aid of both the symbol-based union bound and non-binary EXIT charts for the sake of designing capacity-approaching IQ-TTCM schemes in the context of 8PSK, 16QAM and 32QAM signal sets. It will be shown that our TTCM design is capable of approaching the channel capacity within 0.5 dB at a throughput of 4 bit/s/Hz, when communicating over uncorrelated Rayleigh fading channels using 32QAM

Variable Length Space Time Coded Modulation

A Variable Length Space Time Coded Modulation (VL-STCM) scheme capable of simultaneously providing coding, multiplexing and diversity gains is proposed. The scheme advocated achieves its best performance for correlated sources, where the source symbols exhibit a nonuniform probability of occurrence. The source symbols are encoded using an optimal trellis encoder into variablelength modulated signals and mapped to both the spatial and time domains. More explicitly, the proposed VL-STCM arrangement is a jointly designed source coding, channel coding, modulation and spatial diversity/multiplexing scheme. It is shown that the higher the source correlation, the higher the achievable performance gain of the scheme. Furthermore, the performance of the VL-STCM scheme is about 6 dB better than that of the Fixed Length STCM (FL-STCM) benchmarker at a source symbol error ratio of 10?4

A Purely Symbol-Based Precoded and LDPC-Coded Iterative-Detection Assisted Sphere-Packing Modulated Space-Time Coding Scheme

In this contribution, we propose a purely symbol-based LDPC-coded scheme based on a Space-Time Block Coding (STBC) signal construction method that combines orthogonal design with sphere packing, referred to here as (STBCSP). We demonstrate that useful performance improvements may be attained when sphere packing aided modulation is concatenated with non-binary LDPC especially, when performing purely symbol-based turbo detection by exchanging extrinsic information between the non-binary LDPC decoder and a rate-1 non-binary inner precoder. We also investigate the convergence behaviour of this symbol-based concatenated scheme with the aid of novel non-binary Extrinsic Information Transfer (EXIT) Charts. The proposed symbol-based turbo-detected STBC-SP scheme exhibits a 'turbo-cliff' at Eb/N0 = 5.0 dB and achieves an Eb/N0 gain of 19.2dB at a BER of 10-5 over Alamouti’s scheme

On the Convergence Speed of Turbo Demodulation with Turbo Decoding

Iterative processing is widely adopted nowadays in modern wireless receivers for advanced channel codes like turbo and LDPC codes. Extension of this principle with an additional iterative feedback loop to the demapping function has proven to provide substantial error performance gain. However, the adoption of iterative demodulation with turbo decoding is constrained by the additional implied implementation complexity, heavily impacting latency and power consumption. In this paper, we analyze the convergence speed of these combined two iterative processes in order to determine the exact required number of iterations at each level. Extrinsic information transfer (EXIT) charts are used for a thorough analysis at different modulation orders and code rates. An original iteration scheduling is proposed reducing two demapping iterations with reasonable performance loss of less than 0.15 dB. Analyzing and normalizing the computational and memory access complexity, which directly impact latency and power consumption, demonstrates the considerable gains of the proposed scheduling and the promising contributions of the proposed analysis.Comment: Submitted to IEEE Transactions on Signal Processing on April 27, 201

Performance Analysis of Iteratively Decoded Variable-Length Space-Time Coded Modulation

It is demonstrated that iteratively Decoded Variable Length Space Time Coded Modulation (VL-STCM-ID) schemes are capable of simultaneously providing both coding gain as well as multiplexing and diversity gain. The VL-STCM-ID arrangement is a jointly designed iteratively decoded scheme combining source coding, channel coding, modulation as well as spatial diversity/multiplexing. In this contribution, we analyse the iterative decoding convergence of the VL-STCM-ID scheme using symbol-based three-dimensional EXIT charts. The performance of the VL-STCM-ID scheme is shown to be about 14.6 dB better than that of the Fixed Length STCM (FL-STCM) benchmarker at a source symbol error ratio of 10?4, when communicating over uncorrelated Rayleigh fading channels. The performance of the VL-STCM-ID scheme when communicating over correlated Rayleigh fading channels using imperfect channel state information is also studied

User-Antenna Selection for Physical-Layer Network Coding based on Euclidean Distance

In this paper, we present the error performance analysis of a multiple-input multiple-output (MIMO) physical-layer network coding (PNC) system with two different user-antenna selection (AS) schemes in asymmetric channel conditions. For the first antenna selection scheme (AS1), where the user-antenna is selected in order to maximize the overall channel gain between the user and the relay, we give an explicit analytical proof that for binary modulations, the system achieves full diversity order of $min(N_A , N_B ) \times N_R$ in the multiple-access (MA) phase, where $N_A$, $N_B$ and $N_R$ denote the number of antennas at user $A$, user $B$ and relay $R$ respectively. We present a detailed investigation of the diversity order for the MIMO-PNC system with AS1 in the MA phase for any modulation order. A tight closed-form upper bound on the average SER is also derived for the special case when $N_R = 1$, which is valid for any modulation order. We show that in this case the system fails to achieve transmit diversity in the MA phase, as the system diversity order drops to $1$ irrespective of the number of transmit antennas at the user nodes. Additionally, we propose a Euclidean distance (ED) based user-antenna selection scheme (AS2) which outperforms the first scheme in terms of error performance. Moreover, by deriving upper and lower bounds on the diversity order for the MIMO-PNC system with AS2, we show that this system enjoys both transmit and receive diversity, achieving full diversity order of $\min(N_A, N_B) \times N_R$ in the MA phase for any modulation order. Monte Carlo simulations are provided which confirm the correctness of the derived analytical results.Comment: IEEE Transactions on Communications. arXiv admin note: text overlap with arXiv:1709.0445