Lecture 4: Linear Codes. Copyright G. Caire 88
|
|
- Roy Leonard
- 6 years ago
- Views:
Transcription
1 Lecture 4: Linear Codes Copyright G. Caire 88
2 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 message as a sequence of k symbols from F q. We have C = q k, and R = k n log 2 q bits/symbol. Definition 22. A (q k,n) block code over X = F q is called a linear (n, k) code if its codewords form a k-dimensional vector subspace of the vector space F n q. Copyright G. Caire 89
3 Elementary properties of linear codes The code C is an additive group, in particular, if c, c 0 2 C then c + c 0 2 C and c 2 C. The all-zero vector is a codeword: 0 2 C. Linear combination of codewords are codewords: c 1,...,c` 2 C and a 1,...,a` 2 F q, then a 1 c 1 + a`c` 2 C There exist (non-unique) sets of k linearly independent codewords that generate the whole code, i.e., ( k 1 ) X C = u`g` : u 0,...,u k 1 2 F q `=0 where g 0,...,g k 1 are codewords that form a basis for the code C. Copyright G. Caire 90
4 Generator matrix We can arrange the basis as rows of a k n matrix G = g 0,0 g 0,1 g 0,2 g 0,n 1 g 1,0. g 1,1 g 1,2 g 1,n. 1 g k 1,0 g k 1,1 g k 1,2 g k 1,n This is called a generator matrix for the code. Letting u =(u 0,...,u k can write the encoding function as 1 ) we c = ug Copyright G. Caire 91
5 (7, 4) binary Hamming code G = Copyright G. Caire 92
6 Repetition and single-parity-check codes G = apple G = Copyright G. Caire 93
7 Systematic encoding Sometimes, a desirable property of the encoding function is that the vector of information symbols appears explicitly as part of the codeword. For linear codes, a generator matrix in systematic form is given by G =[P I k ] k (n k) where P 2 Fq and I k denotes the k k identity. In this way, we have c = ug =[up u]. Copyright G. Caire 94
8 Parity-check matrix Since C is a vector subspace of F q of dimension k, then it can be seen as the Kernel of some linear transformation F n q! F n k q. The matrix of such linear transformation is called parity-check matrix and it is denoted by H T, where H 2 F (n k) n q : C = c 2 F n q : ch T = 0 In particular, the rows of H are n-vectors in F n q that are orthogonal to all codewords. Indeed, they generate the orthogonal subspace C?, also known as the dual code of C. If G =[P I k ], then H =[I n k P T ], in fact, we have GH T =[P I k ] apple In k P = P P = 0 Copyright G. Caire 95
9 q-ary symmetric channels A q-ary symmetric channel can always be represented as an additive noise channel over F q, such that y = c + z where z 2 F n q. The noise pmf is given by P Z (z) = 1 for z =0 /(q 1) for z 6= 0 The syndrome of the error vector is given by s = zh T Copyright G. Caire 96
10 Syndrome decoding Notice that the decoder can compute the syndrome even though it does not know z, in fact, yh T =(c + z)h T = ch T + zh T = zh T = s Therefore, the syndrome of the error vector is an index that can be used by the decoder to undo the bit-flips. If s = 0, then y 2 C. In this case, we let bc = y. If s 6= 0, then y /2 C. In this case the decoder knows that an error has occurred (detectable error). Copyright G. Caire 97
11 In order to correct the error, the decoder needs to find bz, an estimate of z, and correct the errors as bc = y bz. Unfortunately, the system of equations s = zh T where s is known (the syndrome) and z is unknown, is underdetermined (n unknowns and n k equations). For every syndrome s 2 F n q k, we have q k possible error vectors. We have to solve this problem in a probabilistic sense... for each set of q k possible error vectors corresponding to a given syndrome, we shall pick the most likely. Copyright G. Caire 98
12 Standard array The linear map F n q! F n q k such that y 7! s = yh T has Kernel Ker(H T )=C Linear maps are group homomorphisms (they preserve the group operation, that in this case is componentwise addition in F q ). A coset of C in F n q is given by the translate v + C for some v 2 F n q. The factor group (group of cosets), with respect to the coset addition, satisfies (canonical isomorphism): F n q /C F n k q The standard array is the correspondence between the syndromes s 2 F n q and the cosets of C in F n q, induced by this isomorphism. k Copyright G. Caire 99
13 Building the standard array s 0 = 0 c 0 = 0 c 1 c q k 1 s 1 v 1 v 1 + c 1 v 1 + c q k 1 s 2 v 2 c 2 + c 1 v 2 + c q k 1... s q n k 1 v q n k 1 v q n k 1 + c 1 v q n k 1 + c q k 1 For every new row, find the vector in F n q with minimum Hamming weight that not yet appeared in the array. The corresponding row is obtained by adding this vector to all codewords. All row are distinct, and yield the same syndrome. These vectors of minimum weight are called coset leaders. Copyright G. Caire 100
14 Example Consider the SPC (3, 2), with parity-check matrix H =[ ] Exercise: build the standard array for the Hamming (7, 4) code. Copyright G. Caire 101
15 Error correction algorithm 1. Compute the syndrome s = yh T. 2. Use the standard array and find the most likely error vector bz compatible with s (coset leader). 3. The minimum Hamming distance decision rule is given by bc = y bz 4. A (n, k) linear code is able to correct q n k error patterns (error vectors) Copyright G. Caire 102
16 The Tanner Graph of a linear code Consider a linear (n, k) block code C = {c : ch T = 0}. It is defined by the set of parity-check equations h 1,1 x 1 + h 1,2 x h 1,n x n = 0 h 2,1 x 1 + h 2,2 x h 2,n x n = 0. h n k,1 x 1 + h n k,2 x h n k,n x n = 0 The Tanner graph of the code is a bipartite graph with n bit-nodes and n k check-nodes, such that an edge (i, j) exists if h i,j = 1, that is, if bit x j participate in the parity-check equation i. Copyright G. Caire 103
17 Hamming (7, 4) code Parity-check equations of the Hamming (7, 4) code: x 1 + x 2 + x 4 + x 5 = 0 x 1 + x 3 + x 4 + x 6 = 0 x 2 + x 3 + x 4 + x 7 = Copyright G. Caire 104
18 LDPC codes Low-Density Parity-Check (LDPC) codes are linear binary codes with the characteristic that their parity-check matrix is sparse: the number of ones in the matrix is proportional to the block length n. Notice that a randomly generated binary matrix H with dimensions n(1 R) n has an average number of ones equal to n 2 (1 R)/2, i.e., quadratic with n. A regular (d`,d r ) LDPC code has Tanner graph with constant left and right degrees d` and d r, respectively. Example: a (3, 6) regular LDPC code of length n = 10, given by the paritycheck matrix H = Copyright G. Caire 105
19 (3, 6) LDPC code with n = 10 Copyright G. Caire 106
20 Introducing memory A binary linear block encoder is a linear transformation F k 2! F n 2. What about using a Linear time-invariant linear system for encoding? Convolutional codes consider small k and n, but introduce memory into the encoding process of a sequence of consecutive blocks. We may see this a the convolution of a sequence of information blocks {u i } with a matrix G of impulse responses, in order to generate a sequence of coded blocks {c i }. Copyright G. Caire 107
21 MA k n linear systems A k n Moving Average (MA) system is defined by: c (1) i = c (2) i =. c (n) i = m 1,1 X `=0 m 1,2 X `=0 m X 1,n `=0 g (1,1) ` u (1) i g (1,2) ` u (1) i g (1,n) ` u (1) i mk,1 ` + + X `=0 mk,2 ` + + X `=0 mk,n ` + + X `=0 g (k,1) ` g (k,2) ` g (k,n) ` u (k) i ` u (k) i ` u (k) i ` Copyright G. Caire 108
22 Defining a vector output sequence c 0, c 1, c 2,...such that c i =(c (1) i and a vector input sequence u 0, u 1, u 2,...such that u i =(u (1) i can write mx where we let m = max{m (i,j) }. c i = `=0 u i `G`,...,c (n),...,u (k) i i ) ), we We obtain a block-toeplitz notation 2 (c 0, c 1, c 2, c 3,...)=(u 0, u 1, u 2, u 3,...) 6 4 G 0 G 1 G m 0 0 G 0 G m 1 G m G m 1... G 0. 0 G The impulse responses g (i,j) are called the code generators. Copyright G. Caire 109
23 D-transform D-transform domain u i! u(d) = X i u i D i (Laurent series) Convolutional encoding in the D-transform domain: c(d) =u(d)g(d) or, equivalently, (c 1 (D),...,c n (D)) = (u 1 (D),...,u k (D)) g 1,1 (D) g 1,2 (D) g 1,n (D) g 2,1 (D). g 2,2 (D) g 2,n (D). g k,1 (D) g k,2 (D) g k,n (D) Copyright G. Caire 110
24 Example: a (2, 1) convolutional code + c (1) i = u i + u i 2 u i + c (2) i = u i + u i 1 + u i 2 Copyright G. Caire 111
25 Encoder canonical forms A code C is defined as the set of all output sequences (code sequences). As for block codes, a convolutional code C may have several input-ouput encoder implementations. We seek encoders in canonical form: a general problem in system theory is for a given system, defined as the ensemble of all its output sequences, what is the minimal canonical realization? State-space representation (ABCD): s i+1 = s i A + u i B, c i = s i C + u i D a minimal representation is a representation with the minimum number of state variables. Copyright G. Caire 112
26 More on the (2, 1) example In the (2, 1) example of before, the state is defined as the content of the memory elements, s i =(u i 1,u i 2 ) therefore we have and s i+1 = s i apple c i = s i apple u i u i 1 1 Copyright G. Caire 113
27 Generalization... A convolutional code can be seen as a block code defined on the field F q (D) of rational functions over F q. Roughly speaking: rational functions are to polynomials as rationals Q to the integers Z. Generalizing what seen before, we can consider G(D) with rational elements g i,j (D). In system theory, this corresponds to AR-MA linear systems. The code is preserved by elementary row operations. It follows that for any G(D), we can find a systematic generator matrix in the form G(D) =[I P(D)] where I is the k k identity, and P(D) is a k (n k) matrix of rational functions. Copyright G. Caire 114
28 State diagram A state-space realization with m binary state variables is a finite-state machine (FSM) with a state space = F m 2. In general, a FSM is described by its state transition diagram, i.e., by a graph with vertices, corresponding to all possible state configurations, and edges connecting those states for which a transition is possible. Each edge (s, s 0 ) 2 is labeled by input and output vectors b 2 F k 2 and c 2 F n 2, corresponding to the state transition between s and s 0. Copyright G. Caire 115
29 Example: the (2, 1) 4-state code Faculty of Electrical Engineering and Computer Systems Department of Telecommunication Systems Information and Communication Theory Prof. Dr. Giuseppe Caire Einsteinufer Berlin Telefon +49 (0) Telefax +49 (0) Sekretariat HFT6 Patrycja Chudzik Telefon +49 (0) Telefax +49 (0) /11 (1, 0) 1/10 0/01 0/00 (0, 0) 1/00 (1, 1) 1/01 0/10 0/11 (0, 1) Copyright G. Caire 116
30 Trellis diagram An alternative representation consists of the trellis section, i.e., by a bipartite graph with state vertices on the left and state vertices on the right. Left vertices represent the possible states at time i, and right vertices represent the possible states at time i +1. Edges represent the possible state transitions corresponding to input u i and output c i. The trellis representation follows from the state transition diagram by introducing the time axis. A trellis diagram for a convolutional code consists of the concatenation of an infinite number of trellis sections. Given an initial state at time i =0, an input sequence u(d) determines an output sequence c(d) and a state sequence s(d) that correspond to a path in the trellis. Copyright G. Caire 117
31 Example: the (2, 1) 4-state code Faculty of Electrical Engineering and Computer Systems Department of Telecommunication Systems Information and Communication Theory Prof. Dr. Giuseppe Caire Einsteinufer Berlin Telefon +49 (0) Telefax +49 (0) Sekretariat HFT6 Patrycja Chudzik Telefon +49 (0) Telefax +49 (0) (0, 0) (1, 0) 0/00 1/11 (0, 0) 0/11 (1, 0) 1/00 (0, 1) 0/01 1/10 (0, 1) 0/10 (1, 1) Copyright G. Caire 1/01 (1, 1) 118
32 The Factor Graph for a convolutional code Three types of variable nodes: information bitnodes u i, coded bitnodes c i and states nodes s i. The function nodes correspond to the state and output mappings s i+1 = s i A + u i B, c i = s i C + u i D Copyright G. Caire 119
33 End of Lecture 4 Copyright G. Caire 120
Lecture 5: Channel Capacity. Copyright G. Caire (Sample Lectures) 122
Lecture 5: Channel Capacity Copyright G. Caire (Sample Lectures) 122 M Definitions and Problem Setup 2 X n Y n Encoder p(y x) Decoder ˆM Message Channel Estimate Definition 11. Discrete Memoryless Channel
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 informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
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 informationThe extended coset leader weight enumerator
The extended coset leader weight enumerator Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands Symposium on Information Theory in the Benelux, 2009 1/14 Outline Codes, weights
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 informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More informationMathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
More informationEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Linear Block Codes February 14, 2007 1. Code 1: n = 4, n k = 2 Parity Check Equations: x 1 + x 3 = 0, x 1 + x 2 + x 4 = 0 Parity Bits: x 3 = x 1,
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 information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy 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 informationBinary Convolutional Codes
Binary Convolutional Codes A convolutional code has memory over a short block length. This memory results in encoded output symbols that depend not only on the present input, but also on past inputs. An
More informationIntroduction to Binary Convolutional Codes [1]
Introduction to Binary Convolutional Codes [1] Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw Y. S. Han Introduction
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 informationCodes on graphs. Chapter Elementary realizations of linear block codes
Chapter 11 Codes on graphs In this chapter we will introduce the subject of codes on graphs. This subject forms an intellectual foundation for all known classes of capacity-approaching codes, including
More informationELEC 519A Selected Topics in Digital Communications: Information Theory. Hamming Codes and Bounds on Codes
ELEC 519A Selected Topics in Digital Communications: Information Theory Hamming Codes and Bounds on Codes Single Error Correcting Codes 2 Hamming Codes (7,4,3) Hamming code 1 0 0 0 0 1 1 0 1 0 0 1 0 1
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 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 informationArrangements, matroids and codes
Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011 References 2/43 1. Codes, arrangements and matroids by Relinde
More informationELEC 405/ELEC 511 Error Control Coding and Sequences. Hamming Codes and the Hamming Bound
ELEC 45/ELEC 5 Error Control Coding and Sequences Hamming Codes and the Hamming Bound Single Error Correcting Codes ELEC 45 2 Hamming Codes One form of the (7,4,3) Hamming code is generated by This is
More informationSolutions to problems from Chapter 3
Solutions to problems from Chapter 3 Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga February 28, 2016 For a systematic (7,4) linear block code, the parity
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationLecture 3 : Introduction to Binary Convolutional Codes
Lecture 3 : Introduction to Binary Convolutional Codes Binary Convolutional Codes 1. Convolutional codes were first introduced by Elias in 1955 as an alternative to block codes. In contrast with a block
More informationMath 512 Syllabus Spring 2017, LIU Post
Week Class Date Material Math 512 Syllabus Spring 2017, LIU Post 1 1/23 ISBN, error-detecting codes HW: Exercises 1.1, 1.3, 1.5, 1.8, 1.14, 1.15 If x, y satisfy ISBN-10 check, then so does x + y. 2 1/30
More informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
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 informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationMATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016
MATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016 Notation: We will use the notations x 1 x 2 x n and also (x 1, x 2,, x n ) to denote a vector x F n where F is a finite field. 1. [20=6+5+9]
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 informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More information(Reprint of pp in Proc. 2nd Int. Workshop on Algebraic and Combinatorial coding Theory, Leningrad, Sept , 1990)
(Reprint of pp. 154-159 in Proc. 2nd Int. Workshop on Algebraic and Combinatorial coding Theory, Leningrad, Sept. 16-22, 1990) SYSTEMATICITY AND ROTATIONAL INVARIANCE OF CONVOLUTIONAL CODES OVER RINGS
More informationELEC 405/ELEC 511 Error Control Coding. Hamming Codes and Bounds on Codes
ELEC 405/ELEC 511 Error Control Coding Hamming Codes and Bounds on Codes Single Error Correcting Codes (3,1,3) code (5,2,3) code (6,3,3) code G = rate R=1/3 n-k=2 [ 1 1 1] rate R=2/5 n-k=3 1 0 1 1 0 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 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 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 informationMATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
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 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 informationChapter10 Convolutional Codes. Dr. Chih-Peng Li ( 李 )
Chapter Convolutional Codes Dr. Chih-Peng Li ( 李 ) Table of Contents. Encoding of Convolutional Codes. tructural Properties of Convolutional Codes. Distance Properties of Convolutional Codes Convolutional
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 informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
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 informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
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 informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationLinear Codes and Syndrome Decoding
Linear Codes and Syndrome Decoding These notes are intended to be used as supplementary reading to Sections 6.7 9 of Grimaldi s Discrete and Combinatorial Mathematics. The proofs of the theorems are left
More informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
More informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
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 informationLinear Block Codes. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 26 Linear Block Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay July 28, 2014 Binary Block Codes 3 / 26 Let F 2 be the set
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 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 informationCoding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014
Anna Dovzhik 1 Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014 Sharing data across channels, such as satellite, television, or compact disc, often
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationBinary Linear Codes G = = [ I 3 B ] , G 4 = None of these matrices are in standard form. Note that the matrix 1 0 0
Coding Theory Massoud Malek Binary Linear Codes Generator and Parity-Check Matrices. A subset C of IK n is called a linear code, if C is a subspace of IK n (i.e., C is closed under addition). A linear
More informationNAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00
NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR Sp ' 00 May 3 OPEN BOOK exam (students are permitted to bring in textbooks, handwritten notes, lecture notes
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
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 informationMATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
More informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
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 informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationAnswers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics
Answers and Solutions to (Even Numbered) Suggested Exercises in Sections 6.5-6.9 of Grimaldi s Discrete and Combinatorial Mathematics Section 6.5 6.5.2. a. r = = + = c + e. So the error pattern is e =.
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 informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
More informationLocal correctability of expander codes
Local correctability of expander codes Brett Hemenway Rafail Ostrovsky Mary Wootters IAS April 4, 24 The point(s) of this talk Locally decodable codes are codes which admit sublinear time decoding of small
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 informationSome error-correcting codes and their applications
Chapter 14 Some error-correcting codes and their applications J. D. Key 1 14.1 Introduction In this chapter we describe three types of error-correcting linear codes that have been used in major applications,
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 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 informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 1 Error-correcting codes In this section of the notes, we have a quick look at coding theory. After a motivating introduction, we discuss the weight enumerator of a code,
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 informationIntroduction to binary block codes
58 Chapter 6 Introduction to binary block codes In this chapter we begin to study binary signal constellations, which are the Euclidean-space images of binary block codes. Such constellations have nominal
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
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 informationOn Weight Enumerators and MacWilliams Identity for Convolutional Codes
On Weight Enumerators and MacWilliams Identity for Convolutional Codes Irina E Bocharova 1, Florian Hug, Rolf Johannesson, and Boris D Kudryashov 1 1 Dept of Information Systems St Petersburg Univ of Information
More informationOn Two Probabilistic Decoding Algorithms for Binary Linear Codes
On Two Probabilistic Decoding Algorithms for Binary Linear Codes Miodrag Živković Abstract A generalization of Sullivan inequality on the ratio of the probability of a linear code to that of any of its
More informationMATH3302 Coding Theory Problem Set The following ISBN was received with a smudge. What is the missing digit? x9139 9
Problem Set 1 These questions are based on the material in Section 1: Introduction to coding theory. You do not need to submit your answers to any of these questions. 1. The following ISBN was received
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 informationIntroduction to convolutional codes
Chapter 9 Introduction to convolutional codes We now introduce binary linear convolutional codes, which like binary linear block codes are useful in the power-limited (low-snr, low-ρ) regime. In this chapter
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 informationSymmetric Product Codes
Symmetric Product Codes Henry D. Pfister 1, Santosh Emmadi 2, and Krishna Narayanan 2 1 Department of Electrical and Computer Engineering Duke University 2 Department of Electrical and Computer Engineering
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 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 information1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g
Exercise Generator polynomials of a convolutional code, given in binary form, are g 0, g 2 0 ja g 3. a) Sketch the encoding circuit. b) Sketch the state diagram. c) Find the transfer function TD. d) What
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationHamming codes and simplex codes ( )
Chapter 6 Hamming codes and simplex codes (2018-03-17) Synopsis. Hamming codes are essentially the first non-trivial family of codes that we shall meet. We start by proving the Distance Theorem for linear
More informationLecture 6: Expander Codes
CS369E: Expanders May 2 & 9, 2005 Lecturer: Prahladh Harsha Lecture 6: Expander Codes Scribe: Hovav Shacham In today s lecture, we will discuss the application of expander graphs to error-correcting codes.
More informationExact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel
Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering
More informationExample of Convolutional Codec
Example of Convolutional Codec Convolutional Code tructure K k bits k k k n- n Output Convolutional codes Convoltuional Code k = number of bits shifted into the encoder at one time k= is usually used!!
More information6.895 PCP and Hardness of Approximation MIT, Fall Lecture 3: Coding Theory
6895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 3: Coding Theory Lecturer: Dana Moshkovitz Scribe: Michael Forbes and Dana Moshkovitz 1 Motivation In the course we will make heavy use of
More informationGenerator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.
Cyclic Codes II Generator Matrix We would now like to consider how the ideas we have previously discussed for linear codes are interpreted in this polynomial version of cyclic codes. Theorem 6: If the
More informationCODE DECOMPOSITION IN THE ANALYSIS OF A CONVOLUTIONAL CODE
Bol. Soc. Esp. Mat. Apl. n o 42(2008), 183 193 CODE DECOMPOSITION IN THE ANALYSIS OF A CONVOLUTIONAL CODE E. FORNASINI, R. PINTO Department of Information Engineering, University of Padua, 35131 Padova,
More informationLecture 12: November 6, 2017
Information and Coding Theory Autumn 017 Lecturer: Madhur Tulsiani Lecture 1: November 6, 017 Recall: We were looking at codes of the form C : F k p F n p, where p is prime, k is the message length, and
More informationCodes on Graphs, Normal Realizations, and Partition Functions
Codes on Graphs, Normal Realizations, and Partition Functions G. David Forney, Jr. 1 Workshop on Counting, Inference and Optimization Princeton, NJ November 3, 2011 1 Joint work with: Heide Gluesing-Luerssen,
More informationCSCI 2570 Introduction to Nanocomputing
CSCI 2570 Introduction to Nanocomputing Information Theory John E Savage What is Information Theory Introduced by Claude Shannon. See Wikipedia Two foci: a) data compression and b) reliable communication
More information