CDMA Cellular System

EE5401 Cellular Mobile Communications EE5401 Cellular Mobile Communications
CDMA systems are different in terms of

CDMA Cellular System
- Reuse factor is 1.
Earlier lecture on cellular system mainly for - The capacity of CDMA systems is interference limited,
FDMA/TDMA systems, i.e., reuse factor > 1. whilst it is bandwidth limited in FDMA and TDMA.
Hence, any reduction in the interference will cause an
- We determine the cochannel cell interference based on increase in the capacity. Alternatively, this means that
the desired SIR for a given modulation technique. if the number of users decreases, the link performance
will be improved for the same transmit power.
- Path loss model come into picture when determining the
received signal power and the interference powers from (a) Asynchronous short code
from co-channel cell. User in the same cell does not
interfere the referenced user because they use different
time slots or frequencies to transmit.
- For example, if only first tier and no sectorization,
R−n
SIR = 6 −n
∑ Di
i =1
- Conversely, if a minimum SIR is given, the cluster size

N can be determined. The total number of available
voice channels then split among these cells within a (bit asynchronous but chip synchronous)
cluster, and this is the total number of handover/newly
generated calls that each cell can handle. Alternative way of representing the evaluation process
⎛1 " [−1 + 1 + 1 − 1 + 1 − 1 + 1] [−1 + 1 + 1 − 1 + 1 − 1 + 1] " " "⎞
- We demostrated the use of Erlang B table for newly ⎜ ⎟
⎜2 " " " [ −1 + 1 − 1 − 1 + 1 + 1 + 1] [+1 − 1 + 1 + 1 − 1 − 1 − 1] "⎟
generated traffic. A more complete scenerio is to ⎜3 ⎟
⎝ [−1 + 1 + 1 − 1 - 1 + 1 − 1] [−1 + 1 + 1 − 1 − 1 + 1 − 1] " " " ⎠
include the handover traffic.
Tx " " " −1 −1 +1 − 3 +1 +1 + 3 +1 − 3 + 3 −1 " "
- Resource management – newly generated vs handover Rx 2 " " " [−1 + 1 − 1 − 1 + 1 + 1 + 1] [−1 + 1 − 1 − 1 " "
traffic (dropped call probabilities), maintaining GoS Despread [ +1 − 1 − 1 + 3 + 1 + 1 + 3] [−1 − 3 + 2 + 1 " " "
(blocking probability) and qaulity-of-service QoS (such +7
as, packet loss probabilities, delay constraints etc) will decode as bit +1
Institute for Infocomm Research 128 National University of Singapore Institute for Infocomm Research 129 National University of Singapore
(b) Synchronous short code In the downlink, BS is capable of synchronizing the

transmission of all the users’ signals, such that the symbol
durations are aligned with each other. Such a scenario is
known as symbol (bit) synchronous transmission.
Designing for perfectly orthogonal code in this case is
simple since the use of short code is sufficient. However,
there will still be interference from users in neighboring
cell BSs. Further, the presence of multiple paths could
distort the orthogonality.
Short code cannot be used in uplink since orthogonality

cannot be achieved when transmission is asynchronous
(no coordination in the transmission of users’ signals).
Long codes such as PN sequences perform much better
but perfect orthogonality cannot achieve for such codes.
Alternative way of representing the evaluation process Example to show why short code cannot be used in
symbol asynchronous transmission.
Consider two orthogonal Walsh codes
[1 1 − 1 − 1] and [1 − 1 − 1 1]
Data transmit is A=[1 1 ... ] B=[-1 1 1...]
If bit synchronous transmission,
⎛1 1⎞ ⎛" 0 2 "⎞
⎜ ⎟ ⎜ ⎟
⎜ 1 − 1⎟⎛ " 1 1 " ⎞ = ⎜ 2 0 ⎟
⎜ ⎟
⎜ − 1 − 1⎟⎝" − 1 1 "⎠ ⎜ ⎟
0 −2
⎜ ⎟ ⎜ ⎟
⎝ −1 1 ⎠ ⎝" − 2 0 "⎠
At the receiver, Consider Walsh codes [1 1 − 1 − 1]

⎛" 0 2 "⎞
Data transmit is [1 1 ... ]
⎜ ⎟
⎛1 1 − 1 − 1⎞⎜ 2 0 ⎟ = ⎛" 4 4 " ⎞
⎜
1 − 1 − 1 1
⎟⎜
0 − 2 ⎟ ⎜⎝" − 4 4 "⎟⎠ At the receiver, due to multipath (assume no phase
⎝ ⎠
⎜ ⎟ change and only power split in 9:1)
⎝" − 2 0 "⎠
If transmission is bit asynchronous but chip ⎛ + 0.9 + 0.9 − 0.9 − 0.9 + 0.9 + 0.9 − 0.9 − 0.9 ⎞
⎜ ⎟
synchronous, offset by a chip period for user B ⎝ + 0.1 + 0.1 − 0.1 − 0.1 + 0.1 + 0.1 − 0.1 − 0.1⎠
⎛ A " +1 +1 −1 −1 +1 +1 −1 −1 " ⎞ ⎛ + 0.9 + 1.0 − 0.8 − 1.0 + 0.8 + 1.0 − 0.8 − 1.0 ⎞
⎜ ⎟ A chip of ⎜ ⎟
⎜ B −1 +1 + 1 − 1 + 1 − 1 − 1 + 1 + 1 ⎟ ⎝ + 3.7 + 3.6 ⎠
⎜ ⎟ previous Multipath reduces the received SNR if conventional
⎜ Tx +2 + 2 − 2 0 0 0 0 0 ⎟⎠ bit
⎝ single user detector is used.
A " +1 +1 − 1 − 1 + 1 + 1 − 1 − 1 "
N 0.9 Channel
(∑ ) 6 0) Multiple
1
0.1
At the receiver, an error may occur due to loss in
orthogonality of the short code.
Multipath interference is always present in both the

