TY - JOUR
T1 - Parity check network coding for wireless cooperative communications
AU - Du, Bing
AU - Zhang, Jun
PY - 2010/4
Y1 - 2010/4
N2 - We develop a cooperative decode-and-forward strategy of distributed Source-Relay network coding for a three-node relay model, in which Relay and Source both send their own messages to Destination. First, we present a cooperative communication protocol to achieve decode-and-forward capacity by leveraging transmit rates between Source and Relay and designing distributed Source-Relay network coding accordingly. Afterwards, multi-dimension Low-density parity-check (LDPC) code is constructed as a layered structure, where Source LDPC, Relay LDPC, and network LDPC code are organically integrated to realize a distributed design. Our design randomly embeds network-coded message into the layered structure as effective extra checks offering side information for both Source and Relay. Based on derivation of the algebraic relationship between constituent codes, a good multi-dimension LDPC code profile is generated. Meanwhile, network coding complexity maintains linear to the block length. The coding scheme is demonstrated to approach decode-and-forward capacity and still provides effective spatial diversity.
AB - We develop a cooperative decode-and-forward strategy of distributed Source-Relay network coding for a three-node relay model, in which Relay and Source both send their own messages to Destination. First, we present a cooperative communication protocol to achieve decode-and-forward capacity by leveraging transmit rates between Source and Relay and designing distributed Source-Relay network coding accordingly. Afterwards, multi-dimension Low-density parity-check (LDPC) code is constructed as a layered structure, where Source LDPC, Relay LDPC, and network LDPC code are organically integrated to realize a distributed design. Our design randomly embeds network-coded message into the layered structure as effective extra checks offering side information for both Source and Relay. Based on derivation of the algebraic relationship between constituent codes, a good multi-dimension LDPC code profile is generated. Meanwhile, network coding complexity maintains linear to the block length. The coding scheme is demonstrated to approach decode-and-forward capacity and still provides effective spatial diversity.
KW - Achievable rate region
KW - Cooperative communications
KW - Multidimension ldpc
KW - Network coding
UR - http://www.scopus.com/inward/record.url?scp=77951947608&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:77951947608
SN - 1022-4653
VL - 19
SP - 339
EP - 344
JO - Chinese Journal of Electronics
JF - Chinese Journal of Electronics
IS - 2
ER -