Interactive encoding and decoding based on syndrome accumulation over a binary regular LDPC Enseme

In this paper we investigate the performance of linear interactive encoding and decoding IED based on syndrome accumulation (SA-IED) over a binary regular LDPC ensemble. Assume that the source alphabet is GF(2), and the side information alphabet is finite. It is shown that we can construct universal SA-IED schemes, which are asymptotically optimal for any stationary ergodic source-side information pair. Our analysis further shows that the word error probability will approach 0 sub-exponentially with respect to the block length, while at the same time, the rate approaches H(X|Y) whenever H(X|Y) is within the rate region (isin, 1), where e can be made arbitrarily small by increasing the variable degree of the LDPC code used. Simulation results on binary source-side information pairs show that SA-IED schemes using LDPC codes coupled with linear time belief propagation decoding consistently outperform Slepian-Wolf coding schemes based on LDPC codes.