forward and reverse link. Multipath interference is due
to the different arrival times of the same signal via the
different paths at the receiver (also known as self-
interference). This is analogous to the signals
transmitted from other users and generates interference.
Hence, multipath interference is normally analyzed in
the same way as MAI.
For asynchronous uplink, taking user 0 as reference and - If Pk is the received power of user k at the receiver of
the delay of user k relative to user 0 is given by user 0, interference due to kth user is given by
τ k = γ k Tc + Δ k , 0 ≤ Δ k < Tc P
I k = k cos ϕk ×
2
c0,i c 0,i +G −1 ⎧⎛ j −1 j + G −γ −1 k ⎞
User 0
Tb = GTc ⎨⎜⎜ bk , −1 ∑ ck ,l c0,l + i − j +γ +bk ,0 ∑ ck ,l c0,l + i − j +γ ⎟⎟(Tc − Δ k )
⎩⎝ ⎠
k k
l = j −γ
k l= j
b0,0
γ k Tc ⎛ j −1 j + G −γ k − 2 ⎞ ⎫
+ ⎜⎜ bk , −1 ∑ ck ,l c0,l + i − j +γ +1 +bk , 0 ∑ ck ,l c0,l + i − j +γ +1 ⎟⎟Δ k ⎬
User k bk ,−1 τk bk ,0 ⎝ l = j − γ −1
k
k
l= j
k
⎠ ⎭
Δk ck , j Pk
= Tc cos ϕ k × Wk (1)
ck , j −γ k −1 2
- For a total of K users, decision statistic is given by
r (t ) K −1
T
∫0 dt
Z 0 = s0 + ∑ I k + n0
k =1
K −1
- The summation term ζ = ∑ I k gives the multiple access
interference (MAI). Assume k =1 I s are all independent of
cos( 2πf c t ) c0, i " " c0, i +G −1 k
each other. If the number of users is sufficiently large,
apply central limit theorem, the decision statistic is
modeled to be a Gaussian random variable.
c0 ,1 c0, 4
Δk ⎡ P ⎤ P
E [I k ] = E ⎢TcWk k cos ϕ k ⎥ = Tc k E[cos ϕ k ]E[Wk ] = 0
Tc
c0,1 c0 ,4
c k ,n c k ,n +1 c k ,n + 4
⎣ 2 ⎦ 2
Δk
ck , n c k , n +1 ck , n + 4 2 2
⎡⎛ Pk ⎞ ⎤ Tc 2 Pk
2
2
σ I = E[ I k ] = E ⎢⎜⎜ TcWk cos ϕ k ⎟⎟ ⎥ = E[cos 2 ϕ k ]E[Wk ]
c0,1 c0, 4 k
⎢⎣⎝ 2 ⎠ ⎥⎦ 2
(Tc − Δk )
c k, n ck , n +1 c k ,n + 4 2π 1 1
E[cos 2 ϕ k ] = ∫0 cos 2 φ ⋅ dφ =
2π 2
- Now examine only the Wk term defined in (1). Since all K −1 GTc
2 K −1
the a ’s take only 1 or –1 equally, Wk only takes on σ ζ 2 = ∑ E[ I k 2 ] = ∑ Pk

