Section 7: 7-1 Information Processing PE/TRD/GR/0109 12.02/EN February, 2000

"Confidential information -- may not be copied or disclosed without permission".
Section 7
Information Processing
PE/TRD/GR/0109 12.02/EN
February, 2000
7-1
Objectives
Processing of all information bits

Upon completion of this lesson, you will be able to:
- Identify all the steps in the information processing - Describe the protection means against transmission errors - Explain how the information confidentiality is guaranteed
PE/TRD/GR/0109 12.02/EN
February, 2000
7-2
Transmission and Reception Chains

Digitizing and source coding Channel coding Source decoding Channel decoding De-interleaving
Interleaving
Deciphering Ciphering Burst deformatting
Burst formatting
section 6 section 7 section 8 section 10
Modulation
Demodulation equalization
Diversity
Transmission
PE/TRD/GR/0109 12.02/EN
February, 2000
7-3
Transmission Chain
INFORMATION BITS
INFORMATION TO TRANSMIT
G1 G2
CHANNEL CODING
CODED INFORMATION
INTERLEAVING
INFORMATION PROTECTED BY REDUNDANCY
INTERLEAVED INFORMATION
CIPHERING
INFORMATION PROTECTED AGAINST TRANSMISSION LOSSES
ENCIPHERED INFORMATION
INFORMATION ON THE RIGHT FORMAT

BURST BURST BURST
MAPPING ON A BURST
BURSTS
PE/TRD/GR/0109 12.02/EN February, 2000 Information Processing
CONFIDENTIALITY OF INFORMATION
7-4
1. Channel Coding
every 20 ms
CODED SPEECH
DATA n bits
SIGNALING 184 bits (LAPDm)
260 bits (FR)
+ parity code + tail bits + convolutional code
+ tail bits + punctured convolutional code
+ Fire code + tail bits + convolutional code
CODED INFORMATION = 456 bits

PE/TRD/GR/0109 12.02/EN February, 2000 Information Processing 7-5
Channel Coding: Block Codes

Bits to code Redundancy bits
= =
TRANSMITTED MESSAGE RECEIVED MESSAGE
= =
PE/TRD/GR/0109 12.02/EN
February, 2000
7-6
Channel Coding: Convolutional Code

Principle
source sequence - N bits
CODING PRINCIPLE:
l
add sequence with same shifted sequences:

=
0 00 0 00 0 0
CONVOLUTION CODES
N l
use M convolutions per sequence
coded sequence - MxN bits

Channel Coding: Convolutional Code

Implementation
+
+
Y0(k) : 1st bit
X(k) 185 bits + 4 x " 0"
X(k-1)
X(k-2)
X(k-3)
X(k-4)
Y1(k) : 2nd bit
+ +
exor
+
D
memory element
+
Speech: 2x189 bits
PE/TRD/GR/0109 12.02/EN
February, 2000
7-8
Channel Coding: TCH Full Rate

260 bits (20 ms at 13 kbits/s)
High Protection Medium Protection No Protection
Class Ia 50 bits
Parity Bits
Class Ib 132 bits
Class II 78 bits
Tail Bits = 0000
50
3
189 bits
132
Convolutional Code r = 1/2 378 bits 456 bits 78 bits
PE/TRD/GR/0109 12.02/EN
February, 2000
7-9
Channel Coding: TCH Half Rate

112 bits (20 ms at 5.6 kbits/s)
Class Ia 22 bits
Class Ib 73 bits
3 73
Class II 17 bits
Tail Bits = 000000
Parity Bits
22
104 bits Convolutional Code r = 1/3

312 bits
Puncturing
211
101
211
17
228 bits
Channel Coding: Data (1/4)

3.6 kbit/s Intermediate Rate (T mode only)
20 ms
36
36
Tail bits = 0000
72
Convolutional Code r = 1/6
456
PE/TRD/GR/0109 12.02/EN
February, 2000
7-11

6 kbit/s Intermediate Rate (T or NT mode)
40 ms 60
36 60
60 60
60
Same processing 60 16 60 16
16 bits equal to '0'
152
456
PE/TRD/GR/0109 12.02/EN
February, 2000
7-12

