FEC performance on multi-part links

Size: px
Start display at page:

Download "FEC performance on multi-part links"

Transcription

1 FEC performance on multi-part links ete Anslow, Ciena IEEE 80.3bs Task Force, San Diego, CA, July 04

2 Introduction When analysing the performance of 400GbE FEC encoded links, two of the aspects that need consideration are: The interaction of burst errors due to decision feedback equalization (DFE) and dis-interleaving of bit-streams from higher rate lanes. Covering several sub-links with a single end-to-end FEC. This contribution provides an analysis of the performance of RS(58,54) FEC for various interleaving schemes and also provides an analysis of the BER limit for a bursty sub-link to give a small penalty in a random sub-link for various interleaving schemes.

3 Reed-Solomon FEC with random errors For a Reed-Solomon code RS(N,k), with symbol size of m and symbol correction capability t, if the input BER is: The input symbol error ratio (or the probability that an input symbol contains errors) SER in is given by: SER in = -(-BER in ) m m x BER in (for small BER in ) () The codeword error ratio (the probability of an uncorrectable FEC codeword) is: N N i N i CER = SER in ( SER in ) i= t i The frame loss ratio (FLR) is then: B ER in = erfc SNR FLR = CER * (CER * ( - CER) * ( MFC)/MFC) (4) Where MFC is the number of MAC frames per codeword. (This is an extension of slide 6 of anslow_0a mmf that still works for high CER) () (3) 3

4 Burst error model The burst error probability is modelled in this contribution on the assumption that the probability of getting an error in the bit following an initial error (burst size of ) is a, the probability of a burst of 3 errors is a^, the probability of a burst of 4 is a^3, and so on. The worst case of a=0.5 is assumed throughout this contribution. While a=0.5 may seem to be a pessimistic assumption, this simple model only applies to a -bit DFE. For a multi-bit DFE (particularly where the largest tap is not at bit of delay) error burst patterns with several correct bits between errors are expected which makes the model used here not unreasonable. Relative probability.e00.e-0.e-0.e-03 No of errors in burst

5 RS(58,54) performance with bursts I For the RS(58,54) code, N=58, k=54, m=0, t=7 Using similar analysis as slide 5 of wang_t_3bs_0_054, the minimum burst size that can cause exactly symbol errors is bits, but this only occurs if the first error is the last bit of a symbol (i.e. a probability of 0.). x x If the burst size is bits, then the probability that it will cause exactly symbol errors is. x x x x x x x x x x x The maximum burst size that can cause exactly symbol errors is 0 bits, but this only occurs if the first error is the first bit of a symbol (i.e. a probability of 0.). x x x x x x x x x x x x x x x x x x x x The probability of exactly two symbol errors (given an initial error) is: m m i i m i i ( ) = a ( a) a ( a) = for m = 0, a = 0.5 m m i= i= m (5) 5

6 6 RS(58,54) performance with bursts II Similar analysis to that on the previous slide gives: () = 0.9, () = , (3) = 9.75E-5, (4) = 9.5E-8, etc. These probabilities can then be used to calculate the overall probability of any combination of events that results in t or more symbol errors: (7) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) = = SER SER SER SER SER SER 8 SER SER SER SER CER in in 7 3 in in 3 in in in in in in N N N N i N N N N N i N i N t i

7 Monte Carlo analysis In an attempt to verify that the formulae on the previous slides give plausible results, a Monte Carlo based simulation was also performed using a random number generator to generate errors in a large number of codewords both with and without burst errors. The results of plotting equations, 3, and 4 for random errors and equations, 5, and 4 for burst errors is shown on the next slide. Also shown via x markers are the results of the Monte Carlo simulations which show good agreement with the formulae down to the probability where the simulations become too time consuming. Note the vertical axis for the plots is Frame Loss Ratio (FLR) for 64- octet MAC frames since uncorrectable codewords have to be discarded to provide an adequate Mean Time To False acket Acceptance (MTTFA). 7

8 RS(58,54) performance with bursts.e00.e-0.e-0.e-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db) 8

9 Bit interleaving same FEC instance For the case of bit interleaving two lanes from the same FEC instance, the minimum burst size that can cause exactly symbol errors is again bits, but here the probability of causing exactly symbol errors is. x x 8:6 The maximum burst size that can cause exactly symbol errors is 0 bits, but this only occurs if the first two errors are the first bits of a symbol (i.e. a probability of 0.05). x x x x x x x x x x x x x 8:6 Note this analysis assumes no skew between the two lanes as this is worse than assuming random alignment. The probability of exactly two symbol errors (given an initial error) is: m ( ) = ( ) m i i a a a ( a) = for m = 0, a = 0.5 (8) m i= () = 0.5, () = 0.465, (3) = 0.05, (4) = 0.05, (5) =.4E-8 etc. x x x x x x x x x x x x x x x x x x x x x x 9