k =1 6 k =1
discrete values. Performing some manupulation to the
expression of Wk , and using the following results: - The desired detected signal has mean given by
1
Tc
T P
E [Δ k ] = ΔdΔ = c s0 = 0 b0,0Tb
∫
Tc 0 2 2
- Can show that in general
[ ]
Tc 2
2 1 T
E Δk = ∫ Δ2 dΔ = c 2
GTc K −1 NT
Tc 0 3 Variance of interference = ∑ Pk + 0 b
2a k =1 4
It can be proved that 1
- where a is constant determine by
[ ]
2
2 2G T PG
E Wk = , or σ I2 = c k a =3 (chip and phase asynchronous) – previous derived
3 k
6
a =1 (chip and phase synchronous)
- Here the expectation is taken over all values of ϕ k , Δ k
and b (bits). a =2 (chip synchronous and phase asynchronous) –
1 Reference
adopted
- for the proof can be found in Textbook,
Appendix C and “Smart antennas for Wireless a =1.5 (phase synchronous and chip asynchronous)
Communications” by Joseph C Liberti and T.S - For adopted case, i.e. chip synchronous and phase
Rappaport, pp.305). asynchronous
- Now go back to the MAI component when detecting the GTc
2 K −1
N 0Tb
information of user 0. Variance of interference =
4
∑ Pk + 4
k =1
⎡⎛ K −1 ⎞ 2 ⎤ ⎛ ⎡ K −1 ⎤ ⎞ 2
σ ζ 2 = E[ζ 2 ] − ( E[ζ ]) 2 = E ⎢⎜ ∑ I k ⎟ ⎥ − ⎜ E ⎢ ∑ I k ⎥ ⎟ The bit error rate is therefore given by
⎢⎣⎝ k =1 ⎠ ⎥⎦ ⎝ ⎣ k =1 ⎦ ⎠ ⎛ P0 2 ⎞
⎜ Tb ⎟ ⎛ ⎞
⎡⎛ K −1 ⎞ 2 ⎤ ⎛ K −1 2
⎞ K −1K −1 ⎜ 2GP0 ⎟
= E ⎢⎜ ∑ I k ⎟ ⎥ − ⎜ ∑ E[ I k ] ⎟ = ∑ ∑ E[ I k I l ] Pe = Q ⎜ 2 ⎟ = Q⎜ ⎟
⎜ GTc2 N 0Tb ⎟ K −1
⎣⎢⎝ k =1 ⎠ ⎦⎥ ⎝ k =1 ⎠ ⎜ ∑ Pk + N 0W ⎟
k =1 l =1 K −1
⎜ ∑ Pk + ⎟ ⎝ k =1 ⎠
⎝ 4 k =1 4 ⎠
Assume that the terms I k are independent, i.e.,
E[ I k I j ] = E[ I k ]E[ I j ] = 0 , this leads to
where G = Tb / Tc = W / B and B = 1 / Tb = Rb is the Power Control

