New EPoC Burst Markers with Data Field

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

EPoC UPSTREAM SYMBOL MAPPER OVERVIEW. Authors: Mark Laubach, Rich Prodan

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

Mapper & De-Mapper System Document

FEC performance on multi-part links

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

Error Correction and Trellis Coding

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

Chapter 7 Reed Solomon Codes and Binary Transmission

Improved MU-MIMO Performance for Future Systems Using Differential Feedback

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

Lecture 12. Block Diagram

VHDL Implementation of Reed Solomon Improved Encoding Algorithm

Channel Coding I. Exercises SS 2017

Optimum Soft Decision Decoding of Linear Block Codes

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

Design and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by

RS(544,514) FEC performance

EPOC Upstream Mapping Part 2

Error Detection & Correction

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

False Packet Acceptance for HDLC framing

Channel Coding I. Exercises SS 2017

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

Chapter 6 Reed-Solomon Codes. 6.1 Finite Field Algebra 6.2 Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding

Turbo Codes for xdsl modems

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

Graph-based codes for flash memory

Multimedia Systems WS 2010/2011

The Pennsylvania State University. The Graduate School. Department of Computer Science and Engineering

Lecture 4 Capacity of Wireless Channels

Coding theory: Applications

Staircase Codes. for High-Speed Optical Communications

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

IEEE Broadband Wireless Access Working Group <

5.0 BCH and Reed-Solomon Codes 5.1 Introduction

Chapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005

CoherentDetectionof OFDM

x n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)

EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates

Error Control Codes for Memories

REED-SOLOMON CODE SYMBOL AVOIDANCE

Adaptive Bit-Interleaved Coded OFDM over Time-Varying Channels

Optical Storage Technology. Error Correction

Making Error Correcting Codes Work for Flash Memory

Chapter 7: Channel coding:convolutional codes

Lecture 7 September 24

EECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)

Error Correction Code (1)

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10

Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras

The BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes

Information redundancy

Error Correction Review

A Simple Baseband Transmission Scheme for Power-Line Channels

Error Correction Methods

Revision of Lecture 4

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


Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels

Optimum Rate Communication by Fast Sparse Superposition Codes

Expectation propagation for symbol detection in large-scale MIMO communications

Information Redundancy: Coding

IEEE C802.16e-05/084r4. IEEE Broadband Wireless Access Working Group <

Multicarrier transmission DMT/OFDM

Binary Primitive BCH Codes. Decoding of the BCH Codes. Implementation of Galois Field Arithmetic. Implementation of Error Correction

Coding for loss tolerant systems

Baseband Transmission on Power Line Channels with LDPC Coset Codes

Assume that the follow string of bits constitutes one of the segments we which to transmit.

4F5: Advanced Communications and Coding

Codes on graphs and iterative decoding

New Coded Modulation for the Frequency Hoping OFDMA System.

16.36 Communication Systems Engineering

EE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels

Codes on graphs and iterative decoding

Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014

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

Math 512 Syllabus Spring 2017, LIU Post

8 PAM BER/SER Monte Carlo Simulation

ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES

Constellation Shaping for Communication Channels with Quantized Outputs

Analysis of Receiver Quantization in Wireless Communication Systems

Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems

Title. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels

Lecture 12: November 6, 2017

Chapter 6. BCH Codes

Fault Tolerant Computing CS 530 Information redundancy: Coding theory. Yashwant K. Malaiya Colorado State University

ECE 4450:427/527 - Computer Networks Spring 2017

About the Sens it Payload

L interférence dans les réseaux non filaires

1 Vandermonde matrices

Compound Polar Codes

Complex Weighting Scheme for OFDM Cognitive Radio Systems

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

Implementation of Galois Field Arithmetic. Nonbinary BCH Codes and Reed-Solomon Codes

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

Cyclic Redundancy Check Codes

Physical layer security against pollution attack in wireless relay networks using random network coding

Minimized Logic Gates Number Of Components In The Chien Search Block For Reed-Solomon (RS)

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

Transcription:

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 Waveforms Burst Marker with Burst Noise Impairment FEC Coding for Burst Markers Burst Marker Data for End of Data Burst Pointer Burst Marker Detection Burst Marker Processing Example Performance Analysis Comparison to Objective Conclusions 1

