Beruflich Dokumente
Kultur Dokumente
Ahmed Zaaza
WIMAX layered architecture
ATM IP
transport transport
Convergence Sub-layer
Privacy Sub-layer
Physical Sub-layer
WIMAX physical sub-layer
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Randomizer:
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Randomizer:
• Randomizer is used to change the bit order to avoid long sequence of consecutive
zeros & ones.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Randomizer:
• At the start of the DL sub-frame, the randomizer is initiated with the sequence:
100101010000000
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Randomizer: Downlink Uplink
Sub-frame Sub-frame
UL PHY .… UL PHY
Preamble FCH MAPs
Burst 1 Burst n
• At the start of burst 2, the randomiser is initialised with the vector as shown.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
2. Channel coding:
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
2. Channel coding:
1001010101111010 1001110100011010
Error from
channel
• How we could get the coded message V from the un-coded message U.
WIMAX physical sub-layer
2. Channel coding:
V = U*G
WIMAX physical sub-layer
2. Channel coding:
Linear Block Code
• Example: N-K = 3 K=4
N-K K
1 1 0 1 0 0 0 if U = 1101
0 1 1 0 1 0 0
G= 1 1 1 0 0 1 0 K
1 0 1 0 0 0 1
N
V = U*G
N
• In our example:
N-K K
1 0 0 1 0 1 1
0 1 0 1 1 1 0
H= 0 0 1 0 1 1 1 N-K
N
WIMAX physical sub-layer
2. Channel coding:
Linear Block Code
• We send the constructed V:
• In our example:
V = 0001101
R = 0001111
Syndrome (S) = R * HT
1 0 0
S = (0001111) * 0 1 0 = 1 1 1 The sixth bit has an error
0 0 1
1 1 0
0 1 1 R = 0001111
1 1 1
1 0 1
U = 0001101
WIMAX physical sub-layer
2. Channel coding:
Cyclic Block Code
• This code called Cyclic because if we make right rotate to any code word, it
gives another code word.
• The greatest power of the code (generator) polynomial indicates the number
of added check bits (N-K).
WIMAX physical sub-layer
2. Channel coding:
Cyclic Block Code
• Example:
• C (7,4) N=7 , K=4 , m=3
• Generator polynomial g(x) = X³ + X² + 1 1 + X + X² + X⁴
• Message polynomial U(x) = X² + X + 1 (mean 1 1 1 0 )
Step (1):
5
• Multiply U(x) * X^(m) = X³ * (X² + X + 1) = X + X⁴ + X³
Step (2): X² + X
• Divide U(x) * X^(m) by g(x) X³ + X + 1 5
X + X⁴ + X³
5
Step (3): X + X ³ + X²
• V(x) = U(x) * X^(m) + b(x) X ⁴ + X²
5
= X + X ⁴ + X³ + X X ⁴ + X² + X
= 0 1 0 1 1 1 0
Reminder X
Check bits U b(x)
WIMAX physical sub-layer
2. Channel coding:
Cyclic Block Code
V(x) channel with error R(x) = V (x)+ e(x)
In our example:
5
• V(x) = X + X ⁴ + X³ + X
=0 1 0 1 1 1 0
• R(x) = 0 1 1 1 1 1 0
= X5+ X ⁴ + X³ + X² + X
Syndrome (S(x)) = R(x) mod g(x)
X² + X
i αi α² α1 α0
0 1 0 0 1
1 α 0 1 0
2 α² 1 0 0
3 α³ = α + 1 0 1 1
4 α⁴ = α (α + 1 ) = α² + α 1 1 0
5 α5 = α (α² + α ) = α³ + α² = α² + α + 1 1 1 1
6 α6 = α (α² + α + 1) = α³ + α² + α = α² + 1 1 0 1
7
7 α = α (α² + 1) = α³ + α = α + 1 + α = 1 0 0 1 repeated
WIMAX physical sub-layer
2. Channel coding:
BCH code
• BCH code has a dimension of C(N,K) of s-bits.
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
2. Channel coding:
Reed – Solomon code
• It is a part from the BCH code.
• N = 255 , K = 239 , S = 8
• N-K = 16 = 2T
• T = 8 it can correct 8 symbols.
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
2. Channel coding:
Convolutional encoder
• It is defined by three parameters n, k, m
Where:
• n: number of output coded bits
• k: number of input data bits enter the encoder simultaneously.
• m: is the number of registers of the encoder menus one (m+1 = registers ).
T1 T2
U1 U1
U1 U2 U1 U2
1 0 0 1 1 0 1 0 1 0
U2 U2
T3 T4
U1 U1
U1 U2 U1 U2
1 0 1 0 0 0 1 0 1 0
U2 U2
WIMAX physical sub-layer
2. Channel coding:
Convolutional encoder
T5 T6
U1 U1
U1 U2 U1 U2
0 0 1 1 1 0 0 0 0 0
U2 U2
n = 2, k = 1, m= 2,
Example: for m = 2
g1 ( X ) g 0(1) g1(1) . X g 2(1) . X 2 1 X X 2
g 2 ( X ) g 0( 2) g1( 2) . X g 2( 2) . X 2 1 X 2
The output sequence is found as follows:
g1(x) = 1 + X + X ²
g2(x) = 1 + X ²
u(x) * g1(x) = (1 + X ²) (1 + X + X ²) = 1 + X + X³ + X⁴
u(x) * g2(x) = (1 + X ²) (1 + X ²) = 1 + X⁴
U1 U2 U1 U2 U1 U2 U1 U2 U1 U2
1 1 1 0 0 0 1 0 1 1
WIMAX physical sub-layer
2. Channel coding:
Convolutional encoder
• Convolutional coding in wimax:
• OFDM symbol:
• OFDMA symbol:
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Interleaver:
•Convolutional codes are suitable for memory less channels with random
error events.
•Some errors have bursty nature:
Statistical dependence among successive error events
(time-correlation) due to the channel memory.
Like errors in multipath fading channels in wireless communications.
WIMAX physical sub-layer
1. Interleaver:
A1 A2 A3 B1 B2 B3 C1 C2 C3 A1 B1 C1 A2 B2 C2 A3 B3 C3
Interleaver Deinterleaver
A1 B1 C1 A2 B2 C2 A3 B3 C3 A1 A2 A3 B1 B2 B3 C1 C2 C3
1 error 1 error 1 error
WIMAX physical sub-layer
1. Mapping:
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. Mapping:
Baseband
Data
ASK modulated
signal
Baseband
Data
FSK modulated
signal
f1 f0 f0 f1
where f0 = A cos(wc-Dw)t and f1 = A cos(wc+Dw)t
Baseband
Data
Modulation - QPSK
(-1,1) Q (1,1)
Odd Data Q-Channel
(NRZ)
0
90
QPSK I
Cos Wc t
Even Data
(NRZ) I-Channel
(-1,-1) (1,-1)
Wc = Carrier Frequency, I = In phase channel, Q = Quadrature channel
Amplitude and phase shift keying can be combined to transmit several bits
per symbol (in this case M=4). These modulation schemes are often refered
to as linear, as they require linear amplification.
16QAM has the largest distance between points, but requires very linear
amplification. 16PSK has less stringent linearity requirements, but has less
spacing between constellation points, and is therefore more affected by
noise.
M-ary schemes are more bandwidth efficient, but more susceptible to
noise. 16 PSK 16 QAM 16 APSK
WIMAX physical sub-layer
1. Mapping:
Mapping
• d = (I + jQ) × KMOD
• The output values, d, are formed by multiplying the resulting (I+jQ)
value by a normalization factor KMOD.
• The normalization factor, KMOD, depends on the base modulation
mode
Modulation KMOD
BPSK 1
QPSK 1/
16-QAM 1/
64-QAM 1/
WIMAX physical sub-layer
1. Mapping:
00 -3 00 -3
01 -1 01 -1
11 1 11 1
10 3 10 3
WIMAX physical sub-layer
1. Mapping:
Channel coding
Reed-
Convolutional
Data Source Randomizer Solomon Interleaver
Encoder
Encoder
Sub-Carrier
IFFT To air interface
Mapping
WIMAX physical sub-layer
1. IFFT :
• Let us introduce the meaning of the orthogonality.
Sin (f)
Cos (f)
Sin(f) * Cos(f) = 0
90
0.5
0 π/2 π 3π/2 2π
0.5
1
WIMAX physical sub-layer
1. IFFT :
• We can obtain orthogonal signals by choosing their frequencies have integer
multiple of the basic frequency.
• sin α , sin 2α , sin3α are orthogonal signals
0.5 0.5
+ + + +
+ +
0 π/2 π 0 -- π/2 -- π --
0.5 0.5 -- -- --
1 1
WIMAX physical sub-layer
1. IFFT :
A • Un-modulated orthogonal frequencies.
t
f1
f2 = n*f1
f3 = m*f1
f A
f
f1 f2 f3
WIMAX physical sub-layer
1. IFFT :
A • modulated orthogonal frequencies.
t
f1
f2 = n*f1
f3 = m*f1
f A
f
f1 f2 f3
WIMAX physical sub-layer
1. IFFT :
• The solution for multicarrier using several oscillator.
S(t)
modulation
S/P
t
OFDM symbol in
Oscillator array time domain
• Disadvantages:
• It requires multiple oscillator for all subcarriers ex.: 256, 512, . . .
• It requires very sharp filters (rectangular) to select each carrier.
WIMAX physical sub-layer
1. IFFT :
• The solution for multicarrier using inverse fast forrier transform. Samples
S(t)
modulation
IFFT
S/P
t
OFDM symbol in
time domain
N 1 j ( 2nk / N )
N 1 j ( 2nk / N )
• IDFT (IFFT): X (n) (1 / N ) x(k ).
k 0
WIMAX physical sub-layer
1. IFFT :
• The solution for multicarrier using inverse fast forrier transform. Samples
S(t)
modulation
IFFT
S/P
t
OFDM symbol in
time domain
• DFT (FFT):
N 1 N 1
X ( K ) a(n). sin( j 2nk / N ) j b(n). cos( j 2nk / N )
n 0 n 0
• IDFT (IFFT):
N 1 N 1
X (n) (1 / N )[ a(k ). sin( j 2nk / N ) b(k ). cos( j 2nk / N )]
k 0 k 0
WIMAX physical sub-layer
1. IFFT :
• OFDM symbol in frequency domain:
S(t)
t
OFDM symbol in
time domain
f
WIMAX physical sub-layer
1. IFFT :
• OFDM symbol in frequency domain: Pilot
Data subcarriers
subcarriers
Lower Upper
Guard Guard
band band
DC f
∆f = 1/Tb
• Example for 256 FFT: 27 : upper guard band
28 : lower guard band
8 : pilot
192 : data
WIMAX physical sub-layer
1. Cyclic prefix :
• OFDM & Inter-Symbol interference:
T (symbol) T (symbol)
• We need to eliminate the corrupted
Period of the next symbol.
Guard Period
• Solution:
Corrupted
t
T(g)
T(g) T(b)
T(s)
modulation
IFFT
S/P D/A
Lower Upper
Guard Guard
band band
DC f
∆f = 1/Tb
Lower Upper
Guard Guard
band band
DC f
∆f = 1/Tb
• Data rate= number of un-coded bites per OFDM symbol/ OFDM symbol duration
= (data sub-carriers * bits per FFT point * coding rate ) / OFDM symbol duration.
WIMAX physical sub-layer
1. IFFT :
• OFDM & OFDMA PHY layer:
Pilot
Data subcarriers
subcarriers
Lower Upper
Guard Guard
band band
DC f
∆f = 1/Tb
•OFDM (fixed WiMAX) PHY layer use •OFDMA (mobile WiMAX) PHY layer use
only 256 sub-carrier so, the sub-carrier only 256, 512, 1024, 2048 sub-
spacing is variable with the selected carriers so, the sub-carrier spacing is
BW. fixed with the selected BW.
WIMAX layered architecture
ATM IP
transport transport
Convergence Sub-layer
Privacy Sub-layer
Physical Sub-layer
WIMAX Privacy Sub-layer
Service Method
Attacker
Attacker
User A User B
• Attack Entity Authentication
Attacker
WIMAX Privacy Sub-layer
• Types of Encryption:
• It is based on the idea that the Transmitter have the secret key of the Receiver .
• So, we must develop another method doesn’t depend on the XOR directly.
• We use Simple DES technique (Data Encryption Standard).
Key1 8-bit
Key Cipher text
Key 10-bit Encryption
scheduler 8-bit
Key2 8-bit
Plain text
8-bit
WIMAX Privacy Sub-layer
LS - 1 LS - 1
Plain text
8-bit
Compression Permutation
Key 1
LS - 2 LS - 2
Compression Permutation
Key 2
WIMAX Privacy Sub-layer
Key 1 F1
Plain text
8-bit
Switch
Key 2 F2
P-1
Key 10-bit
EEE mode
EDE mode
WIMAX Privacy Sub-layer
• There are many modes of operation for the encryption block. Plain text
1. ECB (Electronic Code Block)
2. CBC (Cipher Block Chaining)
3. CFB (Cipher Feed Back)
4. OFB (Output Feed Back)
5. CTR (Counter mode)
Key Encryption
Cipher text
• The question is:
How will the block operate in multi Plain text input?
WIMAX Privacy Sub-layer
Features:
• If blocks received out of order, the system still run.
• No error propagation.
• Can’t sense any of the attacks (deletion, insertion, exchanging, substitution).
• Suitable to one block ciphering.
WIMAX Privacy Sub-layer
IV
IV
IV
• It is based on the idea that the Transmitter doesn’t have the secret key of the
Receiver .
?
MS 1 MS 2
• We must know the MOD operation which mean the reminder of the division
operation.
• -y mod n = ?
• The we must get the value of –y in the modulo system.
• Example:
• y/x mod n = ?
• The we must get the value of (1/X) in the modulo system.
• Example:
• Example:
• Example:
• At n = 7 Prime number
• General Formula:
Ф(n)
a mod n = 1
Example:
At n = 3 , a = 2
Ф(n) = Ф(n) = n – 1 = 3 – 1 = 2.
aФ(n) = 2 ^ 2 = 4
Then, 4 mod 3 = 1
WIMAX Privacy Sub-layer
Confidentiality using Encryption:
• Each user have Secrete Key & Public Key.
• It uses the Secrete key decrypt the data sent to it encrypted with its Public key
MS 1 MS 2
• Then:
• Public key = (e , N).
• Secrete key = (d , N).
Encryption:
• Then C – encrypted message – equals:
C = x emod N
Decryption: d
x = C mod N
e d
= (x mod N) mod N
ed
= (x mod N) mod N e * d = 1 mod N
= x mod N = x x<N
WIMAX Privacy Sub-layer
Authentication using hash message:
• Hash function is a on way function.
• Hash function features:
1. If x is a message ,then hash message (Y) = H(x).
2. Very low collision, i.e: low Prop. to find one hash message to different X
messages.
Plain text 1 Plain text 2 Plain text 3
IV
Hash message
WIMAX Privacy Sub-layer
Authentication using hash message:
• WIMAX makes HMAC (Hash Message Authentication Code) using SHA-1
Algorithm.