Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary.

Slides:



Advertisements
Similar presentations
Convolutional Codes Mohammad Hanaysheh Mahdi Barhoush.
Advertisements

Error Control Code.
Error Correcting Codes Stanley Ziewacz 22M:151 Spring 2009.
Chapter 10 Shannon’s Theorem. Shannon’s Theorems First theorem:H(S) ≤ L n (S n )/n < H(S) + 1/n where L n is the length of a certain code. Second theorem:
Information Theory Introduction to Channel Coding Jalal Al Roumy.
Error-Correcting Codes
Cellular Communications
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Turbo Codes Azmat Ali Pasha.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Vladimir V. Ufimtsev Adviser: Dr. V. Rykov A Mathematical Theory of Communication C.E. Shannon Main result: Entropy function - average value of information.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
DIGITAL COMMUNICATION Coding
15-853Page :Algorithms in the Real World Error Correcting Codes I – Overview – Hamming Codes – Linear Codes.
Digital Data Communications Techniques Updated: 2/9/2009.
Hamming Codes 11/17/04. History In the late 1940’s Richard Hamming recognized that the further evolution of computers required greater reliability, in.
林茂昭 教授 台大電機系 個人專長 錯誤更正碼 數位通訊
CY2G2 Information Theory 5
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
Information and Coding Theory Linear Block Codes. Basic definitions and some examples. Juris Viksna, 2015.
Information Coding in noisy channel error protection:-- improve tolerance of errors error detection: --- indicate occurrence of errors. Source.
ECE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 18 March. 26 th, 2014.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
Data Link Layer: Error Detection and Correction
Codes Codes are used for the following purposes: - to detect errors - to correct errors after detection Error Control Coding © Erhan A. Ince Types: -Linear.
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
ERROR CONTROL CODING Basic concepts Classes of codes: Block Codes
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.
Data and Computer Communications Chapter 6 – Digital Data Communications Techniques.
Introduction to Coding Theory. p2. Outline [1] Introduction [2] Basic assumptions [3] Correcting and detecting error patterns [4] Information rate [5]
Basic Characteristics of Block Codes
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
DIGITAL COMMUNICATIONS Linear Block Codes
Linear codes of good error control performance Tsonka Baicheva Institute of Mathematics and Informatics Bulgarian Academy of Sciences Bulgaria.
Channel Coding Binit Mohanty Ketan Rajawat. Recap…  Information is transmitted through channels (eg. Wires, optical fibres and even air)  Channels are.
Authentication protocol providing user anonymity and untraceability in wireless mobile communication systems Computer Networks Volume: 44, Issue: 2, February.
Last time, we talked about:
Computer Communication & Networks Lecture 10 Datalink Layer: Error Correction Waleed Ejaz
Error Detection. Data can be corrupted during transmission. Some applications require that errors be detected and corrected. An error-detecting code can.
Basic Concepts of Encoding Codes and Error Correction 1.
Error Correction Code (2)
Error Detection and Correction – Hamming Code
Data Link Layer. Data Link Layer Topics to Cover Error Detection and Correction Data Link Control and Protocols Multiple Access Local Area Networks Wireless.
Error Detection and Correction
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
Error-Detecting and Error-Correcting Codes
Hamming Distance & Hamming Code
Error Detecting and Error Correcting Codes
II. Linear Block Codes. © Tallal Elshabrawy 2 Digital Communication Systems Source of Information User of Information Source Encoder Channel Encoder Modulator.
ECE 442 COMMUNICATION SYSTEM DESIGN LECTURE 10. LINEAR BLOCK CODES Husheng Li Dept. of EECS The University of Tennessee.
Classical Coding for Forward Error Correction Prof JA Ritcey Univ of Washington.
FEC decoding algorithm overview VLSI 자동설계연구실 정재헌.
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Coding and Interleaving
COT 5611 Operating Systems Design Principles Spring 2012
II. Linear Block Codes.
COT 5611 Operating Systems Design Principles Spring 2014
Error Correction Code (2)
Error Correction Code (2)
Information Redundancy Fault Tolerant Computing
Distributed Compression For Binary Symetric Channels
Communicating Efficiently
Reliability and Channel Coding
Error Correction Code (2)
Lecture 15 The Minimum Distance of a Code (Section 4.4)
Theory of Information Lecture 13
IV. Convolutional Codes
Chair Professor Chin-Chen Chang Feng Chia University Jan. 2008
Chapter 10 Error Detection and Correction
Information security engineering laboratory
Presentation transcript:

Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary communications, storage..) and when the channel is very noisy (wireless communication)

Hamming distance Simple example of coding The Hamming distance d(x,y) between two codewords x and y is the number of coordinate positions in which they differ d(A,B) =3 The Hamming distance d of a code is the minimum distance between two distinct codewords, over all pairs of codewords d=3 A -> 00 -> B -> 10 -> C -> 01 -> D -> 11 -> 11101

Nearest neighbor decoding a received vector is decoded to the codeword "closest" to it sphere of radius e about the codeword Perfect codes: the spheres cover the whole space

Maximum likelihood decoding Nearest neighbor decoding is equivalent to finding the input message U that maximizes the probability P(U|Y) Decoding problem in terms of probability estimation. Graphical models. U Y X noisy channel

Convolution codes as graphical models

Turbo Codes