Elements of information theory
Elements of information theory
Cooperative diversity in wireless networks: algorithms and architectures
Cooperative diversity in wireless networks: algorithms and architectures
Convex Optimization
Fundamentals of wireless communication
Fundamentals of wireless communication
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
A cooperative phase steering scheme in multi-relay node environments
IEEE Transactions on Wireless Communications
Achievable rates for the AWGN channel with multiple parallel relays
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Multiple-input-multiple-output (MIMO) techniques have been widely proposed as a means to improve capacity and reliability of wireless channels, and have become the most promising technology for next generation networks. However, their practical deployment in current wireless devices is severely affected by antenna correlation, which reduces their impact on performance. One approach to solve this limitation is relaying diversity. In relay channels, a set of N wireless nodes aids a source-destination communication by relaying the source data, thus creating a distributed antenna array with uncorrelated path gains. In this paper, we study this multiple relay channel (MRC) following a decode-and-forward (D & F) strategy (i.e., regenerative forwarding), and derive its achievable rate under AWGN. A half-duplex constraint on relays is assumed, as well as distributed channel knowledge at both transmitter and receiver sides of the communication. For this channel, we obtain the optimum relay selection algorithm and the optimum power allocation within the network so that the transmission rate is maximized. Likewise, we bound the ergodic performance of the achievable rate and derive its asymptotic behavior in the number of relays. Results show that the achievable rate of regenerative MRC grows as the logarithm of the Lambert W function of the total number of relays, that is, C = log2(W0(N)). Therefore, D & F relaying, cannot achieve the capacity of actual MISO channels.