407 research outputs found
Joint Channel Coding and Cooperative Network Coding on PSK Constellations in Wireless Networks
In this paper, we consider the application of Reed- Solomon (RS) channel
coding for joint error correction and cooperative network coding on non-binary
phase shift keying (PSK) modulated signals. The relay first decodes the RS
channel coded messages received each in a time slot from all sources before
applying network coding (NC) by the use of bit-level exclusive OR (XOR)
operation. The network coded resulting message is then channel encoded before
its transmission to the next relay or to the destination according to the
network configuration. This scenario shows superior performance in comparison
with the case where the relay does not perform channel coding/decoding. For
different orders of PSK modulation and different wireless configurations,
simulation results demonstrate the improvements resulting from the use of RS
channel codes in terms of symbol error rate (SER) versus signal-to-noise ratio
(SNR).Comment: 6 pages, 4 figures, conferenc
Maximum Euclidean distance network coded modulation for asymmetric decode-and-forward two-way relaying
Network coding (NC) compresses two traffic flows with the aid of low-complexity algebraic operations, hence holds the potential of significantly improving both the efficiency of wireless two-way relaying, where each receiver is collocated with a transmitter and hence has prior knowledge of the message intended for the distant receiver. In this contribution, network coded modulation (NCM) is proposed for jointly performing NC and modulation. As in classic coded modulation, the Euclidean distance between the symbols is maximised, hence the symbol error probability is minimised. Specifically, the authors first propose set-partitioning-based NCM as an universal concept which can be combined with arbitrary constellations. Then the authors conceive practical phase-shift keying/quadrature amplitude modulation (PSK/QAM) NCM schemes, referred to as network coded PSK/QAM, based on modulo addition of the normalised phase/amplitude. To achieve a spatial diversity gain at a low complexity, a NC oriented maximum ratio combining scheme is proposed for combining the network coded signal and the original signal of the source. An adaptive NCM is also proposed to maximise the throughput while guaranteeing a target bit error probability (BEP). Both theoretical performance analysis and simulations demonstrate that the proposed NCM can achieve at least 3 dB signal-to-noise ratio gain and two times diversity gain
Design guidelines for spatial modulation
A new class of low-complexity, yet energyefficient Multiple-Input Multiple-Output (MIMO) transmission techniques, namely the family of Spatial Modulation (SM) aided MIMOs (SM-MIMO) has emerged. These systems are capable of exploiting the spatial dimensions (i.e. the antenna indices) as an additional dimension invoked for transmitting information, apart from the traditional Amplitude and Phase Modulation (APM). SM is capable of efficiently operating in diverse MIMO configurations in the context of future communication systems. It constitutes a promising transmission candidate for large-scale MIMO design and for the indoor optical wireless communication whilst relying on a single-Radio Frequency (RF) chain. Moreover, SM may also be viewed as an entirely new hybrid modulation scheme, which is still in its infancy. This paper aims for providing a general survey of the SM design framework as well as of its intrinsic limits. In particular, we focus our attention on the associated transceiver design, on spatial constellation optimization, on link adaptation techniques, on distributed/ cooperative protocol design issues, and on their meritorious variants
EM based channel estimation in an amplify-and-forward relaying network
Cooperative communication offers a way to obtain spatial diversity in a wireless network without increasing hardware demands. The different cooperation protocols proposed in the literature [1] are often studied under the assumption that all channel state information is available at the destination. In a practical scenario, channel estimates need to be derived from the broadcasted signals. In this paper, we study the Amplify-and-Forward protocol and use the expectation-maximization (EM) algorithm to obtain the channel estimates in an iterative way. Our results show that the performance of the system that knows the channels can be approached at the cost of an increased computational complexity. In case a small constellation is used, a low complexity approximation is proposed with a similar performance
EM based channel estimation in an amplify-and-forward relaying network
Cooperative communication offers a way to obtain spatial diversity in a wireless network without increasing hardware demands. The different cooperation protocols proposed in the literature [1] are often studied under the assumption that all channel state information is available at the destination. In a practical scenario, channel estimates need to be derived from the broadcasted signals. In this paper, we study the Amplify-and-Forward protocol and use the expectation-maximization (EM) algorithm to obtain the channel estimates in an iterative way. Our results show that the performance of the system that knows the channels can be approached at the cost of an increased computational complexity. In case a small constellation is used, a low complexity approximation is proposed with a similar performance
- âŠ