RS(544,514) FEC performance

Similar documents
FEC performance on multi-part links

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

New EPoC Burst Markers with Data Field

Turbo Codes for xdsl modems

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

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

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

EPOC Upstream Mapping Part 2

Polarization division multiplexing system quality in the presence of polarization effects

Multicarrier transmission DMT/OFDM

New Puncturing Pattern for Bad Interleavers in Turbo-Codes

Staircase Codes. for High-Speed Optical Communications

Optimum Soft Decision Decoding of Linear Block Codes

Jitter Test Methods for 200GAUI-4 and 400GAUI-8

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

8 PAM BER/SER Monte Carlo Simulation

Comment #38, #40: Jitter Test Methods for 200GAUI-4 and 400GAUI-8

EE4304 C-term 2007: Lecture 17 Supplemental Slides

DFE Error Burst Analysis

Rapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping

Graph-based Codes for Quantize-Map-and-Forward Relaying

Similarities of PMD and DMD for 10Gbps Equalization

Optical Storage Technology. Error Correction

PSK bit mappings with good minimax error probability

Hari Coding Objectives

THE IMPACT POLARIZATION MODE DISPERSION OPTICAL DUOBINARY TRANSMISSION

Orbital Angular Momentum (OAM) based Mode Division Multiplexing (MDM) over a km-length Fiber

Polar Code Construction for List Decoding

Instruction Set Extensions for Reed-Solomon Encoding and Decoding

Lecture 12. Block Diagram

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

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

Physical Layer and Coding

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

10GBASE-T PCS details and Precoding

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

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

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

Slides for Lecture 19

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

A Simple Baseband Transmission Scheme for Power-Line Channels

Turbo Codes Performance Optimization over Block Fading Channels

Baseband Transmission on Power Line Channels with LDPC Coset Codes

Bit-wise Decomposition of M-ary Symbol Metric

Parallel Concatenated Chaos Coded Modulations

A Systematic Description of Source Significance Information

Cooperative HARQ with Poisson Interference and Opportunistic Routing

Mapper & De-Mapper System Document

Error Correction Code (1)

Error Correction Methods

Error Floors of LDPC Coded BICM

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

Low-Density Parity-Check Code Design Techniques to Simplify Encoding

VHDL Implementation of Reed Solomon Improved Encoding Algorithm

Optical Component Characterization: A Linear Systems Approach

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

Pulse-Code Modulation (PCM) :

DSP Dimensioning of a 1000Base-T Gigabit Ethernet PHY ASIC

Scalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014

16.36 Communication Systems Engineering

Constellation Shaping for Communication Channels with Quantized Outputs

EECS150 - Digital Design Lecture 21 - Design Blocks

UNIT II COMBINATIONAL CIRCUITS:

An Introduction to Low Density Parity Check (LDPC) Codes

Summary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations

Chapter 7 Reed Solomon Codes and Binary Transmission

Unit 3 Session - 9 Data-Processing Circuits

A Lattice-Reduction-Aided Soft Detector for Multiple-Input Multiple-Output Channels

False Packet Acceptance for HDLC framing

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

Lecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH

Chapter 6: Solutions to Exercises

Boolean Logic Continued Prof. James L. Frankel Harvard University

On the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels

A REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT

Low-density parity-check (LDPC) codes

Error Correction and Trellis Coding

Outline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.

Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution

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

EE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design

Chalmers Publication Library. Copyright Notice

Estimation of the Capacity of Multipath Infrared Channels

Constellation Shaping for Communication Channels with Quantized Outputs

Modulation codes for the deep-space optical channel

Lecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems

Chapter 3 Combinational Logic Design

Chapter 5: Solutions to Exercises

12/31/2010. Digital Operations and Computations Course Notes. 01-Number Systems Text: Unit 1. Overview. What is a Digital System?

Error Detection & Correction

Design at the Register Transfer Level

1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g

Notes on a posteriori probability (APP) metrics for LDPC

Communications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved

Compression methods: the 1 st generation


Approximate BER for OFDM Systems Impaired by a Gain Mismatch of a TI-ADC Realization

Comunicações Ópticas Noise in photodetectors MIEEC EEC038. Henrique Salgado Receiver operation

Transcription:

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 good burst error tolerance. Concerns over the latency of this scheme has led to proposals for either non-multiplexed or symbol multiplexed FEC schemes for Gb/s and next generation Gb/s Ethernet. This presentation analyses the performance of such schemes using a development of the principles explained for the NRZ case in Annex of anslow_bs.

Signal structure Assuming: A single PCS lane or multiple PCS lanes formed by round robin distribution of FEC symbols to the PCS lanes RS(,) FEC (which has -bit symbols) Gray coding (see P.bs D...) There are two ways that the PAM coding can occur: PCS lane Aligned case Next PAM symbol uses these two bits PCS lane PAM symbol uses these two bits Misaligned case Next PAM symbol uses these two bits PAM symbol uses these two bits The analysis in anslow_bs showed no difference in performance between the two cases.

: Symbol multiplexing Round robin distribution of FEC symbols to the PCS lanes. Symbol multiplexing in the PMA. CDWD to lane... The : PMA must find FEC symbol boundaries. If not totally deskewed, the symbol order may be changed, but performance is the same as without multiplexing.

