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: Juane Li
Publisher:
ISBN: 9781316780152
Category : Coding theory
Languages : en
Pages : 260
Get Book Here
Book Description
Author: Shu Lin
Publisher: Cambridge University Press
ISBN: 1009080563
Category : Technology & Engineering
Languages : en
Pages : 844
Get Book Here
Book Description
Using easy-to-follow mathematics, this textbook provides comprehensive coverage of block codes and techniques for reliable communications and data storage. It covers major code designs and constructions from geometric, algebraic, and graph-theoretic points of view, decoding algorithms, error control additive white Gaussian noise (AWGN) and erasure, and dataless recovery. It simplifies a highly mathematical subject to a level that can be understood and applied with a minimum background in mathematics, provides step-by-step explanation of all covered topics, both fundamental and advanced, and includes plenty of practical illustrative examples to assist understanding. Numerous homework problems are included to strengthen student comprehension of new and abstract concepts, and a solutions manual is available online for instructors. Modern developments, including polar codes, are also covered. An essential textbook for senior undergraduates and graduates taking introductory coding courses, students taking advanced full-year graduate coding courses, and professionals working on coding for communications and data storage.
Author: Biswanath Mukherjee
Publisher: Springer Nature
ISBN: 3030162508
Category : Technology & Engineering
Languages : en
Pages : 1169
Get Book Here
Book Description
This handbook is an authoritative, comprehensive reference on optical networks, the backbone of today’s communication and information society. The book reviews the many underlying technologies that enable the global optical communications infrastructure, but also explains current research trends targeted towards continued capacity scaling and enhanced networking flexibility in support of an unabated traffic growth fueled by ever-emerging new applications. The book is divided into four parts: Optical Subsystems for Transmission and Switching, Core Networks, Datacenter and Super-Computer Networking, and Optical Access and Wireless Networks. Each chapter is written by world-renown experts that represent academia, industry, and international government and regulatory agencies. Every chapter provides a complete picture of its field, from entry-level information to a snapshot of the respective state-of-the-art technologies to emerging research trends, providing something useful for the novice who wants to get familiar with the field to the expert who wants to get a concise view of future trends.
Author: Shu Lin
Publisher: Cambridge University Press
ISBN: 1316512622
Category : Computers
Languages : en
Pages : 843
Get Book Here
Book Description
An accessible textbook that uses step-by-step explanations, relatively easy mathematics and numerous examples to aid student understanding.
Author: Lan Lan
Publisher:
ISBN:
Category :
Languages : en
Pages : 340
Get Book Here
Book Description
Author: Juane Li
Publisher:
ISBN: 9781369201024
Category :
Languages : en
Pages :
Get Book Here
Book Description
Due to their capacity-approaching performance which can be achieved with practically implementable iterative decoding algorithms devised based on belief-propagation, low-density parity-check (LDPC) codes have rapid dominance in the applications requiring error control coding. This dissertation is intended to address certain important aspects of the aforementioned issues about LDPC codes. Subjects to be investigated include: (1) flexible and systematic methods for constructing binary LDPC codes with quasi-cyclic structure based on finite fields; (2) construction of high-rate and low-rate quasi-cyclic (QC) LDPC codes to achieve very low error rates without error-floor and with high rate of decoding convergence; (3) construction of binary QC-LDPC codes whose Tanner graphs have girth 8 or larger and contain minimum number of short cycles; (4) developing effective algorithms for enumerating short cycles in the Tanner graph of LDPC codes; (5) devising reduced-complexity decoding schemes and algorithms for binary QC-LDPC codes; (6) effective matrix-theoretic methods for constructing nonbinary (NB) LDPC codes; and (7) reduced-complexity decoding schemes and algorithms for NB LDPC codes. The dissertation presents a simple, flexible and systematic method to construct both binary and nonbinary LDPC codes with quasi-cyclic (QC) structure based on two arbitrary subsets of a finite field. One technique for constructing QC-LDPC codes whose Tanner graphs have girth 8 or larger is also proposed. Simulation results show that these constructed codes perform well over both the additive white Gaussian noise and the binary erasure channels. Also presented in this dissertation is a reduced-complexity decoding scheme to decode binary QC-LDPC codes. The decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. The proposed decoding scheme combined with iterative decoding algorithms of LDPC codes results in no or a relative small performance degradation. Two efficient algorithms for enumerating short cycles in the Tanners graph of LDPC codes are presented. One algorithm is devised based on iterative message-passing algorithm by introducing messages in term of monomials, which is an improvement of the work of Karimi and Banihashemi. The other one is based on the trellis of an LDPC code by finding the partial paths which can form cycles. By removing certain number of cycles, a new code whose Tanner graph has a smaller number of short cycles, a larger girth, or both can be constructed. An algorithm to count and find cycles of lengths four and six in a class of QC-LDPC codes is also proposed. In this dissertation, we also briefly investigate one of the algebraic-based constructions of LDPC code, namely superposition (SP) construction, and one of the graph-based constructions, namely protograph-based (PTG-based) construction. The SP-construction method is re-interpreted in a broader scope from both the algebraic and the graph-theoretic perspectives. From the graph-theoretic point of view, it is shown that the PTG-based construction of LDPC codes is a special case of the SP-construction. An algebraic method for constructing PTG-based QC-LDPC codes through decomposing a small matrix is proposed. Several methods for constructing QC-LDPC codes through the SP-construction are also presented.
Author: Bo Zhou
Publisher:
ISBN:
Category :
Languages : en
Pages : 292
Get Book Here
Book Description
Author: Jun Xu
Publisher:
ISBN:
Category :
Languages : en
Pages : 356
Get Book Here
Book Description
Author: Sohail Noor
Publisher: LAP Lambert Academic Publishing
ISBN: 9783844394122
Category :
Languages : en
Pages : 64
Get Book Here
Book Description
Low Density Parity Check (LDPC) codes are one of the block coding techniques that can approach the Shannon's limit within a fraction of a decibel for high block lengths. In many digital communication systems these codes have strong competitors of turbo codes for error control. LDPC codes performance depends on the excellent design of parity check matrix and many diverse research methods have been used by different study groups to evaluate the performance.Finite fields construction method is used and diverse techniques like masking, dispersion and array dispersion for the construction of parity check matrix H. These constructed codes are then simulated to make the performance evaluation. Simulation was done for different rates using additive white Gaussian noise (AWGN) channel. In MATLAB a library of different functions was created to perform the task for base matrix construction, dispersion, masking, generator matrix construction etc.
