A Novel Weight Coefficient PEG Algorithm for Ultra-Reliable Short Length Analog Fountain Codes

被引：11

作者：

Huang, Zixuan ^{[1
]}

Jiao, Jian ^{[1
]}

Zhang, Ke ^{[1
]}

Wu, Shaohua ^{[1
]}

Zhang, Qinyu ^{[1
]}

机构：

[1] Harbin Inst Technol, Commun Engn Res Ctr, Shenzhen 518055, Peoples R China

来源：

IEEE WIRELESS COMMUNICATIONS LETTERS | 2019年 / 8卷 / 01期

关键词：

URLLC; short length codes; analog fountain codes; progressive edge growth (PEG); weight coefficient distribution;

D O I：

10.1109/LWC.2018.2863289

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The stringent requirements of ultra-reliable and low latency communication (URLLC) services is the most challenging feature of fifth generation systems. The design and optimization of efficient short length codes is essential for URLLC. This letter investigates a novel weight coefficient progressive edge-growth (WCPEG) algorithm to construct ultrareliable analog fountain codes (AFCs) in the short length regime. Our WCPEG AFC can approach the normal approximation benchmark by eliminating the small girth cycles in the encoding Tanner graph. We first analyze the properties of short length AFC, and then present the comprehensive description and theoretical identification of the WCPEG AFC algorithm. Simulation results demonstrate the superior performance of WCPEG AFC in the short length regime.

引用

页码：125 / 128

页数：4

共 16 条

[1]

[Anonymous], 2017, PROC IEEE 18 INT WOR

[2]

[Anonymous], ULTRARELIABLE LOW LA

[3] Bayesian Compressive Sensing Via Belief Propagation [J].

Baron, Dror ;

Sarvotham, Shriram ;

Baraniuk, Richard G. .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (01) :269-280

[4]

Cui H, 2011, ACM S MODEL ANAL SIM, P437

[5] Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets [J].

Durisi, Giuseppe ;

Koch, Tobias ;

Popovski, Petar .

PROCEEDINGS OF THE IEEE, 2016, 104 (09) :1711-1726

[6]

Gaudio L., 2017, P 11 INT ITG C SYST, P2307

[7] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[8] Short Nonbinary Maximum Distance Separable Cycle Codes [J].

Matuz, Balazs ;

Liva, Gianluigi ;

Paolini, Enrico .

IEEE COMMUNICATIONS LETTERS, 2018, 22 (03) :454-457

[9] CRC-Aided Decoding of Polar Codes [J].

Niu, Kai ;

Chen, Kai .

IEEE COMMUNICATIONS LETTERS, 2012, 16 (10) :1668-1671

[10] Channel Coding Rate in the Finite Blocklength Regime [J].

Polyanskiy, Yury ;

Poor, H. Vincent ;

Verdu, Sergio .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (05) :2307-2359

← 1 2 →