A Simple Cooperative Diversity Method Based on Network Path Selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M nodes is required, such as those proposed in [7]. The simplicity of the technique, allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability and efficiency in future 4G wireless systems.Comment: To appear, IEEE JSAC, special issue on 4

A universal space-time architecture for multiple-antenna aided systems

In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547