Performance Analysis of Structured LDPC Over the Polya-Urn Channel with Finite Memory
In this paper, the authors investigate the performance of structured LDPC codes over a simple channel with memory. The channel under consideration is based on Polka's urn model and can be used as a representative of several classes of practical channels with burst errors. Random codes have large storage requirements, and this makes the complete error-control scheme more difficult to implement. They will compute the bit error rate (BER) curves for iterative decoding with channel estimation, for both random codes and codes based on parity-check matrices of the form of block-circulates with permutation blocks and show that the latter codes have performance of the quality of random codes, with significantly smaller storage complexity.