Codes on graphs and iterative decoding
|
|
- Jasmin Jones
- 5 years ago
- Views:
Transcription
1 Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona
2 Prelude
3 Information transmission Channel
4 Information transmission signal 0 0 threshold time
5 Noisy memoryless channels x x 2 x 3 x 4 p( Channel y i x i ) y y 2 y 3 y 4 p y,..., y x,..., x p y x n n j i n i
6 Simple memoryless channels Binary symmetric channel (BSC) Binary erasure channel (BEC) E y Binary input additive white Gaussian noise (AWGN) channel, 2 p(y 0) p(y )
7 Channel capacity - BSC C ,
8 Channel capacity - BEC E 0.6 C
9 Channel capacity - BAWGN y p(y 0) p(y ) C EE b /N b =N 0 (db) 0 (db)
10 Error correction coding m x y Encoder Channel Decoder ˆx ˆm Message Codeword Received word m ( m,..., m ) k x ( x,..., x ) n y ( y,..., y ) n k Code rate R n The decoder tries to find x ( or m ) from y so that the probability of bit/codeword error is minimal. In other words, decoder tries to find a codeword closest to y.
11 Error rate performance FER 0 - SNR 0-6 coded Shannon limit 0-5 uncoded
12 Maximum likelihood decoding
13 Protecting information by coding all words of length n
14 Protecting information by coding all words of length n codewords
15 Minimum distance
16 Protecting information by coding code C
17 Linear block codes
18 Dimension of a linear block code {g,,g k } the basis for code C {h,h 2,,h n-k } the basis of C h g 2 g
19 Encoding Generator matrix an k x n matrix of rank k a b a b a b a b
20 Linear block codes as subspaces Given a GF(2) (ground field), we define the vector space - the n-tuple v=( v,v 2, v n ) of elements from the ground filed is a type of vector. Elias and Golay: A binary linear (n,k) code C is a k - dimensional subspace of a vector space Galois Field, GF(2).
21 Parity check h g 2 x h T =0 x g
22 Parity check h g 2 x h T =0 x g
23 Parity check h g 2 x x h T =0 g
24 Syndrome h y h T 0 y g 2 g
25 Let x be a codeword Dual code C parity check matrix A received vector which is not a codeword results in a nonzero syndrome.
26 Linear constraints A codeword x satisfies v H n-k equations in n variables Example: T 0 H c : x x x x c : x x x x c : x x x x =
27 Side observations Since for any codeword x. and since it follows H can be found from G. For any a,b {0,} The parity check matrix can be modified by adding linear combinations of its rows. The ranks of any such new parity matrix is still n-k.
28 LDPC code basics
29 Applications of LDPC codes Wireless networks, satellite communications, deep-space communications, power line communications are among applications where the low-density parity check (LDPC) codes are the standardized. Standards include: Digital video broadcast over satellite (DVB-S2 Standard) and over cable (DVB-C2 Standard), terrestrial television broadcasting (DVB-T2, DVB-T2-Lite Standards), GEO-Mobile Radio (GMR) satellite telephony (GMR- Standard), local and metropolitan area networks (LAN/MAN) (IEEE 802. (WiFi)), wireless personal area networks (WPAN) (IEEE c (60 GHz PHY)), wireless local and metropolitan area networks (WLAN/WMAN) (IEEE (Mobile WiMAX), near-earth and deep space communications (CCSDS), wire and power line communications ( ITU-T G.hn (G.9960)), utra-wide band technologies (WiMedia.5 UWB), magnetic hard disk drives, optical communications, flash memories.
30 Basics Outline Error correction codes, linear block codes, parity check matrices, code graphs Decoding using local information, iterative decoders Decoders as finite-state dynamical systems, basins of attraction and decoding failures Failures of iterative decoders Correcting number of errors linear in code length Finite length analysis Trapping sets Code design Combinatorial designs and codes Quasi-cyclic codes designed from group-theoretic transforms, Latin squares, difference families, finite geometries
31 Graphical model for a linear block code c : v v v v c : v v v v Checks c : v v v v = v v 2 v 3 v 4 v 5 v 6 v 7 Variables c c 2 c 3
32 Definitions LDPC codes belong to the class of linear block codes which can be defined by sparse bipartite graphs. The Tanner graph of an LDPC code is a bipartite graph with two sets of nodes: the set of variable nodes and the set of check nodes V C
33 Definitions The check nodes (variable nodes resp.) connected to a variable node (check node resp.) are referred to as its neighbors. The set of neighbors of a node is denoted by The degree of a node is the number of its neighbors.
34 Definitions A vector is a codeword if and only if for each check node, the modulo two sum of its neighbors is zero. An regular LDPC code has a Tanner graph with variable nodes each of degree and check nodes each of degree. This code has length rate The Tanner graph is not uniquely defined by the code and when we say the Tanner graph of an LDPC code, we only mean one possible graphical representation.
35 An example of a regular n=25 =3, =5 code H
36 Iterative decoding
37
38
39 Message Passing Example:
40 Message Passing Example:
41 2
42 3
43 4
44 5
45 6
46 7
47 8
48 9 Done!
49 An unresolvable configuration Stucked!
50 Iterative decoders for BEC
51 Iterative decoding on BEC E erased bit correct bit
52 Decoding simulation
53 BEC decoding simulation a check involving a single erased bit other check
54 BEC simulation - a check satisfied after correction
55 BEC simulation - 2
56 BEC simulation - 3
57 BEC simulation - 4
58 BEC simulation - 5
59 BEC simulation - 6 Success!
60 Another example BEC simulation -
61 Another example BEC simulation - 2
62 BEC simulation -final Stuck!
63 Decoding failures A BEC iterative decoder fails to converge to a codeword (correct or wrong) if at any iteration there is no check node connected to less than one erased variable node. A graph induced by such set of check nodes is called a stopping set.
64 Combinatorial definition of a stopping set Consider a set S of variable nodes. Let N(S) be a set of all checks nodes connected to S. If smallest outdegree of nodes in N(S) is two, then S is a stopping set. S N(S) Other channels such as BSC, AWGN do not have such combinatorial definition of a decoding failure.
65 Iterative decoders for BSC
66 Decoding on graphs on BSC Two basic types of algorithms: Bit flipping Message passing
67 Bit flipping If more checks are unsatisfied than satisfied, flip the bit. Continue until all checks are satisfied
68 Steps: Message passing A variable node sends his value to all neighboring checks. A check computes XOR of all incoming messages and sends this along the edges, but it excludes the message on the edge the result is send along! Variable takes a majority vote of incoming messages and sends this along, if tie, sends its original value h ( ) x h x ( y ) y f y ( x ) f x h 2 ( ) x h2 x x ( x ) x f f ( y ) y2 f 2 y 2 n(x)\{f} n(f)\{x}
69 Gallager A/B algorithm The Gallager A/B algorithms are hard decision decoding algorithms in which all the messages are binary. With a slight abuse of the notation, let denote the number of incoming messages to which are equal to. Associated with every decoding round and variable degree is a threshold. The Gallager B algorithm is defined as follows.
70 Gallager A/B algorithm The Gallager A algorithm is a special case of the Gallager B algorithm with for all. At the end of each iteration, a decision on the value of each variable node is made based on all the incoming messages and possibly the received value.
71 General iterative decoders An iterative decode is defined as a 4-tuple given by is a set the message values are confined to is the set of channel values The function used for update at a check node with degree. The function is the update function used at a variable node with degree.
72 Decoders as dynamical systems Let be the vector of messages along all edges in the Tanner graph in the -th iteration, and the received vector, then an iterative decoder on the Tanner graph can be seen as a dynamical system Such dynamical system may have a chaotic behavior When alphabets are finite, a decoder is a finite state machine, with a very large state space. The trajectory converge either to a fixed point or exhibits oscillations around attractor points in the state space. The attractor structure is defined by and.
73 Attractors of iterative decoders adapted using and
74 Syndrome Codeword Bit flipping decoder Trajectory examples
75 Trajectory types Fixed point Cyclic Cyclic with a large period
76 An example of a trajectory
77 Failures of iterative decoders
78 Error floor FER FER 0 - SNR 0 - SNR coded Shannon limit 0-5 uncoded Shannon limit 0-5 Sphere packing bound uncoded
79 Locality of decoding
80 A motivating example Consider a six cycle in a 3-variable regular Tanner Graph. Assume the channel introduces three errors exactly on the variable nodes in the cycle. Also the assume that the neighborhood of the subgraph does not influence the messages propagated within the subgraph (condition to be explained later) Gallager A fails for such error pattern. By adding an extra bit in the message, the decoder can succeed.
81 Gallager A iteration 0 0 Initially wrong variable node Initially correct variable node Odd-degree check node Even-degree check node
82 Gallager A iteration
83 A trapping set illustration Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
84 A trapping set illustration Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
85 Oscillations in the decoder Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
86 Oscillations in the decoder Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
87 Oscillations in the decoder Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
88 Oscillations in the decoder Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
89 Oscillations in the decoder Corrupt variable Correct variable Variable decoded correctly Variable decoded wrongly
90 Concept of a trapping set (3,3) trapping set (5,3) trapping set (8,0) Trapping Set
91 Some ways to construct LDPC codes
92 y LDPC codes - combinatorial designs Affine partial geometry L { ( x, y ) : 0 x k, 0 y m } m - a prime Blocks: the lines starting at points (0,a) with slopes s (0 a,s m-) m each point incident with exactly m blocks m 2 blocks Example: k=3, m= s=0 s= s=2 s=3 s= x k
93 Integer lattice codes s=0 s= s=2 s=3 s= H
94 Affine and projective planes-example Affine Plane Projective Plane 2 3 4
95 Cyclic difference families We can think of the actions of the group V as a partitioning B into classes or orbits. Example: (3,3,) CDF, Z 3 Base blocks B ={0,,4} and B 2 ={0,2,7} B orbits B 2 orbits b +g b 2 +g b 3 +g b 2 +g b 22 +g b 23 +g H
96 Protograph based codes A protograph is a small Tanner graph. Example (Thorpe): V = 4 variable nodes and C = 3 check nodes, connected by E = 8 edges. 2 3 In this case Tanner graph of an (n = 4, k = ) LDPC code (in this case, a repetition code). Double edges are allowed
97 Protograph codes 0 0 H 0 0 A B C A A A B A A 2 A 3 B B 2 B 3 C C 2 C 3 H B B C C C A A 2 A 3 B B 2 B 3 C C 2 C 3
98 Parity check masking Start from a quasi-cyclic code and force some blocks to be zeros (in the Tanner graph, disconnect groups of checks and variables) H H
99 Decoding by belief propagation
100 Crossword puzzles Iterate! Across: 4 Animal with long ears and a short tail. 0 Person who is in charge of a country. 2 In no place. 2 3 Down: Pointer, weapon fired from a bow. 6 Accept as true. 7 A place to shoot at; objective. Math. Seminar Tucson
101 Decoders for channels with soft outputs In addition to the channel value, a measure of bit reliability is also provided ˆx m xˆ, mˆ x y Encoder Channel Decoder Bit log-likelihood ratio given y i. ( x ) ( x ) lo g i P ( x 0 y ) i P ( x y ) i i i lo g lo g p ( y x 0 ) P ( x 0 ) i i i p( y ) p ( y x ) P ( x ) i i i i p( y ) i lo g p ( y i x i 0 ) lo g P ( x i 0 ) p ( y x ) P ( x ) i i i p ( y x 0 ) P ( x 0 ) i i i p ( y x ) P ( x ) i i i
102 Log-likelihood ratio Without prior knowledge on x i i ( x ) lo g i p ( y x 0 ) i p ( y x ) i i i For AWGN (y i = x i + n i, n i ~ N( 0, 2 ) ) p ( y x 0 ) y lo g ( y ) ( y ) p ( y x ) 2 2 i i 2 2 i i 2 i i 2 i i For BSC with parameter lo g if y 0 i i lo g if y i
103 Soft outputs (x i, i ) Message-passing x i an estimate of the i th bit i- belief, reliability, likelihood, likelihood ratio Example: 5 x i ) x : xˆ : ( xˆ ) : Pr( x i = y i )
104 Soft decoding example x : xˆ : ( xˆ ) : ? -5 M m in ( 6, 2, 5 ) 2 S sig n ( 6 ) sig n ( 2 ) sig n ( 5 ) A S M ? A A A A A ? -5 A 0 '
105 Side remark: some bits voted twice ? ? ? -5
106 The min-sum update rule h ( ) x h x ( y ) y f y ( x ) f x h 2 ( ) x h2 x x ( x ) x f f ( y ) y2 f 2 y 2 n(x)\{f} n(f)\{x} x f x h f h n ( x ) \{ f } ( x ) sg n ( ) m in f x y f y f y n ( f ) \{ x } y n ( f ) \{ x } g ( x ) ( x ) i i i h x h n ( x ) i i
107 Derivation of the check update rule Given the log-likelihoods of (x j ) j m find the loglikelihood of y, L(y). 2 j m- m x x 2 x j x m- x m y L( y) P r{ y lo g 0} P r{ # " " in x is e v e n} lo g P r{ y } P r{ # " " in x is o d d } L( y) 2 a rta n h ta n L h ( y) sg n ( ) 2 j j j m j j m j m
108 Derivation of the check update rule B e rn o u lli tria ls: P r{ x 0} q, P r{ x } p m m j m j q p p q 0 j m q p ( ) p q 0 j m j m j m j m j j P r{ # " " in x is e v e n} q p m q p P r{ # " " in x is o d d } 2 q p m q p 2 m m G e n e r a liz a tio n : P r{ x 0} q, P r{ x 0} p, 0 j m j j j j P r{ # " " in x is e v e n} q p q p q p 2 2 j j j j j j j m j m j m P r{ # " " in x is o d d } q p q p q p 2 2 j j j j j j j m j m j m
109 Derivation of the check update rule P r{ 0} P r{ # " " } ( ) lo g lo g P r{ } P r{ # " " } lo g lo g j j j j j j j j j j j m j m j m j m y in x is e v e n L y y in x is o d d e e e e e e e e e e / 2 / 2 / 2 / 2 / 2 / 2 / 2 / 2 ( ) lo g ta n h 2 lo g ta n h 2 ta n h 2 2 lo g 2 ta n h 2 2 a rta n h ta n h 2 j j j j j j j j j m j m j j m j j m j j m j j m j j m e e e e L y e e e e ( ) 2 a rta n h ta n h 2 j j m L y
110 Min-sum approximation (x) = -log tanh(x/2) = log( (e x +)/(e x -) )= - (x) i m in m in i f i f i f i i'
111 Sum-product algorithm (Kschischang et. al.) h ( ) x h x ( y ) y f y ( x) ( x) x f h x h n ( x ) \{ f } h 2 ( ) x h2 x x ( x ) f x ( x ) x f f ( y ) y2 f 2 y 2 ( x ) f ( X ) ( y ) f x y f ~ { x } h n ( f ) \{ x } n(x)\{f} n(f)\{x} g ( x ) ( x ) i i h x i h n ( x ) i i
112 The update rule The sum-product algorithm The result of decoding after iterations, denoted by is determined by the sign of If otherwise
113 The min-sum algorithm In the limit of high SNR, when the absolute value of the messages is large, the sum-product becomes the minsum algorithm, where the message from the check to the bit looks like:
Codes 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 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 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 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 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 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 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 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 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 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 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 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 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 informationFinite Alphabet Iterative Decoders Approaching Maximum Likelihood Performance on the Binary Symmetric Channel
Finite Alphabet Iterative Decoders Approaching Maximum Likelihood Performance on the Binary Symmetric Channel David Declercq ETIS ENSEA/UCP/CNRS UMR 8051 95014 Cergy-Pontoise, France Email: declercq@ensea.fr
More informationAnalytical Performance of One-Step Majority Logic Decoding of Regular LDPC Codes
Analytical Performance of One-Step Majority Logic Decoding of Regular LDPC Codes Rathnakumar Radhakrishnan, Sundararajan Sankaranarayanan, and Bane Vasić Department of Electrical and Computer Engineering
More informationMessage Passing Algorithm with MAP Decoding on Zigzag Cycles for Non-binary LDPC Codes
Message Passing Algorithm with MAP Decoding on Zigzag Cycles for Non-binary LDPC Codes Takayuki Nozaki 1, Kenta Kasai 2, Kohichi Sakaniwa 2 1 Kanagawa University 2 Tokyo Institute of Technology July 12th,
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 informationLDPC Codes. Intracom Telecom, Peania
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,
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 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 informationTwo-Bit Message Passing Decoders for LDPC. Codes Over the Binary Symmetric Channel
Two-Bit Message Passing Decoders for LDPC 1 Codes Over the Binary Symmetric Channel Lucile Sassatelli, Member, IEEE, Shashi Kiran Chilappagari, Member, IEEE, Bane Vasic, arxiv:0901.2090v3 [cs.it] 7 Mar
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 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 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 informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
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 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 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 information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
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 informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
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 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 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 informationDesign of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal
Design of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal Behzad Amiri Electrical Eng. Department University of California, Los Angeles Los Angeles, USA Email: amiri@ucla.edu Jorge Arturo Flores
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 informationAn Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes Mehdi Karimi, Student Member, IEEE and Amir H. Banihashemi, Senior Member, IEEE Abstract arxiv:1108.4478v2 [cs.it] 13 Apr 2012 This
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 informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationInformation Theoretic Imaging
Information Theoretic Imaging WU Faculty: J. A. O Sullivan WU Doctoral Student: Naveen Singla Boeing Engineer: James Meany First Year Focus: Imaging for Data Storage Image Reconstruction Data Retrieval
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 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 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 informationCodes 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 informationOn Bit Error Rate Performance of Polar Codes in Finite Regime
On Bit Error Rate Performance of Polar Codes in Finite Regime A. Eslami and H. Pishro-Nik Abstract Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications
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 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 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 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 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 informationDesign and Analysis of Graph-based Codes Using Algebraic Lifts and Decoding Networks
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Papers in Mathematics Mathematics, Department of 3-2018 Design and Analysis
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 informationPerformance Evaluation of Faulty Iterative Decoders using Absorbing Markov Chains
Performance Evaluation of Faulty Iterative Decoders using Absorbing Markov Chains Predrag Ivaniš School of Electrical Engineering, University of Belgrade Emails: predrag.ivanis@etf.rs Bane Vasić Department
More informationA Short Length Low Complexity Low Delay Recursive LDPC Code
A Short Length Low Complexity Low Delay Recursive LDPC Code BASHAR M. MANSOOR, TARIQ Z. ISMAEEL Department of Electrical Engineering College of Engineering, University of Baghdad, IRAQ bmml77@yahoo.com
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 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 informationWeaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes
Electronic Notes in Theoretical Computer Science 74 (2003) URL: http://www.elsevier.nl/locate/entcs/volume74.html 8 pages Weaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes David
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 informationPractical Polar Code Construction Using Generalised Generator Matrices
Practical Polar Code Construction Using Generalised Generator Matrices Berksan Serbetci and Ali E. Pusane Department of Electrical and Electronics Engineering Bogazici University Istanbul, Turkey E-mail:
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 informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
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 informationChannel Codes for Short Blocks: A Survey
11th International ITG Conference on Systems, Communications and Coding February 6, 2017 Channel Codes for Short Blocks: A Survey Gianluigi Liva, gianluigi.liva@dlr.de Fabian Steiner, fabian.steiner@tum.de
More informationA Mathematical Approach to Channel Codes with a Diagonal Matrix Structure
A Mathematical Approach to Channel Codes with a Diagonal Matrix Structure David G. M. Mitchell E H U N I V E R S I T Y T O H F R G E D I N B U A thesis submitted for the degree of Doctor of Philosophy.
More informationTrapping Set Enumerators for Specific LDPC Codes
Trapping Set Enumerators for Specific LDPC Codes Shadi Abu-Surra Samsung Telecommunications America 1301 E. Lookout Dr. Richardson TX 75082 Email: sasurra@sta.samsung.com David DeClercq ETIS ENSEA/UCP/CNRS
More informationLDPC Decoder LLR Stopping Criterion
International Conference on Innovative Trends in Electronics Communication and Applications 1 International Conference on Innovative Trends in Electronics Communication and Applications 2015 [ICIECA 2015]
More informationNotes 3: Stochastic channels and noisy coding theorem bound. 1 Model of information communication and noisy channel
Introduction to Coding Theory CMU: Spring 2010 Notes 3: Stochastic channels and noisy coding theorem bound January 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami We now turn to the basic
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 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 informationChapter 7 Reed Solomon Codes and Binary Transmission
Chapter 7 Reed Solomon Codes and Binary Transmission 7.1 Introduction Reed Solomon codes named after Reed and Solomon [9] following their publication in 1960 have been used together with hard decision
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 informationDistance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance
Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance Irina E. Bocharova 1,2, Boris D. Kudryashov 1, Vitaly Skachek 2, Yauhen Yakimenka 2 1 St. Petersburg
More informationchannel of communication noise Each codeword has length 2, and all digits are either 0 or 1. Such codes are called Binary Codes.
5 Binary Codes You have already seen how check digits for bar codes (in Unit 3) and ISBN numbers (Unit 4) are used to detect errors. Here you will look at codes relevant for data transmission, for example,
More informationBlock Codes :Algorithms in the Real World
Block Codes 5-853:Algorithms in the Real World Error Correcting Codes II Reed-Solomon Codes Concatenated Codes Overview of some topics in coding Low Density Parity Check Codes (aka Expander Codes) -Network
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationSpatially Coupled LDPC Codes
Spatially Coupled LDPC Codes Kenta Kasai Tokyo Institute of Technology 30 Aug, 2013 We already have very good codes. Efficiently-decodable asymptotically capacity-approaching codes Irregular LDPC Codes
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationFountain Uncorrectable Sets and Finite-Length Analysis
Fountain Uncorrectable Sets and Finite-Length Analysis Wen Ji 1, Bo-Wei Chen 2, and Yiqiang Chen 1 1 Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology, Chinese
More informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationCoding for loss tolerant systems
Coding for loss tolerant systems Workshop APRETAF, 22 janvier 2009 Mathieu Cunche, Vincent Roca INRIA, équipe Planète INRIA Rhône-Alpes Mathieu Cunche, Vincent Roca The erasure channel Erasure codes Reed-Solomon
More informationA Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors Qian Guo Thomas Johansson Paul Stankovski Dept. of Electrical and Information Technology, Lund University ASIACRYPT 2016 Dec 8th, 2016
More informationA Proposed Quantum Low Density Parity Check Code
arxiv:quant-ph/83v 29 Aug 2 A Proposed Quantum Low Density Parity Check Code Michael S. Postol National Security Agency 98 Savage Road Fort Meade, MD 2755 Email: msposto@zombie.ncsc.mil June 3, 28 2 LOW
More informationChapter 3 Linear Block Codes
Wireless Information Transmission System Lab. Chapter 3 Linear Block Codes Institute of Communications Engineering National Sun Yat-sen University Outlines Introduction to linear block codes Syndrome and
More informationPart III Advanced Coding Techniques
Part III Advanced Coding Techniques José Vieira SPL Signal Processing Laboratory Departamento de Electrónica, Telecomunicações e Informática / IEETA Universidade de Aveiro, Portugal 2010 José Vieira (IEETA,
More information9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise
9 THEORY OF CODES Chapter 9 Theory of Codes After studying this chapter you should understand what is meant by noise, error detection and correction; be able to find and use the Hamming distance for a
More informationLecture 8: Shannon s Noise Models
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 8: Shannon s Noise Models September 14, 2007 Lecturer: Atri Rudra Scribe: Sandipan Kundu& Atri Rudra Till now we have
More informationExample: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.
Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell
More information1.6: Solutions 17. Solution to exercise 1.6 (p.13).
1.6: Solutions 17 A slightly more careful answer (short of explicit computation) goes as follows. Taking the approximation for ( N K) to the next order, we find: ( N N/2 ) 2 N 1 2πN/4. (1.40) This approximation
More informationCan You Hear Me Now?
Can You Hear Me Now? An Introduction to Coding Theory William J. Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 19 October 2004 W. J. Turner (Wabash College)
More information9 Forward-backward algorithm, sum-product on factor graphs
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 9 Forward-backward algorithm, sum-product on factor graphs The previous
More informationExtended MinSum Algorithm for Decoding LDPC Codes over GF (q)
Extended MinSum Algorithm for Decoding LDPC Codes over GF (q) David Declercq ETIS ENSEA/UCP/CNRS UMR-8051, 95014 Cergy-Pontoise, (France), declercq@ensea.fr Marc Fossorier Dept. Electrical Engineering,
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 informationStopping, and Trapping Set Analysis
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping, and Trapping Set Analysis Stefan Laendner and Olgica Milenkovic Electrical and Computer Engineering Department University of Colorado, Boulder,
More informationRandom Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes Thomas R. Halford and Keith M. Chugg Communication Sciences Institute University of Southern California Los Angeles, CA 90089-2565 Abstract
More informationEFFICIENT DECODING ALGORITHMS FOR LOW DENSITY PARITY CHECK CODES
EFFICIENT DECODING ALGORITHMS FOR LOW DENSITY PARITY CHECK CODES Master s thesis in electronics systems by Anton Blad LiTH-ISY-EX--05/3691--SE Linköping 2005 EFFICIENT DECODING ALGORITHMS FOR LOW DENSITY
More informationA Simplified Min-Sum Decoding Algorithm. for Non-Binary LDPC Codes
IEEE TRANSACTIONS ON COMMUNICATIONS 1 A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes Chung-Li (Jason) Wang, Xiaoheng Chen, Zongwang Li, and Shaohua Yang arxiv:1207.5555v1 [cs.it] 23
More information