IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Performance of Fountain Codes in Collaborative Relay Networks
IEEE Transactions on Wireless Communications
Design methods for irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
IEEE Transactions on Information Theory
Raptor codes on binary memoryless symmetric channels
IEEE Transactions on Information Theory
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
No symbol left behind: a link-layer protocol for rateless codes
Proceedings of the 18th annual international conference on Mobile computing and networking
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
| Hi-index | 0.00 |
We develop accurate and robust one-dimensional EXIT chart methods to design raptor codes with binary and higher-order modulations on AWGN channels over any desired range of SNRs. We formulate the check-node degree distribution optimization as a linear program that optimizes a suitable objective function ofthe desired operating points. The throughput curves predicted by the analysis are easily compared across different pre-code rates and pre-code error-correcting capabilities. For higher-order modulations we employ BICM on standard Gray-mapped constellations. We further enhance the optimization by applying separate check-node degree distributions to the mapped MSBs and LSBs. Simulated throughput curves using the designed codes for QPSK and 16-QAM modulations on the AWGN channel show marked improvement over previously reported raptor code designs.