(unspread) signal bandwidth, Rb is the data rate, W is
the spread signal bandwidth. Unless otherwise stated, we will assume that
- If the number of users K is large, then thermal noise is - Single user detector is used. Power control is necessary
negligibly small. to avoid near far problem – each mobile must achieve
⎛ ⎞ the required SNR to achieve its pre-specified
⎜ ⎟
P performance (normally specified as minimum BER).
Pe ≈ Q⎜ 2G ⋅ K −1 0 ⎟ = Q( 2Gγ )
⎜ ⎟ - Omni-directional antennas are used in both mobiles and
⎜ ∑ Pk + N 0W ⎟
⎝ k =1 ⎠ BS. This affects how the amount of interference imposed
Pp on a referenced user.
where γ p = K
is defined as the signal-to- - Thermal noise is less significant if number of MSs is large.
∑ Pk + N 0W
k =1
k≠ p Power control is needed
interference plus noise ratio (SINR) for user p.
- CDMA allows all MSs to access the common bandwidth
- For BPSK, another way of viewing this is to define without setting time slots or frequency bands.
Eb P P - Power control is to maintain the required link QoS by
= Gγ p = G ⋅ K −1 0 =G 0
NI N IW adapting to MS movements and also the statistical
∑ Pk + N 0W variations in radio propagation paths. This helps to
k =1
mitigating interference to increase the system capacity.
Eb / N I is defined at the output of matched filter whilst
SIR at the front end of the receiver. - Without power control and simply let all MSs transmit
at same power, their signals will arrive at BS with
(Note: in AWGN, Eb / N 0 is defined as SNR and BER is vastly different power levels – near-far effect.
given by Q( 2SNR ) , but here we just called it Eb / N I to - When an user transmits at excessive power level, its
distinguish from SIR or SINR defined in CDMA system) performance gets improve but will degrade the
K −1 performance of other MSs. Others will try to increase
N I W = N 0W + ∑ Pk their transmit power to restore their link reliability, and
k =1
hence results in “unhealthy” competition among all MSs
are not properly co-ordinated.
- In the uplink, power control is to minimize power

consumption and prolong the battery operating time.
User i
An example : centralized power control algorithm User 2 gii
gi2
- Requires the knowledge of all the radio link gains.
- If feasible solution exists, it gives the optimal solution gi1
for the power control problem. This solution can become g ij
a performance measurement criterion. MS
User 1
- We consider a cellular system with N BSs and M MSs. BS
The transmitted power of MS k is denoted by Pk and the User j
M dimensional vector P is the transmitted power
vector to be determined. - The CIR of mobile i at its base station is given by
2
- We consider the ith MS (referenced) communicates with Pi gii
BS nearest to it. The BS is then also labeled as i. The γi = M 2
, 1≤ i ≤ M
link gain between the i th BS and the j th MS is denoted ∑ Pj gij + N 0W
j =1
by gij . Then gii corresponds to the desired radio links, j ≠i
whereas gij corresponds to the unwanted interference or can be rewritten as
links.
Pi
- The link gain gij depends on the path loss model, γi = M
, 1≤ i ≤ M ,
lognormal fading and fast fading component. ∑ Aij Pj + N 0W
j =1
j ≠i
- Assuming that MS i knows which BS it is connected to
(an example is by connecting each MS to the nearest ⎧⎪ g g 2 ; i ≠ j
BS). Its channel gain to that BS is defined as g ii . If MS where Aij = ⎨ ij ii
2 also connects to BS i, then we have g i 2 = g 22 , g i1 = g 21 , ⎪⎩ 0; i= j
g ij = g 2 j , …
- There exists a SNR threshold γ i * that must be achieved
(i.e., in the example, the BS has two identities, 2 and i) by each individual MS to ensure certain level of receiver
Note: sometimes g is used to represent path loss, but sometimes is used as voltage gain. In
performance. For two different MSs, this threshold
the following, we use it as voltage gain.
needs not be the same.
γ i ≥ γ i * for 1 ≤ i ≤ M - In practical system, a combination of open- and closed

