Theory of Information and Coding
Theory of Information and Coding
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Modulation and demodulation for cooperative diversity in wireless systems
IEEE Transactions on Wireless Communications
Rateless Coding for Wireless Relay Channels
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Selection Cooperation in Multi-Source Cooperative Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Low complexity and fractional coded cooperation for wireless networks
IEEE Transactions on Wireless Communications - Part 2
The capacity of wireless networks
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Reliable channel regions for good binary codes transmitted over parallel channels
IEEE Transactions on Information Theory
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
IEEE Transactions on Information Theory
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Optimization for fractional cooperation in multiple-source multiple-relay systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.01 |
A simplified method of analysis and design based on the Bhattacharyya parameter (BP) in conjunction with the union bound and weight enumeration is presented for relay channels using coded cooperation. This method is particularly suitable for low-complexity relay systems employing demodulate-and-forward, focusing on the problems of relay selection and outage analysis. These applications are chosen to illustrate the use of the BP in scenarios where analytical solutions are otherwise unattainable. In terms of relay selection, it is shown that BP-based relay selection has essentially the same performance as density evolution, though with much lower complexity. It is further shown that BP-based relay selection can be applied to fractional cooperation, where each relay only forwards a fraction of the source codeword. In terms of analysis, it is shown that weight enumeration with BP can be used to provide a close approximate to the upper bound on the outage probability of fractional cooperation, again with much lower computational complexity than density evolution.