Why new Burst Markers (BM)? No intermixing of data payload within BM for simplicity Significantly reduces complexity of the Symbol Mapper Each Stop BM has a data field Stop BM data indicates the last payload RE in the last RB and the last bit location in the last RE Start BM does not need data but inserts a fixed pad value Data is sent in D-QPSK modulation with 3 db boosting First data symbol of RB (in time direction) is reference symbol (00) 0⁰ phase shift, (01) +90⁰ phase shift (11) 180⁰ phase shift, (10) -90⁰ phase shift Demodulation without channel estimation Demodulation with imperfect pre-equalization Allows BM detection and demodulation with frequency exclusions in a BM or a BM spanning two OFDM frames 2

Burst Marker Sequences (1 of 3) Resource Block = 1 subcarrier by 16 symbols BM uses two RBs Resource Block = 1 subcarrier by 8 symbols BM uses four RBs D-QPSK data on B and Nulls on N within the BM pattern 2-D sequences have good auto-correlation and cross-correlation properties Start and Stop BM have low cross-correlation property to reduce false detection 3

Burst Marker Sequences (2 of 3) BM 2x16 (2 subcarriers by 16 symbols) Start = [ B N B N B N N N N N B N B B B B N B N B N B B B B B N B N N N N ]; Stop = [ B B B B N B N N N N N B N B N B N N N N B N B B B B B N B N B N ]; BM 4x8 (4 subcarriers by 8 symbols) Start = [ B N B B N N B N B N N N B B N B N B N N B N B B N B B B N B N N ]; First B on a subcarrier is a reference symbol B D-QPSK N Null Stop = [ N B B N B B N N N B N B N N B B B N N B B N N B B N B N N B B N ]; 4

Burst Marker Sequences (3 of 3) Example of Data in a Stop BM 2x16 (2 subcarriers by 16 symbols) BM = [(+1+1) (+1+1) (-1-1) (+1-1) N (+1+1) N N N N N (+1-1) N (-1+1) N (-1+1) N N N N (+1+1) N (-1+1) (-1-1) (-1-1) (-1+1) (+1-1) N (+1+1) N (+1+1) N]; Data = [ * (00) (11) (01) * (01) * * * * * (10) * (11) * (00) * * * * * * (01) (01) (00) (10) (11) * (01) * (00) * ]; Example of Data in a Stop BM 4x8 (4 subcarriers by 8 symbols) BM = [ N (+1+1) (-1+1) N (+1+1) (-1-1) N N N (+1+1) N (+1+1) N N (-1-1) (+1-1) (+1+1) N N (+1-1) (+1+1) N N (-1-1) (+1+1) N (-1+1) N N (-1-1) (+1-1) N]; Data = [ * * (01) * (10) (11) * * * * * (00) * * (11) (01) * * * (10) (01) * * (11) * * (01) * * (01) (01) * ]; First QPSK (+1+1) on a subcarrier is a reference symbol * denotes a null or a reference symbol Phase Shift Data 0⁰ 00 +90⁰ 01 180⁰ 11-90⁰ 10 5

Burst Marker with Burst Noise Impairment Impulse noise causing a burst error event is the predominant impairment in the upstream Typical impairment statistics 1 : Less than 1 µs in 94% of burst error events 1 µs to 10 µs in 5% of burst error events Longer than 10 µs in 1% of burst error events Almost all (over 99%) of burst error events will impair one or two adjacent OFDMA symbols 1 Characterization of Upstream Transient Impairments on Cable Television Systems, CableLabs 1997 6

Burst Marker with Burst Noise Impairment One OFDM symbol (T OFDM ) SNR impulse Burst duration T burst Burst hits one OFDM symbol Cyclic Prefix One OFDM symbol (T OFDM ) (T CP ) One OFDM symbol (T OFDM ) SNR AWGN SNR AWGN SNR impulse Burst duration T burst Burst hits two OFDM symbols 7

Reed-Solomon (RS) FEC Code for Data Field Reed-Solomon code over GF(2 4 ) with t = 2 4 bits per code symbol 4 parity symbols per codeword Can correct two symbol errors in a codeword Reed-Solomon generator polynomial g(x) = (x+α 0 ) (x+ α 1 ) (x+ α 2 ) (x+ α 3 ) where the primitive element alpha is 0x2 Reed-Solomon primitive polynomial p(x) = x 4 + x + 1 Reed-Solomon(15,11) code shortened to length 6 or 7 8 information bits (0 0 0 0 0 0 0 0 0 I 2 I 1 P 4 P 3 P 2 P 1 ) 12 information bits (0 0 0 0 0 0 0 0 I 3 I 2 I 1 P 4 P 3 P 2 P 1 ) 8

