CDMA Forward Channels1

/
)
J
NbRTEL
NORTHERNTELECOM
Student Guide
CDMA Forward Channels
Lesson3
Proprietary infonnation
For training purposes only
January 9, 1998
-
2.2
The copyright of this document is the property of Northern Telecom. Without the written
consent of Northern Telecom, given by contract or otherwise, this document must not be
copied, reprinted or reproduced in any material form, either wholly or in part, and the contents
of this document, or any methods or techniques available therefrom, must not be disclosed to
any other person whatsoever.
- ---
)
)
)
--
Issue 2.2 - (January 9. 1998) Page3-3
LESSON OBJECTIVES
The following areas are covered in this lesson:
Study the Pilot Channel
Study the Sync Channel and the Sync Channel Message
Study the Paging Channels and selected Paging Channel Messages
Study the Forward Traffic Channels and selected Forward Traffic Channel Messages
Course 810- Stud~nt Guide
Lesson 3: CDMA Forward Channels
@ 1998 Northern Telecom
All rights reserved
--
Issue 2.2 -(January 9, 1998) Page 3-5
Section 3.a: Pilot Channel
Objectives
)
Pilot Channel: what is it used for and how is it generated?
Orthogonal spreading
Walsh matrices, Walsh codes, orthogonality
Spreading and de-spreading a bit stream using a Walsh code
PN code generators: how do they work?
Characteristics of the generated bit string
PN codes used by CDMA
Course 810 - Student Guide
@1998 Nonhero Telecom
All rights reserved
- - ---
.
.
.
.
)
.
,
.
.
Issue 2.2 - (January 9, 1998)
Page3-7
Pilot Channel Generation
')
Walsh
Function0
I PN
Pilot
Channel
(AllO's)
1.2288
Mcps
Q PN
)
. The Walsh function zero spreading sequence is applied to the Pilot
. The use of short PNsequence offsets allowsfor up to 512 distinct
Pilots per COMAchannel
. The PNoffsetindexvalue(0-511inclusive) for a given pilot PN
sequence is multipliedby 64 to determine the actual offset
Example: 15 (offset index) x 64 =960 PN chips
Result: The start of the pilot PN sequence will be delayed
960 chips x 813.8 nanoseconds per chip = 781.25 Jls
. The quadrature spreading and baseband filtering (not shown),
which are performed as with all the other forward and reverse
code channels, will be discussed later
The pilot channel is sent unmodulated, and it is orthogonally spread with Walsh function zero
(which ensures it is easily recognized). Quadrature spreading and channel filtering occur exactly
as discussed for the forward trafficchannel.
Distinct Pilot Channels are identifiedby a PN offset index (0 through 511 inclusive). This PN
offset index specifies the offset value from the zero offset pilot sequence. The PN offset in chips
for a given pilot PN sequence equals the offset index multiplied by 64.
The zero offset pilot PN sequence is aligned with the beginning of System Time (January 6.
1980at 00:00:00 hrs. Universal Coordinated Time) and with every even-second boundary
thereafter, referred to the base station transmission time (within :tlOJlSof the CDMA System
Time). The sequence itself fits exactly 75 times within a two-second interval.
The starting point of the short PN code (zero pilot PN offset) is the' 1' bit in either the I or the
Q sequence following 15 zeroes. The starting point of the long PN code is the '1 ' bit following
42 zeroes in the sequence. They starting point of the long PN code is aligned with the beginning
of system time.
J
@1998Northern Telecom
All rights reserved
-- - - - -- --
Issue 2.2 - (January 9,1998) Page 3-9
Properties of the Walsh Codes
The Walsh matrixes have the property that every row is orthogonal to every other row and to the
logical negation of every other row.
Orthogonality means that the dot product of two rows is zero. In simpler terms, it means that two
rows are orthogonal if half the bits match and half the bits do not match.
To calculate the dot product between two rows, proceed as follows:
1. XOR each pair of corresponding bits, one from each row, same relative position
(match =0, no match =1
2. Represent each resulting 0 by +1and each ] by -1
3. Add them up. If the rows are orthogonal, the result is zero; otherwise, the result is +N
(all O's) for the dot product of a row with itself or -N (all 1's) for the dot product of a
row with its logical negation, where "N" is the number of bits in the row (the size of
the Walsh code).
)
All rights reserved
. When a Walsh code is XORed chip by chip with
000 0
itself, the result is all O's (100% correlation)
101011:
. When a Walsh code is XORed chip by chip with its .
001 1
.
logical negation, the result is all 1's (-100%
I
correlation)
!
o 1 1 0
. When a Walsh code is XORed chip by chip with
,
any other code or its logical negation, the result is
I
half O's and half 1's (0% correlation)
o 1 0 1 o 1 0 1 o 1 0 1 o 1 0 1
000 0 o 1 0 1 001 1 o 1 1 0
o 1 0 1 o 0 0 0 o 1 1 0 001 1
o 1 0 1 o 1 0 1 o 1 0 1 o 1 0 1
1 1 1 1 1 0 1 0 1 100 1 0 0 1
1 0 1 0 1 1 1 1 1 0 0 1 1 100
Orthogonality (Bit Strings)
)
a = (0, 1, 1, 0) b = (0, 1, 0, 1) -b = (1, 0, 1, 0)
+1 +1 +1
-1
I
a=(+1,-1,-1,+1)
-1
I
b = (+1, -1, +1, -1)
-1
I
-b = (-1 , + 1 , -1 , + 1 )
a. a= (+1)(+1) + (-1)(-1) + (-1)(-1) + (+1)(+1) = 1 + 1 + 1 + 1 = 4
a. b = (+1)(+1) + (-1)(-1) + (-1)(+1) + (+1)(-1) = 1 + 1 -1 -1 = 0
b.(-b) =(+1)(-1)+(-1)(+1)+(+1)(-1)+(-1)(+1)=-1-1-1-1 =-4
a XORa = (0, 0, 0, 0) = 100% match
a XORb = (0, 0, 1, 1) = 50% match &50% no-match
b XOR-b = (1, 1, 1, 1) = 100% no-match
)
Lesson 3: CDMAForward Channels
@1998 Northern Telecom
All rights reserved
- - -
)
)
Issue 2.2 - (January 9, 1998) Page 3-13
Walsh Codes: De-spreading a Signal
(Using the Right Code)
(Original sequence):
Receivedsequence:
Walsh code:
XOR:
. XOR the received sequence with the same
Walsh code used for spreading it
. Perfect synchronization is a must
. If a Walsh code produces uN"a's, the
original bit was a a
. If a Walsh code produces uN"1's, the
original bit was a 1
1.0.0.1.1.0
~!~!~!~!~!~
1 0 1 0;0 1 0 1 ;0 1 0 1 !1 0 1 0 ~ 0 1 0;0 1 0 1
o 1 0 1 b 1 0 1 10 1 0 1 ~ 1 0 1 b 1 0 1 b 1 0 1
i i ! ! !
1 1 1 1 ~ 0 0 OiO 0 0 0!1 1 1 1 N 1 1 1 ~ 0 0 0
'--v--';'---v---1'--v--';'--v--';'---v---1'--v--'
1: 0: 0: 1: 1: 0
Second, we de-spread (decode) the received sequence of chips using the same Walshcode and
integrating (adding up) over the size ofthe Walsh code.
@1998 Nonhern Telecom
All rights reserved
- --
4-Bit Pseudo Noise (PN) Code Generator
')
The problem is that if we use a truly randomstring at one end, how can we reproduce it at the
other end? WeB, we can't. We must use instead a Pseudo Random Bit String (PRBS) which
looks like, and has practicaBythe same statistical distribution. as a truly random bit string, but
which can be generated by means of a relatively simple algorithm.
This diagram iJ]ustratesa simple PRBS generator, also caBed a Pseudo Noise (PN) code
generator, based on a 4-bit register.
The bits in the register rotate counterclockwise, and at the same time some of them are altered by
an XOR operation where indicated by the circJe with the ~ symbol in the diagram.
For example, the bit identified as P2is going to occupy the third, fourth, and first positions in the
next three clock cycles, but as it moves back into the second position, during the fourth clock
cycle, it will be modified by an XOR operation with the bit occupying at that time the fourth
position.
The diagram shows howPI is transformed into Ps when it tries to transition from the first to the
second position while the bits in the second, third and fourth positions transition to the third,
fourth and first positions respectively unmodified.
)
All rights reserved
Issue 2.2 - (January 9, 1998) Page3-17
'}
Alternative Method of PN Sequence Generation
(using a Linear Feedback Register)
Characteristic Polynomial
X4 + X + 1
n-O
Linear Recursion
i(n) = i(n-4) EBi(n-3)
)
The secondmethod, using a "linear feedback register", is equivalent to the first one.
All rights reserved
Correlation, Auto-correlation, and Cross-correlation
Notice the result of XORing the generated PN Code with itself and with its logical negation.
Either case shows 100%correlation.
)
All rights reserved
1 0 0 1 1 0 1 0 1 1 1 1 0 0 0 0
1 0 0 1 1 0 1 0 1 1 1 1 0 0 0 0
XOR: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 1 1 0 1 0 1 1 1 1 0 0 0 0
0 1 1 0 0 1 0 1 0 0 0 0 1 1 1 1
XOR: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
. Ingeneral, the correlationbetweentwo same-lengthbit strings is defined as
the "degree of similarity"betweenthem
. When the correlationis determinedbetweentwo copies of the samestring, it is
called auto-correlation
. Whenthe correlationis determinedbetweenanytwo same-lengthstrings, it is
called cross-correlation
. A PNstring (and, as a matter of fact, any bit string), when correlated (XORed
chip by chip) with an unshiftedcopy of it!=>Alf, shows 100%correlation(the result
is all D's);and whencorrelated(XORedchip by chip) with an unshiftedcopy of
its loaical negation. it shows -100%correlation(the result is all 1's)
CDMA "Short" and "Long" PN Codes
CDMA uses three PN code sequences: two "short" and one "long"
. The two short PN codes (called "I" and "Q") are used for quadrature
spreading to differentiate between CDMA partitions (sectors/cells) in
the forward direction
. The two short codes are generated by 15-bit PN code generators.
The generated strings are 215-1 bits long plus one zero inserted
following the longest string of generated zeroes (32,768); and their
cycle period is 26.666... milliseconds (or 75 times every 2 seconds).
. The long PN code is used for spreading and data scrambling/
randomization, and to differentiate among mobile stations in the
reverse direction.
. The long code is generated by a 42-bit PN code generator. The
generated string is 242-1 with no zero inserted (about 4.4 trillion) bits
long; and its cycle period is approximately 41 days, 10 hours, 12
minutes and 19.4 seconds.
. ThethreeCOMAPN codes are synchronized to the beginning of
system time (January 6, 1980 at 00:00:00 hours)
The long code is used for data scrambling the Reverse Traffic Channels (discussed in Lesson 5).
Although all mobile and base stations use the same long code generator perfectly synchronized,
each mobile station combines the generated long code with a unique mask (based on its unique
Electronic Serial Number or ESN) which produces a unique offset. To prevent the possibility of
the close correlation of two subscribers due to their ESNs being consecutive, the ESN portion of
the maskis permutedina predefinedway.
J
@ 1998Nonhero Telecom
All rights reserved
Pilot Channel Acquisition
PILOT CHANNEL
(Walsh Code 0)
00... 00... 00...Q1 00...Q1 00 1 00...Q1
. The mobile station starts generating the I and Q PN short sequences
by itself and correlating them with the received composite signal at
every possible offset
. Inlessthat 15seconds(typically2to 4 seconds)all possibilities(32,768)
arechecked
. Themobilestationremembersthe offsetsfor whichit getsthe best
correlation(wherethe EJlois the best)
. The mobile station locks on the best pilot (at the offset that results in
the best Ecllo), and identifies the pattern defining the start of the short
sequences (a '1' that follows fifteen consecutive 'D's)
. Now the mobile station is ready to start de-correlating with Walsh
code 32 to extract the Sync Channel (next section)
All rights reserved
--
)
)
Issue 2.2 - (January 9. 1998)
Page3-25
8. Describe the bit pattern of the Walsh code that defines the Pilot Channel
9. Discussthe frame structure of the Pilot Channel.
10. What does a mobile station receive from a base station on the Pilot Channel, and
how often?
11. If the mobile station has the means to generate by itself the "I" and "Q"
sequences that it receives on the Pilot Channel, where is the information?
12. What is a "PN Offset" and what is it used for?
13. How many different PN Offsets are defined in CDMA?
14. What is the position in the short PN code sequences that corresponds to a 0 PN
offset?
15. How long does it take the short PN codes generators to produce the complete
sequence of values?
Course 810- Student Guide
All rights reserved
Issue 2.2 - (January 9. 1998)
Page3-27
Section 3.b: Sync Channel
Objectives
Sync Channel: what is it and how is it generated?
Identify the main modulation parameters associated with the Sync Channel
Convolutional encoders: how do they work?, convolutional encoder used by the Sync
Channel
State and trellis diagrams, code words, and Hamming and free distance of a
convolutional encoder
Role of the Viterbi decoder
Block interleaving scheme used in the Sync Channel
Synch Channel structure
Synch Channel Message format
)
All rights reserved
Issue 2.2 -(January 9. 1998)
Page 3-29
Sync Channel
. Used to provide essential system
parameters
. Used during system acquisition stage
. The bit rate is 1200 bps
. The Sync channel has a frame
duration of 26 2/3ms,
this frame duration matches the
periodof repetitionof the PNShort
Sequences
this simplifiesthe acquisitionof the
Sync Channel once the PilotChannel
has been acquired
. The MobileStation re-synchronizes
at the end of every call
The Pilot channel carries no data, therefore it has no frames.
The Sync channel uses 26 2/3ms frames.
All other forward and reverse code channels use 20 ms frames.
Once a strong Pilot Channel is located, the mobile station listens to the corresponding Sync
Channel for system information. This information, transmitted at a rate of 1200bps, is contained
in the Sync Channel Message which is broken into 26.666... ms frames.
Notice that the duration of the Sync Channel frames coincides with the period of the short PN
codes transmitted on the Pilot Channel. Therefore, once the mobile station acquires
synchronization with the pilot channel, the synchronization with the Sync Channel is immediately
known. This facilitates the acquisition of the Sync Channel by the mobile station.
(
Lesson3: CDMAForwardChannels
All rights reserved
- --
}
)
)
Issue 2.2- (January 9, 1998) Page 3-31
Sync Channel Modulation Parameters
In the COMA Forward Code Channels, each repetition of a
code symbol is called a modulation symbol
Lesson 3: COMA Forward Channels
All rights reserved
Data Rate 1200 Bits Per Second
PN Chip Rate
1.2288
Mega Chips Per Second
Code Rate 1/2
Bits Per Code Symbol
Code Repetition
2
Modulation Symbols. Per Code Symbol
Modulation Symbol Rate
4800
Symbols Per Second
PN Chips / Modulation Symbol
256
PN Chips / Modulation Symbol
PN Chips / Bit
1024
PN Chips / Bit
"
)
)
Issue 2.2 - (January 9.1998)
Page 3-33
exactly the original sequence of judgements but an approximate version including errors? This
will be explored in the following slides, but let's first formally define a convolutional encoder and
then let's take a closer look at how a convolutional encoder works by considering a simple
example.
All rights reserved
)
j
Page 3-35
Step-by-Step Example (Rate 1/2, k=4)
.
.
.
11
Consider a convolutional encoder with rate 1/2 and constraint length 4 (that is, with a register
large enough to accommodate three bits).
Notice that it transitions between a state in which bits 1, 2, and 3 are in the register and 4 is about
to enter, to a state in which bit 1has been dropped from the register which now contains bits 2, 3,
and 4, and where bit 5 is about to enter.
If wejust look at these two states, we miss the most interesting part of the process, which is what
happens during the transition.
All rights reserved
)
J
Step-by-Step Example (step 1)
".
f
I
!
)
']
I
Lets assume that we are using a K=4, Rate 1/2 convolutional encoder to process frames that are:
bits long. Lets not make any assumtions on the initial contents of the register of the convolutional
encoder at this time.
Bit bl enters the register and symbols CO,I and Cl,l are generated combining bl with the previom
contents of the register.
@ 1998 Nonhern Te1ecor:
All rights reserve.
J
t
I
I
I
t
,
I
f
f
t
I
)
)
Page 3-39
Step-by-Step Example (step 3)
e
.. CO,3 CO,2 CO,1
'2
Bit b3 enters the register and symbols CO.3and CI.3 are generated.
Three bits have entered the register and that six code symbols have been generated.
Notice that bI, b2, and b3 remain in the register and will affect the code symbols generated with
the three bits of the next frame.
All rights reserved
Page 3-41
")
State Diagram
0+1+1=0
-'-.
,
.
.
,
",
'0 -'....
01 .....
'_"-
.
.
.
......
.
.
.
,
' ...-
0+1=1
1
00
....
On the left side, we have illustrated the transition of the convolutional encoder register from the
state' 1,1' to the state '0,1 ", by entering a '0', which results in the generation of a '0' and' 1'.
To the right we have a "state diagram" representing all possible states of the register, all possible
transitions, and all the corresponding outputs. The register states are represented by circles.
When the register is in any state, either a '0' or a '1' can be entered. Each case is represented by
an arrow which points to the new state of the register after a '0' or a '1' is entered.
Besides each arrow, in a bolder font, the two code symbols generated during the transition are
represented.
Notice that the rectangle in the state diagram surrounded by the discontinuous rectangle
corresponds to the transition illustrated on the left side of the slide.
)
All rights reserved
Issue 2.2 -(January 9, 1998)
Page 3-43
')
Trellis Diagram
10
00
01
10
11
11
If the tree created in the previous slide is repeated "ad infinitum", the resuJt is a particular type of
tree in which not only a branch bifurcates into two (or more) branches, but also in which two (or
more) branches can merge into one. This special type of tree is called a "trellis diagram".
The term "trellis diagram" was coined by G. D. Forney Jr. in its 1970 paper "Coding and its
Applications in Space Communications" published in IEEE Spectrum (7,47-58).
)
Course 810 - Stlldent Guide
All rights reserved
-- -
00
,0 00
1
11
01
Hamming and Free Distance
000000 00
000001 00
00001000
000011 00
valid code words: 26 = 64
. . .
~ .......
. . .
11-10-00-10-00-01-01-10 101011100
one-to-one
11110100
11111000
11111100
26 = 64 r
-- ..",
number of possible received
16-bit sequences:
2 16 = 65,536
For each possible bit sequence in a frame, there is one and only one valid path in the trellis
diagram (and therefore, one and only one valid codeword).
Given any two valid codewords, they will differ in a number of bits. It would then be possible to
transformone into the other by a succession of changes involving one bit at a time. The minimum
number of such one-bit changes necessary to transform one codeword into another is defined as
the "Hamming distance" between the two codewords (and the same term is used when
comparing a received pattern with a valid codeword).
The minimum Hamming distance between any two codewords for a particular convolutional
encoder is called its "free distance", The larger this value, the more bits must be in error before
one codeword (received with errors) may be mistaken for another.
Because of the transmission errors, many more bit patterns could be received that the number of
valid codewords. If the number of bit errors is less than the free distance, the received pattern will
resemble the original valid codewords more than any other (that is, the Hamming distance
between the received pattern and one of the original valid codeword will be minimal).
)
Therefore, by choosing a convolutional encoder with a good free distance value, it should be
possible to guess with a high degree of accuracy the valid codeword corresponding to a received
invalid (due to transmission errors) pattern.
All rights reserved
(
I
Sync Channel Block Interleaver (Input Matrix)
The Sync Channel uses a block interleaver spanning 2621)ms, which is equivalent to 128
modulation symbols) at the symbol rate of 4800 sps. These symbols are arranged in a 16rowby 8
column array.
The input (array write) sequence is shown in the figure above. Symbols are written down by
columns, from left to right. Positions with the same number denote repeated symbols.
The arrows show how the read array, appearing in the next page, is built. This technique for
interleaving the Sync Channel symbols is sometimes described as a "bit reversal" method.
@ 1998 Nonhern Telecom
All rights reserved
9 25 41 57
1 9 25 41 49 57
2 10 18 26 34 42 50 58
2 10 18 26 34 42 50 58
--.....
11 19 27 35 43 51 59
11 19 27 35 43 51 59
12 20 28 36 44 52 60
12 20 28 36 44 52 60
13 21 29 37 45 53 61
5 13 21 29 37 45 53 61
6 14 22 30 38 46 54 62
14 22 30 38 46 54 62
15 23 31 39 47 55 63
7 15 23 31 39 47 55 63
8 16 24 32 40 48 56 64
8 16 24 32 40 48 56 64
The output (array read) sequence is shown in the figure above. Symbols are read down by
columns, fromleft to right.
Notice that when the symbols are restored to their original order, the effect of the noise burst is
spread. The possibly corrupted symbols are not consecutive any longer and the error correction
mechanisms have a better chance to correct them.
)
All rights reserved
Issue 2.2 - (January9. 1998) Page3-49
-, Sync Channel Block Interleaver (Block Restored)
I
I
1 9 17 25 33 41 49 57
1 9 17 25 33 41 49 57
2 10 18 26 34 42 50 58
2 10 18 26 34 42 50 58
3
(IT) (fi) <E)
35
<E) <])
3 11 19 27 35 43 51 59
4 12 20 28 36 44 52 60
4 12 20 28 36 44 52 60
5 13 21 29 37 45 53 61
5 13 21 29 37 45 53 61
6 14 22 30 38 46 54 62
6 14 22 30 38 46 54 62
<:i><l1>(II)
31
63
7 15 23 31 39 47 55 63
8 16 24 32 40 48 56 64
8 16 24 32 40 48 56 64
Ii
')
)
Page 3-51
Sync Channel Acquisition
PILOT CHANNEL
(Walsh Code 0)
00... 00...
o o
SYNC CHANNEL
(Walsh Code 32)
00...(11 00...01 00...(11
~
!
.
.
.
.
.
.
.
LEN
208 bits
All rights reserved
8 bits
.........
-,
Sync Channel Message Parameters
)
. Message Type (MSG_TYPE) - Identifies this message and determines
its structure (set to the fixed value of '00000001 ')
. Protocol Revision level (P_REV) - Shall be set to '00000001'
. Minimum Protocol Revision level (MIN_P_REV) - B-bit unsigned
integer identifying the minimum protocol revision level required to operate
on this system. Onlypersonal stations that support revision numbers
greater than or equal to this field can access the system
. SystemID(SID) - 15-bit unsigned integer identifying the system
. Network ID(NID) - 16-bit unsigned integer identifying the network within
the system(definedby the owner of the SID)
. Pilot PNSequence Offset Index(PilOT_PN)- Set to the pilotPN offset
for the base station(in units of 64 chips), assigned by the network planner
. long Code State (lC_STATE) - Providesthe mobile stationwith the
basestation longcode state at the time given by the SYS_TIME field,
generateddynamically
. System Time (SYS_TIME)- GPSsystem-widetime as 320 ms after the
end of the last superframecontainingany part of this message, minus the
pilot PNoffset, in units of BOms, generateddynamically
. leap Seconds (LP_SEC) - Number of leap seconds that have occurred since
the start of systemtime (January6, 1980at 00:00:00hours) as given in the
SYS_TIMEfield, generateddynamically
. local TimeOffset(l TM_OFF) - Two's complement offset of local time from
systemtime in unitsof 30 minutes,generateddynamically
Current local = SYS_TIME - LP_SEC + LTM_OFF
. Daylight savingstimeindicator (DAYLT) - Determined by the network
planner
1 if daylight savings in effect in this base station
0 otherwise
. Paging Channel Data Rate (PRAT) - The data rate of the paging channel for
this system, determined by the network planner
00 if 9600 bps
01 if 4800 bps
. CDMAFrequency Assignment (CDMA_FREQ) - The COMAchannel
number, in the specified COMA band class, corresponding to the frequency
assignment for the COMA Channel containing a Primary Paging Channel,
determined by the network planner
)
All rights reserved
\
)
All rights reserved
)
- - --- . -- - _.-- -------
7. What else determines the output of a convolutional encoder?
8. What type of convolutional encoder is used for the SyncChannel generation?
9. The O'sand l's input in a convolutionalencoder are called
from it are called I12l.;and each repetition of [b] is called
10. What kind of symbol repetition is used in the Sync Channel?
@L; those output
ll.
11. How large is the block interleaver array used by the Sync Channel?
12. What does the base station send to the mobile stations on the Sync Channel?
13. Explain the difference between Sync Channel frame and superframe.
14. Howmany frames and superframes does it take to carry a Sync Channel
Message?
All rights reserved
Page 3-59
}
Section 3.c: Paging Channels
Objectives
Paging Channels: What are they used for and how they are generated?
Main modulation parameters associated with the Paging Channels.
Block interleaving in the Paging Channels.
Scrambling, "mask", Paging Channel structure.
"Slot cycle" and "Slot Cycle Index"; "Slotted" and "Non-Slotted" modes of operation
How does the mobile station determine which Paging Channel to listen to?
Overhead and Mobile-Directed Messages, selected Paging Channel messages
Message Acknowledgment procedure in the forward direction
Paging Message Addressing, IMSI, TMSI, and Paging Classes
Authentication and SSD update procedures
)
All rights reserved
-,
)
)
Page3-61
Paging Channel Generation
Walsh
Function 1-7
/PN
. There are 192 [96]bits (9600 [4800] bps x 0.020 second) inone Paging
Channel frame
. The Rate 1/2 convolutionalencoder doubles the bit rate, resulting"384 [192]
code symbols ina Paging Channel frame
. Ifthe 4800 bps rate is used, the repetition process doubles the rate again, so
that, at either rate, 384 modulationsymbols per Paging Channel frame result
. 384 modulation symbols per frame times 50 frames per second = 19.2 Ksps
. One copy of Walsh code #1 (or #2, ... or #7) is used to spread each modulation
symbol. Thisresults ina x64rateincrease to 1.2288Mcps
that is, 24,576 chips per Paging Channel frame, or 128 [256]chips per
original bit at 9600 [4800] bps
The Paging Channel is encoded, interleaved, spread and modulated in 20 ms frames.
In the Paging Channels, the convolutional encoder is not "flushed" with zeroes at the end of each
frame. Therefore. the last 8 bits of a Paging Channel frame influence the first 18(for 4800 bps) or
36 (for 9600 bps) modulation symbols generated from the first 8 bits of the foHowingframe.
The Paging Channel Data is scrambled using the long PN code sequence offset by a 42-bit mask
(see next sHde).
The Paging Channel is orthogonaHyspread by the Walsh function with index equal to the Paging
Channel number.
The Paging Channel is then "quadrature spread" and "filtered" (discussed later).
All rights reserved
R = 112,K= 9 19.2 19.2
Scrambling
9600 bps
I Convolutional
Ksps
Block
Ksps
4800bps Encoding & Interleaving
. Repetition
1.2288
Mcps
1.2288
119.2
PagingChannel
.t Long PN Code IMsps .
Ksps
Address Mask Generator -- Declmator.
J
)
Page 3-63
9600 bps Block Interleaver (Input Array)
The Paging Channels and the Forward Traffic Channels (discussed in the next section) use
identical block interIeavers, spanning 20 ms, which is equivalent to 384 modulation symbols at
the rate of 19200 symbols per second.
The input (array write) and output (array read) symbol sequence are shown in the illustration in
this and the following pages.These tables are read down by columns from left to right. In these
tables, symbols with the same number denote repeated symbols.
All rights reserved
......
16 Coumns
.-
j
1 25 49 73 97 121 145 169 193 217 241 265 289 313 337 361
2 26 50 74 98 122 146 170 194 218 242 266 290 314 338 362
3 27 51 75 99 123 147 171 195 219 243 267 291 315 339 363
4 28 52 76 100 124 148 172 196 220 244 268 292 316 340 364
5 29 53 77 101 125 149 173 197 221 245 269 293 317 341 365
6 30 54 78' 102 126 150 174 198 222 246 270 294 318 342 366
7 31 55 79 103 127 151 175 199 223 247 271 295 319 343 367
8 32 56 80 104 128 152 176 200 224 248 272 296 320 344 368
9 33 57 81
105 129 153 177 201 225 249 273 297 321 345 369
10 34 58 82 106 130 154 178 202 226 250 274 298 322 346 370
UJ 11 35 59 83 107 131 155 179 203 227 251 275 299 323 347 371
12 36 60
84 108 132 156 180 204 228 252 276 300 324 348 372
13 37 61 85 109 133 157 181 205 229 253 277 301 325 349 373
C\/ 14 38 62
86 110 134 158 182 206 230 254 278 302 326 350 374
15 39 63 87 III 135 159 183 207 231 255 279 303 327 351 375
16 40 64
88 112 136 160 184 208 232 256 280 304 328 352 376
17 41 65 89 113 137 161 185 209 233 257 281 305 329 353 377
18 42 66 90 114 138 162 186 210 234 258 282 306 330 354 378
19 43 67 91
115 139 163 187 211 235 259 283 307 331 355 379
20 44 68 92 116 140 164 188 212 236 260 284 308 332 356 380
21 45 69 93 117 141
165 189 213 237 261 285 309 333 357 381
,
22 46 70
94 118 142 166 190 214 238 262 286 310 334 358 382
23 47 71
95 119 143 167 191 215 239 263 287 311 335 359 383
24 48 72
96 120 144 168 192 216 240 264 288 312 336 360 384
..
. The 384 modulation symbols in a frame are input into a 24 by 16
block interleaver array (read down by columns, from left to right)
. The array represents a 20 ms interval worth of information
-,
)
)
Page 3-65
9600 bps De-interleaving
16Columnc .
1 25 49 73 97 121 145 169 193 217 241 265 289 3]3 337 361
2 26 50 74 98 ]22 ]46 ]70 ]94 2]8 242 266 290 3]4 338 362
3 27 5] 75 99 ]23 ]47 ]71 ]95 2]9 243 267 29] 3]5 339 363
4 28 52 76 ]00 ]24 ]48 ]72 ]96 220 244 268 292 3]6 340 364
5~125~22]~317~
6~~126~~222~~318~
7 31 55 79 103 127 ]5] ]75 ]99 223 247 27] 295 3]9 343 367
8 32 56 80 ]04 128 ]52 176 200 224 248 272 296 320 344 368
9 33 57 81 105 129 153 177 20] 225 249 273 297 321 345 369
10 34 58 82 106 130 154 178 202 226 250 274 298 322 346 370
11 35 59 83 107 131 155 179 203 227 251 275 299 323 347 371
~
o 1 60 84 1 8] ] ] 2 4 2 8 252
~
6 300 3 4 348 372
... 61 253 349~
~ 'I 62 ] 1] 2 254 350 ~-
15 39 63 87 III ] 35 159 ]83 207 23] 255 279 303 327 351 375
]6 40 64 88 112 136 160 ]84 208 232 256 280 304 328 352 376
]7 41 65 89 113 137 16] ]85 209 233 257 28] 305 329 353 377
18 42 66 90 114 138 162 186 210 234 258 282 306 330 354 378
19 43 67 91 115 ]39 163 187 211 235 259 283 307 331 355 379
~ JA.. 68 ~.I.W..!JQ.. 1M. 188 m.. ~ ~ 284 ~ ~ M2. 380
~69~189~285~381
22 46 70 94 118 142 166 190 214 238 262 286 310 334 358 382
23 47 71 95 119 ]43 167 191 215 239 263 287 311 335 359 383
24 48 72 96 120 144 168 192 216 240 264 288 312 336 360 384
Notice how the effect of the burst of noise is spread over the transmittedblock
All rights reserved
Masks
modulo 2 addition (same as XOR)
New PN
sequence
A mask consists of a register with the same number of bits as in the register of the PN Code
generator, containing an arbitrary FIXED value.
First the bits in the mask are ANDed with the corresponding bits in the PN Code generator
register. Then the bits resulting of this operation are added together (modulo-2) to produce a
single bit.
If this operation is repeated for each state of the register, a new sequence of bits is generated
which shows an interesting property.
)
All rights reserved
,.
o 0 1
1 1 0 0
o 1 1 0
o 0 1 1
1 1 0 1
101 0
o 1 0 1
1 1 1 0
o 1 1 1
1 1 1 1
1 0 1 1
1 0 0 1
1 000
o 1 0 0
001 0
000 1
T
Masks (Example 2)
without mask: (1,,--0 0 1 1
with mask 1100: 0)11 0 0 1
o 1 011
10101
1
1
1 0 0 0)
1 100
In this secondexample,wehaveselectedthe mask' 1100' andrepeatedthe process.Noticethat
the value of the bit generated with the mask again cycles through the same sequence of values as
the first register bit but now with an offset of I bit.
The same thing happens with every possible mask value: the use of a mask results in the same
sequence being generated but with a different offset which depends on the mask being used.
)
All rights reserved
1 1 0 0 - o 1 1 0 - o 0 1 1 - 1 1 0 1 1 0 1 0
-
--
1 1 0 0 1 1 0 0 1 1 00 1 100 1 1 00
1 1 0 0 01 0100 1 1 0000'
01
1'100
01
1 0 00 1 I
l...0101 1 1 1 0 o 1 1 1 1 1 1 1 1 0 1 1
-
-- - -- -
1 1 0 0 1 1 0 0 1 1 0 0 1 100 1 1 0 0
o 1 00
1 I
1 1 0 0
01
o 1 00
1 I
1 100
01
1 000
1 I
-1001 - 1 000 - o1 0 0 -001 0 - o 0 0 1
1 1 0 0 1 1 0 0 1 1 0 0 1 100 1 1 0 0
1 000
1 1
1 000
1 I o 1 00 1 I 0000
01
0000 01
Issue 2.2 -(January 9.1998) Page 3-71
}
Paging Channel Structure
"I R = 9600 or 4800 bps
Slot Channel 0
163.84 s. 163.84 x R bits
Maximum Paging Channel Slot Cycle
2048 slots
Slot Channel "n"
as reqUite,
(1) First new capsule in slot, Synchronized Capsule
(2) Unsynchronized Capsules
(3) Synchronized Capsules
SCI : Synchronized Capsule Indicator
)
The PagingChannel is logically divided in 80 ms slots. Each slot is composedof four 20-ms
PagingChannel frames, eachsubdivided into two 10-ms half-frames. The first bit in any half
frame is a Synchronized Capsule Indicator (SCI). This bit is set to "1" to indicate that the initial
segmentof a messagecapsuleimmediately follows; otherwise, the SCI bit is set to "0".
A PagingChannel MessageCapsule is composedof a Paging Channel Messageandpadding. A
PagingChannel Messageconsistsof a length field, a messagebody, and a CRC field. Padding
consistsof zero or more "0" bits. The messagecapsule is subdivided into small pieces,eachfitting
th~ rest of a half frame (called a Half Frame Body).
The base station may transmit synchronized or unsynchronized Paging Channel message
capsules. A synchronized message capsule starts on the second bit of a half frame. An
unsynchronized message capsule begins immediately after a previous message capsule.
If, after the end of a Paging Channel message, there remain fewer that 8 bits before the next SCI
bit, thebasestationmay transmit an unsynchronized messagecapsuleimmediatelyfollowingthat
message. The base station will not include any padding bits in a message capsule that is followed
by anunsynchronizedmessagecapsule.
)
NOTE: Any message sent by the base station on the Paging Channel must be completely
contained in one or two consecutive Paging Channel slots.
All rights reserved
Page 3-73
Extended Neighbor List Message - Includes the PN offset of each Pilot Channel that the mobile
., station should place in its Neighbor Set.
Global Service Redirection Message - This message is used by the base station to redirect the
mobile stations to another system for service.
)
)
All rights reserved
"
,
)
)
Issue 2.2 - (January 9. 1998) Page 3-75
MULTI NIDS - Multiple NID storage Indicator. If the mobile station may store entries of
SID_NID_LIST having the same SID (with different NIDs), the base station sets this field to '1';
otherwise, the base station sets this field to '0'.
BASE ID - This base station identificationnumber
BASE_CLASS - '0001' indicating that this is a Public PCS System
PAGE CHAN -Number of Paging Channels on this CDMA Channel in this base station (cannot
be '000')
MAX_SLOT_CYCLE_INDEX - Maximum value permitted for the Slot Cycle Index in this
base station
RESCAN - '1' if the mobile stations are to re-initialize and re-acquire the system upon receiving
this message; '0' otherwise
EXT SYS PARAMETER - '1 if the base station sends the "Extended System Parameters - -
Message" on the Paging Channel; '0' otherwise
EXT NGHBR LIST - '1' if the base station sends the "Extended Neighbor List Message" on - -
the Paging Channel; "0" otherwise
GLOBAL REDIRECT - ' 1' if the base station is sending the "Global Service Redirection
Message" on the Paging Channel; '0' otherwise
RESERVED - Reserved bit. Set to '0'.
All rights reserved

CDMA Forward Channels1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CDMA Forward Channels1

Uploaded by

Copyright:

Available Formats

/

You might also like