You are on page 1of 25

VDSL MCM Simulation

Tim Clark
VDSL Consortium

UNIVERSITY of NEW HAMPSHIRE INTEROPERABILITY

Presentation Content
Simulation Overview
Constellation Encoding and Multi-Carrier
Modulation
Reed-Solomon Forward Error Correction
Convolutional Interleaving
Channel Model
Equalization (TEQ and FEQ)
Bit Allocation
Training

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Simulation Overview
Simulation done with code in MATLAB
Simulates a DSLAM transmitter, twisted-pair
channel, and remote receiver
Simulation process:
* Generate a frame of random binary data
* Encode and modulate at the transmitter
* Apply channel attenuation and add crosstalk to signal
* Equalize, demodulate, and decode at the receiver
* Compare binary data and CRC
* Calculate BER and FER

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Block Diagram
Transmitter
CRC
Generation

ReedSolomon
Encoding

Scrambler

Convolutional
Interleaving
QAM
Constellation
Encoder

Random
Binary
Data
CRC
Generation

IFFT

Cyclic
Extension

ReedSolomon
Encoding

Scrambler

Twisted-Pair
Channel

Crosstalk

Receiver

Syndrome
Detector

Convolutional
De-Interleaving
TEQ
&
FEQ

Strip
Cyclic
Extension

FFT

ReedSolomon
Decoding

Descrambler

CRC
Check

ReedSolomon
Decoding

Descrambler

CRC
Check

QAM
Constellation
Decoder

Syndrome
Detector

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Fast and Slow Data Paths


Data is split evenly between an interleaved (slow)
path and a non-interleaved (fast) path
Interleaving provides resistance to burst errors but
introduces latency
Each path has a separate CRC, scrambler, and FEC
Data is joined together before modulation

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Cyclic Redundancy Check (CRC)

CRC Generation Algorithm:


1. Left-shift the input by 8 bits
2. Divide by the CRC generator polynomial
G(D) = D8 + D4 + D3 + D2 + 1
3. The remainder is the checksum and is appended to the frame

CRC Check Algorithm


1. Remove checksum from received frame
2. Use same algorithm to calculate checksum for received frame
3. If the two agree, set the syndrome to 0
Otherwise, set the syndrome to 1

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Scrambler/Descrambler
x(n)
m(n)

...

D18

...

D23

+
Scrambler output is the sum of the current bit and
the 18th and 23rd delayed bits:
x(n) = m(n) + m(n-18) + m(n-23)
Addition is modulo-2, equivalent to exclusive-OR
UNIVERSITY of NEW HAMPSHIRE
INTEROPERABILITY

VDSL MCM Simulation

Forward Error Correction


VDSL uses Reed-Solomon coding for FEC
A RS codeword contains N=K+R bytes:
* N = codeword length
* K = message length
* R = redundancy length

RS code parameters are specified as (N,K)


* The simulation uses either (240,224) or (144,128)
* RS coding can correct R/2 byte errors per codeword

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Reed-Solomon Coding
R redundant bytes are calculated by dividing the K
message bytes by a generator polynomial over the
Galois Field GF(256)
MATLAB has built-in functions for encoding and
decoding RS codewords

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Interleaving
VDSL uses a convolutional interleaving algorithm
to protect data against burst errors by spreading
them out over multiple Reed-Solomon codewords
Interleaving parameters:
* I = number of interleaver branches
* M = incremental delay
* D = interleaving depth = M x I + 1
IR
correct 2 N

Can
byte errors
Introduces a delay of M x I x (I-1) bytes
UNIVERSITY of NEW HAMPSHIRE
INTEROPERABILITY

VDSL MCM Simulation

Convolutional Interleaving (1)

Interleaver has I branches of length M x (I-1) + 1

Algorithm:
1. Interleaver memory is initialized with zeros
2. Input data is read into interleaver I bytes at a time
3. Each interleaver branch is delayed in increments of M
4. Data is output from front of interleaver
5. Left-shift interleaver memory

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Convolutional Interleaving (2)

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

QAM Constellations
A sequence of bits is mapped to a complex number
representing a constellation point
Can use 1 to 15 bits per constellation point
Corresponds to constellation size of 2 1 to 215 = 2 to 32K

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

DMT Modulation
Discrete Multi-Tone
Uses 4095 4-kHz bands
Each band can carry a different number of bits
Construct an array of 4096 complex numbers
Take IFFT
Result is the DMT signal
Demodulated by the FFT, reverse-mapping

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Cyclic Extension (1)


Eliminates inter-symbol interference
Simplifies equalizers
Beginning samples are added to the end, last
samples are added to the beginning, then whole
thing is windowed
At receiver, cyclic extension is stripped from
received symbol

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Cyclic Extension (2)

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Channel Model
Channel transfer function is calculated using ABCD
modeling
IFFT transfer function to get channel impulse
response
Convolve DMT signal with impulse response to get
attenuated signal
Add crosstalk

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Crosstalk
VDSL self-crosstalk is added to signal
Simulates up to 20 other VDSL modems using the
same spectrum operating in the same binder group

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Training
At beginning of simulation, modems perform a
training session that involves discovery of the
channel and bit allocation
Channel discovery for calculating equalizer
coefficients
Channel equalizers designed to negate channel
effects
Bit allocation determines how many bits are
carried on each tone

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Bit Allocation
Shannon Capacity formula:

b 1 / 2 log 2 (1 SNR / )

Number of bits on each tone is calculated from the SNR

to a BER of 10-7
corresponds
9.55
Bits are adjusted such that total number of bits fits an
integer number of Reed-Solomon codewords
Creates a bit allocation profile that tells both receivers
how many bits are modulated on each tone, i.e. what
constellation size to map to

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Frequency-Division Duplexing
Upstream and Downstream are multiplexed by
assigning each tone to a direction
Although 4096 tones extend beyond 17 MHz,
current frequency plans only allocate transmission
up to 12 MHz

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Spectrum Allocation Plans


Frequency Plan 998

138 kHz

3.7 MHz

5.3 MHz

8.4 MHz

12 MHz

Frequency Plan 997

138 kHz

2.9 MHz

5.2 MHz

7 MHz

12 MHz

Downstream
Upstream
UNIVERSITY of NEW HAMPSHIRE
INTEROPERABILITY

VDSL MCM Simulation

Time-domain equalization (TEQ)


Designed to reduce the impulse response of the
channel
Eliminates ISI
Send a signal known to both modems
Wiener filter block-data formulation
Result is an FIR filter

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

Frequency-domain equalization (FEQ)


Negates combination of the channel and TEQ filter
Channel attenuation for each tone is calculated by
sending a known signal and comparing to the
received signal
Channel

TEQ

FEQ

=
1

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

References
ANSI / T1E1
* T1.424 Trial Standard
Multi Carrier Modulation: Part III

UNIVERSITY of NEW HAMPSHIRE


INTEROPERABILITY

VDSL MCM Simulation

You might also like