Fountain codes for piecewise stationary channels

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel statistics. In particular, as a class of PSMC's, binary symmetric channels are considered with a crossover probability that changes a bounded number of times with no repetitions in the statistics. Simulation results are given which illustrate the benefits of using our algorithms, both in terms of probability of error and in terms of redundancy.


Published in:
Proceedings of the IEEE International Symposium on Information Theory, 2242 - 2246
Presented at:
IEEE International Symposium on Information Theory, Toronto, July 2008
Year:
2008
Publisher:
Toronto, IEEE
Keywords:
Laboratories:




 Record created 2008-09-30, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)