10 RS(58,54) with : interleaving and bursts.e00.e-0.e-0.e-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db) 0

11 Bit interleaving different FEC instance The case of bit interleaving two lanes from different FEC instances can be analysed by considering just the bits from one FEC instance with an input BER increased by a factor of a. The minimum burst size that can cause exactly symbol errors is 3 bits, with a probability of 0.. x x x 8:6 If the burst size is bits, then the probability that it will cause exactly symbol errors is. The maximum burst size that can cause exactly symbol errors is 4 bits, with a probability of 0.. x x x x x x x x x x x x 8:6 The probability of exactly two symbol errors (given an initial error) is: m 4m floor ( ) ( i / ) i m floor ( ) ( i / ) i = a a a ( a) = i= m i= m m () = , () = , (3) = 3.E-8 etc. x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x (9)

12 RS(58,54) all curves.e00.e-0.e-0.e-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db)

13 Symbol interleaving Monte Carlo analysis of symbol interleaving shows that, as expected, : same FEC (SF) with bursts shows the same performance as for noninterleaved FEC with bursts and : different FEC (DF) with bursts has only slightly worse performance than for random errors..e0.e- Frame loss ratio (FLR).E-.E-3.E-4.E-5 No bursts Burst, a = 0.5 DF Symbol mux SF symbol mux.e-6.e "SNR" (db) 3

14 Results for RS(58,54) From the curves shown on the previous slide, the BERs (due to the SNR ) at the input required to give FLRs equivalent to that of a BER of E-3 and E-5 are: For FLR = 6.E- For FLR = 6.E-3 No FEC E-3 E-5 : Same FEC, a = 0.5.6E-7*.6E-8* Burst, a = E-6* 3.3E-6* : Different FEC, a = 0.5.3E-5* 5.E-6* Random errors 3.8E-5.E-5 Note these values are the BER derived from equation and do not include the additional errors due to the bursts. To account for burst errors, the values marked with * must be multiplied by when a =

15 What about multi-part links with FEC? If the FEC bytes are added at the source CS layer and then the correction is applied only at the destination CS layer as in: Host Device Module Module Host Device MAC CS MA CDAUI-6 MA MD SR6 MD MA CDAUI-6 MA CS MAC Add RS-FEC Remove RS-FEC Source: gustlin_3bs_0_054 Then the worst case input BER for the FEC decoder must be met by the concatenation of all of the sub-links. In the case of CAUI-0 -> SR0 -> CAUI-0, the worst case BER for each of the sub-links is E- which is the same as the end-to-end requirement. This situation is tolerated on the basis that it is unlikely that all three sub-links will be at the worst case BER at the same time and if two of them were, then the end-to-end BER would still be E-. The situation for a pair of sub-links sharing the same RS(58,54) protection is shown on the next slide. 5

16 RS(58,54) multi-part (random).e00.e-0.e-0.e-03.e-04 Frame loss ratio (FLR).E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 E-3 equivalent E-5 equivalent SNR equivalent to BER of 3.8E-5 One sub-link operating with BER of 3.8E-5 while another is varied One sub-link operating with BER of 3.8E-5/ while another is varied One sub-link operating with BER of 3.8E-5/0 while another is varied "SNR" (db) 6

17 Sub-links with bursts The curves on the previous slide are all for random errors. What if there are burst errors in the electrical sub-links but random errors in the optical part of the link? The plot on the next slide models this situation (with non-interleaved bursts) for a BER floor that is reachable by a Monte Carlo simulation in a realistic time. This shows a good match between the analytical model and the Monte Carlo results. The same model was then used to predict the curves for a sub-link operating with non-interleaved bursts with a fixed BER together with additional random errors from another sub-link (i.e. similar to slide 6 but for a bursty fixed sub-link). The resulting plot is on slide 9 Slides 0 and repeat this analysis for : same FEC (SF) bursts Slides and 3 repeat again for : different FEC (DF) bursts. 7

18 RS(58,54) multi-part (burst random) I.E00.E-0.E-0.E-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db) 8

