Design of network-coding based multi-edge type LDPC codes for multi-source relaying systems

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 8figure. conference

Scientific paper

In this paper we investigate a multi-source LDPC scheme for a Gaussian relay system, where M sources communicate with the destination under the help of a single relay (M-1-1 system). Since various distributed LDPC schemes in the cooperative single-source system, e.g. bilayer LDPC and bilayer multi-edge type LDPC (BMET-LDPC), have been designed to approach the Shannon limit, these schemes can be applied to the $M-1-1$ system by the relay serving each source in a round-robin fashion. However, such a direct application is not optimal due to the lack of potential joint processing gain. In this paper, we propose a network coded multi-edge type LDPC (NCMET-LDPC) scheme for the multi-source scenario. Through an EXIT analysis, we conclude that the NCMET-LDPC scheme achieves higher extrinsic mutual information, relative to a separate application of BMET-LDPC to each source. Our new NCMET-LDPC scheme thus achieves a higher threshold relative to existing schemes.

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 network-coding based multi-edge type LDPC codes for multi-source relaying systems 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 network-coding based multi-edge type LDPC codes for multi-source relaying systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design of network-coding based multi-edge type LDPC codes for multi-source relaying systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-35553

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