Design of Capacity-approaching Protograph-based LDPC Coding Systems PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Design of Capacity-approaching Protograph-based LDPC Coding Systems PDF full book. Access full book title Design of Capacity-approaching Protograph-based LDPC Coding Systems by Thuy Van Nguyen. Download full books in PDF and EPUB format.
Author: Thuy Van Nguyen
Publisher:
ISBN:
Category : Coding theory
Languages : en
Pages : 198
Get Book Here
Book Description
In this dissertation, a systematic framework is proposed to design practical protograph-based low-density parity check (LDPC) coding schemes that address simultaneously several important issues: structured coding that permits easy design, low encoding complexity, embedded structure for convenient adaptation to various channel conditions, and performance close to capacity with a reasonable block length. This dissertation consists of four closely inter-related parts. In the first part, the design of rate-compatible protograph codes for the hybrid automatic repeat request protocol is presented. A high-performance family of protograph codes that has the iterative decoding threshold within a gap of a fraction of dB to capacity in the AWGN channel over a wide range of rates is reported. In the second part, protograph-based LDPC coding schemes are designed for half-duplex relay channels. A simple new methodology for evaluating the end-to-end error performance of relay coding systems is then developed and used to highlight the performance of the proposed codes. In the third part, a general mapping method is devised for using protograph-based LDPC codes in bit-interleaved coded modulation. The reported coding scheme operates close to the coded modulation capacity. In the fourth part, the design of rate-compatible protograph codes in inter-symbol interference channels is proposed. The design problem is non-trivial due to the joint design of structured LDPC codes and the state structure of ISI channels using the BCJR equalizer. High-performance protograph-based LDPC codes that have iterative thresholds close to i.u.d capacity of ISI channels are reported.
Author: Thuy Van Nguyen
Publisher:
ISBN:
Category : Coding theory
Languages : en
Pages : 198
Get Book Here
Book Description
In this dissertation, a systematic framework is proposed to design practical protograph-based low-density parity check (LDPC) coding schemes that address simultaneously several important issues: structured coding that permits easy design, low encoding complexity, embedded structure for convenient adaptation to various channel conditions, and performance close to capacity with a reasonable block length. This dissertation consists of four closely inter-related parts. In the first part, the design of rate-compatible protograph codes for the hybrid automatic repeat request protocol is presented. A high-performance family of protograph codes that has the iterative decoding threshold within a gap of a fraction of dB to capacity in the AWGN channel over a wide range of rates is reported. In the second part, protograph-based LDPC coding schemes are designed for half-duplex relay channels. A simple new methodology for evaluating the end-to-end error performance of relay coding systems is then developed and used to highlight the performance of the proposed codes. In the third part, a general mapping method is devised for using protograph-based LDPC codes in bit-interleaved coded modulation. The reported coding scheme operates close to the coded modulation capacity. In the fourth part, the design of rate-compatible protograph codes in inter-symbol interference channels is proposed. The design problem is non-trivial due to the joint design of structured LDPC codes and the state structure of ISI channels using the BCJR equalizer. High-performance protograph-based LDPC codes that have iterative thresholds close to i.u.d capacity of ISI channels are reported.
Author: Kasra Vakilinia
Publisher:
ISBN:
Category :
Languages : en
Pages : 201
Get Book Here
Book Description
This dissertation mainly focuses on two different branches of coding theory and its applications:1) coding to approach capacity in short blocklengths using feedback and 2) LDPC coding for Flash memory systems. In the first area, we study the benefits that feedback with incremental redundancy can provide to increase the maximum achievable rate in communication systems, using carefully designed adaptive non-binary LDPC codes. We show how to achieve over 90% of the idealized throughput of rate-compatible sphere-packing with maximum-likelihood decoding (RCSP-ML) for average blocklengths of 150-450 bits. This is important because it illustrates that feedback greatly reduces the number of transmitted symbols required to achieve near-capacity performance. We then extend these ideas to feedback systems where the number of incremental transmissions is limited. In order to optimize the blocklengths for each incremental transmission we formulate an integer optimization problem involving an approximation based on the inverse-Gaussian p.d.f., the distribution of the blocklength required for successful decoding. The brute-force approach to solve this computationally complex optimization problem quickly becomes infeasible. In order to solve this problem efficiently, we introduce sequential differential optimization (SDO) algorithm that has only linear complexity to identify optimal incremental transmission lengths. The results obtained from SDO are negligibly different from the exponentially complex exhaustive-search solution. By using the optimized incremental transmission lengths (with an average blocklength of less than 500 bits), non-binary LDPC codes achieve a throughput greater than 90% of the capacity with a two-phase scheme. Furthermore, we extend these ideas to the case of using cyclic redundancy checks (CRC). With CRC, even better performance in the blocklength range of about 500 bits is obtainable. The overhead associated with a CRC prevents great performance in short blocklength regime (fewer than 400 bits). We also extend these ideas to systems with larger constellations operating at a higher signal-to-noise ratio (SNR). Another incremental transmission coding scheme studied in this dissertation focuses on de- sign and use of rate-compatible protograph-based raptor-like (PBRL) LDPC codes with various blocklengths and rates that can be used in feedback systems over additive-white Gaussian noise (AWGN) channels. The codes proposed in this work use X-OR operations and density evolution to produce additional degree-one parity bits providing extensive rate compatibility. The protographs are also carefully lifted to avoid undesirable graphical structures such as problematic stopping sets. For a target frame error rate of 10 5, at each rate the k = 1032 and k = 16384 code families perform within 1 dB and 0.4 dB, respectively, of both the Gallager bound and the normal approximation. The k = 16384 code family outperforms the best known standardized code family, the AR4JA and longer DVB-S2 codes. We extend the ideas in design of PBRL codes from AWGN channels to binary symmetric channels (BSC) and binary erasure channels (BEC). We introduce two fast and efficient algorithms to calculate the threshold of LDPC codes used over BSC. These algorithms serve as alternatives to the quite complex density evolution algorithm. Since these new algorithms are quite fast, we use them to design PBRL LDPC codes for BSC. To explore the advantage of feedback in conjunction with other modern coding schemes, in this work we use an extension of reciprocal channel approximation (RCA) to accurately and effi- ciently predict the frame error rate (FER) performance of polar codes by analyzing the probability density function (p.d.f.) of the log-likelihood ratio (LLR) values associated with information bits. The preliminary results show that a feedback scheme in conjunction with a repetition coding sys- tem significantly reduces the blocklength required to achieve a target FER. For example, using a rate-0.5 128-bit polar code as the initially transmitted code, the theoretical analysis verified by simulation shows a 16-fold reduction in blocklength with only about 7.4% of overhead in forward channel transmissions. We also make an improvement to this feedback coding scheme which reduces the overhead to almost 3% for a similar FER performance gain. The second part of this dissertation focuses on design of binary and non-binary LDPC codes for Flash memory systems. Usually the FER requirements in Flash memory systems is more strict than wireless communication systems. In order to improve the error correction capability of the codes used in Flash memory systems, sometimes the same memory cell is read multiple times. In this dissertation, we study the coding gain from multiple reads of the same Flash memory cell with distinct word-line voltages. The subsequent additional reads provide enhanced precision for LDPC decoding. We identify a trade-off in LDPC code design when decoding is performed with multiple precision levels and conclude that the best code at one level of precision is typically not be the best code at a different level of precision. By studying the trade-off in LDPC code design by using extrinsic-information-transfer (EXIT)- function analysis employing the reciprocal channel approximation (RCA), we obtain the optimal LDPC code degree distributions for initial hard decoding (one-bit quantization of the channel out- put) and for decoding with the soft information provided by subsequent additional reads in both SLC (two-level cell) and MLC (four-level-cell) Flash memory. The results indicate that design for hard decoding can provide irregular degree distributions that have good thresholds across a range of possible decoding precisions. Finally, we illustrate that the MMI optimization of word-line voltages for five reads is a quasi-convex problem for the Gaussian model of SLC Flash.
Author: Juane Li
Publisher: Cambridge University Press
ISBN: 1107175682
Category : Computers
Languages : en
Pages : 259
Get Book Here
Book Description
In this book, leading authorities unify algebraic- and graph-based LDPC code designs and constructions into a single theoretical framework.
Author: Sudarsan Vasista Srinivasan Ranganathan
Publisher:
ISBN:
Category :
Languages : en
Pages : 168
Get Book Here
Book Description
This dissertation consists of three parts. The first part focuses on a class of modern channel codes known as protograph-based low-density parity-check (LDPC) codes. Also known as protograph LDPC codes, these powerful error-correcting codes have enabled communication systems of the past fifteen years to achieve very high throughputs. The first part of the dissertation presents a new design method based on an upper bound on minimum distance to obtain rate-compatible, protograph quasi-cyclic (QC) LDPC codes called Protograph-based Raptor-like LDPC codes (PBRL codes). A major contribution here is a very-low-complexity PBRL design algorithm that is provably efficient. The second part of the dissertation continues the focus on protograph LDPC codes, first exploring how the decoding complexity of PBRL codes can be reduced and whether the extending structure that provides rate-compatibility to a PBRL code is optimal or not. Then, this part considers the problem of design of PBRL codes for any increment ordering. The degree-1 extending structure yields naturally to the design of PBRL codes that decode efficiently even when increments arrive out-of-order. This part finally considers the following question: What is the shortest block-length required to obtain a protograph QC-LDPC code with a girth of at least 6 or 8 from a (3, L) complete protograph? An affirmative answer is given for girth of at least 6 and directions are explored for girth of at least 8. Finally, the dissertation turns to communication theory and tackles a rate allocation problem previously studied in literature, but with an important twist. Consider a cross-layer coding scheme with packet-level erasure coding and physical-layer channel coding. It is known from previous work that some erasure coding is necessary even in the limit of large physical-layer codeword block-lengths if the physical-layer fading channel does not provide diversity that grows with block-length. However, is erasure coding still required in the limit of large block-lengths if the physical layer allows for diversity to grow with block-length? The theoretical answer turns out to be a resounding "no" in the case of Rayleigh fading that allows diversity to increase linearly with block-length.
Author: Jilei Hou
Publisher:
ISBN:
Category :
Languages : en
Pages : 316
Get Book Here
Book Description
Author: Martin Tomlinson
Publisher: Springer
ISBN: 3319511033
Category : Technology & Engineering
Languages : en
Pages : 527
Get Book Here
Book Description
This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style, the book presents the authors’ twenty-five years of research organized into five parts: Part I is concerned with the theoretical performance attainable by using error correcting codes to achieve communications efficiency in digital communications systems. Part II explores the construction of error-correcting codes and explains the different families of codes and how they are designed. Techniques are described for producing the very best codes. Part III addresses the analysis of low-density parity-check (LDPC) codes, primarily to calculate their stopping sets and low-weight codeword spectrum which determines the performance of th ese codes. Part IV deals with decoders designed to realize optimum performance. Part V describes applications which include combined error correction and detection, public key cryptography using Goppa codes, correcting errors in passwords and watermarking. This book is a valuable resource for anyone interested in error-correcting codes and their applications, ranging from non-experts to professionals at the forefront of research in their field. This book is open access under a CC BY 4.0 license.
Author: Jeremy Thorpe
Publisher:
ISBN:
Category : Electronic dissertations
Languages : en
Pages : 166
Get Book Here
Book Description
Author: Tom Richardson
Publisher: Cambridge University Press
ISBN: 9780521852296
Category : Technology & Engineering
Languages : en
Pages : 590
Get Book Here
Book Description
Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.
Author: William Ryan
Publisher: Cambridge University Press
ISBN: 1139483013
Category : Technology & Engineering
Languages : en
Pages : 709
Get Book Here
Book Description
Channel coding lies at the heart of digital communication and data storage, and this detailed introduction describes the core theory as well as decoding algorithms, implementation details, and performance analyses. In this book, Professors Ryan and Lin provide clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes. They also present detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, and product codes, providing a one-stop resource for both classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design. 250 varied and stimulating end-of-chapter problems are also included to test and enhance learning, making this an essential resource for students and practitioners alike.
Author:
Publisher:
ISBN:
Category : French language
Languages : en
Pages :
Get Book Here
Book Description
