Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Foundations and Trends in Communications and Information Theory
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Bounds on information combining
IEEE Transactions on Information Theory
Extremes of information combining
IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
IEEE Transactions on Information Theory
Relay-based deployment concepts for wireless and mobile broadband radio
IEEE Communications Magazine
Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Analyzing the capacity of relay networks is often based on the max-flow min-cut theorem providing an upper bound on the true capacity which is generally still unknown. This paper analyzes the achievable rates of a simple relay network by a semi-analytical approach considering ideal capacity achieving codes of appropriate rates and optimum symbol-by-symbol soft-output decoding at the relay. Applying the information combining technique, regions are illustrated where the upper bound provided by the max-flow min-cut theorem can be reached. Moreover, the results show that the lower bound obtained by the constraint of error-free decoding at the relay can be exceeded in many scenarios. Simulations with a nearly capacity achieving half-rate repeat accumulate code confirm the semi-analytic results.