Sorry, you need to enable JavaScript to visit this website.

DESIGN OF BINARY LDPC CODES FOR SLEPIAN-WOLF CODING OF CORRELATED INFORMATION SOURCES

Citation Author(s):
Saeed Eleruja, Umar-Faruk Abdu-Aguye, Marcel Ambroze, Martin Tomlinson, Mohammed Zaki
Submitted by:
Saeed Eleruja
Last updated:
10 November 2017 - 3:26pm
Document Type:
Presentation Slides
Document Year:
2017
Event:
Presenters:
Saeed Eleruja
Paper Code:
1013
 

In this paper, we propose a scheme for distributed source coding, using low-density parity-check (LDPC) codes to compress close to the Slepian-Wolf limit for correlated binary sources. First, we develop a conventional Belief Propagation (BP) algorithm LDPC decoder which takes the syndrome information into account. Subsequently, modelling the correlation between the sources as a binary symmetric channel (BSC), we replace the received probabilities in the conventional channel with the cross over probability. The performance achieved is seen to be better than previously published schemes for similar block length and code rate.

up
0 users have voted: