Digital modulation and coding
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Diversity through coded cooperation
IEEE Transactions on Wireless Communications
Rateless Coding for Wireless Relay Channels
IEEE Transactions on Wireless Communications
Performance of Fountain Codes in Collaborative Relay Networks
IEEE Transactions on Wireless Communications
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Space-time diversity enhancements using collaborative communications
IEEE Transactions on Information Theory
On the Optimality of the ARQ-DDF Protocol
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
Cooperation in the low power regime for the MAC using multiplexed rateless codes
IEEE Transactions on Signal Processing
Benefit from rateless characteristic
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
| Hi-index | 0.01 |
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes, fountain codes are capable of adapting the bit rate to the channel realization blindly, i.e., without channel information at the transmitter. This makes them attractive in fading wireless channels. We first describe several rateless cooperative protocols, and then implement them using Raptor codes (a type of fountain code) and 16-QAM over a slow, deeply-interleaved fading relay channel. Given no delay constraints, the achievable rate of these protocols are found when the source and relay are close to each other, and when the relay is half-way between the source and destination. Furthermore, to reduce decoding complexity, we propose a soft-decision version of the adaptive demodulation (ADM) method recently introduced in the literature at each receiver. Finally, we analyze the practical scenario of data streaming with delay constraints, and find that the time-division (TD) protocol retains its relative superiority over the space-time one.