東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Error Floors of LDPC Codes and Relat...

Butler, Brian K.

Linked to FindBook

Google Book

Amazon

博客來

Error Floors of LDPC Codes and Related Topics.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Error Floors of LDPC Codes and Related Topics./
Author:	Butler, Brian K.
Description:	180 p.
Notes:	Source: Dissertation Abstracts International, Volume: 74-10(E), Section: B.
Contained By:	Dissertation Abstracts International74-10B(E).
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3567517
ISBN:	9781303193347

Error Floors of LDPC Codes and Related Topics.
Butler, Brian K.

Error Floors of LDPC Codes and Related Topics. - 180 p.

Source: Dissertation Abstracts International, Volume: 74-10(E), Section: B.

Thesis (Ph.D.)--University of California, San Diego, 2013.

Since their rediscovery in the late 1990s, low-density parity-check (LDPC) codes have rapidly become one the most important classes of error correcting codes. LDPC codes have a graphical description and are generally decoded iteratively. The graph of an iteratively decoded code's error rate performance versus the channel quality is typically divided into two regions. The error floor region appears at higher channel quality and is characterized by a more gradual decrease in error rate as channel quality improves. For iterative decoders the error floor is apparently determined by small structures within the code that are specific to the selected graphical description of the code and subtle details of the decoding algorithm.

ISBN: 9781303193347Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Error Floors of LDPC Codes and Related Topics.
LDR:03244nam a2200325 4500 001 1959508
005 20140520124321.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303193347
035 $a (MiAaPQ)AAI3567517
035 $a AAI3567517
040 $a MiAaPQ $c MiAaPQ
100 1 $a Butler, Brian K. $3 2094950
245 1 0 $a Error Floors of LDPC Codes and Related Topics.
300 $a 180 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-10(E), Section: B.
500 $a Adviser: Paul H. Siegel.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2013.
520 $a Since their rediscovery in the late 1990s, low-density parity-check (LDPC) codes have rapidly become one the most important classes of error correcting codes. LDPC codes have a graphical description and are generally decoded iteratively. The graph of an iteratively decoded code's error rate performance versus the channel quality is typically divided into two regions. The error floor region appears at higher channel quality and is characterized by a more gradual decrease in error rate as channel quality improves. For iterative decoders the error floor is apparently determined by small structures within the code that are specific to the selected graphical description of the code and subtle details of the decoding algorithm.
520 $a This thesis addresses several issues of LDPC error floors in the additive white Gaussian noise channel. First, we find the source of several well publicized error floors to be numerical issues within the message-passing decoder. We propose numerical improvements to several decoding formulations which substantially lower error floors.
520 $a Next, we examine and refine error-floor prediction models. A time-variant linear state-space model is presented and analyzed. Graph theory is applied to analyze the small error-prone structures within the code. While we find our techniques encounter considerable problems in determining the error floors for iterative decoders with unrestricted dynamic range, their predictions are quite accurate when significant range restrictions are present.
520 $a The final issue of LDPC error floors which we address relates to the minimum distance of quasi-cyclic (QC) LDPC codes. We derive improved minimum distance upper bounds for codes which are punctured and codes which contain a significant number of zeros in their protomatrices. These bound are then applied to a family of protograph-based LDPC codes standardized for use in deep-space communications. In the case of the rate-1/2 code, our upper bounds demonstrate that the previously promulgated ensemble lower bounds do not apply to QC constructions at block lengths beyond 4400 bits.
520 $a The last part of this dissertation is a fairly separate piece of work on bounding the spectral radius of a large class of nonnegative matrices. We apply these bounds to digraphs and derive several associated equality conditions.
590 $a School code: 0033.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Applied Mathematics. $3 1669109
690 $a 0544
690 $a 0364
710 2 $a University of California, San Diego. $b Electrical Engineering (Communication Theory and Systems). $3 1018760
773 0 $t Dissertation Abstracts International $g 74-10B(E).
790 $a 0033
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3567517