12 kbits/s Intermediate Rate (T or NT mode)
20 ms
60 60 60 60
Tail Bits = 0000
240 Convolutional Code r = 1/2 488 Puncturing
456
32
7-13

14.5 kbits/s Intermediate Rate (T or NT mode)
20 ms 290 bits
Tail Bits = 0000
290 bits 294 bits 1/2 rate Convolutional coding
588 bits
Puncturing
456
132
PE/TRD/GR/0109 12.02/EN
February, 2000
7-14
Channel Coding: SCH
25 bits (RFN + BSIC)

Parity Bits
Tail Bits = 0000
25 bits 39 bits
10
78 bits
PE/TRD/GR/0109 12.02/EN
February, 2000
7-15
Channel Coding: RACH
8 bits
Color Bits = (Parity Bits) XOR (BSIC) Tail Bits = 0000
8 bits
6 18 bits
36 bits
PE/TRD/GR/0109 12.02/EN
February, 2000
7-16
Channel Coding: LAPDm Frames
1 LAPDm frame = 23 bytes 184 bits

Fire Code
Tail bits = 0000
184 bits 228 bits
40
456 bits
PE/TRD/GR/0109 12.02/EN
February, 2000
7-17
2. Interleaving
Interleaving = mixing up bits of several successive sequences in order to randomize errors position
EXTRA DELAY
BETTER PERFORMANCE
Different interleaving schemes according to the logical channel

Interleaving: TCH
0 1 2 3 4 5 6 7 8 ... B0 B1 ... 452 453 454 455
Divide 456 bits in 8 sub-blocks
456 coded bits reordering & partitioning out
0 8 448
1 9 449
2 10 450
3 11 451
4 12 452
5 13 453
6 14 454
7 15 455
B4 B5
B6 B7 B0 B1 B2 B3
B4 B5
B6 B7
B0 B1 B2 B3
57 Rows
bit interleaving
...
...
burst
7-19
Interleaving: Control Channels

0 1 2 3 4 5 6 7 8 ... B0 B1 ... 452 453 454 455
Divide 456 bits in 8 sub-blocks
456 coded bits reordering & partitioning out
0 8 448
1 9 449
2 10 450
3 11 451
4 12 452
5 13 453
6 14 454
7 15 455
B0 B1 B2 B3
B4 B5
B6 B7
57 Rows
bit interleaving
...
...
burst
7-20
Interleaving: Data (1/3)

Bits Reordering 456 bits 114
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
114
6 6 6 6 6 6 6 6 6 6 6 6
114
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
114
6 6
6 6 6
6 6 6
6 6 6
19 x 6 = 114 bits
6 6 6
6 12 18 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 18 12 6
456 bits = 22 sub-blocks
PE/TRD/GR/0109 12.02/EN
February, 2000
7-21

Interleaving on 22 Successive Bursts
.. .. .. .. ..
12
6 6 6 6 6 6
.. .. .. .. ..
24 24 24 18 12
24 24 24 24 24 24 24 18 12
24 24 24 24 24 24 24 24 24 24 24 18 12
24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 18 12 6
12 18 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 18 12 6
12 18 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 6 12 18 24 24 24 24 24 24 24 24 24 24 24 24 6 12 18 24 24 24 24 24 24 24 24 6 12 18 24 24 24 24 6 12 24
114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114 114
22 successive bursts

Intra-Burst Interleaving
.. .. ..
12
6
.. .. .. .. .. 57 bits TSC ..
24 24 24 18 24 24 24 24 24 24 24 24 24 24 24 24 6 12 18 24
.. ..
TSC
..
TSC
..
TSC
..
PE/TRD/GR/0109 12.02/EN
February, 2000
7-23
3. Ciphering
Burst to transmit
Data Data
Plain data: Ciphering sequence: XOR: Ciphered data (transmitted): Ciphering sequence: XOR: Recovered data:
0 1 1 1 0 0 1 0..... 0 0 0 1 1 0 1 0..... 0 1 1 0 1 0 0 0..... 0 0 0 1 1 0 1 0..... 0 1 1 1 0 0 1 0.....
Received burst
Data
Data
7-24
How Is Got the Ciphering Sequence?