loop control can be used.
- Repeat writing down the relationship for all MSs. We
can solve for all powers using the M simultaneous Non-ideal power control
equations.
- For perfect power control, the transmitter power should
Power control is less critical in the forward link if power
be identical to the inverse channel variation. However,
consumption is not the main issue. This is because
due to fast signal fading variations in the channel and
orthogonal short codes are used and transmission is
the control loop delay, the transmit signal power does
symbol synchronous. However, power control still helps
not follow the inverse channel variations. As a result,
in reducing interference picked up by MSs in
there is a significant residual fading in the received
neighboring co-channel cells and the effect of resolvable
signal after power control.
multipath.
From the implementation point of view, power control - In practical system, the received signal power variation
can be classified into two classes in the BS after power control are approximated by a
lognormally distributed. Through experimental data,
Open loop: The forward and reverse links are assumed the standard deviation of the lognormal distribution is
to be symmetric. For example, in this ideal case, MSs about 1 to 2 dB.
can determine its uplink transmited power according
to its downlink received power. This method only
suitable for the case where path loss and shadowing
which affect the signal propagation change relatively
slow and exhibit reciprocity in the forward and reverse
link.
Closed loop: BS provides continuous feedback to each

MS so that the MS varies transmit power accordingly.
Depending on the speed at which power level control is
performed, closed loop control is used to compensate
either for fast fading + lognormal shadowing or
lognormal fading.
- More accurate analysis should consider co-channel

Reverse link Capacity interference, AWGN, imperfect power control,….
Voice activity factor and AWGN

First we shall consider only a single cell system, N users
- Silent periods in a voice conversation occupy more time
(MSs) are transmitting and the desired signal arrived at than nonsilent periods, the ratio is about 60/40.
the BS with received power P (i.e. ideal power control to - Introduce the term “voice activity factor” υ . Similarly
overcome near-far problem, assuming single user for data transmission, “data activity factor” is defined.
detector is used). The received power is P and the
interference power is (N-1)P. At receiver front end,
P 1
SIR = =
( N − 1)P N − 1 Inter-cell and intra-cell interference
After the dispreading and the matched filter ∫0T (⋅)dt , bit - Each BS in a cellular system receives interference
energy-to-noise ratio is given by coming from MSs in the same cell, called intracell
Eb P / Rb G interference. Interference coming from MSs in
= = neighboring cells is called intercell interference.
N I ( N − 1) P / W N − 1
- How to evaluate intercell interference?
where W is the RF bandwidth, Rb is the bit rate, G is
(1) Consider the MS located at (r ,θ ) with respect to
known as the processing gain. If the number of MSs
increases, the interference signal increases linearly. the BS it is communicating with. The desired signal
power received at that BS is given by Pr = P , the
- For a required ( Eb / N 0 )min , total number of users transmitted power pt can be obtained using the path
Eb G ⎛E ⎞ ⎢ G ⎥ loss model.
= ≥ ⎜ b ⎟ ⇒ N max = ⎢1 + ⎥
N I N − 1 ⎝ N 0 ⎠ min ⎣ ( Eb N 0 )min ⎦ (2) The received interference power PI imposed on
- Increase the number of MSs beyond this threshold only the referenced BS can be found from Pt and the path
result in the slight degrading in performance – soft loss model, with the distance between the referenced
capacity. BS and MS, obtained from Cosine’s Rule:
rI = ( r 2 + D 2 − 2 Dr cos θ ) - If all MSs perform ideal power control with respect to its
own BS, and assume that all cells have the same size
D is the distance between the two BSs. and user distribution density. Under these
(3) The interference PI the MS at the interference circumstances, it can be shown that the average
cell to the reference cell BS can be obtained again intercell interference normalized to the total average
from the path loss model. intra-cell interference can be characterized by a
constant, κ , known as the interference factor.
R 2π
Interference user I inter = ∫ ∫ PI dθ dr

