Paper Info
Title
Coding for network-coded slotted ALOHA
Abstract
Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear equations are recovered in different timeslots. A message decoder then recovers the original packets of all the users by jointly solving multiple systems of linear equations obtained over different timeslots. We propose the batched BP decoding algorithm that combines belief propagation (BP) and local Gaussian elimination. Compared with pure Gaussian elimination decoding, our algorithm reduces the decoding complexity from cubic to linear function of the number of users. Compared with the ordinary BP decoding algorithm for low-density generator-matrix codes, our algorithm has better performance and the same order of computational complexity. We analyze the performance of the batched BP decoding algorithm by generalizing the tree-based approach and provide an approach to optimize the system performance.
Year
DOI
Venue
2015
10.1109/ITW.2015.7133085
2015 IEEE Information Theory Workshop (ITW)
Keywords
Field
DocType
network-coded slotted ALOHA,physical-layer network coding,PNC,linear packet combination decoding,linear equations,message decoder,batched BP decoding algorithm,belief propagation decoding,local Gaussian elimination decoding,pure-Gaussian elimination decoding,decoding complexity reduction,low-density generator-matrix codes,computational complexity,tree-based approach,wireless multiple-access network
Linear network coding,Berlekamp–Welch algorithm,Sequential decoding,Aloha,Computer science,Theoretical computer science,Decoding methods,Gaussian elimination,List decoding,Belief propagation
Journal
Volume
ISBN
Citations 
abs/1502.03903
978-1-4799-5524-4
2
PageRank 
References 
Authors
0.40
22
4
Name
Order
Citations
PageRank
Shenghao Yang13313.84
Yi Chen220.40
Soung Chang Liew33307237.57
Lizhao You420.40