1,024 research outputs found
Dispensing with channel estimation: differentially modulated cooperative wireless communications
As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective
Error Rate Analysis of GF(q) Network Coded Detect-and-Forward Wireless Relay Networks Using Equivalent Relay Channel Models
This paper investigates simple means of analyzing the error rate performance
of a general q-ary Galois Field network coded detect-and-forward cooperative
relay network with known relay error statistics at the destination. Equivalent
relay channels are used in obtaining an approximate error rate of the relay
network, from which the diversity order is found. Error rate analyses using
equivalent relay channel models are shown to be closely matched with simulation
results. Using the equivalent relay channels, low complexity receivers are
developed whose performances are close to that of the optimal maximum
likelihood receiver.Comment: 28 pages, 10 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessibl
Generalized Adaptive Network Coding Aided Successive Relaying Based Noncoherent Cooperation
A generalized adaptive network coding (GANC) scheme is conceived for a multi-user, multi-relay scenario, where the multiple users transmit independent information streams to a common destination with the aid of multiple relays. The proposed GANC scheme is developed from adaptive network coded cooperation (ANCC), which aims for a high flexibility in order to: 1) allow arbitrary channel coding schemes to serve as the cross-layer network coding regime; 2) provide any arbitrary trade-off between the throughput and reliability by adjusting the ratio of the source nodes and the cooperating relay nodes. Furthermore, we incorporate the proposed GANC scheme in a novel successive relaying aided network (SRAN) in order to recover the typical 50% half-duplex relaying-induced throughput loss. However, it is unrealistic to expect that in addition to carrying out all the relaying functions, the relays could additionally estimate the source-to-relay channels. Hence noncoherent detection is employed in order to obviate the power-hungry channel estimation. Finally, we intrinsically amalgamate our GANC scheme with the joint network-channel coding (JNCC) concept into a powerful three-stage concatenated architecture relying on iterative detection, which is specifically designed for the destination node (DN). The proposed scheme is also capable of adapting to rapidly time-varying network topologies, while relying on energy-efficient detection
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
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
Interference Cancellation at the Relay for Multi-User Wireless Cooperative Networks
We study multi-user transmission and detection schemes for a multi-access
relay network (MARN) with linear constraints at all nodes. In a MARN, sources, each equipped with antennas, communicate to one
-antenna destination through one -antenna relay. A new protocol called
IC-Relay-TDMA is proposed which takes two phases. During the first phase,
symbols of different sources are transmitted concurrently to the relay. At the
relay, interference cancellation (IC) techniques, previously proposed for
systems with direct transmission, are applied to decouple the information of
different sources without decoding. During the second phase, symbols of
different sources are forwarded to the destination in a time division
multi-access (TDMA) fashion. At the destination, the maximum-likelihood (ML)
decoding is performed source-by-source. The protocol of IC-Relay-TDMA requires
the number of relay antennas no less than the number of sources, i.e., . Through outage analysis, the achievable diversity gain of the proposed
scheme is shown to be . When {\small}, the proposed scheme achieves the maximum
interference-free (int-free) diversity gain . Since concurrent
transmission is allowed during the first phase, compared to full TDMA
transmission, the proposed scheme achieves the same diversity, but with a
higher symbol rate.Comment: submitted to IEEE Transaction on Wireless Communicatio
- …