0 0
r
rI
θ I intra = P (why?)
D −n
P R 2π ⎛ r ⎞
⇒κ = I = ∫ ∫ ⎜ ⎟ dθ dr
P 0 0 ⎜⎝ (r 2 + D 2 − 2 Dr cosθ ) ⎟⎠
- The total intercell interference from all first tier

interfering cells without sectorization is given by κ1 P ,
where κ1 = 6κ .
Exercise: Write down a general expression for the

For example, using simple path loss model, the exact
interference factor.
expression for Pt cannot be obtained directly because
r = 0 is undefined. However, it is not difficult to Underlaying cell (space)
figure out that
−n −n
P ⎛r⎞ ⎛r⎞
= ⎜ ⎟ ⇒ PI (r ,θ ) = P ⎜ ⎟
PI ⎝ rI ⎠ ⎝ rI ⎠
Assuming circular cell with radius R, the average
interference is roughly given by
More accurate model

Rake Receiver
- The interference plus noise power spectral I 0 ( = N I ) for
user jth communicates to BS0 has to modify Multipath channel
K n K
I 0W = ∑ψ k 0 Pk 0 + ∑ ∑ψ ki Pki + N 0W α1 (t )
k =1 i =1
k =1

k≠ j

intercell interference
intracell interference τ1
υ ki = P(ψ ki = 1) = 1 − P(ψ ki = 0) is the voice activity factor α 2 (t )
for the ith user in the kth BS. ψ j is the binomial random s (t )
τ2 r (t )
variable that model the voice activity. All cells are #
α L (t )
having K MSs.
τL n(t )
- When just consider average interference, then the above
L
expression can be simplified: r (t ) = ∑ α l (t ) s (t − τ i ) + n(t ) - for only one user.
K n K l =1
I 0W = ∑ υ k 0 Pk 0 + ∑ ∑ υ ki Pki + N 0W
k =1 i =1
k =1
where s (t ) = Pb(t )c(t ) and α l (t ) is the time-variant
k≠ j

intercell interference
complex channel gain of the ith path.
intracell interference
Exercise: Assume all cells have uniform user Spread spectrum techniques can improve reception
distribution and can support the same number of users, through using a receiver structure named RAKE
N. What is the maximum number of users N each cell receiver. It inherited the name from the analogy of a
can support to guarantee a Eb / N I of γ * . Taking into garden rake, whereby the fingers constitute the
consideration the voice activity factor, intercell resolvable paths. The point where the handle and
interfence and assumed perfect power control and fingers meet is where diversity combining takes place.
lognormal shadowing.. Possible methods of diversity combining are:
Selection combining (SC)

Exercise : What happen if cluster size greater than 1 is Maximal ratio combining (MRC)
used? The bandwidth in this case is partition into a Equal gain combining (EGC)
few carrier channels.
Combining of the n best signals (SC-n)
α1* (t ) c* (t − τ1 )
(i +1)T +τ 1
∫iTb +τ 1b τ1
α 2* (t ) c* (t − τ 2 )
r(t ) (i +1)T +τ 2 b̂
∫iTb +τ 2b time
# #
α M * (t ) c* (t − τ M )
- For optimum performance of the RAKE receiver using
(i +1)T +τ
∫iTb +τ Lb L coherent demodulation, the path attenuation and phase
must be accurately estimated. This estimation is
performed by another process known as channel
⎧⎪ M ⎡ ( i +1)Tb +τ l * ⎤ ⎫⎪ estimation.
ˆ
bi = sgn ⎨∑ ⎢ ∫ α l (t )r (t )c* (t − τ l )dt ⎥ ⎬
⎩⎪ l =1 ⎣ iTb +τ l ⎦ ⎭⎪ Soft handover
⎧⎪ M ⎡ ( i +1)Tb +τ l - CDMA allows each cell to use the same broadband

