No abstract

Cooperation provides transmit diversity in cases where wireless transmitters, due to size, power, or other constraints, cannot support multiple antennas. Cooperation involves two single-antenna sources (which we call users) forming a partnership, in which each achieves space-time diversity by using their partner's antenna as a relay. We propose a new methodology, called coded cooperation, where cooperation is achieved through channel coding methods, instead of a direct relay or repetition. Each codeword is partitioned into two subsets that are transmitted from the user's and partner's antennas, respectively. Coded cooperation achieves impressive gains compared to a non-cooperative system while maintaining the same information rate, transmit power, and bandwidth. We develop tight upper bounds for bit and block error rates, which we validate through simulations. Bit and block error rate results illustrate the improvement of coded cooperation for various combinations of channel conditions between the partners and to the destination.

Abstract-When mobiles cannot support multiple antennas due to size or other constraints, conventional space-time coding cannot be used to provide uplink transmit diversity. To address this limitation, the concept of cooperation diversity has been introduced, where mobiles achieve uplink transmit diversity by relaying each other's messages. A particularly powerful variation of this principle is coded cooperation. Instead of a simple repetition relay, coded cooperation partitions the codewords of each mobile and transmits portions of each codeword through independent fading channels. This paper presents two extensions to the coded cooperation framework. First, we increase the diversity of coded cooperation in the fast-fading scenario via ideas borrowed from space-time codes. We calculate bounds for the bit-and block-error rates to demonstrate the resulting gains. Second, since cooperative coding contains two code components, it is natural to apply turbo codes to this framework. We investigate the application of turbo codes in coded cooperation and demonstrate the resulting gains via error bounds and simulations.

No abstract

No abstract

No abstract

Abstract-This paper addresses the multiplexing loss that occurs in relay networks due to causality of relays and the halfduplex constraint. We devise relay selection methods to recover the multiplexing loss in decode-and-forward (DF) relay networks, while requiring very little feedback (merely bits/relay). Two network topologies are studied: First the case is considered where a direct link is available between the source and destination, in addition to the relayed links. For this configuration, an incremental transmission scheme is proposed, and comprehensively analyzed, which uses limited feedback to improve both diversity as well as multiplexing gain. Then, the case without a direct link is considered, for which efficient non-orthogonal DF protocols are produced and analyzed. An interesting feature of the latter methods is unequal error protection capability via a family of embedded diversity-multiplexing (DMT) curves, which can be very useful for practical applications. Even considering this method's minimal DMT, a marked improvement over previous DF methods is observed, especially in high spectral efficiencies.

Abstract-This paper addresses user coexistence in cognitive radio systems by taking advantage of opportunities that arise during ARQ retransmission. It is shown that if these opportunities are properly exploited, nontrivial rates can be made available to a secondary (cognitive) pair while impinging little or no interference on the primary pair. This can be accomplished with an oblivious primary system and without assuming any non-causal information at the secondary about the primary data. Several protocols are devised that work with varying amounts of channel state information about the cognitive and primary links. The protocols are further extended to the scenario where multiple cognitive receivers exist. Performance analysis of the protocols is presented and their effectiveness is verified via simulations.