AUC
Global GSM Mobility Card
The Smart Card to use
MS
Radio Interface
Random number RAND (128 bits)
GSM
SIM card
Ki
Identification Key (128 bits) RAND
Ki
A8 A8 Ciphering key Kc
Frame Number (22 bits)
Frame Number (22 bits)
A8
A8 Kc
A5
Ciphering Command
A5
A5
A5
Ciphering sequence UL (114 bits)

PE/TRD/GR/0109 12.02/EN
Deciphering sequence DL (114 bits)

Deciphering sequence Ciphering sequence UL (114 bits) DL (114 bits)

7-25
February, 2000
4. Burst Formatting
57 bits
0
Information types Information bits
3 bits Tail
57 bits to cipher Data
26 bits
57 bits to cipher
3 bits 8.25 bits Tail Guard period
S S Training Data odd bits even bits bit = 0: traffic Seq. bit = 0: traffic bit = 1: signaling bit = 1: signaling
156.25 bits (0.577 ms)
NORMAL BURST
(TCH, FACCH, BCCH, PCH, AGCH, SACCH, SDCCH)
Check Your Learning
1- What are all the processing steps, and the respective purposes?
2- Which types of coding are used in GSM?
3- What is the aim of the interleaving process?
4- Give the structure of a normal burst
5- How does the ciphering work?
PE/TRD/GR/0109 12.02/EN
February, 2000
7-27

Section 7: 7-1 Information Processing PE/TRD/GR/0109 12.02/EN February, 2000

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Section 7: 7-1 Information Processing PE/TRD/GR/0109 12.02/EN February, 2000

Diunggah oleh

Hak Cipta:

Format Tersedia

"Confidential information -- may not be copied or disclosed without permission".

Processing of all information bits

Upon completion of this lesson, you will be able to:

Transmission and Reception Chains

"Confidential information -- may not be copied or disclosed without permission".

section 6 section 7 section 8 section 10

INFORMATION PROTECTED BY REDUNDANCY

INFORMATION PROTECTED AGAINST TRANSMISSION LOSSES

INFORMATION ON THE RIGHT FORMAT

SIGNALING 184 bits (LAPDm)

260 bits (FR)

+ parity code + tail bits + convolutional code

+ tail bits + punctured convolutional code

+ Fire code + tail bits + convolutional code

CODED INFORMATION = 456 bits

Channel Coding: Block Codes

"Confidential information -- may not be copied or disclosed without permission".

TRANSMITTED MESSAGE RECEIVED MESSAGE

Channel Coding: Convolutional Code

source sequence - N bits

"Confidential information -- may not be copied or disclosed without permission".

add sequence with same shifted sequences:

use M convolutions per sequence

coded sequence - MxN bits

Channel Coding: Convolutional Code

X(k) 185 bits + 4 x " 0"

Channel Coding: TCH Full Rate

"Confidential information -- may not be copied or disclosed without permission".

Class Ib 132 bits

Convolutional Code r = 1/2 378 bits 456 bits 78 bits

Channel Coding: TCH Half Rate

104 bits Convolutional Code r = 1/3

Channel Coding: Data (1/4)

Convolutional Code r = 1/6

Channel Coding: Data (2/4)

16 bits equal to '0'

Convolutional Code r = 1/3

Channel Coding: Data (3/4)

"Confidential information -- may not be copied or disclosed without permission".

240 Convolutional Code r = 1/2 488 Puncturing

Channel Coding: Data (4/4)

Tail Bits = 0000

290 bits 294 bits 1/2 rate Convolutional coding

Channel Coding: SCH

25 bits (RFN + BSIC)

Tail Bits = 0000

Convolutional Code r = 1/2

Channel Coding: RACH

Color Bits = (Parity Bits) XOR (BSIC) Tail Bits = 0000

Convolutional Code r = 1/2

Channel Coding: LAPDm Frames

1 LAPDm frame = 23 bytes 184 bits

Tail bits = 0000

184 bits 228 bits

Convolutional Code r = 1/2

"Confidential information -- may not be copied or disclosed without permission".

Different interleaving schemes according to the logical channel

Divide 456 bits in 8 sub-blocks

456 coded bits reordering & partitioning out

"Confidential information -- may not be copied or disclosed without permission".

Interleaving: Control Channels

Divide 456 bits in 8 sub-blocks

456 coded bits reordering & partitioning out