Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 4 figures

Scientific paper

A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay's "assistance". The nested LDGM (Low-density generator-matrix) -LDPC (low-density parity-check) was designed to realize Compress-and-forward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for Slepian-Wolf coding. Firstly a practical coding scheme was proposed to achieve the cut-set bound on the capacity of the system, employing LDPC and Nested LDGM-LDPC codes at the source and relay respectively. Then, the degree distribution of LDGM and LDPC codes was optimized with a given rate bound, which ensured that the iterative belief propagation (BP) decoding algorithm at the destination was convergent. Finally, simulations results show that the performance achieved based on nested codes is very close to Slepian-Wolf theoretical limit.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-354424

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.