LDPC Codes. Intracom Telecom, Peania
|
|
- Myrtle Hart
- 6 years ago
- Views:
Transcription
1 LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom, Peania A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
2 Outline 1 Introduction to LDPC Codes 2 Iterative Decoding of LDPC Codes Belief Propagation Density Evolution Gaussian Approximation EXIT Charts 3 Efficient Encoding of LDPC and QC-LDPC Codes 4 Construction of QC-LDPC Codes Deterministic Random 5 RA and Structured RA Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
3 LDPC Codes When? Discovered in 1962 by Gallager. Rediscovered by MacKay and others in late 1990s. Why? Capacity approaching on many channels. Linear decoding complexity using Belief Propagation. Linear complexity encoding, under certain conditions. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
4 LDPC Codes We can define a linear block code C as the nullspace of its m n parity check matrix: C = {c {0, 1} n : Hc = 0}. We can also define a linear block code C through its k n generator matrix as follows: { C = c = G T u : u {0, 1} k}. LDPC codes are linear block codes with a sparse parity check matrix. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
5 Factor Graph Representation An LDPC code can be associated with a bipartite graph, also called a factor graph or Tanner graph. Variable nodes correspond to codeword bits and check nodes correspond to the parity-check equations enforced by the code. Variable node j is connected with check node i if and only if H ij = 1. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
6 Factor Graph Representation and Degree Distributions Example ((7, 4) Hamming Code) H = Variable nodes Check nodes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
7 Degree Distributions The variable node degree distribution from an edge perspective is denoted as: λ(x) = λ i x i 1 i The check node degree distribution from an edge perspective is denoted as: ρ(x) = ρ i x i 1 i The λ i s and ρ i s determine the ratio of edges that are connected to variable and check nodes of degree i, respectively. They also determine the code s design rate: R = 1 i ρ i/i i λ i/i, as well as its average performance, as we will see. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
8 + + Factor Graph Representation and Degree Distributions Example ((7, 4) Hamming Code) H = Variable nodes Check nodes + λ(x) = x x 2 ρ(x) = x 3 A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
9 1 Introduction to LDPC Codes 2 Iterative Decoding of LDPC Codes Belief Propagation Density Evolution Gaussian Approximation EXIT Charts 3 Efficient Encoding of LDPC and QC-LDPC Codes 4 Construction of QC-LDPC Codes Deterministic Random 5 RA and Structured RA Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
10 Sum-Product Marginalization Consider a function which can be factorized as follows f (x 1,..., x 6 ) = f 1 (x 1, x 2, x 3 )f 2 (x 1, x 4, x 6 )f 3 (x 4 )f 4 (x 4, x 5 ) Brute force calculation of marginal f (x 1 ) = x 1 f (x 1,..., x 6 ) requires O( X 6 ) operations. Using the factorization and the distributive law, we can write [ ] f (x 1 ) = f 1 (x 1, x 2, x 3 ) Kernel {}}{ f 2 (x 1, x 4, x 6 ) f 3 (x 4 )f 4 (x 4, x 5 ) x 1 x 1 }{{} Can be further expanded. reducing complexity to O( X 4 ). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
11 Sum-Product Marginalization By further expanding f (x 1 ) we get the following factor graph: A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
12 Sum-Product Marginalization Rules (a) Variable node rules. (b) Function node rules. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
13 Sum-Product Marginalization - Step 1 A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
14 Sum-Product Marginalization - Step 2 A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
15 Sum-Product Marginalization - Step 3 A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
16 Sum-Product Marginalization - Step 4 A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
17 Sum-Product Marginalization - Final Step A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
18 Sum-Product Decoding Transmission of a codeword x = [ x 1 ] x n C over an AWGN channel y i = x i + w i, w i N (0, σw 2 ), i = 1, 2,..., n. The MAP decoding rule for x i reads ˆx i = arg max p(x i y) x i {±1} = arg max p(x y) x i {±1} x i = (Bayes rule, conditional independence) n = arg max p(y j x j ) 1 [x C] x i {±1} x i j=1 }{{} Sum-Product form! A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
19 Belief Propagation Log-domain decoding simplifies the sum-product rules and guarantees numerical stability of the calculations. LLRs are used as messages, i.e. each variable node aims to calculate ( ) p(xi = +1 y) L i = log p(x i = 1 y) If L i > 0, then ˆx i = +1, if L i < 0 then ˆx i = 1. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
20 Belief Propagation (a) Variable node rules. (b) Check node rules. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
21 Belief Propagation Decoding - Initialization p(x i ) and p(y i ) are known. So, given p(y i x i ), we can calculate p(x i y i ), i.e. the a posteriori probability of x i given the channel observation y i. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
22 Belief Propagation If graph is cycle-free, after running BP, we get the marginal p(x 1 y). The same holds for all p(x i y), i = 1, 2,... A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
23 Belief Propagation Decoding If Tanner graph is cycle-free, we can calculate all p(x i y), i = 1, 2,..., simultaneously. Bad news about cycle-free codes: they necessarily contain many low-weight codewords and, hence, have a high probability of error. However, BP still performs very well in practice, even when cycles are present. On graphs with cycles, when Hˆx = 0 or a maximum number of iterations is reached, decoding halts. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
24 Other Iterative Decoding Algorithms Wide variety of performance-complexity trade-offs. In order of increasing complexity and performance: 1 Bit-flipping 2 Majority Logic Decoding 3 Min-Sum Decoding 4 Belief Propagation Decoding A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
25 Density Evolution In the limit of infinite blocklength, the performance of the (λ, ρ)-ensemble of LDPC codes under Belief Propagation decoding can be predicted by Density Evolution. Due to the concentration theorem, performance of individual codes in the ensemble is close to the ensemble average performance (exponential convergence w.r.t. the codeword length). Density Evolution tracks the evolution of message probability density functions throughout the decoding procedure, under the assumption that the all-zero codeword is transmitted. For the BI-AWGNC, probability density functions must be tracked since the received LLR messages are continuous random variables (computationally very demanding). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
26 Density Evolution - BI-AWGN Channel Initial LLR based only on the channel output is: LLR(y) = 2y ( 2 σ 2 N σ 2, 4 ) σ 2. 1 x 10 3 Initial LLR distribution LLR magnitude A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
27 Density Evolution - BI-AWGN Channel LLR magnitude Figure: (3, 6)-regular code, σ 2 = A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
28 Density Evolution - BI-AWGN Channel LLR magnitude Figure: (3, 6)-regular code, σ 2 = A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
29 Density Evolution - BI-AWGN Channel LLR magnitude Figure: (3, 6)-regular code, σ 2 = A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
30 Density Evolution - Gaussian Approximation Gaussian Approximation (GA): we assume the messages are symmetric Gaussian random variables, i.e. variance σ 2 and mean σ 2 /2 (Central Limit Theorem). We must track only the mean. Variable node of degree i at iteration l: m (l) v i = m ch + k m (l 1) k Average over λ(x): m (l) v = i λ i m (l) v i. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
31 Density Evolution - Gaussian Approximation Check node of degree i at iteration l: [ u,i = φ 1 1 m (l) 1 i ( λ i φ m (l) v i ) ] j 1 Average over ρ(x): m (l) u = i ρ i m (l) u,i. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
32 Gaussian Approximation - Convergence Under the assumption that the message densities are symmetric Gaussian and that the all-zero codeword was transmitted, the average probability of bit error is: P (l) e = Q m (l) v 2 m(l) v 0. If m (l) v > m (l 1) v, l = 1, 2,... then, the BP decoder converges to a vanishingly small probability of error. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
33 EXIT Charts Message: extrinsic LLR of codebit i: L i = log p(x i = +1 y i ) p(x i = 1 y i ). Message Density: density of extrinsic LLR assuming that the all-zero codeword was transmitted. BP at a variable node acts as a decoder of a repetition code. BP at a check node acts as a decoder of a parity-check code. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
34 EXIT Charts - Repetition Code Consider an [n, 1, n] repetition code. Transmit X = ±1 over AWGNC: y i = x + w i, w i N (0, σ 2 w ), i = 1,..., n. p(x y) = p(x, y) p(y) = p(y x)p(x) p(y) p(y x) = n p(y i x). i=1 }{{} variable node rule Before decoding: p(x y i ) = a and I (X ; Y i ) = 1 H(a). After decoding: I (X ; Y) = 1 H(a n ), where n denotes n-fold convolution. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
35 EXIT Charts - Parity-Check Code Consider an [n, n 1, 2] parity-check code. Transmit codeword x = [ x 1 x 2... x n ], xi = ±1, over AWGNC: y i = x i + w i, w i N (0, σ 2 w ), i = 1,..., n. p(x i y) = p(x i, y) p(y) x i p(x)p(y x) = x i (1 [x1 x 2... x n=1] ) n p(y i x i ) } {{ } check node rule Before decoding: p(x i y i ) = b and I (X i ; Y i ) = 1 H(b). After decoding: I (X i ; Y) = 1 H(b n ), where n denotes n-fold convolution in the G-domain. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61 i=1
36 EXIT Charts Now, if we consider the repetition and parity-check codes as being part of a large system that performs message passing decoding, we have: For the variable node, if I (X ; L i (X )) = 1 H(a), then: I (X ; L(X )) = 1 H(a n ). For the check codes, if the I (X i ; L i (X i )) = 1 H(b), then: I (X ; L(X )) = 1 H(b n ). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
37 EXIT Charts We define: J(σ) = πσ e (x σ2 /2) 2 2σ 2 log 2 (1 + e x )dx. J(σ) is the mutual information between a codeword bit and the corresponding message, assuming that the message is a symmetric Gaussian random variable with standard deviation σ. J 1 (I ) is the standard deviation of the symmetric Gaussian distributed message which has mutual information I with a codeword bit. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
38 EXIT Charts - Variable Nodes I EV (resp. I AV ) is the average mutual information between the outgoing (resp. incoming) messages of variable nodes and the codeword bits. The EXIT chart I EV describing the variable node function of degree i: ) I i EV (I AV, σ 2 ch ) = J ( (i 1)J 1 (I AV ) 2 + σ 2 ch Average over λ(x): I EV (I AV, σ 2 ch ) = i λ i I i EV (I AV, σ 2 ch ), with σch 2 = 4, σ 2 σw 2 w is the noise variance. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
39 EXIT Charts - Check Nodes I EC (resp. I AC ) is the average mutual information between the outgoing (resp. incoming) messages of check nodes and the codeword bits. The EXIT chart I EC describing the check node function of degree i: ( ) IEC i (I AC ) 1 J (i 1)J 1 (1 I AC ) Average over ρ(x): I EC (I AC ) i ρ i I i EC (I AC ). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
40 EXIT Charts - Code Optimization For every possible incoming average mutual information at variable nodes, we want the outgoing average mutual information to be larger: I EC (I EV (I AV )) > I AV If the EXIT chart of the variable nodes lies above the inverse of the EXIT chart for the check nodes, i.e. I EV (I AV ) > I 1 EC (I AV ) then the decoding converges to a vanishingly small probability of error. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
41 EXIT Charts - Code Rate Optimization For given λ(x) and ρ(x), the code design rate is: R = 1 i ρ i/i i λ i/i. A common approach is to maximize R over λ(x) for fixed ρ(x). This gives rise to a continuous linear program: max v max λ i /i i=2 s.t. I 1 EC (I AV ) < I EV (I AV ) = v max λ i IEV i (I AV ), I AV (0, 1) i=2 v max λ i = 1, λ i 0, i = 2, 3,..., v max. i=2 We solve it by discretizing I AV (0, 1). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
42 EXIT Charts - Code Optimization 0.8 I AC or I EV I EC I AV I AC or I EV I AV or I EC I AV or I EC (a) (3, 6)-regular ensemble, r = 0.5. Figure: Noise variance σ 2 = (b) Optimized ensemble, r = A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
43 1 Introduction to LDPC Codes 2 Iterative Decoding of LDPC Codes Belief Propagation Density Evolution Gaussian Approximation EXIT Charts 3 Efficient Encoding of LDPC and QC-LDPC Codes 4 Construction of QC-LDPC Codes Deterministic Random 5 RA and Structured RA Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
44 Efficient Encoding of LDPC Codes In the general case, encoding has complexity O(n 2 ). If parity-check matrix has an approximate upper triangular form, it can be shown that encoding can be achieved with complexity O(n + g 2 ). A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
45 QC-LDPC Codes - Motivation In general, storage of parity check matrix requires O(n 2 ) memory. In Quasi-Cyclic (QC) LDPC codes, the parity check matrix consists of q q sparse circulant submatrices (usually, permutation matrices). Each circulant is fully characterized by its first row or column. Required memory becomes O(n 2 /q), i.e. reduction by a factor of q. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
46 Efficient Encoding of QC-LDPC Codes The generator matrix G can be obtained in systematic form from its cq tq parity-check matrix G = [ I G P ]. Encoding is done as follows where c = ag = [ a p ], G P has the form: G 1,1 G 1,2... G 1,c G 2,1 G 2,2... G 2,c G P = G t c,1 G t c,2... G t c,c G i,j s are circulants, e.g G i,j = A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
47 Efficient Encoding of QC-LDPC Codes For p, we have: The j-th parity q-tuple can then be obtained as follows: p j = a 1 G 1,j + a 2 G 2,j a t c G t c,j, where a j is the j-th q-tuple of the input. The G i,j s are also circulants which can be fully described by their first row, g i,j. Thus, we can calculate each term of p j as follows: a i G i,j = a (i 1)b+1 g (0) i,j + a (i 1)b+2 g (1) i,j a ib g (b 1) i,j, (1) where g (l) i,j denotes the l-th right cyclic shift of g i,j. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
48 Efficient Encoding of QC-LDPC Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
49 Efficient Encoding of QC-LDPC Codes Some other schemes have been proposed. Wide variety of throughput-size trade-offs. Scheme Encoding speed FFs 2-input XOR 2-input AND 1 (t c)q 2cq cq cq 2 cq (t c)q (t c)q 1 (t c)q 3 q tq O(c 2 q) 0 Table: Various encoder architectures and their complexity. q t c Size of circulants Number of horizontally stacked circulants. Number of vertically stacked circulants. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
50 1 Introduction to LDPC Codes 2 Iterative Decoding of LDPC Codes Belief Propagation Density Evolution Gaussian Approximation EXIT Charts 3 Efficient Encoding of LDPC and QC-LDPC Codes 4 Construction of QC-LDPC Codes Deterministic Random 5 RA and Structured RA Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
51 Deterministic QC-LDPC Codes (Array Codes) For a prime q and positive integer m q, we create the matrix: I I... I... I I P 1... P (m 1)... P (q 1) H = I P 2... P 2(m 1)... P 2(q 1) I P (m 1)... P (m 1)(m 1)... P (m 1)(q 1) P = P i is P with all columns cyclically shifted to the right by i positions. By convention, P 0 = I and P = 0. H represents a (j, q) regular QC-LDPC code. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
52 Deterministic QC-LDPC Codes (Modified Array Codes) For a prime q and positive integer m q, we create the matrix: I I I... I... I 0 I P 1... P (m 2)... P (q 2) H = 0 0 I... P 2(m 3)... P 2(q 3) I... P (m 1)(q m) Efficient encoding possible due to structure. Slightly irregular code. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
53 Random Construction of QC-LDPC Codes (Regular Codes) The mq nq parity-check matrix is constructed as follows: P a 11 P a P a 1n P a 21 P a P a 2n H = P a m1 P a m2... P amn where a ij {0, 1, 2,..., q 1}. If a ij {0, 1, 2,..., L 1}, then irregular codes can also be constructed. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
54 Random Construction of QC-LDPC Codes (Irreg. Codes) The number of non-zero blocks in each column of the block parity check matrix can be chosen according to a degree distribution. Permutation matrices P i are used, i is usually chosen at random, and, if some constraints, e.g. cycle girth, check node distribution, are violated, another value for i is chosen. Very similar to one of Gallager s constructions of irregular codes. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
55 Other Constructions of QC-LDPC Codes Constructions based on Finite Geometries. Constructions based on Reed-Solomon codes. Constructions based on masking of existing LDPC codes. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
56 1 Introduction to LDPC Codes 2 Iterative Decoding of LDPC Codes Belief Propagation Density Evolution Gaussian Approximation EXIT Charts 3 Efficient Encoding of LDPC and QC-LDPC Codes 4 Construction of QC-LDPC Codes Deterministic Random 5 RA and Structured RA Codes A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
57 Repeat-Accumulate Codes RA codes: subclass of LDPC codes. Encoding: 1 A frame of information symbols of length N is repeated q times. 2 A random (but fixed) permutation is applied to the resulting frame. 3 The permuted frame is fed to a rate-1 accumulator with transfer function 1/(1 + D). For Irregular RA codes, each information bit is repeated according to a repetition profile. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
58 Structured Repeat-Accumulate Codes The parity-check matrix of an RA code can be written as follows: H = [ H 1 H 2 ], where: H 2 = We can make RA codes even simpler by enforcing a QC structure on H 1. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
59 Structured IRA Codes We construct the matrix H 1 as follows: P a 11 P a P a 1n P a 21 P a P a 2n H 1 = P a m1 P a m2... P amn where P is a right cyclic shift q q permutation matrix and a i,j {0, 1,..., q 1, } are the corresponding exponents. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
60 Structured IRA Codes If we use H 1 as is, the resulting code has a poor minimum distance. We use a permuted version of H 1 instead, where the permutation is chosen so that the minimum codeword weight for low-weight inputs is increased. So, the final parity-check matrix will be: H = [ ΠH 1 H 2 ] The resulting code is regular unless we choose to mask out some entries (by choosing a ij = ) in the H 1 matrix in accordance with a targeted repetition profile. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
61 Appendix - φ(x) and J(σ) The function φ(x) is defined as follows: { φ(x) = 4πx tanh ( ) } u 2 exp { (u x)2 4x du, x > 0 1, x = 0. The function J(σ) is defined as follows: J(σ) = πσ e (x σ2 /2) 2 2σ 2 log 2 (1 + e x )dx. A. Balatsoukas-Stimming and A. P. Liavas () LDPC Codes December 16, / 61
Codes on Graphs. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 27th, 2008
Codes on Graphs Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 27th, 2008 Telecommunications Laboratory (TUC) Codes on Graphs November 27th, 2008 1 / 31
More informationIntroduction to Low-Density Parity Check Codes. Brian Kurkoski
Introduction to Low-Density Parity Check Codes Brian Kurkoski kurkoski@ice.uec.ac.jp Outline: Low Density Parity Check Codes Review block codes History Low Density Parity Check Codes Gallager s LDPC code
More informationLecture 4 : Introduction to Low-density Parity-check Codes
Lecture 4 : Introduction to Low-density Parity-check Codes LDPC codes are a class of linear block codes with implementable decoders, which provide near-capacity performance. History: 1. LDPC codes were
More informationConstruction of LDPC codes
Construction of LDPC codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete July 1, 2009 Telecommunications Laboratory (TUC) Construction of LDPC codes July 1, 2009
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationLDPC Codes. Slides originally from I. Land p.1
Slides originally from I. Land p.1 LDPC Codes Definition of LDPC Codes Factor Graphs to use in decoding Decoding for binary erasure channels EXIT charts Soft-Output Decoding Turbo principle applied to
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationECEN 655: Advanced Channel Coding
ECEN 655: Advanced Channel Coding Course Introduction Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 655: Advanced Channel Coding 1 / 19 Outline 1 History
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationIterative Encoding of Low-Density Parity-Check Codes
Iterative Encoding of Low-Density Parity-Check Codes David Haley, Alex Grant and John Buetefuer Institute for Telecommunications Research University of South Australia Mawson Lakes Blvd Mawson Lakes SA
More informationStructured Low-Density Parity-Check Codes: Algebraic Constructions
Structured Low-Density Parity-Check Codes: Algebraic Constructions Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, California 95616 Email:shulin@ece.ucdavis.edu
More informationMessage-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras
Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed
More informationLower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationMaking Error Correcting Codes Work for Flash Memory
Making Error Correcting Codes Work for Flash Memory Part I: Primer on ECC, basics of BCH and LDPC codes Lara Dolecek Laboratory for Robust Information Systems (LORIS) Center on Development of Emerging
More informationDistributed Source Coding Using LDPC Codes
Distributed Source Coding Using LDPC Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete May 29, 2010 Telecommunications Laboratory (TUC) Distributed Source Coding
More informationON THE MINIMUM DISTANCE OF NON-BINARY LDPC CODES. Advisor: Iryna Andriyanova Professor: R.. udiger Urbanke
ON THE MINIMUM DISTANCE OF NON-BINARY LDPC CODES RETHNAKARAN PULIKKOONATTU ABSTRACT. Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low
More informationAn Introduction to Low-Density Parity-Check Codes
An Introduction to Low-Density Parity-Check Codes Paul H. Siegel Electrical and Computer Engineering University of California, San Diego 5/ 3/ 7 Copyright 27 by Paul H. Siegel Outline Shannon s Channel
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationCHAPTER 3 LOW DENSITY PARITY CHECK CODES
62 CHAPTER 3 LOW DENSITY PARITY CHECK CODES 3. INTRODUCTION LDPC codes were first presented by Gallager in 962 [] and in 996, MacKay and Neal re-discovered LDPC codes.they proved that these codes approach
More informationLow-density parity-check (LDPC) codes
Low-density parity-check (LDPC) codes Performance similar to turbo codes Do not require long interleaver to achieve good performance Better block error performance Error floor occurs at lower BER Decoding
More informationLow-density parity-check codes
Low-density parity-check codes From principles to practice Dr. Steve Weller steven.weller@newcastle.edu.au School of Electrical Engineering and Computer Science The University of Newcastle, Callaghan,
More informationConstruction and Performance Evaluation of QC-LDPC Codes over Finite Fields
MEE10:83 Construction and Performance Evaluation of QC-LDPC Codes over Finite Fields Ihsan Ullah Sohail Noor This thesis is presented as part of the Degree of Master of Sciences in Electrical Engineering
More informationSingle-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes
Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Brian M. Kurkoski, Kazuhiko Yamaguchi and Kingo Kobayashi kurkoski@ice.uec.ac.jp Dept. of Information and Communications Engineering
More informationLecture 4: Linear Codes. Copyright G. Caire 88
Lecture 4: Linear Codes Copyright G. Caire 88 Linear codes over F q We let X = F q for some prime power q. Most important case: q =2(binary codes). Without loss of generality, we may represent the information
More informationEE229B - Final Project. Capacity-Approaching Low-Density Parity-Check Codes
EE229B - Final Project Capacity-Approaching Low-Density Parity-Check Codes Pierre Garrigues EECS department, UC Berkeley garrigue@eecs.berkeley.edu May 13, 2005 Abstract The class of low-density parity-check
More informationCapacity-approaching codes
Chapter 13 Capacity-approaching codes We have previously discussed codes on graphs and the sum-product decoding algorithm in general terms. In this chapter we will give a brief overview of some particular
More informationStatus of Knowledge on Non-Binary LDPC Decoders
Status of Knowledge on Non-Binary LDPC Decoders Part I: From Binary to Non-Binary Belief Propagation Decoding D. Declercq 1 1 ETIS - UMR8051 ENSEA/Cergy-University/CNRS France IEEE SSC SCV Tutorial, Santa
More informationQuasi-Cyclic Asymptotically Regular LDPC Codes
2010 IEEE Information Theory Workshop - ITW 2010 Dublin Quasi-Cyclic Asymptotically Regular LDPC Codes David G. M. Mitchell, Roxana Smarandache, Michael Lentmaier, and Daniel J. Costello, Jr. Dept. of
More informationBOUNDS ON THE MAP THRESHOLD OF ITERATIVE DECODING SYSTEMS WITH ERASURE NOISE. A Thesis CHIA-WEN WANG
BOUNDS ON THE MAP THRESHOLD OF ITERATIVE DECODING SYSTEMS WITH ERASURE NOISE A Thesis by CHIA-WEN WANG Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the
More informationConstruction and Encoding of QC-LDPC Codes Using Group Rings
1 Construction and Encoding of QC-LDPC Codes Using Group Rings Hassan Khodaiemehr and Dariush Kiani arxiv:1701.00210v1 [cs.it] 1 Jan 2017 Abstract Quasi-cyclic (QC) low-density parity-check (LDPC) codes
More informationLOW-density parity-check (LDPC) codes were invented
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 1, JANUARY 2008 51 Extremal Problems of Information Combining Yibo Jiang, Alexei Ashikhmin, Member, IEEE, Ralf Koetter, Senior Member, IEEE, and Andrew
More informationLow Density Parity Check (LDPC) Codes and the Need for Stronger ECC. August 2011 Ravi Motwani, Zion Kwok, Scott Nelson
Low Density Parity Check (LDPC) Codes and the Need for Stronger ECC August 2011 Ravi Motwani, Zion Kwok, Scott Nelson Agenda NAND ECC History Soft Information What is soft information How do we obtain
More informationIntroducing Low-Density Parity-Check Codes
Introducing Low-Density Parity-Check Codes Sarah J. Johnson School of Electrical Engineering and Computer Science The University of Newcastle Australia email: sarah.johnson@newcastle.edu.au Topic 1: Low-Density
More informationIntegrated Code Design for a Joint Source and Channel LDPC Coding Scheme
Integrated Code Design for a Joint Source and Channel LDPC Coding Scheme Hsien-Ping Lin Shu Lin and Khaled Abdel-Ghaffar Department of Electrical and Computer Engineering University of California Davis
More informationAdaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes
Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego, La Jolla, CA 9093, U Email:{ericzhang, psiegel}@ucsd.edu
More informationLow-Density Parity-Check codes An introduction
Low-Density Parity-Check codes An introduction c Tilo Strutz, 2010-2014,2016 June 9, 2016 Abstract Low-density parity-check codes (LDPC codes) are efficient channel coding codes that allow transmission
More informationRCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths
RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths Kasra Vakilinia, Dariush Divsalar*, and Richard D. Wesel Department of Electrical Engineering, University
More informationOn Generalized EXIT Charts of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels
2012 IEEE International Symposium on Information Theory Proceedings On Generalied EXIT Charts of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels H Mamani 1, H Saeedi 1, A Eslami
More informationModern Coding Theory. Daniel J. Costello, Jr School of Information Theory Northwestern University August 10, 2009
Modern Coding Theory Daniel J. Costello, Jr. Coding Research Group Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 2009 School of Information Theory Northwestern University
More informationLow-Density Parity-Check Codes
Department of Computer Sciences Applied Algorithms Lab. July 24, 2011 Outline 1 Introduction 2 Algorithms for LDPC 3 Properties 4 Iterative Learning in Crowds 5 Algorithm 6 Results 7 Conclusion PART I
More informationCompressed Sensing and Linear Codes over Real Numbers
Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,
More informationSpatially Coupled LDPC Codes Constructed from Protographs
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Spatially Coupled LDPC Codes Constructed from Protographs David G. M. Mitchell, Member, IEEE, Michael Lentmaier, Senior Member, IEEE, and Daniel
More informationGraph-based Codes and Iterative Decoding
Graph-based Codes and Iterative Decoding Thesis by Aamod Khandekar In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 216, Albena, Bulgaria pp. 168 173 On the minimum distance of LDPC codes based on repetition codes and permutation
More informationConvergence of the Sum-Product Algorithm for Short Low-Density Parity-Check Codes
DIPLOMA THESIS Convergence of the Sum-Product Algorithm for Short Low-Density Parity-Check Codes Institut of Communications and Radio-Frequency Engineering Vienna University of Technology (TU Wien) Telecommunications
More informationSPA decoding on the Tanner graph
SPA decoding on the Tanner graph x,(i) q j,l = P(v l = x check sums A l \ {h j } at the ith iteration} x,(i) σ j,l = Σ P(s = 0 v = x,{v : t B(h )\{l}}) q {vt : t B(h j )\{l}} j l t j t B(h j )\{l} j,t
More informationConstruction of Protographs for QC LDPC Codes With Girth Larger Than 12 1
Construction of Protographs for QC LDPC Codes With Girth Larger Than 12 1 Sunghwan Kim, Jong-Seon No School of Electrical Eng. & Com. Sci. Seoul National University, Seoul, Korea Email: {nodoubt, jsno}@snu.ac.kr
More informationCoding Techniques for Data Storage Systems
Coding Techniques for Data Storage Systems Thomas Mittelholzer IBM Zurich Research Laboratory /8 Göttingen Agenda. Channel Coding and Practical Coding Constraints. Linear Codes 3. Weight Enumerators and
More information5. Density evolution. Density evolution 5-1
5. Density evolution Density evolution 5-1 Probabilistic analysis of message passing algorithms variable nodes factor nodes x1 a x i x2 a(x i ; x j ; x k ) x3 b x4 consider factor graph model G = (V ;
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices
On the minimum distance of LDPC codes based on repetition codes and permutation matrices Fedor Ivanov Email: fii@iitp.ru Institute for Information Transmission Problems, Russian Academy of Science XV International
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Prelude Information transmission 0 0 0 0 0 0 Channel Information transmission signal 0 0 threshold
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationBelief-Propagation Decoding of LDPC Codes
LDPC Codes: Motivation Belief-Propagation Decoding of LDPC Codes Amir Bennatan, Princeton University Revolution in coding theory Reliable transmission, rates approaching capacity. BIAWGN, Rate =.5, Threshold.45
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationMessage Passing Algorithm and Linear Programming Decoding for LDPC and Linear Block Codes
Message Passing Algorithm and Linear Programming Decoding for LDPC and Linear Block Codes Institute of Electronic Systems Signal and Information Processing in Communications Nana Traore Shashi Kant Tobias
More informationCirculant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes
Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes 1 arxiv:10041184v1 [csit] 7 Apr 2010 Li Zhang 1, Shu Lin 1, Khaled Abdel-Ghaffar 1, Zhi
More informationABSTRACT. The original low-density parity-check (LDPC) codes were developed by Robert
ABSTRACT Title of Thesis: OPTIMIZATION OF PERMUTATION KEY FOR π-rotation LDPC CODES Nasim Vakili Pourtaklo, Master of Science, 2006 Dissertation directed by: Associate Professor Steven Tretter Department
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationIntroduction to Convolutional Codes, Part 1
Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 4029 Optimized Design of Finite-Length Separable Circulant-Based Spatially-Coupled Codes: An Absorbing Set-Based Analysis Behzad Amiri,
More informationNon-binary Hybrid LDPC Codes: structure, decoding and optimization
Non-binary Hybrid LDPC Codes: structure, decoding and optimization Lucile Sassatelli and David Declercq ETIS - ENSEA/UCP/CNRS UMR-8051 95014 Cergy-Pontoise, France {sassatelli, declercq}@ensea.fr Abstract
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Funded by: National Science Foundation (NSF) Seagate Technology Defense Advanced Research Projects
More informationAn algorithm to improve the error rate performance of Accumulate-Repeat-Accumulate codes Tae-Ui Kim
An algorithm to improve the error rate performance of Accumulate-Repeat-Accumulate codes Tae-Ui Kim The Graduate School Yonsei University Department of Electrical and Electronic Engineering An algorithm
More informationCOMPSCI 650 Applied Information Theory Apr 5, Lecture 18. Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei
COMPSCI 650 Applied Information Theory Apr 5, 2016 Lecture 18 Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei 1 Correcting Errors in Linear Codes Suppose someone is to send
More informationLDPC codes based on Steiner quadruple systems and permutation matrices
Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory September 7 13, 2014, Svetlogorsk (Kaliningrad region), Russia pp. 175 180 LDPC codes based on Steiner quadruple systems and
More informationLow-complexity error correction in LDPC codes with constituent RS codes 1
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 348-353 Low-complexity error correction in LDPC codes with constituent RS codes 1
More informationEfficient design of LDPC code using circulant matrix and eira code Seul-Ki Bae
Efficient design of LDPC code using circulant matrix and eira code Seul-Ki Bae The Graduate School Yonsei University Department of Electrical and Electronic Engineering Efficient design of LDPC code using
More informationCoding on a Trellis: Convolutional Codes
.... Coding on a Trellis: Convolutional Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 6th, 2008 Telecommunications Laboratory (TUC) Coding on a Trellis:
More informationLow-Complexity Fixed-to-Fixed Joint Source-Channel Coding
Low-Complexity Fixed-to-Fixed Joint Source-Channel Coding Irina E. Bocharova 1, Albert Guillén i Fàbregas 234, Boris D. Kudryashov 1, Alfonso Martinez 2, Adrià Tauste Campo 2, and Gonzalo Vazquez-Vilar
More informationOptimizing Flash based Storage Systems
Optimizing Flash based Storage Systems 1 Lifetime Reliability Latency Throughput 2 Projects Reliability/Latency/Throughput: Error Correction Code (ECC) Parallelization and Incremental Redundancy Lifetime:
More informationLDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation
LDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation Anatoly Khina EE Systems Dept., TAU Tel Aviv, Israel Email: anatolyk@eng.tau.ac.il Yair Yona Dept. of EE, UCLA
More information6.451 Principles of Digital Communication II Wednesday, May 4, 2005 MIT, Spring 2005 Handout #22. Problem Set 9 Solutions
6.45 Principles of Digital Communication II Wednesda, Ma 4, 25 MIT, Spring 25 Hand #22 Problem Set 9 Solutions Problem 8.3 (revised) (BCJR (sum-product) decoding of SPC codes) As shown in Problem 6.4 or
More informationAccumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel with Bounded Complexity
Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel with Bounded Complexity Henry D. Pfister, Member, Igal Sason, Member Abstract The paper introduces
More informationSTUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION
EE229B PROJECT REPORT STUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION Zhengya Zhang SID: 16827455 zyzhang@eecs.berkeley.edu 1 MOTIVATION Permutation matrices refer to the square matrices with
More informationMulti-Edge Low-Density Parity-Check Coded Modulation. Lei Zhang
Multi-Edge Low-Density Parity-Check Coded Modulation by Lei Zhang A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department of Edward Rogers
More informationEnhancing Binary Images of Non-Binary LDPC Codes
Enhancing Binary Images of Non-Binary LDPC Codes Aman Bhatia, Aravind R Iyengar, and Paul H Siegel University of California, San Diego, La Jolla, CA 92093 0401, USA Email: {a1bhatia, aravind, psiegel}@ucsdedu
More informationQuantum LDPC Codes Derived from Combinatorial Objects and Latin Squares
Codes Derived from Combinatorial Objects and s Salah A. Aly & Latin salah at cs.tamu.edu PhD Candidate Department of Computer Science Texas A&M University November 11, 2007 Motivation for Computers computers
More informationAnalysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem
Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem Osamu Watanabe, Takeshi Sawai, and Hayato Takahashi Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationIterative Decoding for Wireless Networks
Iterative Decoding for Wireless Networks Thesis by Ravi Palanki In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California
More informationPartially Quasi-Cyclic Protograph-Based LDPC Codes
Partially Quasi-Cyclic Protograph-Based LDPC Codes Roxana Smarandache Department of Mathematics and Statistics San Diego State University San Diego, CA 92182 Email: rsmarand@sciencessdsuedu David G M Mitchell
More informationProgressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Li Chen ( 陈立 ), PhD, MIEEE Associate Professor, School of Information Science and Technology Sun Yat-sen University, China Joint work
More informationLow-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes
Low-Density Arrays of Circulant Matrices: 1 Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes Qin Huang 1 and Keke Liu 2 and Zulin Wang 1 arxiv:12020702v1 [csit] 3 Feb 2012 1 School of Electronic
More informationThe PPM Poisson Channel: Finite-Length Bounds and Code Design
August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs
More informationECC for NAND Flash. Osso Vahabzadeh. TexasLDPC Inc. Flash Memory Summit 2017 Santa Clara, CA 1
ECC for NAND Flash Osso Vahabzadeh TexasLDPC Inc. 1 Overview Why Is Error Correction Needed in Flash Memories? Error Correction Codes Fundamentals Low-Density Parity-Check (LDPC) Codes LDPC Encoding and
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 2, FEBRUARY 2011 835 Deriving Good LDPC Convolutional Codes from LDPC Block Codes Ali E Pusane, Member, IEEE, Roxana Smarandache, Member, IEEE, Pascal
More informationConvolutional Codes. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 6th, 2008
Convolutional Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 6th, 2008 Telecommunications Laboratory (TUC) Convolutional Codes November 6th, 2008 1
More informationFactor Graphs and Message Passing Algorithms Part 1: Introduction
Factor Graphs and Message Passing Algorithms Part 1: Introduction Hans-Andrea Loeliger December 2007 1 The Two Basic Problems 1. Marginalization: Compute f k (x k ) f(x 1,..., x n ) x 1,..., x n except
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 56, NO 1, JANUARY 2010 181 Analysis of Absorbing Sets Fully Absorbing Sets of Array-Based LDPC Codes Lara Dolecek, Member, IEEE, Zhengya Zhang, Member, IEEE,
More informationTurbo Codes are Low Density Parity Check Codes
Turbo Codes are Low Density Parity Check Codes David J. C. MacKay July 5, 00 Draft 0., not for distribution! (First draft written July 5, 998) Abstract Turbo codes and Gallager codes (also known as low
More informationA Class of Quantum LDPC Codes Constructed From Finite Geometries
A Class of Quantum LDPC Codes Constructed From Finite Geometries Salah A Aly Department of Computer Science, Texas A&M University College Station, TX 77843, USA Email: salah@cstamuedu arxiv:07124115v3
More informationA Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design
A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design Salah A Aly Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA Email: salah@cstamuedu
More informationTHE seminal paper of Gallager [1, p. 48] suggested to evaluate
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 11, NOVEMBER 2004 2657 Extrinsic Information Transfer Functions: Model and Erasure Channel Properties Alexei Ashikhmin, Member, IEEE, Gerhard Kramer,
More informationRECURSIVE CONSTRUCTION OF (J, L) QC LDPC CODES WITH GIRTH 6. Communicated by Dianhua Wu. 1. Introduction
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol 5 No 2 (2016, pp 11-22 c 2016 University of Isfahan wwwcombinatoricsir wwwuiacir RECURSIVE CONSTRUCTION OF (J, L QC LDPC
More informationAn Introduction to Algorithmic Coding Theory
An Introduction to Algorithmic Coding Theory M. Amin Shokrollahi Bell Laboratories Part : Codes - A puzzle What do the following problems have in common? 2 Problem : Information Transmission MESSAGE G
More informationCodes designed via algebraic lifts of graphs
p./40 Codes designed via algebraic lifts of graphs Clemson Mini-Conference on Discrete Mathematics Oct. 3, 2008. Christine A. Kelley Department of Mathematics University of Nebraska-Lincoln email: ckelley2@math.unl.edu
More informationCapacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity Henry D. Pfister, Member, Igal Sason, Member, and Rüdiger Urbanke Abstract We present two sequences of ensembles of non-systematic
More informationAnalysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, and Borivoje Nikolić dolecek@mit.edu; {zyzhang,ananth,wainwrig,bora}@eecs.berkeley.edu
More information