![Effects of Clipping and Quantization on Min-sum Algorithm and Its Modifications for Decoding Low-density Parity-check (LDPC) Codes [microform] PDF](https://books.google.com/books/content/images/frontcover/-6fouQEACAAJ?fife=w150-h200)
Author: Jianguang ZhaoPublisher: National Library of Canada = Bibliothèque nationale du Canada
ISBN: 9780612889064
Category : Algorithms
Languages : en
Pages : 238
Book Description
Effects of Clipping and Quantization on Min-sum Algorithm and Its Modifications for Decoding Low-density Parity-check (LDPC) Codes [microform]
![Effects of Clipping and Quantization on Min-sum Algorithm and Its Modifications for Decoding Low-density Parity-check (LDPC) Codes [microform] PDF](https://books.google.com/books/content/images/frontcover/-6fouQEACAAJ?fife=w80-h100)
Author: Jianguang ZhaoPublisher: National Library of Canada = Bibliothèque nationale du Canada
ISBN: 9780612889064
Category : Algorithms
Languages : en
Pages : 238
Book Description
Modified Adaptive Offset Min-Sum Algorithm for Low-Density Parity Check Codes
Author: 黃耀熠Low-Complexity Decoding of Low-Density Parity Check Codes Through Optimal Quantization and Machine Learning and Optimal Modulation and Coding for Short Block-Length Transmissions
Author: Linfang WangPublisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
This dissertation investigates two topics in channel coding theory: low-complexity decoder design for low-density parity-check (LDPC) codes and reliable communication in the short blocklength regime. For the first topic, we propose a finite-precision decoding method that features the three steps of Reconstruction, Computation, and Quantization (RCQ). The parameters of the RCQ decoder, for both the flooding-scheduled and the layered-scheduled, can be designed efficiently using discrete density evolution featuring hierarchical dynamic quantization (HDQ). To further reduce the hardware usage of the RCQ decoder, we propose a second RCQ framework called weighted RCQ (W-RCQ). Unlike the RCQ decoder, whose quantization and reconstruction parameters change in each layer and iteration, the W-RCQ decoder limits the number of quantization and reconstruction functions to a very small number during the decoding process, for example, three or four. However, the W-RCQ decoder weights check-to-variable node messages using dynamic parameters optimized by a quantized neural network. The proposed W-RCQ decoder uses fewer parameters than the RCQ decoder, thus requiring much fewer resources such as lookup tables. For the second topic, we apply probabilistic amplitude shaping (PAS) to cyclic redundancy check (CRC)-aided tail-biting trellis-coded modulation (TCM). CRC-TCM-PAS produces practical codes for short block lengths on the additive white Gaussian noise (AWGN) channel. In the transmitter, equally likely message bits are encoded by a distribution matcher (DM), generating amplitude symbols with a desired distribution.A CRC is appended to the sequence of amplitude symbols, and this sequence is then encoded and modulated by TCM to produce real-valued channel input signals. We prove that the sign values produced by the TCM are asymptotically equally likely to be positive or negative. The CRC-TCM-PAS scheme can thus generate channel input symbols with a symmetric capacity-approaching probability mass function. We also provide an analytical upper bound on the frame error rate of the CRC-TCM-PAS system over the AWGN channel. This FER upper bound is the objective function for jointly optimizing the CRC and convolutional code. This paper also proposes a multi-composition DM, a collection of multiple constant-composition DMs. The optimized CRC-TCM-PAS systems achieve frame error rates below the random coding union (RCU) bound in AWGN and outperform the short-blocklength PAS systems with various other forward error correction codes.
Analysis of Finite-length Low-density Parity-check Codes
Author: Chenying WangLow-density Parity-check Codes
Author: Sara SandbergPublisher:
ISBN: 9789186233143
Category :
Languages : en
Pages : 188
Book Description
Good Families of Quantum Low-density Parity-check Codes and a Geometric Framework for the Amplitude-damping Channel
Author: Reina RiemannPublisher:
ISBN:
Category :
Languages : en
Pages : 70
Book Description
Classical low-density parity-check (LDPC) codes were first introduced by Robert Gallager in the 1960's and have reemerged as one of the most influential coding schemes. We present new families of quantum low-density parity-check error-correcting codes derived from regular tessellations of Platonic 2-manifolds and from embeddings of the Lubotzky-Phillips-Sarnak Ramanujan graphs. These families of quantum error-correcting codes answer a conjecture proposed by MacKay about the existence of good families of quantum low-density parity-check codes with nonzero rate, increasing minimum distance and a practical decoder. For both families of codes, we present a logarithmic lower bound on the shortest noncontractible cycle of the tessellations and therefore on their distance. Note that a logarithmic lower bound is the best known in the theory of regular tessellations of 2-manifolds. We show their asymptotic sparsity and non-zero rate. In addition, we show their decoding performance with simulations using belief propagation. Furthermore, we present a general geometrical model to design non-additive quantum error-correcting codes for the amplitude-damping channel. Non-additive quantum error-correcting codes are more general than stabilizer or additive quantum errorcorrecting codes, and in some cases non-additive quantum codes are more optimal. As an example, we provide an 8-qubit amplitude-damping code, which can encode 1 qubit and correct for 2 errors. This violates the quantum Hamming bound which requires that its length start at 9.
Weight Distributions and Constructions of Low-density Parity-check Codes
Author: Chung-Li WangPublisher:
ISBN: 9781124223643
Category :
Languages : en
Pages :
Book Description
Low-density parity-check (LDPC) codes are currently the most promising coding technique to achieve the Shannon capacities for a wide range of channels. These codes were first discovered by Gallager in 1962 and then rediscovered in late 1990's. Ever since their rediscovery, a great deal of research effort has been expended in design, construction, encoding, decoding, performance analysis, generalizations, and applications of LDPC codes. This research is set up to investigate two major aspects of LDPC codes: weight distributions and code constructions. The research focus of the first part is to analyze the asymptotic weight distributions of various ensembles. Analysis shows that for generalized LDPC (G-LDPC) and doubly generalized LDPC (DG-LDPC) code ensembles with some conditions, the average minimum distance grows linearly with the code length. This implies that both ensembles contain good codes. The effect of changing the component codes of the ensemble on the minimum distance is clarified. The computation of asymptotic weight and stopping set enumerators is improved. Furthermore, the average weight distribution of a multi-edge type code ensemble is investigated to obtain its upper and lower bounds. Based on them, the growth rate of the number of codewords is defined. For the growth rate of codewords with small linear, logarithmic, and constant weights, the approximations are given with two critical coefficients. It is shown that for infinite code length, the properties of the weight distribution are determined by its asymptotic growth rate. The second part of the research emphasizes specific designs and constructions of LDPC codes that not only perform well but can also be efficiently encoded. One such construction is the serial concatenation of an LDPC outer code and an accumulator with an interleaver. Such construction gives a code called an LDPCA code. The study shows that well designed LDPCA codes perform just as well as the regular LDPC codes. It also shows that the asymptotic minimum distance of regular LDPCA codes grows linearly with the code length.
كتاب لمحة الناظر فى مسك الدفاتر
Author: Finite Geometry Low Density Parity Check Codes
Author: Yu KouLow Density Parity Check Codes Based on Finite Geometries
Author: National Aeronautics and Space Adm NasaPublisher:
ISBN: 9781723736247
Category :
Languages : en
Pages : 36
Book Description
Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents two classes of high rate LDPC codes whose constructions are based on finite Euclidean and projective geometries, respectively. These classes of codes a.re cyclic and have good constraint parameters and minimum distances. Cyclic structure adows the use of linear feedback shift registers for encoding. These finite geometry LDPC codes achieve very good error performance with either soft-decision iterative decoding based on belief propagation or Gallager's hard-decision bit flipping algorithm. These codes can be punctured or extended to obtain other good LDPC codes. A generalization of these codes is also presented.Kou, Yu and Lin, Shu and Fossorier, MarcGoddard Space Flight CenterEUCLIDEAN GEOMETRY; ALGORITHMS; DECODING; PARITY; ALGEBRA; INFORMATION THEORY; PROJECTIVE GEOMETRY; TWO DIMENSIONAL MODELS; COMPUTERIZED SIMULATION; ERRORS; BLOCK DIAGRAMS...