On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels

This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available at the transmitter. Using the maximum likelihood (ML) principle, and assuming perfect knowledge of the channel mean, we derive the optimal multiple symbol detection (MSD) rule for diagonal differential unitary space-time modulation (DUSTM). This rule is used to develop a sphere decoding bound intersection detector (SD-BID) with low complexity. A suboptimal MSD based decision feedback DD (DF-DD) algorithm is also derived. The simulation results show that our proposed MSD algorithms reduce the error floor of conventional differential detection and that the computational complexity of these new algorithms is reasonably low

Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information

In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space–time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space–time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R-d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas

Maximum likelihood detection for differential unitary space-time modulation with carrier frequency offset

Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)? This paper answers this question affirmatively and derives the necessary maximum likelihood (ML) detection rule. The asymptotic performance of the proposed ML rule is analyzed, leading to a code design criterion for DUSTM by using the modified diversity product. The resulting proposed decision rule is a new differential modulation scheme in both the temporal and spatial domains. Two sub-optimal multiple-symbol decision rules with improved performance are also proposed. For the efficient implementation of these, we derive a modified bound intersection detector (BID), a generalization of the previously derived optimal BID for the conventional DUSTM. The simulation results show that the proposed differential modulation scheme is more robust against CFO drifting than the existing double temporal differential modulation

Cyclic Algebras for Noncoherent Differential Space–Time Coding

We investigate cyclic algebras for coding over the differential noncoherent channel. Cyclic algebras are an algebraic object that became popular for coherent space–time coding, since it naturally yields linear families of matrices with full diversity. Coding for the differential noncoherent channel has a similar flavor in the sense that it asks for matrices that achieve full diversity, except that these matrices furthermore have to be unitary. In this work, we give a systematic way to find infinitely many unitary matrices inside cyclic algebras, which holds for all dimensions. We show how cyclic algebras generalize previous families of unitary matrices obtained using the representation of fixed-point-free groups. As an application of our technique, we present families of codes for three and four antennas that achieve high coding gain

Coherent and Non-coherent Techniques for Cooperative Communications

Future wireless network may consist of a cluster of low-complexity battery-powered nodes or mobile stations (MS). Information is propagated from one location in the network to another by cooperation and relaying. Due to the channel fading or node failure, one or more relaying links could become unreliable during multiple-hop relaying. Inspired by conventional multiple-input multiple-output (MIMO) techniques exploiting multiple co-located transmit antennas to introduce temporal and spatial diversity, the error performance and robustness against channel fading of a multiple-hop cooperative network could be significantly improved by creating a virtual antenna array (VAA) with various distributed MIMO techniques. In this thesis, we concentrate on the low-complexity distributed MIMO designed for both coherent and non-coherent diversity signal reception at the destination node. Further improvement on the network throughput as well as spectral efficiency could be achieved by extending the concept of unidirectional relaying to bidirectional cooperative communication. Physical-layer network coding (PLNC) assisted distributed space-time block coding (STBC) scheme as well as non-coherent PLNC aided distributed differential STBC system are proposed. It is confirmed by the theoretical analysis that both approaches have the potential for offering full spatial diversity gain. 　　 Furthermore, differential encoding and non-coherent detection techniques are generally associated with performance degradation due to the doubled noise variance. More importantly, conventional differential schemes suffer from the incapability of recovering the source information in time-varying channels owing to the assumption of static channel model used in the derivation of non-coherent detection algorithm. Several low-complexity solutions are proposed and studied in this thesis, which are able to compensate the performance loss caused by non-coherent detection and guarantee the reliable recovery of information in applications with high mobility. A substantial amount of iteration gain is achieved by combining the differential encoding with error-correction code and sufficient interleaving, which allows iterative possessing at the receiver