Data Detection Algorithms for BICM Alternate-Relaying Cooperative Systems With Multiple-Antenna Destination

Abstract

This paper proposes two new data detection algorithms for decode-and-forward (DF) alternate-relaying cooperative (ARC) communication systems. These algorithms are discussed in the context of bit-interleaved coded modulation (BICM) transmission with a multiple-antenna destination. The interference signal, resulting from the concurrent transmission of the source and one of the relays, is exploited as a beneficial resource to develop an optimal data detection algorithm. We show that the optimal algorithm can be implemented by parallel demappers, each based on a family of Bahl, Cocke, Jelinek and Raviv (BCJR) algorithms, connected to parallel decoders in an iterative way. Due to the need to buffer the entire frame before decoding, the optimal algorithm suffers from long processing time. A sub-optimal algorithm is also proposed to avoid this problem, where each packet is decoded by using two consecutive received packets. The sub-optimal algorithm reduces the processing time, complexity, bandwidth loss, and memory size with a slight increase of the bit-error-rate (BER). The BER performance of the proposed algorithms is evaluated via Monte Carlo simulations, and the results indicate their effectiveness in improving the BER performance.Index Terms-Cooperative systems, BICM scheme, BCJR algorithm.M. Marey is with the Faculty

STBC Identification for Multi-User Uplink SC-FDMA Asynchronous Transmissions Exploiting Iterative Soft Information Feedback of Error Correcting Codes

“…We analyze the computational complexity of the proposed SAGE-based identification algorithm in terms of the number of floating operations (flops), with 6 and 2 flops required for multiplication and addition of two complex numbers, respectively. We also assume that the M-point FFT algorithm requires 5M log 2 (M) flops, that multiplication of two complex matrices with dimensions of ϱ 1 × ϱ 2 and ϱ 2 × ϱ 3 requires 8ϱ 1 ϱ 2 ϱ 3 flops, that addition/subtraction of two complex matrices with dimensions of ϱ 1 × ϱ 2 each requires 2ϱ 1 ϱ 2 flops, and that the inverse of a complex matrix with dimension of ϱ 1 × ϱ 1 requires ϱ 3 1 flops [35], [36]. As shown in Table 1, the precise computations of the required computational complexity ψ per iteration per user is…”

Modulation Awareness Method for Dual-Hop Cooperative Transmissions over Frequency-Selective Channels

“…We leave the implementation of multiple antennas at each node to future development. The relay implements an AF protocol and runs in a half-duplex configuration that it transmits and receives at two distinct times [ 24 ].…”

“…We express the k th received samples at the relay, , and the destination, , analytically as and where and are the noise samples at the relay and destination, respectively. Here, we underline that both situations of direct connection presence and absence are extensively discussed in the literature (e.g., [ 19 , 20 , 21 , 22 , 23 , 24 , 25 ] and references therein). We focus on the existence of direct link in this investigation.…”

“…Extensive work has been made in information theoretic analysis of various cooperative systems to estimate feasible rates, capacity limitations and the diversity-multiplexing trade-off as well as data detection and channel estimation (e.g., [ 19 , 20 , 21 , 22 , 23 , 24 ]). Despite the importance of these findings, more work must be done before they can be put into practice.…”

Multiuser Detection Schemes for Multicarrier Four-node Wireless Systems

“…Generally speaking, the previous work on TPC can be categorized into two groups of studies. A group has concentrated on the information theory issues such as capacity-outage and diversity-multiplexing tradeoff analysis ( [1,4]) while the second one is devoted to data detection algorithms [2,3,6]. The previously mentioned works of the second group were considered a single user with single carrier transmission.…”