An Efficient Construction Method for Ultra-Reliable Finite Length Analog Fountain Codes

Ultra-reliable low latency communication (URLLC) is defined by the the third generation partnership project (3GPP) for the fifth generation (5G) mobile systems. In order to realize the stringent requirements of ultra-high reliability and low latency, the data block length needs to be small. However, most of the state-of-art channel codes are designed and optimized for long block length. Analog fountain code (AFC) is a capacity-approaching self-adaptive code on wireless channels with linear encoding/decoding complexity. In this paper, we study the optimization of AFC in the finite length regime. We first analyze the effect of average degree on decoding performance of AFC in the finite length regime. Then, based on the characteristic of weight coefficient in AFC, we proposed a joint design of weight optimization (WO) progressive edge growth (PEG)-AFC algorithm to improve the decoding performance in the finite length regime, named PEG-AFC algorithm. Simulation results show that the proposed PEG-AFC algorithm can achieve lower bit error rate (BER) in a wide range of signal to noise ratio (SNR).

[1]  Qinyu Zhang,et al.  ARMA-Based Adaptive Coding Transmission Over Millimeter-Wave Channel for Integrated Satellite-Terrestrial Networks , 2018, IEEE Access.

[2]  Feng Wu,et al.  Seamless rate adaptation for wireless networking , 2011, MSWiM '11.

[3]  Branka Vucetic,et al.  Short Block-Length Codes for Ultra-Reliable Low Latency Communications , 2019, IEEE Communications Magazine.

[4]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[5]  Branka Vucetic,et al.  Adaptive analog fountain for wireless channels , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).

[6]  Ke Zhang,et al.  Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime , 2017, IEEE Access.

[7]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[8]  Branka Vucetic,et al.  Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels , 2013, IEEE Communications Letters.

[9]  Ke Zhang,et al.  Bounds on the error probability of finite-length RaptorQ codes , 2017, 2017 IEEE/CIC International Conference on Communications in China (ICCC).

[10]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[11]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets , 2015 .