Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime | Zendy

Ke Zhang | Zendy; Qinyu Zhang | Zendy; Jian Jiao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime

Author(s) -

Ke Zhang,

Qinyu Zhang,

Jian Jiao

Publication year - 2017

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2017.2768158

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

In this paper we analyze the bounds on the reliability of RaptorQ codes under maximum likelihood decoding, especially in the finite-length regime. RaptorQ code ensembles by a high-order low density generator-matrix (LDGM) code as pre-code and an inner Luby transform (LT) code. By investigating the rank of the product of two random coefficient matrices of the high-order LDGM code and the inner LT code, we derive the expressions for the upper and lower bounds of decoding failure probability (DFP) on the RaptorQ code. Then, the accuracy of our derived theoretical bounds are verified through the Monte Carlo simulations with different degree distributions and short packets. The high accuracy bounds are then exploited to design near-optimum finite-length RaptorQ codes, enabling a tight control on the tradeoff between decoding complexity and DFP.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research