FEC for 2x16 Burst Marker RS symbol uses two QPSK data Resource Elements QPSK info data pair of 2 MSBs I jh and 2 LSBs I jl, j=1,2,3 QPSK parity pair of 2 MSBs P kh and 2 LSBs P kl, k=1,2,3,4 RS(15,11) 2 error-correcting code shortened to length 7 Corrects burst error over two consecutive OFDMA symbols 12 information bits per shortened codeword (8 used, I 3 =0) Stop BM: I ref I 3H I 3L I 2H 0 I 2L 0 0 0 0 0 P 3L 0 P 2L 0 P 1L 0 0 0 0 I ref 0 I 1H I 1L P 4H P 4L P 3H 0 P 2H 0 P 1H 0 9

FEC for 4x8 Burst Marker RS symbol uses two QPSK data Resource Elements QPSK info data pair of 2 MSBs I jh and 2 LSBs I jl, j=1,2 QPSK parity pair of 2 MSBs P kh and 2 LSBs P kl, k=1,2,3,4 RS(15,11) 2 error-correcting code shortened to length 6 Corrects burst error over two consecutive OFDMA symbols 8 information bits per shortened codeword Stop BM: 0 I ref I 2H 0 P 4H P 3H 0 0 0 I ref 0 I 1H 0 0 P 2H P 1H I ref 0 0 I 1L P 4L 0 0 P 1L I ref 0 I 2L 0 0 P 3L P 2L 0 10

Burst Marker Data for End of Data Burst Pointer Last RE Position in Last RB MSB Pointer Bits (I 2H I 2L ) Last Bit Position in Last RE LSB Pointer Bits (I 1H I 1L ) 0 0000 1 0001 2 0010 3 0011 4 0100 5 0101 6 0110 7 0111 8 1000 9 1001 10 1010 11 1011 12 1100 13 1101 14 1110 15 1111 0 0000 1 0001 2 0010 3 0011 4 0100 5 0101 6 0110 7 0111 8 1000 9 1001 10 1010 11 1011 12 1100 13 1101 14 1110 15 1111 Note: 0xFF or 0xFFF used for 4x8 or 2x16 Start BM RS information symbols respectively. 11

