Digital Codes Coding Gain For a given Bit error Rate, Coding Gain is defined as the increase required in C/N such that un-coded data yields the same BER.

Slides:



Advertisements
Similar presentations
Convolutional Codes Representation and Encoding  Many known codes can be modified by an extra code symbol or by deleting a symbol * Can create codes of.
Advertisements

1 S Digital Communication Systems Cyclic Codes.
Inserting Turbo Code Technology into the DVB Satellite Broadcasting System Matthew Valenti Assistant Professor West Virginia University Morgantown, WV.
Forward Error Correction Demystified Presented by Sunrise Telecom Broadband … a step ahead.
1 Wireless Sensor Networks Akyildiz/Vuran Administration Issues  Take home Mid-term Exam  Assign April 2, Due April 7  Individual work is required 
6.375 Project Arthur Chang Omid Salehi-Abari Sung Sik Woo May 11, 2011
Data and Computer Communications
1 Channel Coding in IEEE802.16e Student: Po-Sheng Wu Advisor: David W. Lin.
Cellular Communications
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Turbo Codes – Decoding and Applications Bob Wall EE 548.
Coding and Error Control
Turbo Codes Azmat Ali Pasha.
Lecture 9-10: Error Detection and Correction Anders Västberg Slides are a selection from the slides from chapter 8 from:
Chapter 11 Error-Control CodingChapter 11 : Lecture edition by K.Heikkinen.
1 CS 6910 – Pervasive Computing Spring 2007 Section 4 (Ch.4): Channel Coding and Error Control Prof. Leszek Lilien Department of Computer Science Western.
Forward Error Correction. FEC Basic Idea Send redundant data Receiver uses it to detect/correct errors Reduces retransmissions/NAKs Useful when RTT is.
Reed Solomon Codes block oriented FEC used in high reliability wireless applications non-binary code with m-ary symbol alphabet e.g. M = 8  alphabet size.
Wireless Networks Spring 2005 Coding and Error Control.
DIGITAL COMMUNICATION Error - Correction A.J. Han Vinck.
1 S Advanced Digital Communication (4 cr) Cyclic Codes.
Channel Coding and Error Control
Channel Coding Part 1: Block Coding
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 4 Channel Coding.
Coding and Error Control
Lecture 10: Error Control Coding I Chapter 8 – Coding and Error Control From: Wireless Communications and Networks by William Stallings, Prentice Hall,
1 Channel Coding (II) Cyclic Codes and Convolutional Codes.
1 University of Canberra Advanced Communications Topics Television Broadcasting into the Digital Era by: Neil Pickford Lecture 5 DTTB Transmission Error.
ECE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 18 March. 26 th, 2014.
1 SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Cyclic Codes.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Codes Codes are used for the following purposes: - to detect errors - to correct errors after detection Error Control Coding © Erhan A. Ince Types: -Linear.
March 29, 2005Week 11 1 EE521 Analog and Digital Communications James K. Beard, Ph. D. Tuesday, March 29, 2005
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Lecture 3-2: Coding and Error Control (Cont.) ECE
1 Chapter 8. Coding and Error Control Wen-Shyang Hwang KUAS EE.
Basic Characteristics of Block Codes
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter Thirteen Channel Coding and Encryption.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Channel Coding Binit Mohanty Ketan Rajawat. Recap…  Information is transmitted through channels (eg. Wires, optical fibres and even air)  Channels are.
Wireless Communication Network Lab. Chapter 4 Channel Coding and Error Control Chih-Cheng Tseng1EE of NIU Prof. Chih-Cheng Tseng
Error Detection. Data can be corrupted during transmission. Some applications require that errors be detected and corrected. An error-detecting code can.
Error Detection and Correction
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Struggle ! two practical classes of channel (error- correcting) codes cyclic codes (巡回符号) a subclass of linear codes linear-time encoding and error detection.
Coding and Error Control
Error Control Coding. Purpose To detect and correct error(s) that is introduced during transmission of digital signal.
1 Product Codes An extension of the concept of parity to a large number of words of data 0110… … … … … … …101.
Komunikasi Satelit, Sukiswo, ST, MT 1 KOMUNIKASI SATELIT DIGITAL Sukiswo
GBT protocol implementation on Xilinx FPGAs Csaba SOOS PH-ESE-BE-OT.
Diana B. Llacza Sosaya Digital Communications Chosun University
Block Coded Modulation Tareq Elhabbash, Yousef Yazji, Mahmoud Amassi.
Classical Coding for Forward Error Correction Prof JA Ritcey Univ of Washington.
Class Report 林格名 : Reed Solomon Encoder. Reed-Solomom Error Correction When a codeword is decoded, there are three possible outcomes –If 2s + r < 2t (s.
Channel Coding and Error Control 1. Outline Introduction Linear Block Codes Cyclic Codes Cyclic Redundancy Check (CRC) Convolutional Codes Turbo Codes.
V. Non-Binary Codes: Introduction to Reed Solomon Codes
1 Wireless Networks Lecture 5 Error Detecting and Correcting Techniques (Part II) Dr. Ghalib A. Shah.
Hamming Codes The Hamming Code is a Forward Error-correcting Code (FEC) that uses redundant bits to correct a single bit error For 4 bit codes, 3 redundant.
Lecture Slides 03-October-2017
Coding and Interleaving
University of Canberra Advanced Communications Topics
Chapter 6.
DIGITAL COMMUNICATION Coding
Coding and Error Control
Error Trapping on LFBSR
Wireless Mesh Networks
Error Correction Code (1)
Unequal Error Protection for Video Transmission over Wireless Channels
Error Correction Code (1)
Homework #2 Due May 29 , Consider a (2,1,4) convolutional code with g(1) = 1+ D2, g(2) = 1+ D + D2 + D3 a. Draw the.
Presentation transcript:

Digital Codes Coding Gain For a given Bit error Rate, Coding Gain is defined as the increase required in C/N such that un-coded data yields the same BER as Coded data. Standard Codes (covered in CEC 220) CCITT-2/ITU ARQ ASCII EBCDIC Gray

Reed Solomon Code Properties Byte Oriented Block Code m : bits per byte k : information bytes per block n = 2 m - 1 : total bytes per block t : number of byte error corrections possible n – k = 2t : required redundancy bytes r = k/n : code “rate” Example: Determine the block properties of an RS code with m = 6 bits/byte, capable of correcting t = 4 byte errors per block. n = 2 6 – 1 = 63 bytes/block = 378 bits/block n - k = 2t = 8 bytes = 48 redundancy bits k = n – 2t = 55 data bytes = 330 data bits r = k/n = 55/63 = rate 0.873

Reed Solomon Codes (cont) A “byte error” is byte containing a single bit error. Multiple bit errors within a byte cannot be corrected, so RS codes are vulnerable to channel interruptions resulting in “burst errors.” Bit ordering over several coded blocks are often shuffled at the transmitter in a prescribed way and un- shuffled at the receiver so that burst errors are dispersed over several blocks. This is known as Data Interleaving.

BCH Code Properties Block/Word oriented Code Cyclic (polynomial) Code: encoding/decoding is accomplished using shift registers and Modulo 2 addition (XOR). cnumber of correctible bits per word n = 2 i – 1total bits per word k > n - cinumber of data bit per word Example: Determine the block properties of a BCH code with k = 64 bits/word, capable of correcting c = 4 bit errors per word. n = 2 i – 1 < ci +k < 4i + 64 i min = 7 n min = 127 Note: for i = 7 (n = 127), we could have c = 5 and k = 92

Convolutional Codes D Q Clock Data Symbol Modulator Transmitted Symbols Received Symbols Data Viterbi Decoder Encoder (State Machine) The Viterbi decoder uses the input symbols to construct the most likely sequence of encoder states, and deduces the data sequence therefrom. Q0Q0 Q1Q1 Q2Q2

Data = 1 Data = 0 State Diagram for Example Encoder y1y2y1y2 Q0Q0 Q1Q1 Q2Q2 Q2Q1Q0y1y2Q2Q1Q0y1y2 Data State Template

Data = 1 Data = 0 Decoding Example