Please use this identifier to cite or link to this item: http://dlib.scu.ac.ir/handle/Hannan/527583
Title: Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime
Authors: Ke Zhang;Qinyu Zhang;Jian Jiao
Year: 2017
Publisher: IEEE
Abstract: 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.
Description: 
URI: http://dl.kums.ac.ir/handle/Hannan/527583
volume: 5
More Information: 24766,
24774
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
8089731.pdf4.18 MBAdobe PDFThumbnail
Preview File
Title: Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime
Authors: Ke Zhang;Qinyu Zhang;Jian Jiao
Year: 2017
Publisher: IEEE
Abstract: 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.
Description: 
URI: http://dl.kums.ac.ir/handle/Hannan/527583
volume: 5
More Information: 24766,
24774
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
8089731.pdf4.18 MBAdobe PDFThumbnail
Preview File
Title: Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime
Authors: Ke Zhang;Qinyu Zhang;Jian Jiao
Year: 2017
Publisher: IEEE
Abstract: 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.
Description: 
URI: http://dl.kums.ac.ir/handle/Hannan/527583
volume: 5
More Information: 24766,
24774
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
8089731.pdf4.18 MBAdobe PDFThumbnail
Preview File