Gray coding Assume the use of Gray coding (see P.bs D...) as illustrated below: Noise amplitude required for both bits to be in error Noise amplitude required for bit to be in error,,,, If noise causes any of the levels to be mistaken for an adjacent level, this causes one of the two bits to be in error. If there is just enough Gaussian noise to cause a BER of.e-* due to single level errors, then the probability of that noise causing both bits to be in error is E-. This analysis therefore assumes that only one of the two bits is in error. * FLR =.E- (equivalent to BER = E- with random errors) after RS(,) FEC

Burst error model The NRZ burst analysis in anslow_bs page assumed that if a bit is in error, the worst case probability that the next bit is also in error is.. If we assume for Gray coded PAM that an error in a particular symbol only causes the decision on the next symbol to move up or down one level, then the possibilities are: Correct level Received level Error pattern One up One down One up One down,,,,,,,,,,,, Since two of the eight possibilities result in both bits being correct, these states terminate the burst. Therefore for Gray coded PAM, if a symbol is in error, the worst case probability that the next symbol is also in error is..

Burst error model The second aspect of this table is that of the six possibilities giving bits in error, two have errors in the first bit while four have errors in the second bit. Correct level Received level Error pattern One up One down One up One down,,,,,,,, The analysis in the remainder of this contribution therefore assumes that if a given symbol is in error, the probability of a bit error in the first bit is / and in the second bit is /.

Burst error model The SNR shown on the X axis of the following results slides is related to the noise induced input SER via the following equation: SNR SER in = erfc Which does not include the additional errors due to the bursts. The average number of errors in a burst is related to the probability of the burst continuing a as shown below: () Average errors per burst............. a - Probability of burst continuing For a =., the BER in including bursts is x the BER in due to noise.

Single burst bound * As pointed out in anslow logic, for a non-interleaved scheme, a single burst that lasts for ~ PAM symbols has a high probability of causing errors in FEC symbols (which is uncorrectable). With a =., the probability of a burst this long is.^ =.E-. When this is combined with the probability that the codeword has at least one error in it, a simple lower bound for the FLR can be calculated. If a is the probability of the burst continuing, a more accurate calculation for the probability that a single burst is uncorrectable is: P uncorr = /*a *(-a) + /*a *(-a) + /*a *(-a) + /*a *(-a) + a *(-a) + a *(-a) + a *(-a) + For a =., this evaluates to.e-. This bound is plotted as a dashed line on the next page.

RS(,) no mux or symbol mux.e+.e-.e-.e- Frame loss ratio (FLR).E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E- x = Monte Carlo data points E- equivalent E- equivalent "SNR" (db)

: P.bs D. scheme Symbol interleave from FEC codewords. Bit multiplex in the PMA. CDWD to lane...... If one codeword is uncorrectable, the other is marked bad also.... A B

P.bs D. performance.e+.e-.e-.e- Frame loss ratio (FLR).E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E- x = Monte Carlo data points E- equivalent E- equivalent "SNR" (db)

All curves.e+.e-.e-.e- Frame loss ratio (FLR).E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E-.E- x = Monte Carlo data points E- equivalent E- equivalent "SNR" (db)

Results for RS(,) all gain used for PAM From the curves shown on the previous slide, if all of the coding gain were to be used for the PAM link, the BERs at the FEC input required to give FLRs equivalent to that of a BER of E- and E- are: RS(,) FLR =.E- FLR =.E- No FEC E- E- No mux, a =..E-*.E-* No mux, a =..E-*.E-* P.bs D., a =..E-*.E-* No mux, a =..E-*.E-* Random errors.e-.e- Note these values are the BER including the additional errors due to the bursts. To account for burst errors, the values marked with * have been multiplied by when a =.,. when a =., when a =..

Multi-part links with FEC If the FEC bytes are added at the source FEC sublayer and then the correction is applied only at the destination FEC sublayer as in: Host Device Module Module Host Device MAC RS PCS FEC PMA Gb/s lane AUI PMA PMD Optical PMD PMA Gb/s lane AUI PMA FEC PCS RS MAC Add FEC Remove FEC 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 CDAUI- -> FR -> CDAUI-, the worst case BER for each lane of the electrical sub-links is E-. Even though there may be two additional CDAUI- CC sub-links, this is tolerated on the basis that it is extremely unlikely that all four sub-links will be at the worst case BER at the same time given that each sub-link BER is averaged over lanes. The results for multiple sub-links sharing the same RS(,) protection is shown on the next slide.

Multi-part link results The BER of the electrical sub-links for a BER of.e- in the optical sublink are shown in the table below (. db optical penalty). An additional row is included for no mux, a =. where the electrical BER is E- to allow E- for each of two AUI sub-links (. db optical penalty). RS(,) FLR =.E- Electrical Optical No mux, a =. Burst.E-* Random.E- No mux, a =. Burst E-* Random.E- No mux, a =. Burst.E-* Random.E- P.bs D., a =. Burst.E-* Random.E- No mux, a =. Burst E-* Random.E- Random errors Random.E- Random.E- Note these values are the BER including the additional errors due to the bursts. To account for burst errors, the values marked with * have been multiplied by when a =.,. when a =., when a =..

Conclusion Assuming either non-multiplexed or symbol multiplexed RS(,) FEC schemes for Gb/s and next generation Gb/s Ethernet: If the probability of a burst continuing (a) is allowed to be as high as., either: the electrical sub-link BER has to be ~ E- with consequent reduction in capability for the electrical links or the optical BER has to be ~.E- with. db optical penalty but the margin required to achieve an FLR equivalent to E- is much larger than expected. If the probability of a burst continuing (a) is restricted to., then an electrical sub-link BER of E- and an optical sub-link BER of.e- as per GBASR-R PHYs seems viable.

Thanks!