Академический Документы
Профессиональный Документы
Культура Документы
Table of Contents
Traditional Sequential ASIC Design Flow WCDMA Network Architecture Physical Layer General Description Multiplexing and Channel Coding (MCC) WCDMA Uplink Physical Layer WCDMA Downlink Physical Layer Compressed Mode Site Selection Transmit Diversity
References 3GPP Technical Specification (Release 1999, 25 Series) WCDMA for UMTS Radio Access For Third
Generation Mobile Communications -- by Harri Holma and Antti Toskala, Artech House, 2001
Architecture Design
RTL Design
Iu
GMSC HLR
Cu
ME
Iub
Node B
Iur
RNC SGSN
GGSN
Internet
Node B
UE
UTRAN
Core Network
External Networks
PLMN: Public Land Mobile Network. One PLMN is operated by a single operator. 7
Both User Equipment (UE) and UTRAN consist of completely new protocols, which is based on the new WCDMA radio technology. The definition of CN is adopted from GSM.
9
10
11
SGSN (Serving GPRS (General Packet Radio Service) Support Node) functionality is similar to that of MSC/VLR, but is typically used for Packet Switched (PS) services. GGSN (Gateway GPRS Support Node) functionality is close to that of GMSC but is in relation to PS services.
12
Interfaces
Cu Interface: this is the electrical interface between the USIM smartcard and the ME. The interface follows a standard format for smartcards. Uu Interface: this is the WCDMA radio interface, which is the subject of the main part of WCDMA technology. This is also the most important open interface in UMTS. Iu Interface: this connects UTRAN to the CN. Iur Interface: the open Iur interface allows soft handover between RNCs from different manufacturers. Iub Interface: the Iub connects a Node B and an RNC. UMTS is the first commercial mobile telephony system where the Controller-Base Station interface is standardized as a fully open interface.
13
TS 25.211
TS 25.213
TS 25.215
Layer 2
Layer 1
18
MAC offers different Logical channels to the Radio Link Control (RLC) sub-layer of Layer 2.
A logical channel is characterized by the type of information transferred.
19
20
1.
2.
3. 4.
6.
7. 8.
9. 10.
11. 12.
Rate matching of coded transport channels to physical channels. Mapping of coded composite transport channels on physical channels. Power weighting and combining of physical channels. Modulation and spreading/demodulation and despreading of physical channels. Frequency and time (chip, bit, slot, frame) synchronisation. Radio characteristics measurements including FER, SIR, Interference Power, etc., and indication to higher layers. Inner - loop power control. RF processing.
22
Multiple Access
UTRA has two modes, FDD (Frequency Division Duplex) & TDD (Time Division Duplex), for operating with paired and unpaired bands respectively. FDD: A pair of frequency bands which have specified separation shall be assigned for the system. TDD: A duplex method whereby uplink and downlink transmissions are carried over same radio frequency by using synchronised time intervals.
In the TDD, time slots in a physical channel are divided into transmission and reception part.
23
1.
2.
3.
Transport Channels
Transport channels are services offered by Layer 1 to the higher layers. A transport channel is defined by how and with what characteristics data is transferred over the air interface. Two groups of transport channels:
Dedicated Transport Channels Common Transport Channels
25
Transport Channels
Dedicated Transport Channels DCH Dedicated Channel (only one type) Common Transport Channels divided between all or a group of users in a cell (no soft handover, but some of them can have fast power control) BCH: Broadcast Channel FACH: Forward Access Channel PCH: Paging Channel RACH: Random Access Channel CPCH: Common Packet Channel DSCH: DL Shared Channel
26
28
29
30
31
33
34
Transport Channel
Dedicated Channel DCH Uplink/ Downlink Code Usage Fast Power Control Soft Handover Suited for: Both According to maximum bit rate. Yes Yes Medium or large data amount. No FACH Downlink Fixed codes per cell. No No Small data amounts. Common Channel RACH Uplink Fixed codes per cell. No No Small data amounts. CPCH Uplink Fixed codes per cell. Yes No Small or medium data amounts. Yes Shared Channels DSCH Downlink Shared between users. Yes No Medium or large data amounts. Yes USCH Uplink, only in TDD. Shared between users. Yes No Medium or large data amounts. Yes
Yes
Yes
35
Unmapped
Common Pilot Channel (CPICH) Synchronization Channel (SCH) Acquisition Indicator Channel (AICH) Access Preamble Acquisition Indicator Channel (AP-AICH) Paging Indicator Channel (PICH) CPCH Status Indicator Channel (CSICH) Collision-Detection/Channel-Assignment Indicator Channel (CD/CA-ICH)
36
Transport Block
Transport Block
Transport Block & Error Indication Transport Block & Error Indication
Transport Block & Error Indication Transport Block & Error Indication
TFI
Transport Block
TFI
TFI
TFI
TFCI
TFCI
37
41
Table of Contents
Overview of MCC Transport channel related terminologies UL-MCC DL-MCC Some examples
43
Overview of MCC
MCC multiplexing and channel coding Encoding data stream from MAC and higher layers to offer transport services over the radio transmission link Map transport block data into physical channel data Operations performed in MCC CRC attachment Channel coding Interleaving Radio frame equalization/segmentation Rate matching Transport channel multiplexing Mapping to physical channels
44
Overview of MCC
Multiplexing and channel coding (MCC) is
a key procedure in 3GPP PHY to support QoS requirements from upper layers MCC interfaces with the 3GPP MAC layer by transport channels (TrCHs) Different QoS requirements may assign to different transport channels Transport channels are processed and multiplexed into one or more physical channels (PhCHs) by MCC
45
46
47
49
Ex:{320bits, 640bits}, { 10ms, convolutional code, rate matching parameter = 1, 8bits CRC }
50
Ex:
{ 40bits, 40bits } , { 80bits, 80bits }, { 160bits, 160bits } { 10ms, convolutional code, rate matching parameter = 1, 8bits CRC }
51
Examples:
DCH1: {20bits, 20bits}, {10ms, convolutional code, rm=2} DCH2: {320bits, 1280bits}, {10ms, turbo code, rm = 3} DCH3: {320bits, 320bits}, {40ms, convolutional code, rm = 1}
52
Ex:
Combination 1
DCH1{20bits, 20bits}, DCH2{320bits, 1280bits} DCH3{320bits,320bits}
Combination 2
DCH1{40bits, 40bits}, DCH2{320bits, 1280bits} DCH3{320bits,320bits}
Combination 3
DCH1{160bits, 160bits}, DCH2{320bits, 320bits} DCH3{320bits,320bits}
Static part
DCH1: {10ms, convolutional code, rm=2} DCH2: {10ms, turbo code, rm = 3} DCH3: {40ms, convolutional code, rm = 1}
53
Transport format set a Transport format set c Transport format set b Transport format set d
54
Slot #0
Slot #1
Slot #14
55
UL-MCC
CRC attachment TrBk concatenation / code block segmentation Channel coding Radio frame equalization 1st interleaving Radio frame segmentation Rate matching TrCH multiplexing Physical channel segmentation 2nd interleaving Physical channel mapping
56
UL-MCC
CRC-attachment
For error detection gCRC24(D) = D24 + D23 + D6 + D5 + D + 1 gCRC16(D) = D16 + D12 + D5 + 1 gCRC12(D) = D12 + D11 + D3 + D2 + D + 1 gCRC8(D) = D8 + D7 + D4 + D3 + D + 1 TrBk
TrBk
57
UL-MCC
TrBk concatenation
TrBk TrBk CRC CRC TrBk CRC TrBk CRC
UL-MCC
Channel coding
For error correction
Turbo-code
Higher error correction capability, long decoding latency Rate = 1/3
Convolutional code
Lower error correction capability, short decoding latency Rate = 1/2 or 1/3
59
UL-MCC
Usage of coding scheme and coding rate
1/3
D
Output 0 G0 = 561 (octal) Output 1 G1 = 753 (octal)
D
Output 0 G0 = 557 (octal) Output 1 G1 = 663 (octal) Output 2 G2 = 711 (octal)
61
zk
xk
Input D D D
Input
zk
xk
xk
62
UL-MCC
Concatenation of encoded blocks Radio frame size equalization
Code block After CC, rate 1/2 Concatenation Of encoded blocks Radio frame size equalization 301 602 16 1236 1236
Assume TTI=8, 1236/8 = 154.5, So we add 4 to let it can be divided by 8
301 602 16
63
UL-MCC
1st interleaving is an inter-frame interleaving scheme Interleaving period is one TTI
10, 20, 40, 80 ms => 1, 2, 4, 8 columns in the interleaving matrix
64
UL-MCC
1st interleaving:
Input bits
0 2 1 3
65
Rate Matching
Rate matching performs after radio frame segmentation (per 10ms data)
Nij: number of bits in a radio frame before RM on TrCH i Ndata,j: total number of bits that are available for the CCTrCH RMi: rate matching attribute for transport channel i Ni,j:number of bits that should be repeated/punctured in each radio frame on TrCH i
Z
i, j
i RM m N m , j N data , j m =1 = I N m, j 1 RM m m=
Rate Matching
Example
Assume 3 TrCH
N0 = 30, RM = 10 N1 = 100, RM = 12 N2 = 20, RM = 13
If Ndata = 180
Z1 = floor(300*180/1760) = 30 : = 0 Z2 = floor((300+1200)*180/1760) = 153 : N1 = 23 Z3 = floor((300+1200+260)*180/1760) = 180 : N2 = 7
If Ndata = 130
Z1 = floor(300*130/1760) = 22 : N0 = -8 Z2 = floor((300+1200)*130/1760) = 110 : N1 = -12 Z3 = floor((300+1200+260)*130/1760) = 130 : N2 = -10
67
Rate Matching
How could we decide which bits should be punctured/repeated?
Determine of eini, eplus, eminus e = eini m=1 do while m < Xi (input bit length before RM)
e = e eminus if e <= 0 then
Repeat or puncture xm e = e + eplus
end if
m=m+1
end do
68
Rate Matching
Example: eini=3, eminus=2, eplus=5 (Puncturing case)
+5 +5 +5 +5
0100100110
001010
69
UL-MCC
TrCH multiplexing
Serially multiplex different transport channels into a coded composite transport channel (CCTrCH)
2nd interleaving
Intra-frame interleaving Similar with 1st interleaving, but with C2 = 30
70
UL-MCC
TTI=2 TTI=2 TTI=4
TrCH1
Radio frame segmentation Rate matching TrCH1 TrCH1 TrCH1 TrCH1
TrCH2
TrCH2 TrCH2 TrCH2 TrCH2
TrCH3
TrCH3 TrCH3 TrCH3 TrCH3
TrCH1
c1
PhCH c2
71
DL-MCC
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12.
CRC attachment TrBk concatenation / code block segmentation Channel coding Rate matching 1st insertion of DTX indication 1st interleaving Radio frame segmentation TrCH multiplexing 2nd insertion of DTX indication Physical channel segmentation 2nd interleaving Physical channel mapping
72
Rate Matching
Since DL rate matching is performed before TrCH multiplexing, the RM does not know TF of other transport channel
TrCH1 TrCH1 TrCH2 TrCH2 PhCH size RM in UL case TrCH3 TrCH3 TrCH1 ? PhCH size RM in DL case ? ?
73
Rate Matching
2 solutions in DL-RM
Fixed position
Use the maximum Ni in TFS i for all i as the data size before RM Calculate for Ni as in UL case
Flexible position
Find maximum RMi*Ni,j for all combination j Calculate for Ni
74
Rate Matching
TFCS example
Combination 1: DCH1{20bits, 20bits}, DCH2{320bits, 1280bits} DCH3{320bits,320bits} Combination 2: DCH1{40bits, 40bits}, DCH2{320bits, 1280bits} DCH3{320bits,320bits} Combination 3: DCH1{160bits, 160bits}, DCH2{320bits, 320bits} DCH3{320bits,320bits} Assume RM1 = RM2 = RM3 = 100 (same importance)
Fixed position
Choose N1=160, N2=1280, N3=320 to calculate for Ni
Flexible position
Choose N1=40, N2=1280, N3=320 to calculate for Ni (combination 2)
75
Rate Matching
Normal mode
For frames not overlapping with transmission gap
Compressed mode
Frames overlapping with transmission gap
Frame structure of type A
Slot # (Nfirst - 1) T TF Data1 P CI C transmission gap Slot # (Nlast + 1) T TF PL Data1 P CI C
Data2
PL
Data2
PL
Data2
PL
Data2
PL
76
Rate Matching
Compressed mode by puncturing
Use rate matching algorithm to generate available space for transmission gap We insert p-bits corresponding to the transmission gap length and will be removed later Using slot format A
DTX Insertion
Since the rate matching output is to match the maximum bit number of each TrCH, DTX (discontinuous transmission bits) should be inserted to match the real bit number after TrCH multiplexing
Before RM After RM TrCH1 TrCH1 TrCH2 TrCH2 TrCH3 TrCH3
TrCH MUX
TrCH1
TrCH2
TrCH3 DTX
PhCH size
78
Slot #0
Slot #1
Slot #14
79
80
81
Some Examples
UL DCH example
UL 12.2 kbps data UL 64/128/144 kbps packet data UL 384 kbps packet data
TrCH multiplexing
12.2 kbps data + 3.4 kbps data 64 kbps data + 3.4 kbps data
DL DCH example
DL 12.2 kbps data DL 64/128/144 kbps packet data
TrCH multiplexing
12.2 kbps data + 3.4 kbps data
82
TrC h # b
N CRC
TrC H b
T rC h # c
N
TrC H c
T a il b it a tta c h m e n t*
TrC H a
12 Ta il
TrC H b
N Ta il
TrC H c
Ta il
T rC H b/ 1
TrC H a+ 1 2
TrC H b
8*N
03
TrC H c
8*N
T rC H c/ 6
3*( N
T rC H a +
20)
3*( N
T rC H b+
8*N
T rC H b/ 1
03)
2*( N
T rC H c+
8*N
TrC H c/6
0)
3*( N
T rC H a +
20)
3*( N
T rC H b+
8*N
T rC H b / 1
03)
2*( N
T rC H c+
8*N
TrC H c/6
0)
R a d io fra m e s e g m e n ta tio n R a te m a tc h in g
3 * ( N T rC H a + 2 0 ) + 1 * N T rC H a / 8 1
3*( N
TrC H b+
2*( N 0 3 )+ 1 * N
T rC
T rC H c+
8*N
TrC H c/6
0)
8*N
T rC H b/1
#1a
N
RFa
#2b
N
RFa
#1b
N
RFb
#2b
N
RFb
#1c
N
RFc
#2c
N
RFc
#1a
N
RFa+
#2b
N
R Fa+
#1b
N
R F b+
#2b
N
R F b+
#1c
R M _2b
#2c
N
2c R F c+
RM _1a
RM _2b
R M _1b
R F c+
RM
RM _
_1c
N N N
[ 3 * ( N T rC H a + 2 0 )+ 1 * N T rC H a /8 1 ] /2 [ 3 * ( N T rC H b+ 8 * N T rC H b/ 1 0 3 ) + 1 * N T rC H b/ 1 0 3 ] /2 R F c= N T rC H c+ 8 * N T rC H c/ 6 0
R Fa= R F b=
T o T rC h M u ltip le x in g
* C R C a n d ta il b its fo r T rC H # a is a tta c h e d e v e n if N b lo c k is a p p lie d .
T rC ha=
83
CRC
336 16
T rB k c o n c a te n a tio n
B T rB k s (B = 0 , 1 , 2 , 4 , 8 , 9 )
T u r b o c o d in g R = 1 /3
352* B
Ta il b it a tta c h m e n t
1056* B
Ta il 1
st
in te rle a v in g
1056* B
1 2 * B /9
R a d io fra m e s e g m e n ta tio n
1 0 5 6 * B + 1 2 * B /9
#1
R a te m a tc h in g
(1 0 5 6 * B + 1 2 * B /9 )/2
#2
(1 0 5 6 * B + 1 2 * B /9 )/2
#1
(1 0 5 6 * B + 1 2 * B /9 )/2 + N
RM 1
#2
(1 0 5 6 * B + 1 2 * B /9 )/2 + N
RM 2
T o T rC h M u ltip le x in g
84
CRC
336 16
T rB k c o n c a te n a tio n
B T rB k s (B = 0 , 1 , 2 , 4 , 8 , 1 2 , 2 4 )
C o d e b lo c k s e g m e n ta tio n
176* B
352* B
176* B
T u rb o c o d in g R = 1 /3
T a il b it a tta c h m e n t
528* B
528* B
T a il 1 st in te r le a v in g R a d io fra m e s e g m e n ta tio n
528* B 1 2 * B /2 4 528* B
T a il
1 2 * B /2 4
1 0 5 6 * B + 2 4 * B /2 4
#1
R a te m a tc h in g
(1 0 5 6 * B + 2 4 * B /2 4 )/2
#2
(1 0 5 6 * B + 2 4 * B /2 4 )/2
#1
(1 0 5 6 * B + 2 4 * B /2 4 )/2 + N
RM 1
#2
(1 0 5 6 * B + 2 4 * B /2 4 )/2 + N
RM 2
T o T rC h M u ltip le x in g
85
TrCH multiplexing
#1a #1b #1c #1 #2a #2b #2c #2 #1a #1b #1c #3 #2a #2b #2c #4
2nd interleaving Physical channel mapping 60 ksps DPDCH CFN=4N CFN=4N+1 CFN=4N+2 CFN=4N+3
600 600 600 600
86
64 kbps data #1 TrCH multiplexing #1 2nd interleaving Physical channel mapping 240 ksps DPDCH CFN=4N CFN=4N+1 CFN=4N+2 #1 #2 #2 #3 #3 #2 #3 #4 #1 #2
#4
#4
CFN=4N+3
87
T rC h # b
N CRC
TrC H b
T rC h # c
N
TrC H c
T a il b it a tta c h m e n t*
TrC H a
12 Ta il
TrC H b
N Ta il
TrC H c
Ta il 03 N
TrC H c
C o n v o lu tio n a l c o d in g R = 1 /3 , 1 /2 R a te m a tc h in g
TrC H a+
12
TrC H b
8*N
T rC H b/ 1
8* N
T rC H c/ 6
3 * (N
TrC H a+
20)
3 * (N
TrC H b+
8* N
T rC H b/ 1
03)
2 * (N
TrC H c+
8* N
T rC H c/ 6
0)
In s e rtio n o f D T X in d ic a tio n
3 * (N
TrC H a+
2 0 )+ N
RM a
3 * (N N
TrC H b+
TrC H b/1
8* 0 3 )+ N RM
2 * (N
b
TrC H c+
TrC H c/6
8* 0 )+ N R M
3 * (N
TrC H a+
2 0 )+ N
R M a+
D I1
1 st in te r le a v in g
TrC H b/1
3 * (N TrC H b+ 8 * 0 3 )+ N R M b+ N
D Ib
TrC H c/6
2 * (N TrC H c+ 8 * 0 )+ N R M c+ N
D Ic
R a d io fra m e s e g m e n ta tio n
3 * (N
TrC H a+
2 0 )+ N
R M a+
D I1
TrC H b/1
3 * ( N TrC H b+ 8 * 0 3 )+ N R M b+ N
D Ib
TrC H c/6
2 * (N TrC H c+ 8 * 0 )+ N R M c+ N
D Ic
#1a
N
RFa
#2a
N
RFa
#1b
N
RFb
#2b
N
RFb
#1c
N = [3 * (N = [3 * (N = [2 * (N
T rC H a + TrC H b+ T rC H c+ RFc
#2c
N
RFc
N N N
RFa
20) +N 8* N 8* N
RM a+
D Ia ] / 2 R M b+
RFb
T rC H b / 1 TrC H c/6
0 3 )+ N 0 )+ N
D Ib]
/2
RFc
R M c+
D Ic]
/2
T o T rC h M u ltip le x in g
* C R C a n d ta il b its fo r T rC H # a is a tta c h e d e v e n if N b lo c k is a p p lie d .
T rC ha=
88
C R C
336 16
T rB k c o n c a te n a tio n
B T rB k s (B = 0 , 1 , 2 , 4 , 8 , 9 )
T u r b o c o d in g R = 1 /3
352* B
T a il b it a tta c h m e n t
1056*B
T a il R a te m a tc h in g
1056*B 1 2 * B /9
1 0 5 6 * B + 1 2 * B /9 + N
R M
st
in te rle a v in g
1 0 5 6 * B + 1 2 * B /9 + N
R a d io fra m e s e g m e n ta tio n
R M
#1
(1 0 5 6 * B + 1 2 * B /9 + N
R M
#2
)/2 (1 0 5 6 * B + 1 2 * B /9 + N
R M
)/2
T o T rC h M u ltip le x in g
89
T rCH m ultiplexing
#1a #1b #1c #1 #2a #2b #2c #2 #1a #1b #1c #3 #2a #2b #2c #4
2nd interleaving
510 1 2 15 1 2 510 15 1 2 510 15 1 2 510 15
30 ksps D PCH
slot
CFN=4N
slot
CFN=4N+1
slot
CFN=4N+2
slot
90
Table of Contents
Overview Uplink Physical Layer
Dedicated Uplink Physical Channels
Uplink Dedicated Physical Data Channel (UL DPDCH) Uplink Dedicated Physical Control Channel (UL DPCCH)
Overview
Configuration
Radio frame
A radio frame is a processing unit which consists of 15 slots. The length of a radio frame corresponds to 38400 chips.
Time slot
A time slot is a unit which consists of fields containing bits. The length of a slot corresponds to 2560 chips.
Overview
Spreading (cont.)
Channelization operation
OVSF codes. Transform every data symbol into a number of chips. Increase the bandwidth of the signal. The number of chips per data symbol is called the Spreading Factor. Data symbols on I- and Q-branches are independently multiplied with an OVSF code.
Scrambling operation
Long or short Gold codes. Applied to the spread signals. Randomize the codes
Spread signal is further multiplied by complex-valued scrambling 94
95
96
Slot #0
Slot #1
Slot #14
UL DPDCH
The parameter k determines the number of bits per uplink DPDCH slot. It is related to the spreading factor SF of the DPDCH as SF = 256/2k. The DPDCH spreading factor ranges from 256 down to 4.
Slot Format #i Channel Bit Rate (kbps) 15 30 60 120 240 480 960 Channel Symbol Rate (ksps) 15 30 60 120 240 480 960 SF Bits/ Frame 150 300 600 1200 2400 4800 9600 Bits/ Slot 10 20 40 80 160 320 640 Ndata
0 1 2 3 4 5 6
256 128 64 32 16 8 4
98
99
Npilot = 4 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0 2 1 0 1 0 0 1 1 0 1 1 1 0 0 0 0 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0
Npilot = 5 1 1 0 1 0 0 1 1 0 1 1 1 0 0 0 0 101 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 0 0 0 1 0 0 1 1 0 1 0 1 1 4 0 0 1 0 1 0 0 0 0 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0
Npilot = 6 2 1 0 1 0 0 1 1 0 1 1 1 0 0 0 0 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 4 1 1 0 0 0 1 0 0 1 1 0 1 0 1 1 5 0 0 1 0 1 0 0 0 0 1 1 1 0 1 1
0 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0
1 1 0 1 0 0 1 1 0 1 1 1 0 0 0 0
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 2 3 4 5 6 7 8 9 10 11 12 13 14
FBI Bits
The FBI bits are used to support techniques requiring feedback from the UE to the UTRAN Access Point, including closed loop mode transmit diversity and site selection diversity transmission (SSDT).
S field NFBI D field
The S field is used for SSDT signalling, while the D field is used for closed loop mode transmit diversity signalling. The S field consists of 0, 1, or 2 bits. The D field consists of 0 or 1 bit. Simultaneous use of SSDT power control and closed loop mode transmit diversity requires that the S field consists of 1 bit.
103
TFCI Bits
There are two types of uplink dedicated physical channels:
those that include TFCI (e.g. for several simultaneous services) those that do not include TFCI (e.g. for fixed-rate services).
It is the UTRAN that determines if a TFCI should be transmitted and it is mandatory for all UEs to support the use of TFCI in the uplink. In compressed mode, DPCCH slot formats with TFCI fields are changed. There are two possible compressed slot formats for each normal slot format.
104
1 0
Spreading of UL DPCH
c d ,1 DPDCH1 c d ,3 DPDCH3 c d ,5 DPDCH5 d S lo n g , n o r S s h o r t , n I+ jQ c d ,2 DPDCH2 c d ,4 DPDCH4 c d ,6 DPDCH6 cc DPCCH c d d d d d
106
Spreading of UL DPCH
The binary DPCCH and DPDCHs to be spread are represented by real-valued sequences, i.e. the binary value "0" is mapped to the real value +1, while the binary value "1" is mapped to the real value 1. The DPCCH is spread to the chip rate by the channelization code cc, while the n:th DPDCH called DPDCHn is spread to the chip rate by the channelization code cd,n. One DPCCH and up to six parallel DPDCHs can be transmitted simultaneously, i.e. 1 n 6.
107
Channelization Codes
Each CDMA channel is distinguished via a unique spreading code. These spreading codes should have low crosscorrelation values. In 3GPP W-CDMA, Orthogonal Variable Spreading Factor (OVSF) codes are used. Preserve the orthogonality between a users different physical channels. Scrambling is used on top of spreading.
108
The channelization codes are uniquely described as Cch,SF,k, where SF is the spreading factor of the code and k is the code number, 0 k SF-1.
109
Channelization Codes
As the chip rate is already achieved in the spreading by the channelization codes, the symbol rate is not affected by the scrambling. Another physical channel may use a certain code in the tree if no other physical channel to be transmitted using the same code three is using a code that is on an underlying branch, i.e. using a higher spreading factor code generated from the intended spreading code to be used. Neither can a smaller spreading factor code on the path to the root of the tree be used.
110
Channelization Codes
The downlink orthogonal codes within each base station are managed by the radio network controller (RNC) in the network. The definition for the same code tree means that for transmission from a single source, from either a terminal or a base station. One code tree is used with one scrambling code on top of the tree. Different terminals and different base stations may operate their code trees independently of each other.
111
113
Gain of UL DPCH
After channelization, the real-valued spread signals are weighted by gain factors, c for DPCCH and d for all DPDCHs. At every instant in time, at least one of the values c and d has the amplitude 1.0. The -values are quantized into 4 bit words. After the weighting, the stream of real-valued chips on the I- and Q-branches are then summed and treated as a complex-valued stream of chips. This complex-valued signal is then scrambled by the complexvalued scrambling code Sdpch,n.
114
Gain of UL DPCH
Signaling values for c and d 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Quantized amplitude ratios c and d 1.0 0.9333 0.8666 0.8000 0.7333 0.6667 0.6000 0.5333 0.4667 0.4000 0.3333 0.2667 0.2000 0.1333 0.0667 Switch off
115
clong,1,n
x
MSB LSB
clong,2,n
117
The sequence clong,2,n is a 16777232 chip shifted version of the sequence clong,1,n. clong,1,n and clong,2,n are Gold codes.
118
Initial conditions
xn(0)=n0, xn(1)=n1, , xn(22)=n22, xn(23)=n23, xn(24)=1 y(0)=y(1)= =y(23)= y(24)=1
119
Gold sequence zn
zn(i ) = xn(i ) + y (i ) modulo 2, i = 0, 1, 2, , 225-2
+ 1 if zn (i ) = 0 Zn (i ) = 1 if zn (i ) = 1
for i = 0,1,,225 2.
120
3
mod 2
0
d(i)
2
zn(i)
Mapper
cshort,1,n(i) cshort,2,n(i)
0
b(i) mod 4
0
a(i)
3 2 3
mod 4
122
Generation
From the family of periodically extended S(2) codes The n:th quaternary S(2) sequence zn(i ), 0 n 16777215, is obtained by modulo 4 addition of three sequences One quaternary sequence a (i ) Two binary sequences b (i ) and d (i )
123
Recursive formulation
a (i) = 3a (i-3) + a (i-5) + 3a (i-6) + 2a (i-7) + 3a (i-8) modulo 4, i = 8, 9, , 254
124
Recursive formulation
b (i) = b (i-1) + b (i-3) + b (i-7) + b (i-8) modulo 2, i = 8, 9, , 254
125
Recursive formulation
d (i ) = d (i-1) + d (i-3) + d (i-4) + d (i-8) modulo 2, i = 8, 9, , 254
126
Mapping
z n ( i) 0 1 2 3 c s h o rt,1 ,n ( i ) +1 -1 -1 +1 c s h o rt,2 ,n ( i ) +1 +1 -1 -1
Cshort, n is
127
129
Preamble
Preamble
Preamble
Preamble
130
k = 0,1,2,,4095
131
132
133
134
135
Control
Slot #0 Slot #1
Slot #i
Slot #14
Control part
SF=256. 8 known pilot bits to support channel estimation for coherent detection. 2 TFCI bits corresponds to a certain transport format of the current Random-access message.
The message part length can be determined from the sued signature and/or access slot, as configured by higher layers.
137
256 128 64 32
256
138
139
Sr-msg,n I I+jQ Q
142
Message Part
4096 chips
143
k = 0,1,2, ,4095
The RACH preamble signature sequences are used. The scrambling codes could be either
A different code segment of the Gold code used to form the scrambling code of the RACH preambles or The same scrambling code in case the signature set is shared.
144
The codes are divided into 512 groups with 80 codes in each group. There is a one-to-one correspondence between the group of PCPCH access preamble scrambling codes in a cell and the primary scrambling code used in the downlink of the cell.
The k:th PCPCH scrambling code within the cell with downlink primary scrambling code m, for k = 0,..., 79 and m = 0, 1, 2, , 511, is Sc-acc,n as defined above with n=16m+k for k=0,...,15 and n = 64m + (k-16)+8192 for k=16,..., 79.
145
k = 0,1,2, ,4095
The RACH preamble signature sequences are used. The scrambling code is chosen to be a different code segment of the Gold code used to form the scrambling code for the RACH and CPCH preambles.
146
The 40960 PCPCH scrambling codes are divided into 512 groups with 80 codes in each group. There is a one-to-one correspondence between the group of PCPCH CD preamble scrambling codes in a cell and the primary scrambling code used in the downlink of the cell.
The k:th PCPCH scrambling code within the cell with downlink primary scrambling code m, k = 0,1, , 79 and m = 0, 1, 2, , 511, is Sc-cd, n as defined above with n=16m+k for k = 0,...,15 and n = 64m + (k-16)+8192 for k=16,...,79.
147
256 256
6 5
2 2
2 2
0 1
The scrambling code for the PCPCH power control preamble is the same as for the PCPCH message part. The channelization code the PCPCH power control preamble is the same as the control part of message part.
148
Slot #0
Slot #1
Slot #14
Control part carries Layer 1 control information with SF = 256. Slot format is the same as CPCH PC-P part.
150
151
152
153
The 32768 PCPCH scrambling codes are divided into 512 groups with 64 codes in each group. There is a one-to-one correspondence between the group of PCPCH preamble scrambling codes in a cell and the primary scrambling code used in the downlink of the cell.
154
Uplink Modulation
The modulation chip rate is 3.84 Mcps. The complex-valued chip sequence generated by the spreading process is QPSK modulated.
cos(t) Re{S} Complex-valued chip sequence from spreading operations S Split real & imag. parts Pulseshaping Pulseshaping -sin(t)
Im{S}
155
Uplink Modulation
The uplink modulation should be designed:
The audible interference from the terminal transmission is minimized. The terminal amplifier efficiency is maximized.
Audible interference:
Discontinuous uplink transmission can cause audible interference to audio equipment that is very close to the terminal. Solution: WCDMA uplink doesnt adopt time multiplexing. User Data (DPDCH) DTX Period User Data (DPDCH)
Table of Contents
Introduction Downlink Transmit Diversity Open loop transmit diversity
Space Time Block Coding Based Transmit Antenna Diversity (STTD) Time Switched Transmit Diversity for Synchronization Channel (TSTD)
Common Pilot Channel (CPICH) Primary Common Control Physical Channel (P-CCPCH) Secondary Common Control Physical Channel (S-CCPCH)
158
Table of Contents
Common Downlink Physical Channels (continue)
4. 5. 6. 7. 8.
9. 10.
Synchronization Channel (SCH) Physical Downlink Shared Channel (PDSCH) Acquisition Indicator Channel (AICH) CPCH Access Preamble Acquisition Indicator Channel (AP-AICH) CPCH Collision Detection/Channel Assignment Indicator Channel (CD/CA-ICH) Page indicator channel (PICH) CPCH Status Indicator Channel (CSICH)
Introduction
CCPCH, PICH Downlink DPCH AICH, CPICH
On-line MS
161
S T T D e n c o d e d c h a n n e l b its fo r a n te n n a 1 a n d a n te n n a 2 .
162
S lo t # 1 acp acs
i,1
S lo t # 1 4 acp acs
i,14
2 5 6 c h ip s 2 5 6 0 c h ip s O n e 1 0 m s S C H ra d io fra m e
Slot #0 acp acsi,0
(Tx OFF)
Slot #14
Antenna 1
(Tx OFF)
(Tx OFF)
Antenna 2
(Tx OFF)
acp acsi,1
(Tx OFF)
(Tx OFF)
(Tx OFF)
(Tx OFF)
163
Ant2
DPCCH DPDCH
DPCH
w2 CPICH2
w1
w2
Weight Generation
164
1 1
1 4
1500 Hz 1500 Hz
0 1
1 3
/2 N/A
166
If Q = 0, a command '0' is sent to UTRAN using the FSMph field. If Q = , command '1' is sent to UTRAN using the FSMph field.
168
169
170
Slot #0
Slot #1
Slot #14
171
DL DPCH
Parameters
Each frame= 15 slots = 10 ms
Each slot= 2560 chips Each slot= one power-control period.
It is the UTRAN that determines if a TFCI should be transmitted and it is mandatory for all UEs to support the use of TFCI in the downlink.
172
0 0A 0B 1 1B 2 2A 2B 3 3A 3B 4 4A 4B 5 5A
174
Npilot = 4 (*1) 0 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 1 11 00 01 00 10 11 11 10 01 11 01 10 10 00 00 0 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11
Npilot = 8 (*2) 1 11 00 01 00 10 11 11 10 01 11 01 10 10 00 00 2 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 3 10 10 01 00 01 10 00 00 10 11 01 11 00 11 11 0 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 1 11 00 01 00 10 11 11 10 01 11 01 10 10 00 00 2 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11
Npilot = 16 (*3) 3 10 10 01 00 01 10 00 00 10 11 01 11 00 11 11 4 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 5 11 11 10 01 11 01 10 10 00 00 11 00 01 00 10 6 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 7 10 00 00 10 11 01 11 00 11 11 10 10 01 00 01
0 11 00 01 00 10 11 11 10 01 11 01 10 10 00 00
# Slot #0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
175
TFCI TFCI value in each radio frame corresponds to a certain combination of bit rates of the DCHs currently in use.
176
Condition: Total bit rate to be transmitted exceeds the maximum bit rate Multicode transmission is mapped onto several parallel downlink DPCHs using the same spreading factor. Layer 1 control information is transmitted only on the first DL DPCH.
Physical Channel 1
Transmission Power
Physical Channel 2
Transmission Power
Physical Channel L
177
Slot #0
Slot #1
Slot #14
178
179
Antenna 2
Frame Boundary
The Primary CPICH is a phase reference for the following downlink channels: SCH, Primary CCPCH, AICH, PICH APAICH, CD/CA-ICH, CSICH, DL-DPCCH for CPCH and the S-CCPCH. By default, the Primary CPICH is also a phase reference for downlink DPCH and any associated PDSCH. The Primary CPICH is always a phase reference for a downlink physical channel using closed loop TX diversity.
181
A Secondary CPICH may be a phase reference for a downlink DPCH. The Secondary CPICH can be a phase reference for a downlink physical channel using open loop TX diversity, instead of the Primary CPICH being a phase reference.
182
Note *: the same phase reference as with the associated DPCH shall be used. 183
Slot #0
Slot #1
Slot #14
184
Slot #0
Slot #1
Slot #14
185
SF
256 256 256 256 128 128 128 128 64 64 32 32 16 16 8 8 4 4
Bits/ Frame
300 300 300 300 600 600 600 600 1200 1200 2400 2400 4800 4800 9600 9600 19200 19200
Bits/ Slot
20 20 20 20 40 40 40 40 80 80 160 160 320 320 640 640 1280 1280
Ndata1
20 12 18 10 40 32 38 30 72 64 152 144 312 296 632 616 1272 1256
Npilot
0 8 0 8 0 8 0 8 0 8 0 8 0 16 0 16 0 16
NTFCI
0 0 2 2 0 0 2 2 8 8 8 8 8 8 8 8 8 8
186
Characteristics of S-CCPCH
The FACH and PCH can be mapped to the same or to separate Secondary CCPCHs. If FACH and PCH are mapped to the same S-CCPCH, they can be mapped to the same frame. The main difference between a CCPCH and a downlink dedicated physical channel is that a CCPCH is not innerloop power controlled. The main difference between the P-CCPCH and SCCPCH is that the transport channel mapped to the PCCPCH can only have a fixed predefined transport format combination, while the S-CCPCH support multiple transport format combinations using TFCI.
188
Slot #14
189
a = +1 a = -1
Slot #0
Slot #1
Slot #14
193
a0 a1 a 2
a30 a31
Transmission Off
AS #14
AS #0
AS #1
AS #i 20 ms
AS #14
AS #0
195
a j = AI s b s, j
s =0
15
AIs (1, 0, -1) ~( ACK, No ACK, NACK) Each slot can ack 16 signatures.
197
198
a0 a1 a2
a30 a31
AS #14
AS #0
AS #1
AS #i 20 ms
AS #14
AS #0
199
CPCH Collision Detection/Channel Assignment Indicator Channel (CD/CA-ICH) The CD/CA-ICH is a fixed rate (SF=256) physical channel used to carry CD Indicator (CDI) only if the CA is not active, or CD Indicator/CA Indicator (CDI/CAI) at the same time if the CA is active. CD/CA-ICH frame structure:
CDI/CAI part =
4096 chips, 32 real-valued symbols
a0 a1 a2
a30 a31
AS #14
AS #0
AS #1
AS #i 20 ms
AS #14
AS #0
201
CPCH Collision Detection/Channel Assignment Indicator Channel (CD/CA-ICH) CD/CA-ICH and AP-AICH may use the same or different channelisation codes. The CD/CA-ICH has a part of duration of 4096chips where the CDI/CAI is transmitted, followed by a part of duration 1024chips with no transmission that is not formally part of the CD/CA-ICH. The spreading factor (SF) used for channelisation of the CD/CA-ICH is 256.
202
One PICH radio frame of length 10 ms consists of 300 bits (b0, b1, , b299). 288 bits (b0, b1, , b287) are used to carry paging indicators. The remaining 12 bits are not formally part of the PICH and shall not be transmitted. The part of the frame with no transmission is reserved for possible future use.
204
205
{b16q, , b16q+15} = {-1,-1,,-1} {b8q, , b8q+7} = {-1,-1,,-1} {b4q, , b4q+3} = {-1, -1,,-1} {b2q, b2q+1} = {-1,-1}
{b16q, , b16q+15} = {+1,+1,,+1} {b8q, , b8q+7} = {+1,+1,,+1} {b4q, , b4q+3} = {+1, +1,,+1} {b2q, b2q+1} = {+1,+1}
207
SI part
b8i+6 b8i+7
AS #14
AS #0
AS #1
AS #i 20 ms
AS #14
AS #0
The CSICH frame consists of 15 consecutive access slots (AS) each of length 40 bits. Each access slot consists of two parts, a part of duration 4096 chips with no transmission, and a Status Indicator (SI) part consisting of 8 bits b8i,.b8i+7, where i is the access slot number. The part of the slot with no transmission is reserved for use by AICH, AP-AICH or CD/CA-ICH.
209
P-CCPCH
k:th S-CCPCH
PICH for k:th S-CCPCH AICH access slots Any PDSCH DPCH,n #0 #1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14
n:th DPCH
10 ms
10 ms
212
213
215
p-a
PRACH access slots TX at UE
Preamble Preamble Message part
p-p
p-m
216
217
T DPCH
T PDSCH
219
Downlink
In downlink, the DPCCH and all the DPDCHs carrying CCTrCHs of dedicated type to one UE have the same frame timing. Note: support of multiple CCTrChs of dedicated type is not part of the current release.
Uplink/downlink timing at UE
At the UE, the uplink DPCCH/DPDCH frame transmission takes place approximately T0 chips after the reception of the first detected path (in time) of the corresponding downlink DPCCH/DPDCH frame. T0 is a constant defined to be 1024 chips.
220
S P
221
G2
P-SCH GP S-SCH GS
222
223
Each cell is allocated one and only one primary scrambling code. The primary CCPCH, primary CPICH, PICH, AICH, APAICH, CD/CA-ICH, CSICH and S-CCPCH carrying PCH are always transmitted using the primary scrambling code. The other downlink physical channels can be transmitted with either the primary scrambling code or a secondary scrambling code from the set associated with the primary scrambling code of the cell.
224
17 16 15 14 13 12 11 10
I Q
17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
225
Mapping
+ 1 Z n (i ) = 1 if z n ( i ) = 0 if z n ( i ) = 1 for i = 0 ,1, , 2 18 2 .
227
Downlink Modulation
In the downlink, the complex-valued chip sequence generated by the spreading process is QPSK modulated:
cos(t) Re{T} Complex-valued chip sequence from summing operations T Split real & imag. parts Pulseshaping Pulseshaping -sin(t)
Im{T}
228
Compressed Mode
Compressed Mode
Often referred to as the slotted mode. Inter-frequency handovers are needed for utilization of hierarchical cell structures and for handovers to 2nd generation systems. To complete inter-frequency handovers, measurements on other frequencies while still having the connection running on the current frequency are needed: Dual Receiver; Compressed Mode;
Lowering the data rate from higher layers. Variable spreading factor. Code rate increase. Puncturing at the physical layer. Multi-code. 3GPP TS 25.212 V.3.8.0 4.4 Higher order modulation.
230
Compressed Mode
The specified Transmission Gap Length (TGL) are 3, 4, 7, 10, and 14 slots.
231
Compressed Mode
In compressed frames, TGL slots from Nfirst to Nlast are not used for transmission of data. The instantaneous transmit power is increased in the compressed frame in order to keep the quality (BER, FER, etc.) unaffected by the reduced processing gain. The amount of power increase depends on the transmission time reduction method. What frames are compressed, are decided by the network. When in compressed mode, compressed frames can occur periodically, or requested on demand.
232
Slot # (Nfirst 1)
transmission gap
Slot # (Nlast + 1)
Data
Data
Pilot
Pilot
233
Type A: the pilot field of the last slot in the transmission gap is transmitted. Type B: the TPC field of the first slot in the transmission gap and the pilot field of the last slot in the transmission gap is transmitted.
Slot # (Nfirst - 1) transmission gap Slot # (Nlast + 1) T TF PL Data1 P CI C
transmission gap T P C
A: B:
T TF Data1 P CI C
Data2
PL
Data2
PL
Data2
PL
Data2
PL
234
In the downlink, all methods are supported while compressed mode by puncturing is not used in the uplink. The maximum idle length is defined to be 7 slots per one 10 ms frame.
235
#0
# N fi r s t - 1
# N la s t + 1
#14
( 1 ) S in g le - fr a m e m e th o d T r a n s m is s io n g a p
F ir s t r a d io fr a m e
S e c o n d r a d io fr a m e
#0
# N fi r s t - 1
# N la s t + 1
#14
( 2 ) D o u b le - fr a m e m e th o d
236
TGL=3,4, and 7.
T r a n s m is s io n g a p
T r a n s m is s io n g a p
R a d io fr a m e ( 1 ) S in g le - fr a m e m e th o d T r a n s m is s io n g a p
F ir s t r a d io fr a m e
S e c o n d r a d io fr a m e
TGL=3,4,7,10,14.
: : T r a n s m is s io n g a p
: : T r a n s m is s io n g a p
R a d io fr a m e ( 2 ) D o u b le - fr a m e m e th o d
When the transmission gap spans two consecutive radio frames, Nfirst and TGL must be chosen so that at least 8 slots in each radio frame are transmitted. 237
3 4 5
256 4
(S) (D) =(1,2) or (2,1) (S) (D) =(1,3), (2,2) or (3,1) (S) (D) = (1,4), (2,3), (3, 2) or (4,1) (S) (D)=(1,6), (2,5), (3,4), (4,3), (5,2) or (6,1) (D)=(3,7), (4,6), (5,5), (6,4) or (7,3) (D) =(7,7)
4.67
10 14
6.67 9.33
(S): Single-frame method. (D): Double-frame method. (x,y) indicates x: the number of idle slots in the first frame, y: the number of idle slots in the second frame. 238
512 4
1.73 1.99 1.60 1.86 2.40 2.66 2.27 2.53 3.07 3.33 2.93 3.19 4.40 4.66 4.27 4.53 6.40 6.66 6.27 6.53 9.07 9.33 8.93 9.19
(S) (D) =(1,2) or (2,1) (S) (D) =(1,3), (2,2) or (3,1) (S) (D) = (1,4), (2,3), (3, 2) or (4,1) (S) (D)=(1,6), (2,5), (3,4), (4,3), (5,2) or (6,1) (D)=(3,7), (4,6), (5,5), (6,4) or (7,3) (D) =(7,7)
239
3 4 5
(S) (D) =(1,2) or (2,1) (S) (D) =(1,3), (2,2) or (3,1) (S) (D) = (1,4), (2,3), (3, 2) or (4,1) (S) (D)=(1,6), (2,5), (3,4), (4,3), (5,2) or (6,1) (D)=(3,7), (4,6), (5,5), (6,4) or (7,3) (D) =(7,7)
4.13 4.39
10 14
240
242
246
247
DeScrambling
249
DeScrambling
250