Full-Diversity Binary Frame-Wise Network Coding for Multiple-Source Multiple-Relay Networks Over Slow-Fading Channels
2012 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 61, no 3, 1346-1360 p.Article in journal (Refereed) Published
We study the design of network codes for M-source N-relay (M - N - 1) wireless networks over slow-fading channels. Binary frame-wise network coding (BFNC) based on cyclic-shifting matrices is developed to achieve full diversity and good coding gain. We develop a criterion in the context of BFNC that if satisfied guarantees to achieve full diversity gain. Based on this criterion, we propose an algorithm to design low-complexity encoders for a BFNC scheme by exploiting quasi-cyclic low-density parity-check (LDPC) code structures. We also design practical decoders based on the belief propagation decoding principle with a focus on large block lengths. Numerical results demonstrate that our BFNC schemes have substantial benefits over previous complex field and Galois field network coding schemes in the sense that our BFNC schemes can achieve full diversity gain and high coding gain for arbitrary block lengths with low encoding/decoding complexity.
Place, publisher, year, edition, pages
2012. Vol. 61, no 3, 1346-1360 p.
Belief propagation (BP) decoding, low-density parity-check (LDPC) code, multiple-source multiple-relay network, network coding (NC), quasi-cyclic (QC) matrix, slow-fading channel
IdentifiersURN: urn:nbn:se:kth:diva-94062DOI: 10.1109/TVT.2012.2185966ISI: 000302081500034ScopusID: 2-s2.0-84858987283OAI: oai:DiVA.org:kth-94062DiVA: diva2:525627
FunderSwedish Research CouncilICT - The Next Generation
QC 201205082012-05-082012-05-072013-04-11Bibliographically approved