Ger man Aerospace Center Gothenburg, 11-12 April, 2007 Coding Schemes for Crisscross Error Patterns Simon Plass, Gerd Richter, and A.J. Han Vinck.

Slides:



Advertisements
Similar presentations
Mahdi Barhoush Mohammad Hanaysheh
Advertisements

Information theory Multi-user information theory A.J. Han Vinck Essen, 2004.
Error Control Code.
An Ω(n 1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval Alexander Razborov Sergey Yekhanin.
Efficient Soft-Decision Decoding of Reed- Solomon Codes Clemson University Center for Wireless Communications SURE 2006 Presented By: Sierra Williams Claflin.
Information and Coding Theory
(speaker) Fedor Groshev Vladimir Potapov Victor Zyablov IITP RAS, Moscow.
Data and Computer Communications Tenth Edition by William Stallings Data and Computer Communications, Tenth Edition by William Stallings, (c) Pearson Education.
II. Linear Block Codes. © Tallal Elshabrawy 2 Last Lecture H Matrix and Calculation of d min Error Detection Capability Error Correction Capability Error.
Quantum Error Correction Michele Mosca. Quantum Error Correction: Bit Flip Errors l Suppose the environment will effect error (i.e. operation ) on our.
DIGITAL COMMUNICATION Coding
Chapter 11 Error-Control CodingChapter 11 : Lecture edition by K.Heikkinen.
Low Density Parity Check Codes LDPC ( Low Density Parity Check ) codes are a class of linear bock code. The term “Low Density” refers to the characteristic.
EE436 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
Mario Vodisek 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Erasure Codes for Reading and Writing Mario Vodisek ( joint work.
Linear codes 1 CHAPTER 2: Linear codes ABSTRACT Most of the important codes are special types of so-called linear codes. Linear codes are of importance.
Linear Codes.
DIGITAL COMMUNICATION Error - Correction A.J. Han Vinck.
SPANISH CRYPTOGRAPHY DAYS (SCD 2011) A Search Algorithm Based on Syndrome Computation to Get Efficient Shortened Cyclic Codes Correcting either Random.
Exercise in the previous class p: the probability that symbols are delivered correctly C: 1 00 → → → → What is the threshold.
Application of Finite Geometry LDPC code on the Internet Data Transport Wu Yuchun Oct 2006 Huawei Hisi Company Ltd.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany On STORAGE Systems A.J. Han Vinck January 2011.
Combinatorial Algorithms Reference Text: Kreher and Stinson.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
1 SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Cyclic Codes.
Codes Codes are used for the following purposes: - to detect errors - to correct errors after detection Error Control Coding © Erhan A. Ince Types: -Linear.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
Coding and Algorithms for Memories Lecture 5 1.
Basic Characteristics of Block Codes
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany Data communication signatures A.J. Han Vinck July 29, 2004.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
INTRODUCTION  New tools in computer package for coding theory research and studying QPlus are presented  QPlus includes a DLL library package that implements.
CS717 Algorithm-Based Fault Tolerance Matrix Multiplication Greg Bronevetsky.
Coding and Algorithms for Memories Lecture 4 1.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
§6 Linear Codes § 6.1 Classification of error control system § 6.2 Channel coding conception § 6.3 The generator and parity-check matrices § 6.5 Hamming.
DIGITAL COMMUNICATIONS Linear Block Codes
ADVANTAGE of GENERATOR MATRIX:
Linear Block Code 指導教授:黃文傑 博士 學生:吳濟廷
Chapter 31 INTRODUCTION TO ALGEBRAIC CODING THEORY.
Information Theory Linear Block Codes Jalal Al Roumy.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Error control coding – binary linear codes Background material for linear error control codes.
3.6 Solving Systems Using Matrices You can use a matrix to represent and solve a system of equations without writing the variables. A matrix is a rectangular.
The parity bits of linear block codes are linear combination of the message. Therefore, we can represent the encoder by a linear system described by matrices.
Perfect and Related Codes
Error Detection and Correction – Hamming Code
Some Computation Problems in Coding Theory
Elementary Coding Theory Including Hamming and Reed-Solomom Codes with Maple and MATLAB Richard Klima Appalachian State University Boone, North Carolina.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
International Iran conference on Quantum Information September 2007, Kish Island Evaluation of bounds of codes defined over hexagonal and honeycomb lattices.
1 Reliability-Based SD Decoding Not applicable to only graph-based codes May even help with some algebraic structure SD alternative to trellis decoding.
Error Control Coding. Purpose To detect and correct error(s) that is introduced during transmission of digital signal.
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture (2011)
Reed-Solomon Codes Rong-Jaye Chen.
1 Code design: Computer search Low rate: Represent code by its generator matrix Find one representative for each equivalence class of codes Permutation.
ECE 442 COMMUNICATION SYSTEM DESIGN LECTURE 10. LINEAR BLOCK CODES Husheng Li Dept. of EECS The University of Tennessee.
Channel Coding: Part I Presentation II Irvanda Kurniadi V. ( ) Digital Communication 1.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
Part 2 Linear block codes
The Viterbi Decoding Algorithm
Coding and Algorithms for Memories Lecture 4
Subject Name: Information Theory Coding Subject Code: 10EC55
Block codes. encodes each message individually into a codeword n is fixed, Input/out belong to alphabet Q of cardinality q. The set of Q-ary n-tuples.
Information Redundancy Fault Tolerant Computing
Error Correction Coding
Presentation transcript:

Ger man Aerospace Center Gothenburg, April, 2007 Coding Schemes for Crisscross Error Patterns Simon Plass, Gerd Richter, and A.J. Han Vinck

2 Ger man Aerospace Center What are Crisscross Errors?  Crisscross errors can occur in several applications of information transmission, e.g., magnetic tape recording, memory chip arrays or in environments with impulsive- or narrowband noise, where the information is stored or transmitted in (N x n) arrays.

3 Ger man Aerospace Center Motivation Are there coding scheme which are suited to these crisscross errors?  Rank-Codes  Permutation Codes

4 Ger man Aerospace Center Introduction of Rank-Codes Let us consider a vector with elements of the extension field GF(q N ): Now, we can present the vector x as a matrix with entries of the finite field GF(q): Let us define the rank distance between two matrices A and B as:

5 Ger man Aerospace Center Introduction of Rank-Codes (cont’d) Example for the rank distance: Furthermore, Rank-Codes have an error correction capability t of where E is the error matrix.

6 Ger man Aerospace Center Example of Rank Error 1 = error Rank array is 2.  rank error = 2 Rank of array is still 2.

7 Ger man Aerospace Center Construction of Rank-Codes A parity-check matrix H and its corresponding generator matrix G which define the Rank-Code are given by: The elementsand must be linearly independent over

8 Ger man Aerospace Center Algebraic Decoding Syndrome calculation s=(c+e)H T =eH T  Key equation Use of efficient algorithm, e.g., Berlekamp-Massey algorithm, for solving the system of linear equations  Error polynomial Error value and error location computation by recursive calculation  Error vector e c decode = r - e

9 Ger man Aerospace Center Key Equation of Rank-Codes Main problem: Solve the key equation for the unknown variables Syndrome S j can be represented by an appropriate designed shift-register if is known

10 Ger man Aerospace Center Berlekamp-Massey Algorithm for Rank-Codes Initialize the algorithm Does current design of shift-register produce next syndrome? Modify shift-register Has shift-register correct length? Modify length All syndromes calculated? Yes No Yes No Yes and finished New theorem and proof

11 Ger man Aerospace Center Conclusions for Rank-Codes  Rank-Codes exploit the rank metric by decoding over the rank of the error matrix, and therefore, Rank-Codes can handle efficiently crisscross errors  The Berlekamp-Massey algorithm was introduced as an efficient decoding algorithm

12 Ger man Aerospace Center A Permutation Code C consists of |C| codewords of length N, where every codeword contains the N different integers 1,2,…,N as symbols. The cardinality |C| is upper bounded by The codewords are presented in a binary matrix where every row and column contains exactly one single symbol 1. Introduction of Permutation Codes

13 Ger man Aerospace Center Example of a simple Permutation Code N=3, d min =2, |C|=6 and the resulting codewords: As binary matrix:

14 Ger man Aerospace Center Influence of Crisscross and Random Errors  A row or column error reduces the distance between two codewords by a maximum value of two.  A random error reduces the distance by a maximum value of one.  We can correct these errors, if

15 Ger man Aerospace Center Application to M-FSK Modulation  In M-FSK, symbols are modulated as one of M orthogonal sinusoidal waves  The setting of Permutation Codes can be mapped onto M-FSK modulation Example: M=N=4, |C|=4, C={1234}, {2143}, {3412}, {4321}; {2143}  {f 2 f 1 f 4 f 3 }  f f f f time frequency time

16 Ger man Aerospace Center Influence of Different Noise No noise Background noise narrowband impulsivefading

17 Ger man Aerospace Center Conclusions  Introduction of codes, namely Rank-Codes and Permutation Codes, which can handle crisscross errors  Rank-Codes: Rank-Codes exploit the rank metric by decoding over the rank of the error matrix, and therefore, Rank-Codes can handle efficiently crisscross errors The Berlekamp-Massey algorithm was introduced as an efficient decoding algorithm  Permutation Codes: Binary code for the crisscross error problem Example of M-FSK modulation application is introduced

18 Ger man Aerospace Center Thank you!

19 Ger man Aerospace Center Error Pattern Example RS codeword single error error