Packing of Data into 1 by 8 RB example Stop BM marks last bit in last RE with Data Data in multiple of 65 bits + multiple CRC and parity bits Idle 65 b 65 b... 65 b CRC 40b Parity bits 65 b 65 b...... 65 b CRC 40b Parity bits Idle 0 Align Data first bit to RB boundary Resource Elements in time Last data bit may not be aligned to RE boundary resulting in a partially filled RE 8... N-4 N-3 N-2 N-1 N Time Time 0 8 Start Burst Marker...... N-4 N-3 N-2 N-1 N Stop Burst Marker OFDMA Frame, 1x8 RB Frequency 1. Insert Data into RE. Align first data bit with first RE bit. 2. Fill REs with Data. May end up with partially filled RB with partially filled last RE. 3. Add 4x8 Start Burst Marker with FEC encoded 0xFF to indicate position of first RB with data in the OFDMA frame. 4. Pack REs in RBs of OFDMA frame. Align first data RE with first nonpilot RE of RB. 5. Add Stop Burst Marker with FEC encoded (8 bit) pointer to indicate position of last bit (4 bits) in last RE (4 bits) with data. 6. Burst receiver determines the size of data burst between Burst Markers by decoding FEC encoded pointer in Stop Burst Marker. Note: The first 4 pointer bits define the position of the last data RE in the last RB (0 through K-1 for an RB of 1 subcarrier by K RE. The last 4 pointer bits define the position of the last data bit in the last RE (0 through M-1 for an RE of M bits. (K and M 16) 12

BURST MARKER DETECTION 13

Example of B & N Sequence Detector Kbn set the B vs. N power ratio threshold Smaller gain allow detection at lower SNR Higher gain prevent false trigger from payload data or noise Pb set the min power for trigger Prevent false trigger from background noise 14

Simulation Methodology Frame base simulation 2x16: 2 RB start, 94 RB 64-QAM payload, 2 RB stop, 2 RB quiet. 100 RB total 4x8: 4 RB start, 88 RB 64-QAM payload, 4 RB stop, 4 RB quiet. 100 RB total 1 Burst Noise event corrupt a whole column of subcarriers 2x16: Corruption of 2 RE in start BM, 2 RE in stop BM, 94 RB in payload and 2 in quiet time. 4x8: Corruption of 4 RE in start BM, 4 RE in stop BM, 88 RB in payload and 4 in quiet time. 15

Burst Marker Simulations 2x16 and 4x8 BM have virtually the same Mis-Detection probability. Depend on: Additive Noise on B and N False Detection probability is more complex. Depend on: Auto-Correlation of Start and Stop BM sequence, i.e. the spurious peaks Cross-Correlation of Start and Stop BM False detection of a Start BM on a Stop BM and Stop BM on a Start BM False detection of BM on QAM payload False detection of BM on a quiet time 16

2x16 Mis-Detection Probability with Burst Noise 10 0 Mis-Detection probability vs SNR 10-2 10-4 Probability 10-6 10-8 10-10 Kbn=6 9/2*erfc(4/9*10 SNR/10 ) Kbn=8 9/2*erfc(1/3*10 SNR/10 ) Kbn=8, Burst noise 10us 0dBc one symbol Kbn=8, Burst noise 10us 0dBc two symbols 10-12 6 8 10 12 14 16 18 SNR (db) 17

2x16 False-Detection Probability and QAM Cumulative Distribution Function 10 0 CDF of 16 averaged M-QAM symbols, False Detection Probability 10-2 10-4 Chi-Square CDF for average of 16 noise samples @ 0dB Probability 10-6 10-8 98 RB burst length. Start BM = 2 RB, Payload = 94 RB, Stop BM = 2 RB, 2 empty RB between burst 10-10 1/Kbn = 1/8 10-12 64-QAM SNR=15dB Pb=0 64-QAM SNR=15dB Pb=2 64-QAM CDF AWGN CDF 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Power, 1/Kbn 18

4x8 Mis-Detection Probability 10 0 Mis-Detection probability vs SNR 10-2 10-4 Probability 10-6 10-8 Kbn=6 9/2*erfc(4/9*10 SNR/10 ) Kbn=8 9/2*erfc(1/3*10 SNR/10 ) Kbn=8, Burst noise 10us 0dBc one symbol Kbn=8, Burst noise 10us 0dBc two symbols 10-10 10-12 6 8 10 12 14 16 18 SNR (db) 19

4x8 False-Detection Probability and QAM Cumulative Distribution Function 10 0 CDF of 16 averaged M-QAM symbols, Probability of False Detection 10-2 10-4 Chi-Square CDF for average of 16 noise samples @ 0dB Probability 10-6 10-8 96 RB burst length. Start BM = 4 RB, Payload = 88 RB, Stop BM = 8 RB, 4 empty RB between burst 10-10 1/Kbn = 1/8 10-12 64-QAM SNR=15dB 64-QAM CDF AWGN CDF 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Power, 1/Kbn 20

Data Burst Error Rate Example Assumptions: SNR = 15 db ( 2.5 db above 16-QAM error threshold) FEC code rate 0.865 Pilots overhead = 1/8 Resource Block = 16 Resource Elements (1 subcarrier by 16 symbols) 1500 Byte data burst payload K bn = 1/8, P b = 2 Burst size: Payload = 3468 Resource Elements before pilots = 244 Resource Blocks after pilots insertion Probability of missing a data burst: Data Burst Error Rate = Pm + Pm + 244*Pf = 0 + 0 + 244*10-12 = 2.44*10-10 << 5*10-5 upstream Frame Loss Ratio objective Pm: Probability of missing Start or Stop Burst Marker ( 10-49 @ SNR=15 db) Pf: Probability of false detecting a Start or Stop Burst Marker ( 10-12 @ SNR=15 db) 21

Conclusions 4x8 and 2x16 are more robust than 4x6 Burst Markers BM Detector relies only on data and null pattern No need for S correlators Stop BM contains Reed-Solomon FEC protected data 4x8 BM carries 8 info data bits in 24 encoded bits 2x16 BM carries 8 info data bits plus 4 zero pad bits in 28 encoded bits Stop BM data points to the last payload data bit in the last subcarrier of the resource block before the stop BM RS FEC protects against burst errors in 1 or 2 consecutive OFDMA symbols (99% of burst errors) BM and payload data do not share Resource Blocks BM construction with an equal number of B and N per symbol provides immunity to a false trigger from burst noise events Data burst error rate well below upstream Frame Loss Ratio objective 22

BACKUP SLIDES 23

2x16 BM Detector block diagram 24

2x16 Start and Stop BM detectors (yellow: B, magenta: N ) Stop BM Start BM Quiet time between burst QAM Payload 25

4x8 BM Detector block diagram with circuit to prevent simultaneous Start and Stop BM trigger Improved Burst Marker Detector with low False Detection rate 26

4x8 Start and Stop BM detectors (yellow: B, magenta: N ) Cross-correlation sidelobes False trigger Stop BM Start BM Quiet time between burst QAM Payload 27