= sgn ⎨∑ ⎢ P ∫
2
α l (t ) b(t − τ l )c(t − τ l )c* (t − τ l )dt frequency channel, eliminating the need for a mobile to
⎪⎩ l =1 ⎣ iTb +τ l change its freuqency when moving into another cell.
This is the pre-requirement for soft handover.
( i +1)Tb +τ l ⎤⎫ - In establishing the connection, the mobile detects and
L
⎪
+∑ ∫ α (t )α i (t )c (t − τ l )c(t − τ i )dt ⎥ ⎬
* *
tracks the BS with the highest power. At the same time
i =1 iTb +τ l
l
⎥⎪ the mobile monitors the powers of neighoring BSs. The
i ≠l ⎦⎭
second BS is introduced when its power becomes
⎧⎡ M ⎫ significant relative to the first BS power. The first BS
⎤
= sgn ⎨ ⎢ ∑ ⎡ α l (t ) Pbi ⎥ + inter-finger interference ⎬
2
will be abondoned only when the first BS’s signal
⎩ ⎣ l =1 ⎣ ⎦ ⎭ becomes weak relative to second BS.
We assume there is M rake fingers ( M ≤ L ) is used,

∫ c(t − τ i ) ⋅ c(t − τ j )dt ≠ 0 if i ≠ j and =1 if i = j .
A
B
Spectral Overlay Systems
DS spread spectrum systems can share common

spectrum with the currently operating cellular or fixed
microwave systems in order to achieve efficient
A
B
bandwidth utilization.
The signals of coexisting users would appear as

narrowband interference in the spectrum of a wideband
signal. This is still possible because spread spectrum
modulation has an inherent ability to reject narrowband
interference. The effectiveness of narrowband
interference rejection depends on the processing gain.

CDMA Cellular System

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

CDMA Cellular System

Hochgeladen von

Copyright:

Verfügbare Formate

EE5401 Cellular Mobile Communications EE5401 Cellular Mobile Communications

 CDMA systems are different in terms of

- Conversely, if a minimum SIR is given, the cluster size

(b) Synchronous short code  In the downlink, BS is capable of synchronizing the

 Short code cannot be used in uplink since orthogonality

At the receiver, Consider Walsh codes [1 1 − 1 − 1]

 Multipath interference is always present in both the

the a ’s take only 1 or –1 equally, Wk only takes on σ ζ 2 = ∑ E[ I k 2 ] = ∑ Pk

where G = Tb / Tc = W / B and B = 1 / Tb = Rb is the Power Control

- In the uplink, power control is to minimize power

γ i ≥ γ i * for 1 ≤ i ≤ M - In practical system, a combination of open- and closed

Closed loop: BS provides continuous feedback to each

- More accurate analysis should consider co-channel

 Voice activity factor and AWGN

Interference user I inter = ∫ ∫ PI dθ dr

- The total intercell interference from all first tier

Exercise: Write down a general expression for the

 More accurate model

υ ki = P(ψ ki = 1) = 1 − P(ψ ki = 0) is the voice activity factor α 2 (t )

Selection combining (SC)

⎧⎪ M ⎡ ( i +1)Tb +τ l - CDMA allows each cell to use the same broadband

We assume there is M rake fingers ( M ≤ L ) is used,

 DS spread spectrum systems can share common

 The signals of coexisting users would appear as

Das könnte Ihnen auch gefallen

CDMA systems are different in terms of

(b) Synchronous short code In the downlink, BS is capable of synchronizing the

Short code cannot be used in uplink since orthogonality

Multipath interference is always present in both the

Voice activity factor and AWGN

More accurate model

DS spread spectrum systems can share common

The signals of coexisting users would appear as