國立虎尾科技大學 |

Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes./
作者:	Raveendran, Nithin.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	187 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-05, Section: B.
Contained By:	Dissertations Abstracts International83-05B.
標題:	Quantum physics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28774471
ISBN:	9798496506366

Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes.
Raveendran, Nithin.

Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 187 p.

Source: Dissertations Abstracts International, Volume: 83-05, Section: B.

Thesis (Ph.D.)--The University of Arizona, 2021.

This item must not be sold to any third party vendors.

Protecting logical information in the form of a classical bit or a quantum bit (qubit) is an essential step in ensuring fault-tolerant classical or quantum computation. Error correction codes and their decoders perform this step by adding redundant information that aids the decoder to recover or protect the logical information even in the presence of noise. Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems. Similarly, their quantum analogues, quantum LDPC codes are being actively pursued as excellent prospects for error correction in future fault-tolerant quantum systems due to their asymptotically non-zero rates, sparse parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as trapping sets of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the error floor phenomenon - the degradation of logical error rate performance at low physical noise regime. The study of quantum trapping sets will enable the construction of better quantum LDPC codes and also help in modifying iterative quantum decoders to achieve higher fault-tolerant thresholds and lower error floors. Towards this goal, the dissertation also presents iterative decoders for classical and quantum LDPC codes using the deep neural network framework, novel iterative decoding algorithms, and a decoder-aware expansion-contraction method for error floor estimation.In this dissertation, we first establish a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used. For this purpose, we leverage the known harmful configurations in the Tanner graph, called trapping sets (TSs), from the classical error correction world. The conventional definition of a trapping set of classical LDPC codes is generalized to address the syndrome decoding scenario for quantum LDPC codes. Furthermore, we show that the knowledge of QTSs can be used to design better quantum LDPC codes and decoders.In the context of the development of novel decoders, we extend the stochastic resonance based decoders to quantum LDPC codes, propose iteration-varying message passing decoders with their message update rules learned by neural networks tuned for low logical error rate, and present a syndrome based generalized belief propagation algorithm for tackling convergence failure of iterative decoders due to the presence of short cycles.Our analysis of TSs of a layered decoding architecture clearly reveals the dependence of the harmfulness of TSs (classical or quantum) on the iterative decoder, and thus on the error floor estimates. We present a computationally efficient method for estimating error floors of LDPC codes over the binary symmetric channel without any prior knowledge of its trapping sets. The sub-graph expansion-contraction method is a general procedure for TS characterization, which lists all harmful error patterns up to a given weight for the LDPC code and decoder. Based on this decoder-aware trapping set characterization for LDPC codes, we propose a model-driven deep neural network (DNN) framework that unfolds the decoding iterations, to design the decoder diversity of finite alphabet iterative decoders (FAIDs). Our decoder diversity DNN-FAID delivers excellent waterfall performance along with a low error floor.

ISBN: 9798496506366Subjects--Topical Terms:

1179090
Quantum physics.
Subjects--Index Terms:

Iterative decoding

Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes.
LDR:04812nam a2200397 4500 001 1121855
005 20240624103653.5
006 m o d
007 cr#unu||||||||
008 240823s2021 ||||||||||||||||| ||eng d
020 $a 9798496506366
035 $a (MiAaPQ)AAI28774471
035 $a AAI28774471
040 $a MiAaPQ $c MiAaPQ
100 1 $a Raveendran, Nithin. $3 1437677
245 1 0 $a Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 187 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-05, Section: B.
500 $a Advisor: Vasic, Bane;Guha, Saikat.
502 $a Thesis (Ph.D.)--The University of Arizona, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Protecting logical information in the form of a classical bit or a quantum bit (qubit) is an essential step in ensuring fault-tolerant classical or quantum computation. Error correction codes and their decoders perform this step by adding redundant information that aids the decoder to recover or protect the logical information even in the presence of noise. Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems. Similarly, their quantum analogues, quantum LDPC codes are being actively pursued as excellent prospects for error correction in future fault-tolerant quantum systems due to their asymptotically non-zero rates, sparse parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as trapping sets of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the error floor phenomenon - the degradation of logical error rate performance at low physical noise regime. The study of quantum trapping sets will enable the construction of better quantum LDPC codes and also help in modifying iterative quantum decoders to achieve higher fault-tolerant thresholds and lower error floors. Towards this goal, the dissertation also presents iterative decoders for classical and quantum LDPC codes using the deep neural network framework, novel iterative decoding algorithms, and a decoder-aware expansion-contraction method for error floor estimation.In this dissertation, we first establish a systematic methodology by which one can identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used. For this purpose, we leverage the known harmful configurations in the Tanner graph, called trapping sets (TSs), from the classical error correction world. The conventional definition of a trapping set of classical LDPC codes is generalized to address the syndrome decoding scenario for quantum LDPC codes. Furthermore, we show that the knowledge of QTSs can be used to design better quantum LDPC codes and decoders.In the context of the development of novel decoders, we extend the stochastic resonance based decoders to quantum LDPC codes, propose iteration-varying message passing decoders with their message update rules learned by neural networks tuned for low logical error rate, and present a syndrome based generalized belief propagation algorithm for tackling convergence failure of iterative decoders due to the presence of short cycles.Our analysis of TSs of a layered decoding architecture clearly reveals the dependence of the harmfulness of TSs (classical or quantum) on the iterative decoder, and thus on the error floor estimates. We present a computationally efficient method for estimating error floors of LDPC codes over the binary symmetric channel without any prior knowledge of its trapping sets. The sub-graph expansion-contraction method is a general procedure for TS characterization, which lists all harmful error patterns up to a given weight for the LDPC code and decoder. Based on this decoder-aware trapping set characterization for LDPC codes, we propose a model-driven deep neural network (DNN) framework that unfolds the decoding iterations, to design the decoder diversity of finite alphabet iterative decoders (FAIDs). Our decoder diversity DNN-FAID delivers excellent waterfall performance along with a low error floor.
590 $a School code: 0009.
650 4 $a Quantum physics. $3 1179090
650 4 $a Electrical engineering. $3 596380
653 $a Iterative decoding
653 $a Low-density parity-check codes
653 $a Neural networks
653 $a Quantum error correction
653 $a Quantum low-density parity-check Codes
653 $a Trapping sets
690 $a 0544
690 $a 0599
710 2 $a The University of Arizona. $b Electrical & Computer Engineering. $3 1189571
773 0 $t Dissertations Abstracts International $g 83-05B.
790 $a 0009
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28774471