19 RS(58,54) multi-part (burst random) II.E00.E-0.E-0.E-03.E-04.E-05 Frame loss ratio (FLR).E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4 E-3 equivalent E-5 equivalent Bursty sub-link operating with BER of 9.6E-6 while another is varied Bursty sub-link operating with BER of 9.6E-6/3 while another is varied Bursty sub-link operating with BER of 9.6E-6/0 while another is varied.e "SNR" (db) 9

20 RS(58,54) multi-part (: SF burst random) I.E00.E-0.E-0.E-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db) 0

21 RS(58,54) multi-part (: SF burst random) II.E00.E-0.E-0.E-03.E-04 Frame loss ratio (FLR).E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 E-3 equivalent SF bursty sub-link operating with BER of.6e-7 while another is varied SF bursty sub-link operating with BER of.6e-8 while another is varied E-5 equivalent SF bursty sub-link operating with BER of.6e-9 while another is varied "SNR" (db)

22 RS(58,54) multi-part (: DF burst random) I.E00.E-0.E-0.E-03 Frame loss ratio (FLR).E-04.E-05.E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4.E-5 x = Monte Carlo data points E-3 equivalent E-5 equivalent "SNR" (db)

23 RS(58,54) multi-part (: DF burst random) II.E00.E-0.E-0.E-03.E-04.E-05 Frame loss ratio (FLR).E-06.E-07.E-08.E-09.E-0.E-.E-.E-3.E-4 E-3 equivalent E-5 equivalent DF bursty sub-link operating with BER of.3e-5 while another is varied DF bursty sub-link operating with BER of.3e-5/3 while another is varied DF bursty sub-link operating with BER of.3e-5/0 while another is varied.e "SNR" (db) 3

24 Conclusions This presentation contains curves predicting the performance of RS(58,54) FEC with various forms of interleaving supported by Monte Carlo analysis. The performance curves of multi-part links containing one fixed bursty part and one random part has also been analysed. The BERs (due to the SNR ) of the bursty part for a penalty of 0.05 db optical (BER = 3.E-5 rather than 3.8E-5 or.7e-5 rather than.e-5 ) in the random part are: For FLR = 6.E- For FLR = 6.E-3 : Same FEC, a = 0.5.0E-8*.3E-9* Burst, a = 0.5.5E-6* 5.5E-7* : Different FEC, a = 0.5.E-6* 8.8E-7* Random errors 6.7E-6 4.0E-6 Note these values do not include the additional errors due to the bursts. To account for burst errors, the values marked with * must be multiplied by when a =

25 Thanks! 5

RS(544,514) FEC performance

RS(544,514) FEC performance RS(,) FEC performance Pete Anslow, Ciena IEEE GbE & NGOATH Study Group Ad-Hoc, May Introduction The IEEE.bs Task Force has adopted RS(,) FEC with interleaving of FEC symbols from two FEC codewords to give

More information

New EPoC Burst Markers with Data Field

New EPoC Burst Markers with Data Field New EPoC Burst Markers with Data Field Leo Montreuil Rich Prodan Tom Kolze January 2015 www.broadcom.com Burst Markers Update Modifications in Burst Marker Motivation Updated BM Sequences and Modulated

More information

Dr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems

Dr. 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 information

Preliminary Studies on DFE Error Propagation, Precoding, and their Impact on KP4 FEC Performance for PAM4 Signaling Systems

Preliminary Studies on DFE Error Propagation, Precoding, and their Impact on KP4 FEC Performance for PAM4 Signaling Systems Preliminary Studies on DFE Error Propagation, Precoding, and their Impact on KP4 FEC Performance for PAM4 Signaling Systems Geoff Zhang September, 2018 Outline 1/(1+D) precoding for PAM4 link systems 1/(1+D)

More information

Introduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.

Introduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved. Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information

More information

Convolutional Codes Klaus von der Heide

Convolutional Codes Klaus von der Heide Convolutional Codes Klaus von der Heide Convolutional codes encode a stream of symbols into n streams of symbols. 1/n = R is called the code rate. A second important parameter is the constraint length

More information

EPOC Upstream Mapping Part 2

EPOC Upstream Mapping Part 2 EPOC Upstream Mapping Part 2 Ed Boyd, Broadcom Burst Anatomy UPSTREAM BURST MARKERS EPON Review The EPON OLT locks to the upstream without information from the MAC. The is able to determine 1G or 10G EPON

More information

Turbo Codes for xdsl modems

Turbo Codes for xdsl modems Turbo Codes for xdsl modems Juan Alberto Torres, Ph. D. VOCAL Technologies, Ltd. (http://www.vocal.com) John James Audubon Parkway Buffalo, NY 14228, USA Phone: +1 716 688 4675 Fax: +1 716 639 0713 Email:

More information

Staircase Codes. for High-Speed Optical Communications

Staircase Codes. for High-Speed Optical Communications Staircase Codes for High-Speed Optical Communications Frank R. Kschischang Dept. of Electrical & Computer Engineering University of Toronto (Joint work with Lei Zhang, Benjamin Smith, Arash Farhood, Andrew

More information

Error Correction Review

Error Correction Review Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols

More information

VHDL Implementation of Reed Solomon Improved Encoding Algorithm

VHDL Implementation of Reed Solomon Improved Encoding Algorithm VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of

More information

2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor

2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor SYSTEM ARCHITECTURE ADVANCED SYSTEM ARCHITECTURE Error Correction Code 1 01/Fall-Winter Term Monday 1:50 Room# 1- or 5F Meeting Room Instructor: Fire Tom Wada, Professor 014/1/0 System Arch 1 Introduction

More information

Burst Markers in EPoC Syed Rahman, Huawei Nicola Varanese, Qualcomm

Burst Markers in EPoC Syed Rahman, Huawei Nicola Varanese, Qualcomm Burst Markers in EPoC Syed Rahman, Huawei Nicola Varanese, Qualcomm Page 1 Introduction Burst markers are used to indicate the start and end of each burst in EPoC burst mode The same marker delimits the

More information

False Packet Acceptance for HDLC framing

False Packet Acceptance for HDLC framing False Packet Acceptance for HDLC framing Analyzed by Presented by Boaz Porat Zion Shohet 802.3ah March 2002 Page 1 page: 1 Abstract The issue raised at the January 2002 EFM meeting: The HDLC Framing introduces

More information

10GBASE-T T PAM Scheme: Fixed Precoder for all Cable Types and Lengths

10GBASE-T T PAM Scheme: Fixed Precoder for all Cable Types and Lengths 10GBASE- PAM Scheme: Fixed Precoder or all Cable ypes and Lengths IEEE P80.3an ask Force Portland, July 1-16, 004 Gottried Ungerboeck 1 Key points One ixed precoding response, h (D), suices or all cable

More information

Optical Storage Technology. Error Correction

Optical Storage Technology. Error Correction Optical Storage Technology Error Correction Introduction With analog audio, there is no opportunity for error correction. With digital audio, the nature of binary data lends itself to recovery in the event

More information

Error Correction Code (1)

Error Correction Code (1) Error Correction Code 1 Fire Tom Wada Professor, Information Engineering, Univ. of the Ryukyus 01/1/7 1 Introduction Digital data storage Digital data transmission Data might change by some Noise, Fading,

More information

Error Detection & Correction

Error Detection & Correction Error Detection & Correction Error detection & correction noisy channels techniques in networking error detection error detection capability retransmition error correction reconstruction checksums redundancy

More information

The E8 Lattice and Error Correction in Multi-Level Flash Memory

The E8 Lattice and Error Correction in Multi-Level Flash Memory The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon

More information

Lecture 12. Block Diagram

Lecture 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 information

The E8 Lattice and Error Correction in Multi-Level Flash Memory

The 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 information

Error Control Codes for Memories

Error Control Codes for Memories The 2 th Korea Test Conference Error Control Codes for Memories June 22, 2 Jun Jin Kong, Ph.D. (jjkong@samsung.com) Samsung Electronics Co., Ltd. (Memory) Biography of Jun Jin Kong Brief History Present:

More information

Error Correction Methods

Error Correction Methods Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.

More information

DFE Error Burst Analysis

DFE Error Burst Analysis DFE Error Burst Analysis Considerations for SAS 2.0 Steve Gorshe Yuriy Greshishchev Winston Mok www.pmc-sierra.com T10/05-263r1 1 12 July 2005 Introduction A contribution to the T10 SAS Ad hoc meeting

More information

Error Correction and Trellis Coding

Error Correction and Trellis Coding Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at

More information

R. A. Carrasco and M. Johnston, Non-Binary Error Control Coding Cork 2009

R. A. Carrasco and M. Johnston, Non-Binary Error Control Coding Cork 2009 Design of Non-Binary Error-Correction Codes and their Applications R. A. Carrasco and. Johnston, Non-Binary Error Control Coding for Wireless Communication and Data Storage, Wiley, SBN 978-- 7-89-9 Prof.

More information

The PPM Poisson Channel: Finite-Length Bounds and Code Design

The PPM Poisson Channel: Finite-Length Bounds and Code Design August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs

More information

Polar Code Construction for List Decoding

Polar Code Construction for List Decoding 1 Polar Code Construction for List Decoding Peihong Yuan, Tobias Prinz, Georg Böcherer arxiv:1707.09753v1 [cs.it] 31 Jul 2017 Abstract A heuristic construction of polar codes for successive cancellation

More information

1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007

1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007 1 Reed Solomon Decoder 6.375 Final Project Group 3 Abhinav Agarwal S Branavan Grant Elliott 14 th May 2007 2 Outline Error Correcting Codes Mathematical Foundation of Reed Solomon Codes Decoder Architecture

More information

Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel.

Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel. UCLA Graduate School of Engineering - Electrical Engineering Program Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel. Miguel Griot, Andres I. Vila Casado, and Richard

More information

Performance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels

Performance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary

More information

Baseband Transmission on Power Line Channels with LDPC Coset Codes

Baseband Transmission on Power Line Channels with LDPC Coset Codes Baseband Transmission on Power Line Channels with LDPC Coset Codes Raju Hormis Inaki Berenguer and Xiaodong Wang Columbia University New York NY University of Cambridge Cambridge UK Abstract High rate

More information

Information redundancy

Information redundancy Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant

More information

Staircase Codes. Error-correction for High-Speed Fiber-Optic Channels

Staircase Codes. Error-correction for High-Speed Fiber-Optic Channels Staircase Codes Error-correction for High-Speed Fiber-Optic Channels Frank R. Kschischang Dept. of Electrical & Computer Engineering University of Toronto Talk at Delft University of Technology, Delft,

More information

Optimum Soft Decision Decoding of Linear Block Codes

Optimum 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 information

Chapter 7 Reed Solomon Codes and Binary Transmission

Chapter 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 information

Performance Analysis of BPSK over Joint Fading and Two-Path Shadowing Channels

Performance Analysis of BPSK over Joint Fading and Two-Path Shadowing Channels IEEE VTC-Fall 2014, Vancouver, Sept. 14-17, 2014 IqIq Performance of BPSK over Joint Fading and Two-Path Shadowing Channels I. Dey and G. G. Messier Electrical and Computer Engineering University of Calgary,

More information

Chapter 7: Channel coding:convolutional codes

Chapter 7: Channel coding:convolutional codes Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication

More information

Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise

Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2012 Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check

More information

An Introduction to Low Density Parity Check (LDPC) Codes

An 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 information

10GBASE-T PCS details and Precoding

10GBASE-T PCS details and Precoding 10GBASE-T PCS details and Precoding with additions of 24Jan05 IEEE P802.3an Task Force Vancouver, January 26-28, 2005 Gottfried Ungerboeck 1 IEEE P802.3an Nov 2004 Plenary CRC and Scrambling - in which

More information

A Simple Baseband Transmission Scheme for Power-Line Channels

A Simple Baseband Transmission Scheme for Power-Line Channels A Simple Baseband Transmission Scheme for Power-Line Channels Raju Hormis Inaki Berenguer Xiaodong Wang Abstract We propose a simple PAM-based coded modulation scheme that overcomes two major constraints

More information

Communication Theory II

Communication Theory II Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic

More information

Structured Low-Density Parity-Check Codes: Algebraic Constructions

Structured 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 information

Shannon capacities and error-correction codes for optical atmospheric turbulent channels

Shannon capacities and error-correction codes for optical atmospheric turbulent channels Shannon capacities and error-correction codes for optical atmospheric turbulent channels Jaime A. Anguita, Ivan B. Djordjevic, Mark A. Neifeld, and Bane V. Vasic Department of Electrical and Computer Engineering,

More information

ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes

ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes Kevin Buckley - 2010 109 ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes m GF(2 ) adder m GF(2 ) multiplier

More information

Compression methods: the 1 st generation

Compression methods: the 1 st generation Compression methods: the 1 st generation 1998-2017 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Still1g 2017 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 32 Basic

More information

New Puncturing Pattern for Bad Interleavers in Turbo-Codes

New Puncturing Pattern for Bad Interleavers in Turbo-Codes SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 2, November 2009, 351-358 UDK: 621.391.7:004.052.4 New Puncturing Pattern for Bad Interleavers in Turbo-Codes Abdelmounaim Moulay Lakhdar 1, Malika

More information

AN increasing number of multimedia applications require. Streaming Codes with Partial Recovery over Channels with Burst and Isolated Erasures

AN increasing number of multimedia applications require. Streaming Codes with Partial Recovery over Channels with Burst and Isolated Erasures 1 Streaming Codes with Partial Recovery over Channels with Burst and Isolated Erasures Ahmed Badr, Student Member, IEEE, Ashish Khisti, Member, IEEE, Wai-Tian Tan, Member IEEE and John Apostolopoulos,

More information

홀로그램저장재료. National Creative Research Center for Active Plasmonics Applications Systems

홀로그램저장재료. National Creative Research Center for Active Plasmonics Applications Systems 홀로그램저장재료 Holographic materials Material Reusable Processing Type of Exposure Spectral Resol. Max. diff. hologram (J/m2) sensitivity (lim./mm) efficiency Photographic emulsion Dichromated gelatin Photoresists

More information

Constellation Shaping for Communication Channels with Quantized Outputs

Constellation Shaping for Communication Channels with Quantized Outputs Constellation Shaping for Communication Channels with Quantized Outputs, Dr. Matthew C. Valenti and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia University

More information

Cyclic Codes. Saravanan Vijayakumaran August 26, Department of Electrical Engineering Indian Institute of Technology Bombay

Cyclic Codes. Saravanan Vijayakumaran August 26, Department of Electrical Engineering Indian Institute of Technology Bombay 1 / 25 Cyclic Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay August 26, 2014 2 / 25 Cyclic Codes Definition A cyclic shift

More information

A new analytic approach to evaluation of Packet Error Rate in Wireless Networks

A new analytic approach to evaluation of Packet Error Rate in Wireless Networks A new analytic approach to evaluation of Packet Error Rate in Wireless Networks Ramin Khalili Université Pierre et Marie Curie LIP6-CNRS, Paris, France ramin.khalili@lip6.fr Kavé Salamatian Université

More information

Coding Techniques for Data Storage Systems

Coding 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 information

New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding

New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding 1 New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding Alireza Kenarsari-Anhari, Student Member, IEEE, and Lutz Lampe, Senior Member, IEEE Abstract Bit-interleaved

More information

Berlekamp-Massey decoding of RS code

Berlekamp-Massey decoding of RS code IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture

More information

Mapper & De-Mapper System Document

Mapper & De-Mapper System Document Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation

More information

Reed-Solomon codes. Chapter Linear codes over finite fields

Reed-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 information

RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths

RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths Kasra Vakilinia, Dariush Divsalar*, and Richard D. Wesel Department of Electrical Engineering, University

More information

Application of Link Layer FEC to DVB-S2 for Railway Scenarios

Application of Link Layer FEC to DVB-S2 for Railway Scenarios Application of Link Layer FEC to DVB-S2 for Railway Scenarios Jiang Lei, M.Angeles. Vázquez Castro, Fausto Vieira Dpt. Telecom. and Systems Engineering Universitat Autónoma de Barcelona Barcelona, Spain

More information

Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation

Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation Alexios Balatsoukas-Stimming, Tomasz Podzorny, Jan Uythoven {alexios.balatsoukas, tomasz.podzorny, jan.uythoven}@cern.ch European

More information

B. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.

B. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes. B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from

More information

Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey

Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 1 Vivek Tilavat, 2 Dr.Yagnesh Shukla 1 PG Student,

More information

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Georg Böcherer, Patrick Schulte, Fabian Steiner Chair for Communications Engineering patrick.schulte@tum.de April 29, 2015

More information

EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS

EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS Ramin Khalili, Kavé Salamatian LIP6-CNRS, Université Pierre et Marie Curie. Paris, France. Ramin.khalili, kave.salamatian@lip6.fr Abstract Bit Error

More information

Multiple Description Transform Coding of Images

Multiple Description Transform Coding of Images Multiple Description Transform Coding of Images Vivek K Goyal Jelena Kovačević Ramon Arean Martin Vetterli U. of California, Berkeley Bell Laboratories École Poly. Féd. de Lausanne École Poly. Féd. de

More information

REED-SOLOMON CODE SYMBOL AVOIDANCE

REED-SOLOMON CODE SYMBOL AVOIDANCE Vol105(1) March 2014 SOUTH AFRICAN INSTITUTE OF ELECTRICAL ENGINEERS 13 REED-SOLOMON CODE SYMBOL AVOIDANCE T Shongwe and A J Han Vinck Department of Electrical and Electronic Engineering Science, University

More information

Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication. Lei Zhang

Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication. Lei Zhang Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication by Lei Zhang A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department

More information

16.36 Communication Systems Engineering

16.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 information

8 PAM BER/SER Monte Carlo Simulation

8 PAM BER/SER Monte Carlo Simulation xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot

More information

Guess & Check Codes for Deletions, Insertions, and Synchronization

Guess & Check Codes for Deletions, Insertions, and Synchronization Guess & Check Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University sergekhanna@rutgersedu, salimelrouayheb@rutgersedu arxiv:759569v3

More information

PACKET-BASED MARKOV MODELING OF REED-SOLOMON BLOCK CODED CORRELATED FADING CHANNELS

PACKET-BASED MARKOV MODELING OF REED-SOLOMON BLOCK CODED CORRELATED FADING CHANNELS PACKET-BASED MARKOV MODELING OF REED-SOLOMON BLOCK CODED CORRELATED FADING CHANNELS Cecilio Pimentel Department of Electronics and Systems Federal University of Pernambuco Recife, PE, 50711-970, Brazil

More information

Soft-Output Decision-Feedback Equalization with a Priori Information

Soft-Output Decision-Feedback Equalization with a Priori Information Soft-Output Decision-Feedback Equalization with a Priori Information Renato R. opes and John R. Barry School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, Georgia 333-5

More information

Pulse-Code Modulation (PCM) :

Pulse-Code Modulation (PCM) : PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from

More information

Expectation propagation for signal detection in flat-fading channels

Expectation propagation for signal detection in flat-fading channels Expectation propagation for signal detection in flat-fading channels Yuan Qi MIT Media Lab Cambridge, MA, 02139 USA yuanqi@media.mit.edu Thomas Minka CMU Statistics Department Pittsburgh, PA 15213 USA

More information

Instruction Set Extensions for Reed-Solomon Encoding and Decoding

Instruction Set Extensions for Reed-Solomon Encoding and Decoding Instruction Set Extensions for Reed-Solomon Encoding and Decoding Suman Mamidi and Michael J Schulte Dept of ECE University of Wisconsin-Madison {mamidi, schulte}@caewiscedu http://mesaecewiscedu Daniel

More information

Leistungsfähigkeit von elektronischen Entzerrer in hochbitratigen optischen Übertragungsystemen. S. Otte, W. Rosenkranz. chair for communications,

Leistungsfähigkeit von elektronischen Entzerrer in hochbitratigen optischen Übertragungsystemen. S. Otte, W. Rosenkranz. chair for communications, Leistungsfähigkeit von elektronischen Entzerrer in hochbitratigen optischen Übertragungsystemen S. Otte, W. Rosenkranz chair for communications, Sven Otte, DFG-Kolloquium, 6. 11. 001, 1 Outline 1. Motivation.

More information

Modulation codes for the deep-space optical channel

Modulation codes for the deep-space optical channel Modulation codes for the deep-space optical channel Bruce Moision, Jon Hamkins, Matt Klimesh, Robert McEliece Jet Propulsion Laboratory Pasadena, CA, USA DIMACS, March 25 26, 2004 March 25 26, 2004 DIMACS

More information

RADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology

RADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology RADIO SYSTEMS ETIN15 Lecture no: 8 Equalization Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se Contents Inter-symbol interference Linear equalizers Decision-feedback

More information

Tackling Intracell Variability in TLC Flash Through Tensor Product Codes

Tackling Intracell Variability in TLC Flash Through Tensor Product Codes Tackling Intracell Variability in TLC Flash Through Tensor Product Codes Ryan Gabrys, Eitan Yaakobi, Laura Grupp, Steven Swanson, Lara Dolecek University of California, Los Angeles University of California,

More information

Coding for loss tolerant systems

Coding 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 information

Code Concatenation and Low-Density Parity Check Codes

Code Concatenation and Low-Density Parity Check Codes Contents 11 Code Concatenation and Low-Density Parity Check Codes 254 11.1CodeConcatenation...256 11.1.1 SerialConcatenation...256 11.1.2 ParallelConcatenation...256 11.1.3 ultilevelcoding...257 11.2Interleaving...258

More information

Coding on a Trellis: Convolutional Codes

Coding 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 information

Timing errors in distributed space-time communications

Timing errors in distributed space-time communications Timing errors in distributed space-time communications Emanuele Viterbo Dipartimento di Elettronica Politecnico di Torino Torino, Italy viterbo@polito.it Yi Hong Institute for Telecom. Research University

More information

A Comparison of Cooperative Transmission Schemes for the Multiple Access Relay Channel

A Comparison of Cooperative Transmission Schemes for the Multiple Access Relay Channel A Comparison of Cooperative Transmission Schemes for the ultiple Access elay Channel André Angierski andre.angierski@uni-rostock.de 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING

More information

Block Codes :Algorithms in the Real World

Block 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 information

Parallel Concatenated Chaos Coded Modulations

Parallel Concatenated Chaos Coded Modulations Parallel Concatenated Chaos Coded Modulations Francisco J. Escribano, M. A. F. Sanjuán Departamento de Física Universidad Rey Juan Carlos 8933 Móstoles, Madrid, Spain Email: francisco.escribano@ieee.org

More information

Error Floors of LDPC Coded BICM

Error Floors of LDPC Coded BICM Electrical and Computer Engineering Conference Papers, Posters and Presentations Electrical and Computer Engineering 2007 Error Floors of LDPC Coded BICM Aditya Ramamoorthy Iowa State University, adityar@iastate.edu

More information

ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES

ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES Journal of ELECTRICAL ENGINEERING, VOL. 54, NO. -2, 2003, 305 30 ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES Sergey Egorov Garik Markarian A modification of Blahut procedure

More information

CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego

CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego CSE 4 Lecture Standard Combinational Modules CK Cheng and Diba Mirza CSE Dept. UC San Diego Part III - Standard Combinational Modules (Harris: 2.8, 5) Signal Transport Decoder: Decode address Encoder:

More information

EE 5345 Biomedical Instrumentation Lecture 12: slides

EE 5345 Biomedical Instrumentation Lecture 12: slides EE 5345 Biomedical Instrumentation Lecture 1: slides 4-6 Carlos E. Davila, Electrical Engineering Dept. Southern Methodist University slides can be viewed at: http:// www.seas.smu.edu/~cd/ee5345.html EE

More information

Function of Combinational Logic ENT263

Function of Combinational Logic ENT263 Function of Combinational Logic ENT263 Chapter Objectives Distinguish between half-adder and full-adder Use BCD-to-7-segment decoders in display systems Apply multiplexer in data selection Use decoders

More information

Ralf Koetter, Andrew C. Singer, and Michael Tüchler

Ralf Koetter, Andrew C. Singer, and Michael Tüchler Ralf Koetter, Andrew C. Singer, and Michael Tüchler Capitalizing on the tremendous performance gains of turbo codes and the turbo decoding algorithm, turbo equalization is an iterative equalization and

More information

Determining the Optimal Decision Delay Parameter for a Linear Equalizer

Determining the Optimal Decision Delay Parameter for a Linear Equalizer International Journal of Automation and Computing 1 (2005) 20-24 Determining the Optimal Decision Delay Parameter for a Linear Equalizer Eng Siong Chng School of Computer Engineering, Nanyang Technological

More information

Digital Communications

Digital Communications Digital Communications Chapter 8: Trellis and Graph Based Codes Saeedeh Moloudi May 7, 2014 Outline 1 Introduction 2 Convolutional Codes 3 Decoding of Convolutional Codes 4 Turbo Codes May 7, 2014 Proakis-Salehi

More information

Fiber Modeling Resolution and Assumptions: Analysis, Data, and Recommendations

Fiber Modeling Resolution and Assumptions: Analysis, Data, and Recommendations Fiber Modeling Resolution and Assumptions: Analysis, Data, and Recommendations GaTech: Kasyapa Balemarthy, Stephen Ralph OFS: Robert Lingle, Jr., George Oulundsen, Yi Sun, John George Corning: John Abbott

More information

Modern Coding Theory. Daniel J. Costello, Jr School of Information Theory Northwestern University August 10, 2009

Modern 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 information

Hari Coding Objectives

Hari Coding Objectives Hari Coding Objectives Protocol Independence - 10 GbE, FC, InfiniBand Alignment independence (e.g. word, even/odd, etc.) Application Independence Chip-to-PMD, Chip-to-Chip (backplane), Very Short-Haul

More information

Iterative Equalization using Improved Block DFE for Synchronous CDMA Systems

Iterative Equalization using Improved Block DFE for Synchronous CDMA Systems Iterative Equalization using Improved Bloc DFE for Synchronous CDMA Systems Sang-Yic Leong, Kah-ing Lee, and Yahong Rosa Zheng Abstract Iterative equalization using optimal multiuser detector and trellis-based

More information

POWER ALLOCATION TRADEOFFS IN MULTICARRIER AUTHENTICATION SYSTEMS

POWER ALLOCATION TRADEOFFS IN MULTICARRIER AUTHENTICATION SYSTEMS POWER ALLOCATION TRADEOFFS IN MULTICARRIER AUTHENTICATION SYSTEMS P. L. Yu*, J. S. Baras University of Maryland College Par, MD 074 B. M. Sadler Army Research Laboratory Adelphi, MD 0783 Abstract Physical

More information