Академический Документы
Профессиональный Документы
Культура Документы
LESSON PLAN
Reason for
Teaching Assigned Attained
WEEK No Unit Date Hour Portions Planned deviation, if
Aids hours hours
any
Parameters of mobile CB
1
multipath channels
Time dispersion CB
1
parameters
1 Coherence bandwidth – CB
Doppler spread &
Coherence time
Reason
Teaching Assigned Attained for
WEEK No Unit Date Hour Portions Planned
Aids hours hours deviation
, if any
8
Multiple Access PP
2
techniques
2 2 FDMA CB
2 TDMA CB
2 CDMA CB
Capacity calculations– CB
2
Cellular concept
Frequency reuse - PP
2
channel assignment
Reason
Teaching Assigned Attained for
WEEK No Unit Date Hour Portions Planned
Aids hours hours deviation
, if any
2 system capacity CB
8
3 2
- trunking & grade of
service
CB
Principles of Offset- CB
3
QPSK
3 p/4-DQPSK CB
Reason
Teaching Assigned Attained for
WEEK No Unit Date Hour Portions Planned
Aids hours hours deviation
, if any
Error performance in CB
3
fading channels
3 OFDM principle PP
8
4 3 Cyclic prefix CB
3 Windowing CB
3 PAPR PP
4 Equalisation CB
4 Adaptive equalization CB
Reason
Teaching Assigned Attained for
WEEK No Unit Date Hour Portions Planned
Aids hours hours deviation
, if any
Diversity combining PP
4
techniques
4 diversity reception CB
4 Rake receiver, CB
Reason
Teaching Assigned Attained for
WEEK No Unit Date Hour Portions Planned
Aids hours hours deviation
, if any
5 MIMO systems PP
5 spatial multiplexing CB
5 System model CB
5 Pre-coding CB
8
6 5 Beam forming CB
5 transmitter diversity, CB
5 receiver diversity PP
Channel state CB
5
information
capacity in fading CB
5
channels
8
7 5 non-fading channels PP
The transmission path between the transmitter and the receiver can vary from
simple line of sight to the one that is severely obstructed by buildings, mountains and
foliage.
Unlike wired channels that are stationary and predictable, radio channels are
extremely random.
Even the speed of motion rapidly fades the signal level as a mobile terminal
moves in space.
Modeling the radio channel has been one of the most difficult parts of mobile
radio system design.
Cellular radio systems operate in urban areas, there is no direct line of sight path
between the transmitter and the receiver, whereas the presence of high-rise buildings
causes severe diffraction loss.
Due to multiple reflection, the electromagnetic waves travel along different paths
of varying lengths.
Propagation models that predict the mean signal strength for an arbitrary
transmitter-receiver (T-R) separation distance are useful in estimating the radio
coverage area of a transmitter and are called large scale propagation models.
Large scale model characterize signal strength over large T-R separation
distances (several l00s or 1000 meters)
Propagation models that characterize the rapid fluctuations of the received signal
strength over very short travel distances (a few wavelengths) are called small-scale or
fading models.
Path Loss Models :
Path loss or path attenuation is the reduction in power density of an
electromagnetic wave as it propagate through space.
Path loss is a major component in the analysis and design of the link budget of a
telecommunication system.
Path loss is the difference between the transmitter power and the received power.
Path loss models normally includes propagation losses caused by the normally
includes propagation losses caused by the natural expansion of the radio wave front in
free space, absorption losses, diffraction and also due to indoor models.
Indoor radio channel differs from the traditional mobile radio channel in two
aspects.
Partitions that are formed as part of the building structure are called hard
partitions.
Partitions that may be moved and which do not spam to the ceiling are called soft
partitions.
Number of windows in a building and the presence of tinting impact the loss
between the floors.
Model has four breakpoints and considers both an upper and lower bound on the
path loss.
This model provides flexibility and reduce the standard deviation between
measured and predicted path loss in two different buildings are shown.
Technique used for drawing a single ray between the transmitter and receiver is
called primary ray tracing.
The terrain profile of the particular area needs to be taken for estimating path
loss.
The terrain profile may very from a simple curved earth profile to a highly
mountainous profile.
A number of propagation models are available to predict path loss over irregular
terrain.
2) Durkin’s model
3) Okumura model
4) Hata model
Longley-Rice Model :
The median transmission loss is predicted using the path geometry of the terrain
profile and refractivity of the troposphere.
Geometric optics techniques are used to predict signal strengths withinthe radio
horizon.
This model calculate the large scale median transmission loss relative to free
space loss over irregular terrain for frequencies between 20MHZ and 10GHZ.
When a detailed terrain path profile is available, the path specific parameters can
be easily determined and the prediction is called a point-to-point mode prediction.
If the terrain path profile is not available to estimate the path specific parameters,
the prediction is called an area mode prediction.
Durkin’s Model :
Prediction is similar to Longley-Rice by Edward and Durkin as well as Dadson.
Predicts only large scale phenomena over irregular terrain and the losses caused
by obstacles in a radio path.
Assumption is that the receiving antenna receives all of its energy along the
radial, and therefore experiences no multipath propagation.
Second part, calculates the expected path loss along that radial.
After this is done, the simulated receiver location can be iteratively mored to
different locations in the service area to deducted the signal strength contour.
Okumura Model :
Wideley used models for signal prediction in urban areas.
Used for base station antenna heights ranging from 30m to 1000m.
Satellite and Microwave line-of-sight radio links typically undergo free space
propagation.
Large-scale radio wave propagation models, the free space model predicts that
received power decays as a function of the T-R separation distance raised to some
power.
The free space power received by a receiver antenna which is separated from a
radiating transmitter antenna by a distance d is given by the frils free space equation.
(4/)2 . d2 . .L
y = Wavelength, meters
The gain of an antenna related to its effective aperture
G = 4 Ae (2)
The effective aperture Ae related to the physical size of the antenna and is
related to the carrier frequency by
f wc
Losses are usually due to transmission line attenuation filter losses and antenna
losses in the system.
An isotropic radiator is an ideal antenna which radiates power with unit gain
uniformly in all directions and is often used to reference antenna gains.
In practice, effective radiated power (ERP) denotes the maximum radiated power
and antenna gains are given in dBi (gain w.r.t an isotropic antenna) or dBd (gain w.r.t a
half-wave-dipole)
The path loss, which represents signal attenuation, designed as the difference
between the effective transmitted power and the received power.
The path loss for the free space model when antenna gains are included is given
by
[
PL(dB) = 10 log Pt = 10 log Gt.Gr.1/2 ]
(5)
Pr 41/2. d2
When antenna gains are excluded, the antennas are assumed to have unity gain
and path loss is
(7)
df = 2D2
1/
Large scale propagation models use a close in distance do, known received
power reference point.
The reference distance must be chosen such that it lies in the far field region ie;
do>df.
( )
Pr(d) = Pr (do) do 2
d> do > (10)
d
In mobile radio systems, Pr are expressed interms dBm or dBW
( ) (11)
Pr(d) dBM = 10 log [pr(do)] + 20 log do
0.001 w do
For practical systems, the reference distance do using low-gain antennas in the 1-
2GHZ is choosen to be 1m in the indoor and 100m or 1km in outdoor environment.
The two-ray ground reflection model is a useful propagation model that is based
on geometric optics and considers both the direct path and a ground reflected
propagation path between transmitter and receiver.
This model is accurate for predicting the large-scale signal strength over
distances of sevaral km for mobile radio systems that use tall towers, as well as for line-
of-sight microcell channels in urban environment.
The maximum T-R separation distance is atmost only a fewtens of km and the
earth maybe assured to be flat.
The total received field, Etot is a result of the direct line-of-sight component,
ELos and the ground reflected component. Eg.
Where /E(d,t)/ = Eo.do/d represents the envelope of the E-field at d meters from
the transmitter.
Two propagation waves arrive at the receiver the direct wave that travels a
distence d’ and the reflected wave that travels a distance d”
[ ]
ELos (d;t) = Eo.do. cos wc (t-d’) (2)
d’ c
The E-field for the ground reflected wave, which has a propagation distance of
d”
Eg(d”,tt) Eo.do cos [wcwcc (tt-dd”)] (3)
d” c
According to laws of reflection in dielectrics
i = o. (4)
Eg = Ei (5)
Et = (1 + ) . Ei (6)
where [= refelection coefficient for ground
The resultant E-field, assuming perfect horizontal E-field polarization and
ground reflection ie;
[ = -1 and E= 0
( EToT) = 1ELoS + Eg1 (7)
The electric field ETOT (d,t)
ETOT (d,t) = Eo.do cos [Wc (t-d1)] + (-1) Eo-do.cos [wc(t-d’)] (8)
d’ c d ” c
Using the method of images, the path difference A, between the line-of-sight and
the ground reflected paths.
= d”-d1
= √(ht+hr)2+d2 - √(ht+hr)2+d2 (a)
When the T-R distance d is large compared to ht+hr
= d”-d’ = 2 ht.hr ( b)
d
Once the path difference is known, the phase difference between the two E-field
components and the time delay Td between the arrival of the two components can be
computed using
= 2π = wc (11) = c/f = c/f
c
c = wc =2πfc
Td = = (12)
c 2πfc
d becomes large, difference between d’ and d’’ becomes very small, and the amplitudes
ELOS = ELOS = Eg Eg and anddssdfsfd differ only in phase.
E0 . D0 = E E0 . D0 = E0 . D0 (13)
d d’ d’’
If the received E-filed is evaluated at t=d’’/c,
= E0 . D0 < - E0 . d0
d’ d’’
= E0 . D0 [< - 1]
d
d’
ht ht – hr
hr
ht d’’ hr
ht + hr
Method of images
Where d= distance over a flat earth between the bases of the transmitter and
receiver antennas.
E0.d0 2 E0.d0 2
ETOT(d) = (coscos - 1)2 + .sm2 (15)
d d
E0.d0 2−2cos
ETOT(d) = (16)
d
2.𝐸𝑜 .𝑑𝑜 Ѳ
ETOT(d) = .sin = (17)
d 2
This gives the exact received E-field for the two-ray ground reflection model.
The received power at a distance d from the transmitter for the two-ray ground
bounce model.
Pr = Pt.Gt.Gr.ht2.hr2 (21)
d4
At small T-R separation distances, (8) is used to compute the total E-field..
Link Budget Design :
Radio propagation models are derived using a combination of analytical and
empirical methods.
Over time, classical propagation models are used to predict large-scale coverage
for mobile communication system design.
The average large-scale path loss for an arbitrary T-R separation as a function of
distance by using path loss exponent.
PL (d) + d n
do
(or)
PL (dB) = PL(do) + 10nlog d
do
Where n = path loss exponent, indicates the rate at which the path loss increases
with distance.
denotes the enremble average of all possible path loss free space reference
distance must be selected in appropriate manner for the propagation environments.
In large coverage cellular systems, 1km reference distances are commonly used.
Whereas in microcellular systems, small distances (100 mor 1m) are used.
2) Log-normal shadowing :
Measures signals that vastly differ from the average predicted value.
Path loss PL(d) at a particular location is random and distributed log-normally.
dfgdfgdfgdfgdfgdfgdfgdfgfdgfgfg
𝑑
PL(d) [db] = PL (d) + X 𝜍 = PL (do) + 10n.log + X𝜍
𝑑𝑜
Where X𝜍 = Zero mean Gaussian distributed describes the random shadowing effects
which occur over a large number of measurement locations having the same T-R
separation, but have different levels of cutter on the propagation path, is known as log
normal shadowing.
Computer now the boundary coverage relates to the percent of area covered
within the boundary.
For a circular coverage area having radius R from the base station, desired
received signal thershold.
1 2𝜋 𝑅
= 0 0
Pr [Pr(r)>8].r.dr.do
𝜋𝑅 2
Small scale fading or fading is used to describe the rapid fluctuations of the
amplitudes, phases of time or travel distance.
these waves called multipath waves combine at the receiver antenna to give
resultant signal.
Multipath propagation:
the presence of reflecting objects and scatters in the channel creates a constantly
changing environment that dissipates the signal energy in amplitude, phase and time.
These effects result in multiple versions of the transmitted signal that phase and
amplitudes of the different multipath components cause fluenations in signals strength.
Multi path propagation often lengthens the time required for the baseband
portion of the signal to reach the receiver which cause smearing due to ISI.
Relative motion between the base station and the mobile results in random
frequency modulation due to different Doppler shifts on each of the multipath
components.
Doppler shift will be +ve or –ve depending on whether the mobile receiver is
moving toward or away from the base station.
If objects in the radio channel are in motion, they in duce a time varying Doppler
shifts on multipath components.
If the surrounding objects move at a greater rate than the mobile, then this effect
objects move at a greater rate than the mobile, then this effect dominates the small-scale
fading.
Coherence time defines the staticness of the channel, and is directly impacted by
the Doppler shift.
If the transmitted radio signal bandwidth > the bandwidth of the multipath
channel, the received signal will be distorted but will not fade much.
The mean excess delay, rms delay spread and excess delay spread are
multipath channel parameters that can be determined from a power delay profile.
The time dispersive properties of wide band multipath channels are quantified by
their mean excess delay (𝜏) and rms delay spread.
The mean excess delay is the first moment of the power delay profile and is
defined to be
𝜏= 𝑘 𝑎𝑘2. 𝜏𝑘 = 𝑘 𝑝 𝑘𝜏 . 𝑘𝜏
𝑘 𝑎𝑘2 𝑘 𝑝(𝜏𝑘)
𝜍𝜏 = 𝜏2 − 𝜏 2
Where
𝑘 𝑎𝑘2 𝑘 𝑝(𝜏𝑘)
These delays are measured to the first detectable signal arriving at the receiver
𝜏0 = 0
The maximum excess delay is defined to be time delay which multipath energy
falls to XdB below the maximum.
Delay spread is caused by reflected and scattered propagation paths in the radio
channel.
Other words, it is the range of frequencies over which two frequency components
have strong potential for amplitude correlation.
1
Bc = [correlation function above 0,9]
500𝑐
There parameters describe the time dispersive nature of the channel in a small-
scale region.
Doppler spread Bd is the measure of the spectral broadening caused by the time
rate of change of the mobile radio.
It is defined as the rage of frequencies over which the received Doppler spectrum
is non-zero.
If the baseband signal bandwidth > Bd, effect of Doppler spread are negligible at
the receiver. This is a slow fading channel.
Coherence time Tc, characterize the time varying nature of the frequency
depressiveness of the channel.
1
Tc =
𝑓𝑚
Coherence time is the time duration over which two received signals have a
strong potential for amplitude correlation.
Depending on the relation between the signal parameters and the channel
parameters, different transmitted signals will undergo different types of fading.
Multipath delay spread bads to time dispersion and frequency selective fading.
Time dispersion due to multipath caused the transmitted signal to undergo either
flat or frequency selective fading.
Flat Fading:
If the mobile ratios channel has a constant gain and linear phase response over a
bandwidth > bandwidth of the transmitted signal, then the received signal undergo flat
fading.
In flat fading, the multipath structure of the channels is such that the spectral
characteristics of the transmitted signal are preserved at the receiver.
The strength of the received signal changes with time, due to fulenations in the
gain of the channel caused by multipath
Small-scale fading
2. Delay spread < symbol period 2. Delay spread > symbol period
Small-scale fading
If the channel gain changes over time, a change of amplitude occurs in the
received signal.
In a flat fading channel, the received bandwidth of the transmitted signal is > the
multipath time delay spread of the channel.
Since the bandwidth of the applied signal is narrow compared to the channel flat
fading bandwidth.
Flat fading channels cause deep fades, and thus require 20/30 dB. more
transmitter power to achieve low bit error rates.
Rayleigh flat fading channel model assumes that the channel includes an
amplitude which varies in time according to the Rayleigh distribution.
Bs << Bc
Ts >> 𝝈𝝉
If the channel posses a constant gain and linear phase response over a bandwidth
ie. smaller than the bandwidth of transmitted signal, then the channel creates frequency
selective fading on the received signal.
Channel impulse response has a multipath delay spread > the reciprocal
bandwidth of the transmitted message wave form.
When this occurs, the received signal includes multiple versions of the
transmitted wave form which are attenuated and delayed in time, and hence the
received signal is distorted.
For frequency selective fading, the spectrum s(f) of the transmitted signal has a
bandwidth > Bc.
Frequency selective fading channels are also known as wideband channels since
the bandwidth of the signal is wider than the bandwidth of the channel impulse
response.
Fast fading:
Depending on the transmitted baseband signal channels, a channel may be
classified as a fast or slow fading.
In a fast fading channel, the channel in pulse response changes rapidly within
the symbol duration
ie TS > TC BS < BD
This causes frequency dispersion due to Doppler spreading which leads to signal
distortion.
Slow Fading:
In a slow fading channel, the channel impulse response changes at a rate much
slower than the transmitted baseband signal.
In the frequency domain, Doppler spread of the channel < bandwidth of the
baseband signal.
TS << TC
BS >> BD
The velocity of the mobile and the baseband signaling determines whether a signal
undergoes fast or slow fading.
Ts
Ts
Bs
Bc
Bs
Bd
Introduction:
Multiple access schemes are used to allow many mobile users to share
simultaneously a finite amount of radio spectrum.
The forward band provides traffic from the base station to the mobile and the
reverse band provides traffic from the mobile to the base station.
In FDD, any duplex channel consists of two simplex channel and a device
called a duplex is used inside each subscriber unit and base station to allow
simultaneously bidirectional radio transmission and reception for both the subscriber
unit and base station on the duplex channel pair.
It uses time instead of frequency to provide both a forward and reverse link.
In TDD multiple users share a single radio channel by taking turns in the time
domain.
Individual user are allowed to access the channel in assigned time slots, and
each duplex channel has both a forward time slot and a reverse time slot to facilitate
bidirectional communication.
If the time separation between forward and reverse time slot is small, then
transmission and reception of data appears simultaneously to the users at both the
subscriber unit and on the base station side.
Frequency division multiple access, time division multiple access and code
division multiple access are three major access techniques used to share the available
bandwidth.
In this system, the available radio spectrum is divided into a large number of
narrow band channels.
Thus multipath fading does not vary greatly the received signal power and
frequency selective fades occurs in only a small fraction of the signal bandwidth.
Channel Channel
Frequency separation
Reverse Forward
Channel Channel
Time separation
During the period of the call, no other user can share the same channel.
In FDD system, the users are assigned a channel as a pair of frequencies; one
frequency is used for forward channel while the other frequency of FDMA:
Carrier only one phone circuit at a time idle and cannot be used by other user to
increase or share capacity.
After the assignment of a voice channel, the base station and mobile transmit
simultaneously and continuously.
code
C C C C C
h h h h h
a a a a a
n n n n n
n n n n n
e e e e e
l l l l l
1 2 3 4 n
In FDMA, many channels share the same antenna at the base station.
The first analog cellular system, the Advanced Mobile System (AMPS) based
on FDMA/FDD.
A single user occupies a single channel while the call is in progress and the
single channel is actually two simplex channels which are frequency duplexed with
45mhz split.
Voice signal are sent on the forward channel from the base station to mobile
unit, and on the reverse channel from the mobile to base station.
Bt- 2Bquard
N=
Bc
Where Bt = Total Spectrum allocation
Bc = Channel bandwidth.
TDMA system divides the radio spectrum into time slots and in each slot only
one user is allowed to either transmit or receive.
TDMA systems transmit data in a buffer and burst method, thus the
transmission for any users is non-continuous.
The transmission from various users is interlaced into repeat ins frame
structure.
In TDMA/TDD, half of the time slots in the frame. Information message would
be used for the forward link channels and half for the reverse link channels.
Features of TDMA:
TDMA shares a single carrier frequency with several users, where each user
makes use of non-overlapping timeslots.
Data transmission for users occurs in burst. This results in low battery
consumption.
TDMA uses different time slots for transmission and reception, duplexers are
not required. Even if FDD is used, a switch rather than a duplexer inside the subscriber
unit is required to switch between transmitter and receiver using TDMA.
Efficiency:
Bt = Tf.R
Efficiency,
Ŋf = (1-boh/bt) * 100
The number of the TDMA channel slots can be found by multiplying the
number of TDMA slots per channel by the number of channels.
N = m (Btot – 2 Bquard)
code
Cn
C2
C1
Code Division Multiple Access (CDMA):
The spreading signal is a pseudo noise code. Sequence that has a chip rate
which is orders of magnitudes greater than the data rate of the message.
All users in CDMA systems use the same carrier frequency and may transmit
simultaneously.
Each user has its own pseudorandom code word which approximately
orthogonal to all other code words.
The receiver performs a time correlation operation to detect only the specific
desired code word.
For detection of the message signal the receiver needs to know the code word
by the transmitter.
code
C1
C2
code
Cn f
T
In CDMA, the power of the multiple users at a receiver determines the noise
floor after decor elate.
If the power of each user within a cell is not controlled such that they do not
appear equal at the base station receiver. Then the near-far problem occurs.
The near-far problem occurs when many mobile users share the same channel.
In general the strongest received mobile signal will capture the demodulator at
base station.
Power control is provided by each base station in cellular systems and assures
that each mobile within base station coverage area provides the same signal level to the
station.
This shows the problem of a nearby subscriber over powering the base station
receiver and drawings out the signals of faraway subscribers.
Features of CDMA:
Many users of CDMA systems share the same frequency either TDD or FDD
maybe used.
CDMA has soft capacity limit. Increasing the number of users in CDMA raise
the noise floor in linear manner.
The systems performance gradually degrades for all users as the number of
users is increased and improves as the number of users is decreased.
Multipath fading may be reduced because the signal is spread over a large
spectrum. If the spread spectrum bandwidth of the channels.
Channel data rates are very high in CDMA. A RAKE receiver can be used to
improve reception.
Since CDMA uses co-channels alls, it can use macroscopic spatial diversity to
provide soft handoff.
Capacity Calculations:
Channel capacity for a radio system can be defined as the maximum numbers
of channels or users that can be provided in a fixed frequency band.
In a cellular system, the interference at a base system receiver will come from
the subscriber unit in surrounding cells caller reverse channel interference.
For a particular subscriber unit, the desired base station will provide the desired
forward channel. While the surrounding co-channel base stations will provide forward
channel interference.
Cellular Capacity:
2 3
4
5
Advantages of cellular services:
Higher capacity
Less transmission power
Robustness
Local interferences only.
The base station antennas are designed to achieve the desired coverage within a
particular cell. The design process of selecting and allocates channel groups for all of
the cellular base station within a system is called frequency reuse or frequency
planning.
Consider a cellular system which has a total of a duplex channels available for
use. If each cells are allocated a group of K channels (K<S), and if the S channel are
divided among N cell into unique and disjoint channel groups which each have the
same number of channels.
S = KN
The N cells which collectiouly use the complete set of available frequencies is
called a cluster. If the cluster is replicated „M‟ times within a system. Then the total
number of duplex channels, C can be used as a measure of capacity and is given by
C = MKN
C = MS [⁖ S = Kn]
D = 1/N
D/R = 3𝑁
Channel Assignment
Borrowing strategy:
A cell is allowed to borrow channels from a neighboring cell if all the channels
are already occupied with no interference is called as borrowing strategy.
Simple borrowing:
Flexible borrowing:
Some fixed channel set of cell is divided into two groups. One group for local
user only other group of channels for borrowing.
To avoid ECI any channel that in use one cell can only be reassigned
simultaneously to another cell in the system if the distance b/w two cells in large than
minimum reuse distance .
Random DCA:
Here available channels are randomly assigned which has per channel
utilization.
Channel ordering:
Here a cell can use any channel, but each has a different ordering. Channel with
the highest priority is selected for the cell.
Here cell develops “favorite” channels from post experience. This scheme
adapts faster to traffic changes from DCA and CO but needs more time to search for
highest priority channel that cause delay.
It divided the total number of channels into two groups one of which is used for
fixed allocation to cells, which other is kept as central pool to be shared by all users.
Hand –off:
As the mobile moves around, it is quite possible that it approaches the edges of
the cell. This is the point of which radio signal is to weak.
R Level at point A
e
c
e
Hand-off Threshold
i
v
e
d
Minimum acceptable
S/R
S
/ Level at point B
R
Time
R
e
c Level at point B
e
Types of handoff:
1. Hard handoff
2. Soft handoff
Soft handoff:
Hard handoff:
Hard handoff, unlike channelized wireless systems that assign different radio
channels during a handoff, spread spectrum mobiles share the same channel is every
cell.
Handoff prioritization:
One of the ways to reduce the handoff failure rate is to prioritize handoff. Two
basic of handoff prioritization.
Guard channels:
Queuing of handoff:
Cell Dragging:
When there is a line of sight radio path between the base station and subscriber
in urban environment then the cell dragging results from pedestrian users that provide a
new strong signal to the station.
1. Co-channel interference
Co-channel interference:
Frequency reuse implies that in a given coverage areas are seven cells that use
the set of frequencies. These cells that use the set of frequencies. These cells are called
co-channels cell. Co-channel interference is defined as the interference between signals
from these cells.
When the each cell size is same and each base station transmit the same power
the co-channel interference ratio is independent of the transmitted power and the
function of the radius of the cell (R) and distance between contuse of the nearest co-
channel cells (D).
The parameter Q called co-channel reuse ratio is related to the cluster size.
ӨL = D/R = 3𝑁
S/I = (20)-n
There is no queuing for call requests. For every user when requests service, it is
assumed there is no setup time and the user is given immediate access to a channel if
one is available. If no channels are available the requesting user is blocked without
access and is free to try again later.
𝐴𝑐
𝐶!
Pr(Blocking) = 𝐴𝑘
= Gos (Erlag B)
𝑘=0 𝐾 !
Gos is defined as the probability that a call is blocked after waiting a specific
length of time in the queue.
𝐴𝑐
Pr (delay > 0) = 𝐴 𝐴𝑘
𝑐+𝐶![1− ] 𝐶−1
𝐴 𝐶 𝑘=0 𝑘!
Cellular systems are designed in such a manner they provide coverage to large
area as well as will accommodate large no. of users as possible. But in some case it
may be difficult to predict the need for network expansion. At this situation cellular
design techniques must be incorporated to accommodate more users as possible i.e.,
channel capacity must be improved. There are four basic capacity techniques available.
They are:
1. Cell splitting
2. Sectoring
3. Repeaters for extending range
4. Micro cell zone method
Cell splitting:
Cell splitting is the process of splitting a cell into smaller cells and the
frequencies are redistributed in such a way interference is eliminated. In this method
each cell is split into microcells which then own base station rescaling to the newer cell
sizer. This includes reduction in the antenna height as well the reduction in the
transmitted power.
Cell splitting is very useful when the is cell congested, because smaller cells
provides way for more number of BS (Base Station), there by increasing thechannel
that can be used in a particular cell and increases the capacity. This concept helps in the
effective frequency reuse and Allows the system to grow without upsetting the channel
allocation. BS is usually placed at the cell boundaries. The cell also posses larger BS
thereby providing less hand off splitting is its cost, since BS are placed in a large
manner cost increases. But it provides the tradeoff between the channel capacity.
𝑃𝑇1
Power of new cell PT2 =
2𝑛
From the above equation, the transmitted power of new cell will be 9dB less
than the original transmit power. This avoids the interference effect in the cell splitting.
Sectoring
In sectoring, the cell have the same coverage space but instead of using a single
omnidirectional antenna within a cell, 3 (or) 6 directional antenna, are used so that
sectoring of 600, 900 or 1200 can be achieved. Sectoring methods reduces the D/R ratio
and keeps the R untouched. In sectoring technique each antenna will be radiating in a
specific region there by reducing the effort of interference.
In sectoring the cells are divided into wedge shaped sectors each having its own
set of channels. These results in the increased number of user, thereby contributing to
the spectral efficiency. The main drawback of sectoring is it decreases the trunking
efficiency. It also results in increased of antennas as well as produces unnecessary
handoff‟s.
Repeaters
Repeaters are used for extending the range of the signal. They are mainly
incorporated in places which are hard to reach such as subways, underground buildings,
mountains, etc.,. repeaters does not have additional channels, they amplify the signal as
well as reradiate it to the unreachable locations. They are usually bidirectional in nature
i.e., can transmit and receive at the same time. The drawbacks of repeaters are since
they amplify the signal, the noise associated with the received signal is also reradiated.
MODULATION TECHNIQUES
Modulation is the process of changing the parameters of the carrier signal, in accordance with
the instantaneous values of the modulating signal. Modulation may be analog or digital.
ANALOG MODULATION
Analog modulation is the process of converting an analog input signal into a signal that is
suitable for RF transmission. Here both information and carrier are analog signals.
DIGITAL MODULATION
Digital modulation is the process of translating bits to analog waveforms that can be sent over
a physical channel. However the wireless channel is analog in nature so analog waveform of the data
has to be transmitted. For this reason, the digital modulator at the transmitter (TX) has to convert the
digital source data to analog waveforms. At the receiver (RX), the demodulator tries to recover the
bits from the received waveform.
METRICS FOR DIGITAL MODULATION
It is a measure of how much signal power should be increased to achieve a particular BER for
a given modulation scheme. It is the ability of a modulation technique to preserve the fidelity of the
digital message at low power levels.
Designer can increase noise immunity by increasing signal power. Power efficiency is a
measure of how much signal power should be increased to achieve a particular BER for a given
modulation scheme. i.e., signal energy per bit/noise power spectral density (Eb/N0).
It defines the ability to accommodate data within a limited bandwidth. It reflects how
efficiently the allocated band width is utilized. It is the ratio of the throughput data rate per Hertz in a
given bandwidth.
3. SHANNON LIMIT
Shannon‟s channel coding theorem states that an arbitrarily small probability of error, the
maximum possible bandwidth efficiency is limited by the noise in the channel, and is given the
channel capacity formula.
B is the RF bandwidth,
4. PROBABILITY OF ERROR
In digital communications it is desirable to minimize the average probability of bit error at the
receiver subject to the constraints on received power and channel bandwidth. The terms
probability of bit error (Pe) and bit error rate (BER) are used interchangeably. Advantage of
pass band transmission is optimum design of receiver so it reduces the average probability of
error in presence of additive white Gaussian Noise (AWGN).
SELECTION OF MODULATION SCHEME
1. The digital communication has mostly common structure of encoding a signal so devices
used are mostly similar.
2. The Digital Communication's main advantage is that it provides us added security to our
information signal.
3. The digital Communication system has more immunity to noise and external interference.
4. Digital information can be saved and retrieved when necessary while it is not possible in
analog.
5. Digital Communication is cheaper than Analog Communication.
6. The configuring process of digital communication system is simple as compared to analog
communication system. Although, they are complex.
7. In Digital Communication System, the error correction and detection techniques can be
implemented easily.
The goal of a wireless link is the transmission of information from an analog information
source via an analog wireless propagation channel to an analog information sink. The digitizing of
information is done only in order to increase the reliability of the link. The transmission can then add
redundancy in the form of a forward error connection code, in order to make it more resistant to error
introduced by the channel. The encoded data are then used as input to a modulator, which maps the
data to output wave form that can be transmitted. By transmitting there symbol on specific frequencies
or at specific times, different user can be distinguished.
At the Rx, the signal is received by one or more antennas. If the channel is delay dispersing,
then an equalizer can be used to reverse that dispersion and eliminated inter symbol interference. Then
the single is demodulated and a channel decoder eliminates the errors that are present in the resulting
bit stream.
Signaling
Local OSC
noise
Propagation
channel
INFORMATION SOURCE
The information source provides an analog source signal and feed it into the source
ADC. The ADC band limits the signal from the analog information source and then converts
the signal into digital data.
SOURCE CODER
The source coder uses information on the properties of the source code in order to
reduce redundancy in the source signal. This reduces the amount of source data to be
transmitted and thus the required transmission time and bandwidth.
CHANNEL CODER
The channel codes add redundancy in order to protect data against transmission errors.
This increases the data rate that has to be transmitted at interference. The channel coder often
uses information about the statistics of error sources in the channel to design a coder that are
well suited for the channel. Signaling adds control information for the establishing and ending
of communication users, synchronization etc...
MULTIPLEXER
The multiplexer combines user data and signaling information and combines the data
from multiple users. This is done by time multiplexing.
BASEBAND MODULATOR
The baseband modulator assigns the gross data bits, to complex transmit symbol in the
baseband. Spectral properties, inter symbol interference, peak to average ratio and other
properties of the transmit signal are determined in this step.
The transmitter digital to analog converter [DAC] generates a pair of analog, discrete
amplitude voltage corresponding to the real and imaging part the signal.
LOW-PASS FILTER
The analog low-pass filter in the transmitter side eliminates the spectral component
outside the desired transmission bandwidth. These components are created by the out-of-band
emission of a base band modulator.
LOCAL OSCILLATOR
UP-CONVERTER
The up-converter converts the analog filtered baseband signal to a pass band signal by
mixing it with the local signal.
The RF Tx filter eliminates out-of-band emission in the RF domain. Even if the low-pass filter
succeeded in eliminating all out-of band emission. The propagation channel attenuates the signal and
leads to delay and frequency dispersion.
The Rx filter performs a rough selection of the secured band. The bandwidth of the filter
corresponds to the total bandwidth assigned to a specific source.
LOW-NOISE AMPLIFIER
The low-noise amp amplifies the signal, so that the noise added by later components of the Rx
chain has less effect on the SNR.
RX LOCAL OSCILLATOR
The Rx local OSC provides sinusoidal signal corresponding to possible signals at the Tx local
OSC. The Rx down converter converts the required signal into baseband. The Rx low pass filter
provides a selection of desired freq bands for one specific user.
RX A / D CONVERTER
The RX A / D converter converts the analog signal into value that are discrete in time and
amplitude. The carrier recovery determines the frequency and phase of the causes of the received
signal.
BASEBAND DEMODULATOR
The baseband demodulator obtains soft decision data from digitized baseband data and hands
them over to the decoder. The symbol timing recovery uses demodulates data to determine an estimate
of the duration of symbol and uses it to fine-tune sampling intervals. The decoder uses soft estimates
from the demodulator to find the original source data.
SIGNALING RECOVERY
Signaling recovery identifies the parts of the data that represent signaling information and
control the subsequent de-multiplexer. The de-multiplexer separates the user data and signaling
information and resource possible time comparison of the Tx multiplier. The source decoder
reconstructs the source signal from the rules of source coding.
Simplified block:
One possible classification of digital modulation techniques depends on whether receiver uses
coherent detection or not. These are:
1. Coherent Techniques
2. Non- Coherent Techniques
Coherent Non-Coherent
Figure 3.3 Hierarchy of Digital Modulation Technique
1. Coherent Techniques
Receiver is equipped with phase recovery circuit, i.e., locally-generated carrier at the Rx, is
synchronized in frequency and phase to received carrier. Thus the detection is done by correlating
noisy signal and locally generated carrier. Thus the coherent detection is a synchronous detection.
Examples:
BPSK
QPSK
M-ARY PSK
M-ARY QAM
M-ARY FSK
2. Non-Coherent techniques
Examples:
M-ary ASK
M-ary FSK
BFSK
DSPK
Here no need to exactly recover phase but only need to recover phase difference another
possible classification of digital modulation techniques is
1. Binary Techniques
2. M-ary Techniques
1. Binary Techniques:
The information bits {0, 1} are represented by one signal each, namely s1(t) and s2(t). The
symbol duration (T) is equal to the bit duration, T= Tb. The bandwidth is proportional to 1/Tb.
2. M-ary Techniques:
The information bits {0, 1} are grouped into M distinct n-bit symbols, represented by M
signals, namely S1(t),S2(t),….,Sm(t). Where M=2n. The symbol duration (T) is equal to the bit
duration, T=nTb. The bandwidth is proportional to 1/nTb. Instead of transmitting one bit at a time,
M-ary two or more bits are transmitted simultaneously. It reduces channel bandwidth.
OVERVIEW OF MODULATION
Principle:
In QPSK, as with BPSK, information carried by the transmitted signal is contained in the
phase. It provides efficient utilization of channel bandwidth. It has twice the bandwidth efficiency of
BPSK, since 2 bits are transmitted in a single modulation symbol. QPSK is equivalent to two coherent
BPSK systems working in parallel and using two carriers that are in phase quadrature. In quadrature
phase shift keying, 4 possible phase locations are used at a time. Two data bits can thus be transmitted
simultaneously. One of the data bits produces the in-phase (I) component and the other data bit
produces the Quadrature (Q) component.
2𝐸𝑠
SQPSK = 𝑇𝑠
cos [2πfc+(2i-1)π/4] 0 ≤ t ≤ Ts
2𝐸𝑠
Or 𝑇𝑠
cos [2πfc+(i-1)π/2 ] 0 ≤ t ≤ Ts
E = Es= 2Eb
i.e., Ts = 2Tb
Es = 2Eb represents the signal energy per symbol is twice the signal energy per bit.
Es - Bit energy
Tb - Bit duration
Ts is the symbol duration and is equal to twice the bit period.
fc = nc/T
fc = carrier frequency
Quadrature phase-shift keying(QPSK) is a form of phase shift keying (PSK) using four phase state,
normally 90 degrees apart (π/4, 3π/4, 5π/4 and 7π/4).
2 2
SQPSK(t)= cos[(2i-1)π/4]cos(2πfct)- sin[(2i-1)π/4]sin (2πfct)
𝑇𝑠 𝑇𝑠
Where, i = 1, 2, 3, 4
2
ϕ1 (t) = cos (2πfct) 0 ≤ t ≤ Ts
𝑇𝑠
2
ϕ2 (t) = sin (2πfct) 0 ≤ t ≤ Ts
𝑇𝑠
2 2
SQPSK = 𝐸𝑆 cos [(2i-1) π/4] cos (2πfct) - 𝐸𝑠 sin [(2i-1) π/4] sin (2πfct)
𝑇𝑠 𝑇𝑠
Then the 4 signals in the set can be expressed in terms of the basis signals as
Where, i = 1, 2, 3, 4
The four message points and the associated signal vectors are defined by
The carrier frequency fc equals nc/T for fixed integer nc. Each possible value of the phase corresponds
to a unique bit (pair of bit) as shown. We many choose the foregoing set of phase value to represent
the Gray – encoded set of dibits: 10,00,01 and 11, where only a single bit is changed from one di-bit
to the next. The elements of single vector have their values summarized in table
Gray Coded Input Phase of QPSK Coordinate of message points
Dibit (Radians)
S11 S12
10 π/4 𝐸 𝐸
+ 2
- 2
𝐸 𝐸
00 3π/4 - 2
- 2
𝐸 𝐸
01 5π/4 - 2
+ 2
𝐸 𝐸
11 7π/4 + +
2 2
Decision
Region Z1
Region Z2 boundary
𝐸/2
Message Message
point m2 (00) point m1 (10)
Phase1
0 𝐸/2
− 𝐸/2
Message Message
point m3 (01) point m4(11)
Region Z4
Region Z3
− 𝐸/2
Constellation diagram
Distance between adjacent points is 2𝐸 s
1 Symbol = 2 bit
Es = 2Eb
QPSK Transmitter
Here incoming data sequence is first given into Polar non return to zero level encoder for polar
conversion. Incoming symbols are represented by + 𝐸 b and - 𝐸 b by and for 1 and 0 respectively.
Next these binary waves are divided by de-multiplexer, which separate the incoming binary
wave into two components namely odd and even components. This two binary waves amplitudes are
represented by a1 (t) and a2 (t) for si1 and si2 respectively.
Product Multiplier
Then this two binary waves with amplitudes a1 (t) and a2 (t) are multiplied with orthogonal basis
functions ϕ1 (t) and ϕ2 (t). Product modulator 1by the signal Si1 with ϕ1 (t) then it gives output as Si1 ϕ1
(t). Product modulator 1by the signal Si2 with ϕ2 (t) then it gives output as Si2 ϕ2(t).
2
Φ1(f)= 𝑇
cos (2πfct)
a1(t)
x
a2(t) 2
Φ2(f)= 𝑇
cos (2πfct)
QPSK Transmitter
QPSK Waveform
Then output of both product modulator 1 and 2 are given into summer which
sums the both signal then it gives output as follows
Before that we have to know that output of each product modulator is BPSK output only.
Summary
After adding the output of both product modulators 1 and 2 we can get QPSK output from this
we may know that by adding two BPSK signal we may get QPSK. Two successive bits are combined
two form distinct bits.
2π
Phase shift =
Number of symbol
2𝜋
=
4
= 90 o
If x1˃0, decision is made in favor of symbol 1 for the in-phase channel output, but
x1˂0, decision is made in favor of symbol 0.
If x2˃0, decision is made in favor of symbol 1 for the quadrature channel output, but
x2˂0, decision is made in favor of symbol 0.
Finally these two binary sequences at in-phase and quadrature channel outputs are added in a
multiplexer to reproduce the original binary sequence at the transmitter.
((2πfct)
X1
𝑇𝑏
Decision
𝑑𝑡
0 Circuit
Recovered
Signal s(t)
Threshold = 0
ϕ1(t) = 2𝜋 sin(2πfct)
((2πfct)
PROBABILITY OF ERROR
In QPSK system, the received signal x(t) is defined by
x (t) = si(t) + w(t), {0≤t≤T
i=1, 2, 3, 4
Where w(t) = sample function of White Gaussian noise process with zero mean and power spectral
density N0/2. Then the components x1 and x2 in x(t) are defined by follows
𝑇
X1 = 0
𝑥(𝑡) ϕ1 (t) dt
Substitute equation
𝑇 2
= 0
𝐸 cos ((2i-1)π/4) 𝑇
cos (2πfct) dt
= 𝐸cos ((2i-1)π/4) + w1
𝐸
X1 =± 2
+ w1
𝑇
And X2 = 0
𝑥(𝑡) ϕ1 (t) dt
Substitute equation
𝑇 2
= 0
−𝐸 sin ((2i-1)π/4) 𝑇
sin (2πfct) dt
𝐸
X1 =± 2
+ w2
As we know that QPSK is equivalent to two BPSK working in parallel manner with the following
property.
𝐸
P‟ = 1/2erfc [ /𝑁0 ] = 1/2erfc [ 𝐸/2𝑁0]
2
The average probability of a correct decision by decision rule resulting from combined action of the
two channels working together is
Pe = 1 - pc
QPSK transmits two bits per symbol; the transmitted energy per symbol is twice the single energy per
bit i.e.
E = Es = 2Eb
Substitute equation
Characteristics of QPSK
1. BER
Average BER can be defined as ratio of total number of erroneous bits to total number of bits
transmitted.
No of erroneous bit
Average BER =
Total no. of bits transmitted
BER = Q 2𝛾𝑏
2.Bandwidth
In QPSK odd and even components are baseband signals. So one bit period for both of these
signals are equal to 2tb. So bandwidth is
Bandwidth = 2(1/2Tb)
BW = fb
From these we may know that bandwidth of QPSK is half of the BPSK.
PSD
P QPSK = Es/2 [(sin π (-f –fc) Ts/ π (-f – fc)Ts)2 + (sin π (-f –fc) Ts/ π (-f – fc) Ts) 2]
E2 = 2Eb
Substitute equation
= Eb [(sin 2π (-f –fc) Ts/ 2π (-f – fc)Ts)2 + (sin 2π (-f –fc) Ts/ 2π (-f – fc) Ts) 2]
Since f > fc, by considering the first term only, P QPSK becomes.
B) Depending on bits sent during the signaling interval, the in-phase components equals +g(t)
or –g(t). The g(t) denotes the symbol shaping function. It can be expressed as follows
𝐸
g(t) = { 𝑇
0≤t≤T
0 Otherwise
1.2
0.8
0.6 MSK
QPSK
0.4
0.2
0
0.25 0.5 0.75 1
π/4 QPSK
The π/4 shifted QPSK modulation is a quadrature phase shift keying technique which offers a
compromise between OQPSK and QPSK in terms of the allowed maximum phase transitions.
PRINCIPLES
In π/4 QPSK, the maximum phase change is limited to ±1350 as compared to 1800 for QPSK.
Hence, the band-limit π/4 QPSK single preserves the constant envelope property better than base-
limited QPSK, but is more susceptible detected. Which envelope variations than OQPSK.When
differently encoded, π/4 QPSK is called π/4DQPSK.
The kth in-phase and quadrature phase, Ik and Qk are produced at the output of the signal mapping
circuit. Time is in the following range kT ≤ t ≤ (k+1)T and the kth in-phase and quadrature phase can
be determined from previous values Ik-1 and Qk-1 as well as Өk
Ik and Qk represent rectangular pulses over one symbol duration having amplitudes given by
Where Qk = ᵠk-1 + ϕk; Өk and Өk-1 are phase of the kth and (k-1)st symbol.
Modulator
The in-phase and quadrature bit streams Ik & Qk are then separately modulated by 2 carriers which are
in quadrature with one another, to produce the π/4 QPSK waveform given by
LPF I(t)
ml.k lk I(t)
mk Serial to Signal Amplifier
parallel Ʃ
mapping Q(t
convertor ) π/4 QPSK
Qk Q(t)
M signal
q.k LPF
-sin 𝜔ctt
Both Ik and Qk are passed through raised cosine rolloff pulse shaping filters before modulation,
in order to reduce the bandwidth occupancy.
Peak amplitude of the wave forms I(t) and Q(t) can take one of the five possible values, 0, +1,
-1, +1/ 2, -1/ 2
Summer
Amplifier
After summer, the π/4 QPSK signal is then given into Amplifier. The signal is amplified by non-
linear amplifier with greater efficiency. From the above discussion it is clear that the information in a
π/4 QPSK signal is completely contained in the phase difference φk of the carrier between two
adjacent symbols. Since the information is completely contained in the phase difference, it is possible
to use non-coherent differential detection even in the absence of differential encoding.
Due to simple hardware implementation, differential detection is often employed to demodulate π/4
QPSK signals. In an AWGN channel , the BER performance of a differentially detected π/4 QPSK
is about 3 dB inferior to QPSK, while coherently detected it π/4 QPSK has the error performance as
QPSK.
There are Various types of detection techniques that are used for the detection are π/4 QPSK
signals.
The incoming π/4 QPSK signal is quadrature demodulated using two local oscillator signals.
Local oscillator, carrier frequency has the same frequency as the unmodulated carrier at the
transmitter, but not necessarily the same phase. It is important to ensure the local receiver oscillator
frequency is the same as the transmitter carrier frequency, and that it does not drift.
If φk = tan-1〔Qk/Ik〕 is the phase of the carrier due to the kth data bit, the output wk and z k
from the two low poss filters in the in-phase and quadrature arms of the demodulator can be expressed
as
Wk = cos (φk - ɤ)
Zk = sin (φk - ɤ)
where ɤ is a phase shift due to noise, propagation, and interference.
The phase ɤ is assumed to change much slower than φk so it is essentially constant.
In phase Channel
wk xk
Block diagram of a base band differential detector
The two sequences wk and zk are passed through a differential decoder which operates on the
following rule.
Xk = wk wk-1 + zk zk-1
yk = zk wk-1 - wk zk-1
The output of the differential decoder can be expressed as follows by substituting the equations,
wk = cos (ɸk - ɤ )
zk = sin (ɸk - ɤ )
xk = cos(ɸk - ɤ) cos(qk-1) + sin(ɸk - ɤ) sin(ɸk-1- ɤ)
Since cos (A-B) = cosAcosB + sinAsinB
Above equation becomes,
xk = cos(φk - φk-1)
yk = sin(φk - ɤ) cos(φk-1- ɤ) + cos(φk - ɤ) sin(φk-1- ɤ)
= sin(φk - φk-1)
Decision Device
The output of the differential decoder is applied to the decision circuit.
SI = 1, If xk > 0 or SI = 0, If xk < 0
SQ = 1, If yk > 0 or SQ = 0, If yk < 0
Where SI and SQ are the decoder bits in the in-phase and quadrature arms, respectively.
Multiplexer selects any one of SI and SQ.
Any drift in the carrier frequency will cause a drift in the output phase which will lead to BER
degradation.
2. IF Differential Detector
IF differential detector shown in figure 3.17 avoids the need for a local oscillator by using a
delay line and two phase detectors.
LPF Decision
device
Sampled at maximum
output for every TS
BPF Ts Multiplex
LPF Decision
device
IF Modulator
BPF
The band pass filter is designed to match the transmitted pulse shape, so that the carrier phase is
preserved and noise power is minimized the effect of ISI and noise, the bandwidth of the filters are
chosen as 0.57/ TS
Differential Decoder
The received IF signal is differentially decoded using a delay line and two mixers. The
bandwidth of the signal at the output of the differential detector is twice that of the baseband signal at
transmitter end.
Decision device
SI = 1, If xk > 0 or Si = 0, If xk< 0
where SI and SQ are the detected bits in the in-phase and quadrature arms, respectively.
3. FM Discriminator
Figure 3.18 shows a block diagram of an FM discriminator detector for π/4 QPSK.
BPF
The input signal is first filtered using a band-pass filter is matched to the transmitted signal.
Limiter
The filtered signal is then hard-limited to remove any develop fluctuations. Hard-limiting
preserves the phase changes in the input signal and hence no information is lost.
FS Discriminator
The FM discriminator extracts the instantaneous frequency deviation of the received signal.
Signal for FS Discriminator is passed in integrate and dump. The demodulated signal is
integrated over each symbol period gives the phase difference between two sampling instants.
The phase difference is then detected by a four level threshold comparator to obtain the original
signal. The phase difference can also be detected using a modulo-2π phase detector. The modulo-2π
phase detector improves the BER performance and reduces the effect of click noise.
Disadvantages of FM Discriminator
In QPSK, the amplitude is ideally constant. However, when QPSK signals are pulse shaped,
they lose the constant envelop property which results in
1. Regeneration of side-lobes
2. Spectral widening
QPSK signals is amplified only using linear amplifiers, which are less efficient. A modified form of
QPSK, called offset QPSK (OQPSK) or staggered QPSK.
1. The carrier phase changes by ±180 degrees whenever both the in-phase and
quadrature components of the QPSK signal changes whenever the in-phase or
quadrature component changes sign.
2. The carrier phase changes by ±90 degrees whenever the in-phase or quadrature
component changes sign.
3. The carrier phase is unchanged when neither the in – phase nor the quadrature
component changes sign.
These shifts in carrier phase can result in changes in the carrier amplitude, thereby causing
additional symbol errors on detection. The extent of amplitude fluctuations exhibited by
QPSK signals may be reduced by using offset QPSK, where the bit stream responsible for
generating the quadrature component is delayed by half a symbol interval with respect to the
bit stream responsible for generating the in-phase component.
Definition
OQPSK (offset QPSK) is a special version of QPSK in which the transmitted signal has no
amplitude modulation. It results to 180o shifting in the phase. If the two bit streams are offset by a ½
interval, then the amplitude fluctuations are minimized since the phase never changes by 180 o as its
occurred in QPSK when debit 01 changes to 10. This modulation is called as offset QPSK.
Signal Representation
Offset QPSK is obtained from QPSK by delaying the odd bit stream by half a bit interval with
respect to the even bit stream.
Above signal representation is similar to QPSK except for time alignment of even and odd bit
streams.
In QPSK signaling, the bit transitions of the even odd bit stream occur at the
same time instants, but in OQPSK signaling, the even and odd streams, m I(t) and mQ(t) are offset in
theft relative alignment by one bit period(half-symbol period). This is shown in the waveform.
In OQPSK, the incoming signal is divided in the modulator into two portions I and Q which
are then transmitted shifted by a half symbol duration, so that I and Q channel signals do not transition
at the same time.
The result of this sample change is that phase shifts at any one time are limited and hence
offset QPSK is more “constant-envelop” than straight QPSK.
I Channel
Rb/2
Set1 Pulse X
Amplitude shaping
Informati ˷
on bit ƩƩ
stream Serial to Cos (2πfcTs)
parallel
converter π/2 QPSK
delay (or)
OQPSK
R1=Rb/2
Cos(2πfcTb carrier
+π/2)
Set1 Pulse Tsdelay X
Amplitude shaping
Rb/2
Q Channel
Offset QPSK
d1(t)
+1 d0 d6
0 t
d2 d4
-1
-T 0 T 3T 5T 7T
dQ(t)
+1
d1 d5 d1 t
d3
-1
0 2T 4T 6T 8T
Due to time alignment of m1(t) and mQ(t) in QPSK, phase transition occur only
once every Ts = 2Tb seconds.
In QPSK , if there is a change in the value of both m1(t) and mQ(t), then there
will be a maximum of phase shift of 180o
In OQPSK signaling, bit transitions(and hence phase transitions) occur every Tb.
Since the transitions instants of mI(t) and mQ(t) are offset, at any given time only
one of the two bit streams can change values. This implies that the maximum
phase shift of the transmitted signal at any given time is limited to ±90o.
Hence, by switching phases more frequently (i.e., every Tb instead of 2Tb)
OQPSK signaling eliminates 180o phase transitions.
Probability of error
Probability of error is same as for QPSK
Advantage of offset QPSK
1. Offset QPSK offers better performance in satellite applications.
2. It performs better than QPSK in presence of phase jitter.
Application of offset QPSK
1. In high power amplifiers and for certain satellite applications.
2. Mobile communication systems.
Differential QPSK
DQPSK transfers the data by mapping the two bits digital signal to one of the four modulated
phase pattern. With incoming data stream in group of two bits, the modulator selects the
phase from 0, π/2,π/4,3π/4 and add current phase with previous phase to form a
differential encoded signal. The In-phase and Quadrature-phase (I and Q) signals are obtained
by multiplying the to the cosine and negative sine. Both I and Q signals are transmitted and
received by pulse shaping filter gT(t) at modulator and gR(t) at demodulator to maximize the
SNR. The original data is recovered at phase comparator, which accepts current and delayed I
and Q signals as input.
A modulation index 0.5 corresponds to the minimum frequency spacing that allows two FSK
signals to be coherently orthogonal. The name minimum shift keying implies the minimum frequency
separation (i.e., Bandwidth) that allows orthogonal detection.
2. Alternatively, we can interpret MSK as offset QAM (OQAM), basis pulses are sinusoidal
half-waves extending over a duration of 2TB.
g(t) = sin (2π fmod(t + TB)) gR (t, 2TB)
Due to the use of smoother basis functions the spectrum decreases faster than regular
OQPSK.
16𝑇𝐵 cos
(2𝜋𝑓 𝑇𝐵
S(f) = ( )
𝜋2 1−16 𝑓 2 𝑇𝐵2
MSK is only a binary modulation format, white OQPSK transmits 2 bits per symbol duration.
MSK is sometimes referred to as fast FSK, as the frequency spacing used is only half as much
as that used in conventional non-coherent FSK.
MSK is a spectrally efficient modulation scheme and is attractive for use in mobile radio
communication systems.
Properties of MSK:
MSK has lower spectral efficiency when the energy bandwidth is 90% (1.29 bit/s/Hz),
but still performs well when the energy bandwidth is 99% (0.85 bit/s/Hz).
MSK modulator:
Multiplying a carrier signal with cos [nt/2T] produces two phase-coherent signals at fc +
X(t)
1/4 T and fc – 1/4 T. X(t)
BPF fc+1/4T X(t)
- +
Cos 2πfct MSK signal
ml(t
)
S(t)
Cos 2πfct
+ +
BPF fc-1/4T
MSK modulator
These two FSK signals are separated using two narrow band filters and appropriately combined to
form the in-phase and quatrature carrier components x (t) and y(t) respectively.
These carriers are multiplied with the odd and even bit streams, m I(t) and mQ(t), to produce the MSK
modulated signal S(t).
MSK demodulator:
The received signal s(t) in the absence of noise and interference is multiplied by the respective
in-phase and quadrature carriers x(t) and y(t).
The output of the multipliers are integrated over two bit periods and dumped to a decision
circuit at the end of each two bit periods.
Based on the level signal at the output of the integrator, the threshold detector decides whether
the signal is a 0 or a 1.
Threshold=0
Smsk(t) X(t)
T=2(2k+2)T
Threshold=0
MSK demodulator
The output data streams are mi(t) and mq(t), which are combined to obtained the demodulation signal.
The different interpretations of MSK are not useful for gaining insights into the modulation
scheme, but also foe building demodulator.
Advantages
(i) Constant envelope
(ii) Spectral efficiency
(iii) Self synchronization
(iv) Good BER performance
Disadvantages
(i) The generation and detection of MSK signal is slightly complex.
(ii) Phase jitter is present because of incorrect synchronization.
(iii) The bandwidth requirement of MSK is high i.. 1.5 fb whereas fb in QPSK.
While MSK has many advantages, its special efficiency is rather low. The drawback is
eliminated by GMSK [Gaussian minimum shift keying]
GMSK is CPFSK [Continuous Phase Frequency shift keying] with modulation index h mod=0.5,
the difference is the basis pulses are Gaussian pulses.
∞
PD(t) = 𝑖=−∞ 𝑏𝑖 𝑔(t-iTB) = bi* 𝑔*(t)
1
Mobile radio channels have an irreducible error rate due to mobile velocity the GMSK has irreducible
error rate is less than that produced by the mobile channel, there is no penalty is using GMSK.
GMSK is most attractive for its excellent power efficiency (due to the constant envelope) and
its excellent spectral efficiency.
Desirable properties can be achieved by passing a non-return-to-zero (NRZ) binary data stream
through a baseband pulse-shaping filter whose impulse response is defined by a Gaussian function.
The resulting method of binary frequency modulation is naturally referred to as Gaussian shift keying.
2ɤ𝐸𝑏
Pe = Q
𝑁0
Where
To generate a GMSK is to pass a NRZ message bit stream through a Gaussian baseband filter
having a response, followed by a FM modulator.
GMSK transmitter
GMSK is used in a variety of analog and digital implementation for the US Cellular Digital
Packet Data [CDPD] and Global System for Mobile [GSM]
GMSK Receiver:
GMSK signal can be detected using orthogonal coherent detectors (or) with simple non-
coherent detectors.
LPF
π/2
Loop
- filter 𝜋 +
+
Modulated Demodulate
if input π/ d signal
signal
2
LPF
Clock
recovery
GMSK Receiver
Carrier frequency is recovered by Buda‟s method, where the sum of the two discrete frequency
components contained at the output of a frequency decide. It is divided by four.
2𝛾𝐸𝑏
𝑃𝑒 = 𝑄
𝑁0
B is bandwidth
𝐸𝑏
⎾=
𝑁0
Coherent receivers compensate for phase rotation of the channel by means of carrier recovery.
Furthermore, the channel gain α is assumed to be known, and absorbed into the received signal, so
that in the absence of noise, r = s holds. The probability the symbol sy is mistaken for symbol sk
that has Euclidean distance djk from sj (pairwise error probability) is given as
𝑑 2 𝑗𝑘 𝐸
Prpair (sj,sk) = Q =Q (1 − 𝑅𝑒 𝜌𝑗𝑘 ) ----------------------(1)
2𝑁0 𝑁0
And
1
Erfc(x) = 2 exp
(−𝛾𝑏/2)
It is found by computing the probability that the noise is large enough to make the received signal
geometrically closer to the point sk in the signal space diagram, even though the signal sj was
transmitted.
The modulation formats can be viewed as binary orthogonal signals – most prominently, binary
frequency shift keying (FSK) and binary pulse position modulation (PPM). The decision boundary: if
a received signal point falls into the shaded region, then it is decided thata+1 was transmitted,
otherwise a-1 was transmitted.
Defining the signal-to-Noise Ratio (SNR) for one symbols as 𝛾𝑠 = 𝐸𝑠/𝑁𝑜, we get
= Q ( 𝛾𝑠)
If the phase rotation introduce by the channel is slowly time varying (and thus effectively the
same for two subsequent symbols), it enters just the absolute phase, and thus need not be taken into
account in the detection process.
For differential detection of Phase Shifting Keying (PSK), the transmitter needs to provide
differential encoding. For binary symmetric PSK, the transmit phase ϕi of the ith bit is
𝜋
+ 𝑖𝑓 𝑏 𝑖 =+1
Φi = ϕi-1 + 𝜋
2
− 𝑖𝑓 𝑏 𝑖 =−1
2
Comparison of the difference between phases on two subsequent sampling instances determines
whether the transmitted bit bi was +1 or -1.
For Continuous Phase Frequency Shift Keying (CPFSK), such differential encoding can be
avoided. Remember that in the case of MSK (without differential encoding), the phase rotation over a
1-bit duration is ±π/2.
Where
1 1
a= 2𝛾𝐵 (1 − ), b = 2𝛾𝐵 (1 + )
2 2
In fading, channels the received signal power (and thus the SNR) is not constant but
changes as the fading of the channel changes. In many cases, we are interested in the BER in a fading
channel averaged over the different fading states. For a mathematical computation of the BER in such
a channel, we have to proceed in three steps:
For the binary modulation formats, a 10-dB SNR is sufficient to give a BER on the order of 10-4, for
15dB the BER is below that in a fading channel the BER decreases only linearly with the (Average)
SNR. At first glance, this is astonishing: sometimes fading leads to high SNRs, sometimes it leads to
low SNRs, and it could be assumed that high and low values would compensate for each other. The
important point here is that the relationship between (instantaneous) BER and (instantaneous) SNR is
highly nonlinear, so that the cases of low SNR essentially determine the overall BER.
For AWGN channels, the advantages of the alternative representation of the Q – function are
rather limited. They allow a simpler formulation for higher order modulation formats, but do not
exhibit significant advantages for the modulation formats that are mostly used in practice. The real
advantage emerges when we apply this description method as the basis for computations of the BER
in fading channels.
The average over the pdf of the SNR pdfɤ (ɤ), we have now seen that the alternative
representation of the Q function allows us to write the SER in the generic form:
Ѳ2
SER(ɤ) = Ѳ1
𝑓1 Ѳ exp
(−ɤ𝑓2 (Ѳ)) d Ѳ−
Ѳ2 ∞
= Ѳ1
𝑓1 Ѳ 0
𝑝𝑑𝑓ɤ (ɤ) exp(−ɤ𝑓2 (𝜃)) dɤ d 𝜃
Frequency Dispersion
Consider error due to frequency dispersion. For FSK, it is immediately obvious how
frequency dispersion leads to error: random frequency Modulation (FM) leads to a frequency shift of
the receiver signal, and can push a bit over the decision boundary. Assume that a+1 was sent (i.e., the
frequency fc +fmod). Due to the random FM effect, the frequency fc+ fmod finst is received. If this is
smaller than fc, the receiver opts for a-1.Note that instantaneous frequency shifts can be significantly
larger than the maximum Doppler frequency even though the statistics of the random FM are
determined by the Doppler spectrum of the channel. Consider the following equation for the
instantaneous frequency:
𝑑𝑟 𝑡
𝐼𝑚 (𝑟∗ )
𝑑𝑡
Finst(t) = |𝑟(𝑡)|2
In deep fading dips lead to large shift in the instantaneous frequency, and thus higher error probability.
A somewhat different interpretation can be given for differential detection. The detection assumes that
the channel does not change between two adjacent symbols.
However, if there is a finite Doppler, then the channel does change-remember that the Doppler a
spectrum gives statistical description of channel changes. Thus, a nonzero Doppler effect implies a
wrong reference phase for differential detection. If this effort is strong, it can lead to erroneous
decision. Also in this case it is true that channel changes are strongest near fading dips.
Delay Dispersion
In contrast to frequency dispersion, delay dispersion has great importance for high-data-rate systems.
This becomes obvious when we remember that the errors in un-equalized systems are determined by
the ratio of symbol duration that is disturbed by Inter Symbol Interface (ISI) to that of the un-
disturbed part of the symbol.
The maximum excess delay of a channel impulse response is determined by the environment, and
independent of the system: let us assume in the following a maximum excess delay of 1𝜇𝑠. In a
system with a symbol duration of 20 𝜇𝑠, the ISI can disturb 5% of each symbol, while it can disturb
20% if the symbol duration is 5 𝜇𝑠.
Many theoretical and experimental investigations have shown that the error floor due to delay
dispersion is given by the following equation:
𝑆
𝐵𝐸𝑅 = K(𝑇 𝜏 )2
𝐵
Where 𝑆𝜏 is the rms delay spread of the channel. Just as for frequency dispertion, errors mainly occur
near fading dips. An interpretation of this fact in terms of group delay, which reaches its largest value
near fading dips.
Equation is only valid if the maximum excess delay of the channel is much smaller than the symbol
duration, and the channel is Rayleigh fading.
Advances in hardware for digital signal processing made OFDM a realistic option for wireless
communication systems. OFDM is used for Digital audio broadcasting (DAB), digital video
broadcasting (DVB), and wireless local area networks [LANs].
Principal of OFDM:
Principle – OFDM splits the information into N parallel streams which are then transmitted
by modulating N distinct carries (called Sub-carriers or tones). Symbol duration on each subcarrier
thus becomes targerby a subcarriers they have to be orthogonal.
Where
n – is an integer
N – different carriers.
W – total available bandwidth
𝑁
Total available bandwidth, W = 𝑇𝑠
Where
Ts – symbol duration.
Carrier spacing
FDMA:
OFDM:
Assume, modulation on each of the subcarriers is pulse amplitude modulation (PAM) with rectangular
pulses. Subcarriers are mutually orthogonal, the relationship is
𝑖+1 𝑇𝑠
𝑖𝑇𝑠
exp 𝑗2𝜋 𝑓𝑛𝑡 𝑑𝑡 = 𝛿𝑛𝑘
In time, due to the rectangular shape of pulses, the spectrum of each modulated carrier has a
sin (𝑥)
shape.
𝑥
The spectra of different modulated carriers overlap, but each, carrier is in the spectral nulls of
all other carriers. Therefore, the data stream of any subcarriers will not interface at the receiver during
demodulation process.
Transceiver implementation:
(i)Analog construction:
S/P conversion [serial to parallel conversion]: Data streams are first split into N parallel data
streams each of which has a lower data rate.
Each of the parallel data streams then modulates one of the carriers. Actual implementation
hardware effort of multiple local oscillators is too high. Let the complex transmit symbol at time
instant i on the nth carrier be cn, i.
Receiver
Transmitter
Channel
Ck0 Ck0
The transmit signal is
∞ ∞ 𝑁−1
𝑆 𝑡 = 𝑖=−∞ 𝑆𝑖 𝑡 = 𝑖=−∞. 𝑛=0 𝐶𝑛,𝑖 𝑔𝑛 (𝑡 − 𝑖𝑇𝑠 )
Where
1
𝑔𝑛 𝑡 = exp(𝑗2𝜋 𝑇𝑡𝑠 ) ; for 0<t<Ts
𝑇𝑠
; otherwise
Let us consider the signal only for i=0, and sample it at instances tk=kTs/N.
1 𝑁−1 𝑘
𝑆𝑘 = 𝑆(𝑡𝑘 ) = 𝑛=0 𝐶𝑛,0 exp(𝑗2𝜋𝑛 𝑁 )
𝑇𝑠
This is nothing but the inverse discrete Fourier transform of the transmit sysmbols.
The received signal is demodulated by using locally generated subcarriers. Then, each signal
is serially converted by parallel to serial (p/s) conversion. The result is an estimate 𝐶𝑛 of the original
data Cn.
It would require multiple local oscillators each of which has to operate with little phase noise
and drift in order to retain orthography between the different subcarriers.
Disadvantages:
It is less efficient than digital
Slow in process, hardware complexity is too high.
Low sensitivity to time and frequency dispersion.
(ii)Digital Construction:
The data streams are divided into blocks on N symbols. This block of N data symbols are
subjected to an Inverse Fast Transformations (IFFT) and then transmitted.
Transmitter
Channel
Ck,0
Inverse Parallel to
S(t)
Serial to Ck,1 Fast serial
Data
parallel Fourier
source H
conversion
(IFFT)
Hs(t)
Ck,n-1 Transform
𝐶 k,0
FFT Serial to
parallel
𝐶 k,1 [FastFouri
Parallel to
Data er
serial
sink Transform
conversion
]
𝐶 k,n-1
(K+1) T
Receiver
The input to IFFT is made up of n samples [the symbols for the different subcarriers], and therefore
the output from the IFFT also consists of N values.
These N temporal sample values to be transmitted using parallel to serial converter, one offer
the other.
Receiver:
We can reverse the process the received is to parallel signal converted into seriual using S/P
converter. Then perform FFT on this vector, this resulted signal is an estimate of Cnoriginal data
from τn.
Delay dispersion is OFDM leads to a loss of orthogonality between subcarriers and thus to
inter carrier interference [ICI]
The negative effects can be eliminated by a special type of guard interval called the Cyclic
Prefix [CP]. The performance can be achieved in frequency selective channels.
Cyclic Prefix:
CP means creating a cyclically extended guard interval whereby each symbol sequence is
preceded by a periodic extension of the sequence itself.
Specifically, the last V samples of the symbol sequence are repeated at the beginning of the
sequence being transmitted.
This condition is called cyclic prefix. It is needed for frequency selective channels AWGN
[Additive White Gaussian Noise Channels].
𝑁
𝑇𝑠 = 𝑊
Ts – is symbol duration
Ts - 𝑇𝑠 + 𝑇𝑐𝑝
The base function means that for duration 0<t<𝑇𝑠 the “normal” OFDM symbol is transmitted.
During time - 𝑇𝑐𝑝 < t < 0, a copy of the last part of the symbol is transmitted.
Sk
Cyclic prefix
-Ncp N-Ncp
K
-1 N-1
𝑁
gn(t) = gn [t+𝑊 ]. This pretended part of the signal is called the “cyclic prefix” shown in above
diagram.
When transmitting any data stream over a delay – dispressive channel the arriving signal is the
linear convolution of the transmitted signal with the channel impulse response. The CP converts this
Linear Convolution into a cyclical convolution. During the time 0<t<τmax, where τmaxis the maximum
excess delay of the channel.
The received signal suffers from ISI [Inter symbol Interference], as echoes of the last part of
the preceding symbol interfere with the desired symbol. This ISI is eliminated by discarding the
received signal during this time interval.
During the remainder of the symbol, we have cyclical ISI. It is the last part of the current (not
the preceding) symbol that interfaces with the first part of the current symbol.
each block of n data symbol is subjected to an IFFT and then the last NTcp/Ts samples are
preponded.
Ck,0
Inverse
Serial to Ck,1 Fast
Data Parallel Addition of
parallel Fourier
source cyclic prefix
conversion to serial
(IFFT)
Transform Conversio
Ck,n-1
n S(t)
𝐶 k,0 Channel
1-tap
equalizer Fast Serial
Serial to Fourier Stripping
Data to
parallel 1-tap of cyclic
source Transform H
conversion 𝐶 k,1 equalizer Parallel prefix
1 (FFT)
Conversio Hs(t)
𝐶 k,, N-1
1-tap n
,n-1 equalizer
The resulting signal is modulated onto a (single) carrier and transmitted over a channel, which distorts
the signal and adds noise.
At the receiver, the received signal is partitioned into books. For each block the cyclic prefix
(CP) is removed and the remainder is subjected to an FFT.
The resulting samples are equalized by means of one-tap equalization that is division by the
complex channel attenuation on each carrier.
The cyclic prefix (cp) converts a frequency – selective channel into a number of parallel flat-
fading channels. This is positive in the sense that it gets free from ISI that plagues TDMA and CDMA
systems.
If a subcarrier is in a fading dip, then error probability is very high, and dominates the BER
[Bit Error Rate] of the total system for high SNRs.
Thus, low SNR, the transmitter will send symbols using stronger encoding and a smaller
modulation alphabet, The power allocated to each subcarrier can be varied.
Channel estimation:
OFDM systems requires an estimate of the channel transfer function or the channel impulse response.
the good channel estimators are
(i) Pilot symbols – which are mainly suitable for an initial estimate of the channel.
(ii) Scattered pilot tones whichhelp to track changes in channels over time.
(iii) Eligen value decomposition – based methods – which can be used to reduce the
complexity of the first two methods.
The peak amplitude of the emitted signal can be considerably higher than the average
amplitude. PAR occurs in OFDM signal is the superposition of N sinusoidal signals on different
subcarriers.
Due to PAR, non-linear distortions and decreased spectral efficiency is OFDM system. So, we
use PAR reduction techniques, these are:
Intercarrier interference:
The cyclic prefix provides an excellent way of ensuring orthogonality of the carriers in delay
dispersive environment. ICI can be eliminated of OFDM.
One of the major problems of OFDM is that the peak amplitude of the emitted signal can be
considerably higher than the average amplitude. This issue originates from the fact that an OFDM
signal is the superposition of N sinusoidal signals on different subcarriers.
On Average the emitted power is linearly proportional to N. sometimes the signal on the
subcarriers add up constructively so that the amplitude of the signal is proportional to N and the power
thus goes with N2.
The contributions to the total signal from the different subcarriers can be viewed as random
variables (they have quasi random phases, depending on the sampling time as well as the value of the
symbol with which they are modulated).
If the number of subcarriers is large the central limit theorem to show that the distribution of
the amplitudes of in-phase components is Gaussian, with a standard deviation 𝜍 = 1 2 (and
similarly for the quadrature components) such that mean power is unity. Since both in-phase and
quadrature components are Gaussian, the absolute amplitude is Rayleigh-distributed.
Knowing the amplitude distributions it is easy to compute the probability that the
instantaneous amplitude will be above a given threshold and similarly for power is 6dB above the
average power.
Phase adjustments
These code words only a subset of size 2K is acceptable in the sense that its PAR is lower than a
given threshold. Both the transmitter and the receiver know the mapping between a bit combination
of length K and the codeword of length N that is chosen to represent it which has a admissible
PAR.
The coding scheme can guarantee a certain value for the PAR. It also has some coding gain is
smaller than for code that are solely dedicated to error correction.
2. PHASE ADJUSTMENTS:
This scheme first defines an ensemble of phase adjustment vectors ∅ l, l= 1,….,L, that are
known to both the transmitter and receiver; each vector has N entire {∅}. The transmitter than
multiplies the OFDM symbol to be transmitted cn by each of these phase vectors to get:
𝑐𝑛 l = cnexp[j (∅n)l]
and then selects:
𝑙 = argmin (PAR ( 𝑐𝑛 l))
The vector which gives the lowest PAR. 𝑐𝑛 𝑙 is then transmitted, together with index 𝑙 .The
receiver can then undoes phase adjustment and demodulate the OFDM symbol.
This method has the advantage that the overhead is rather small.
The correction function should be smooth enough nit to introduce significant out-of-band
interference. Furthermore the correction function acts as additional pseudo-noise and thus
increases the BER of the system.
When comparing the different approaches to PAR reduction we find that there is no single
“best” technique. The coding method can guarantee a maximum PAR value but requires
considerable overhead and thus reduced throughput.
The phase adjustment method has a smaller overhead (depending on the number of phase
adjustment vectors), but cannot give a guaranteed performance. Neither of these two methods
leads to an increase in either ICI or out-of-band emissions.
WINDOWING
Introduction
The digital signals are infinite in nature and sufficiently large that the dataset cannot be
manipulated as a whole. Such a large set of signals are difficult to analyze statistically, because
statistical calculation require all points to be available for analysis. In order to avoid these
problems, typically to analyze small subset of the total data, through a process called
windowing.
The nonlinear distortion of the OFDM signal significantly increases the level of the out
of band radiation. The OFDM signals consist of number of unfiltered sub-carriers. Therefore
the out-of band spectrum decreases rather slowly with the speed depending on the number of
subcarriers.
UNIT IV
Introduction:
In wireless communication systems requires signal processing technique to improve the link performance in
radio environment. The multipath propagation and Doppler spread have a negative impact on the bit error
rate of any modulation technique. Equalization, diversity and channel coding are three techniques to improve
received signal quality.
EQUALIZATION
Introduction
Equalization compensates for intersymbol interface (ISI) created by multipath within time dispersive channels.
If the modulation bandwidth exceeds the coherence bandwidth of the radio channel, ISI occurs and
modulation pulses are spread in time into adjacent symbols. An equalizer within a receiver compensates for
the average range of expected channel amplitude and delay characteristics. Equalizers must be adaptive since
the channel is generally unknown and time varying.
Intersymbol interface (ISI) caused by multipath in band limited (frequency selectively) time dispersive
channels distorts the transmitted signal, causing bit errors at the receiver. ISI has been recognized as the
major obstacle to high speed data transmission over wireless channels. Equalization is a technique used to
fight against intersymbol interference.
ADAPTIVE EQUALIZER
In radio channels, a variety of adaptive equalizers can be used to cancel interference while providing
diversity. The mobile fading channel is random and time varying, equalizers must track the time varying
characteristics of the mobile channel, and thus are called adaptive equalizers.
(ii) Tracking.
A known, fixed-length training sequence is send by the transmitter so that the receiver’s equalizer may adapt
to a proper sending for minimum bit error rate (BER) detection.
The training sequence is typically a pseudorandom binary signal is a fixed, prescribed bit pattern. Immediately
following this training sequence, the user data (which may or may not include coding bits) is sent, and the
adaptive equalizer at the receiver utilizes a recursive algorithm to evaluate the channel and estimate filter
coefficients to compensate for the distortion created by multipath in the channel.
Tracking
The training sequence is designed to permit an equalizer at the receiver to acquire the proper filter
coefficients in the worst possible channel conditions. As user data are received, the adaptive algorithm of the
equalizer tracks the changing channel. As a consequence, the adaptive equalizer is continually changing its
filter characteristics overtime. When an equalizer has been properly trained, it is said to have converged.
The time span over which an equalizer converges is a function of the equalizer algorithm, the
equalizer structure, and the time rate of change of the multipath radio channel. Equalizers require periodic
retraining in order to maintain effective ISI cancellation.
If x(t) is the original information signal, and f(t) is the combined complex baseband impulse response of the
transmitter, channel, and the RF/IF sections of the receiver, the signal received by the equalizer may be
expressed as
Original baseband
message x(t) Radio channel
Modulator Transmitter
BLOCK DIAGRAM OF ADAPTIVE EQUALIZER
If the impulse response of the equalizer is heq(t), then the output of the equalizer is
If the channel is frequency selective, the equalizer enhances the frequency components with small amplitudes
and attenuates the strong frequencies in the received frequency spectrum in order to provide a flat,
composite, received frequency response and linear phase response.
For a time-varying channel, an adaptive equalizer is designed to track the channel variations is approximately
satisfied.
Equalization techniques can be subdivided into two general categories linear and nonlinear
equalization. These categories are determined from how the output of an adaptive equalizer is used for
subsequent control (feedback) of the equalizer. In analog signal d (t) is processed by the decision making
device in the receiver. The decision maker determines the value of the digital data bit being received and
applies a slicing or thresholding operation (a non-linear operation) in order to determine the value of d (t).
Linear Equalizer
If d(t) is not used in the feedback path to adapt the equalizer, the equalization is linear.
If d(t) is fed back to change the subsequent outputs of the equalizer. Many filter structures are used to
implement linear and nonlinear equalizers.
CLASSIFICAATION OF EQUALIZER:
EQUALIZER
Nonlinear
Linear
ML symbol
DFE MLSE
Detector
Linear equalizer can be implemented as an FIR filter, otherwise known as the traversal filter. This type
of equalizer is the simplest type available.
In this equalizer, the current and past values of the received signal are linearly weighted by the filter
coefficient and summed to produce the output. If the delays and the tap gains are analog, the continuous
output of the equalizer is sampled at the symbol rate and the samples are applied to the decision device.
The most common equalizer structure is a linear traversal equalizer (LTE). A linear transversal filter is made up
of tapped lines, with the tapings spaced a symbol period (Ts) apart.
Assuming that the delay elements have unity gain and delay Ts, the transfer function of a linear traversal
equalizer can be written as a function of the delay operator exp(-jωTs) or Z-1.
.
Delay elements
Ts Ts Ts Ts
Y(t)+nb(t)
ClockZ
Taps
This simplest LTE uses only feed forward taps, and the transfer function of the equalizer filter is a polynomial
in Z-1. This filter has many zeroes but poles only at z=0, and is called a finite impulse response (FIR) filter, or
simply a traversal filter.
Yk+N1-1 Yk Yk+N2
Yk+N1 Yk-N2
z-1 z-1 z-1 +1 z-1
If the equalizer has both feed forward and feedback taps, its transfer function is a rational function of Z -1, and
is called an infinite impulse response (IIR) filter with poles and zeroes
𝑁2
𝑑k = 𝑛=−𝑁1 (𝑐𝑛 ∗)𝑦𝑘−𝑛
The values N1 and N2 denote the number of taps used in the forward and reverse portions of the equalizer,
respectively. The minimum mean squared error E[|e(n)|2] that a linear transversal equalizer can be achieved .
𝜋
𝑇 𝑁0
E [|e (n) |2] = 2𝜋 𝑇
−𝜋 𝑖𝜔𝑇 )|2 +𝑁 0
𝑑𝜔
𝑇
|𝐹(𝑒
Where 𝐹(𝑒 𝑖𝜔𝑇 ) is the frequency response of the channel, and N0 is the noise power spectral density.
Lattice Equalizer
In lattice structure the input signal Yk is transformed into set of N intermediate forward fn(k) and backward
error signals nn(k). Those two signal are used as input to the tap multiplier and are used to calculate the
updated co-efficient.
𝑓1 𝑘 = 𝑏1 𝑘 = 𝑦 𝑘
𝑛
bn k = y k − n − k i y(k − n + 1)
i=1
= 𝑏𝑛−1 𝑘 − 1 + 𝐾𝑛−1 𝑘 𝑓𝑛−1 (𝑘)
where Kn(k) is the reflection coefficient for the nth stage of the structure
The backward error signal bn are then used as input to the tap weight
𝑑= 𝑐𝑛 𝑘 𝑏𝑛 𝑘
𝑛=1
(iii) Unique structure allows the dynamic assignment of the most efficient
length.
(iv) If the channel is not time dispersive, only a fraction of stages are used.
(ii) For severe distortion channel, lattice equalizer is not preferable one.
Σ Σ
Y K1 KN-1
b2(k)
bN
Z-1 Σ Z-1 Σ
b1(k-1)
b1(k)
C1
C2 CN
𝑑1
NONLINEAR EQUALIZATION:
Nonlinear equalizers are used in applications where the channel distortion is too server for a linear
equalizer to handle, and are commonplace in practical wireless systems.
Linear equalizers do not perform well on channels which have deep spectral null in the passband. Three very
effective nonlinear methods have been developed which offer improvements over linear equalization
techniques and are used in most 2G and 3G system. They are
The basic idea behind decision feedback equalization is that once an information symbol has been detected
and decides upon, the ISI that it includes on future symbols can be estimated and subtracted out before
detection of subsequent symbols.
The DFE can be realized in either the direct transversal from or as a lattice filter. The direct from is shown in
figure. It consists of a feed forward filter (FFF) and a feedback filter (FBF). The FBF is driven by decision on the
output of the detector, and its Coefficients can be adjusted to cancel the SIS on the current symbol from past
detected symbols.
The equalizer has N1+N2+1 taps in the feed forward filter and N3 taps in the feedback filter, and its
output can be expressed as:
𝑁2 ∗ 𝑁3
𝑑k = 𝑛 =−𝑁1 𝐶𝑛 𝑌𝑘−𝑛 + 𝑖=1 𝐹𝑖 𝑑𝑘−𝑖
Where 𝐶𝑛∗ and 𝑌𝑛∗ are taps gain and the inputs, respectively, to the forward filter,
d^k
dk
+ + + +
FN3 FN3-1 F1
+ +
𝑑k is obtained using Equation. Then, dk along with previous decisions dk-1, dk-2.....are feedback into the
equalizer, and 𝑑k+1is obtained using Equation. The minimum mean squared error a DFE can achieved
𝑇 𝜋 𝑇 𝑁
E[|e(n)|2]min = exp {2𝜋 −𝜋 𝑇
𝑖𝑛 [|𝐹(𝑒 𝑖𝜔𝑇 0)|2 +𝑁0] 𝑑𝜔}
It can be shown that the minimum MSE for a DFE in Equation is always smaller than that of an LTE in
Equation unless |𝐹(𝑒 𝑖𝜔𝑇 )| is a constant, a DFE has significantly smaller minimum MSE than an LTE.
Thus, a DFE is more appropriate for severely distorted wireless channels. The lattice implementation
of the DFE is equivalent to a transversal DFE having a feed forward filter of length N1 and a feedback filter of
length N2, where N1>N2.
PREDICTIVE DFE
Another form of DFE is called a predictive DFE. It also consists of a feed forward filter (FFF) as in the
conventional DFE.
However, the feedback filter (FBF) is driven by an input sequence formed by the difference of the
output of the detector and the output of the feed forward filter.
Hence, the FBF here is called a noise predictor because it predicts the noise and the residual ISI
contained in the signal at the FFF output and subtracts from it the detector output after some feedback delay.
The predictive DFE performs as well as the conventional DFE as the limit in the number of taps in the
FFF and the FBF approach infinity. The FBF in the predictive DFE can also be realized as a lattice structure. The
RLS lattice algorithm can be used in this case to yield fast convergence.
The MSE based linear equalizers are optimum with respect to the criterion of minimum probability of
symbol error when the channel does not introduce any amplitude distortion.
These equalizers use various forms of the classical maximum likelihood receiver structure. Using a channel
impulse response simulator within the algorithm, the MLSE tests all possible data sequence (rather than
decoding each received symbol by itself), and choose the data sequence with the maximum probability as the
output. An MLSE as national requirement, especially when the delay spread of the channel is large.
The MLSE can be viewed as a problem in estimating the state of a discrete-time finite state machine,
which in this case happens to the radio channels with coefficients fk and with a channel state which at any
instant of time is estimated by the receiver based on the L most recent input samples. The block diagram of a
MLSE receiver based on the DFE is shown in.
Requirements of MLSE
The MLSE is optimal in the sense that it minimizes the probability of a sequence error. The MLSE
requires knowledge of the channel characteristics in order to compute the metrics for making decisions. The
MLSE also requires knowledge of the statistical distribution of the noise computing the signal.
Thus, the probability distribution of the noise determines the form of the metric for optimum
demodulation of the received signal. Notice that the matched filter operates on the continuous time signal,
whereas the MLSE and channel estimator relay on discretized (nonlinear) sample.
Received Signal
Sample +
Feed Back Ʃ Decision Device
Filter
Output
Decision
-
THE STRUCTURE OF A MAXIMUM LIKELIHOOD SEQUENCE
Channel output
Estimated data
Z(t) {zn}
y(t) sequence
Matched Filter MLSE
{an}
{si}
Delay
+
Channel
+
Estimator
-
Since an adaptive compensates for an unknown and time-varying channel, it requires a specific
algorithm to update the equalizer coefficients and track the channel variations.
A wide range of algorithm exists to adapt the filter coefficients. The development of adaptive algorithms is a
complex undertaking, and it is beyond the scope of this text to delve into great detail on how this is done. The
performance of an algorithm is determined by various factors which include:
Rate of convergence - This is defined as the number of iterations required for the algorithm, in
response to stationary inputs, to converge close enough to the optimum solutions. A fast rate of convergence
allows the algorithm to adapt rapidly to a stationary environment of unknown statistic. Furthermore, it
enables the algorithm to track statistical variations when operating in a non-stationary environment.
Misadjustment - this parameter provides a quantitative measure of the amount by which the final
value of the mean square error, average over an ensemble of adaptive filters, deviates from the optimal
minimum mean square error.
Computational complexity – This is the number of operations required to make one complete iteration
of the algorithm.
In practice, the cost of the computing platform, the power budget, and the radio propagation
characteristics dominate the choice of an equalizer structure and its algorithm.
The choice of algorithm, and is corresponding rate of convergence, depends on the channel data and
coherence time.
The maximum excepted time delay spread of the channel dictates the number of taps to the equalizer
design. An equalizer can only equalize over delay intervals less than or equal to the maximum delay within the
filter structure.
Three classic equalizer algorithms are discussed below. These includes the 1. Zero forcing (ZF)
algorithm,
In a zero forcing equalizer, the equalizer coefficients Cn are chosen to force the samples of the
combined channel and equalizer impulse response to zero at all but one of the NT spaced sample points in the
tapped delay line filter.
By letting the number of coefficients increase without bound, an infinite length equalizer with zero ISI at the
output can be obtained.
When each of the delay elements provide a time delay equal to the symbol duration T, the frequency
response Heq(f) of the equalizer is periodic with a period equal to the symbol rate 1/T. the combined response
of the channel with the equalizer must stratify NY Quist’s first criterion.
ISI equalizer is simply an inverse filter which inverts the folded frequency response of the channel. Thus
infinite length equalizer is usually implemented by a truncate length version.
Disadvantages
1. The zero forcing equalizer has the disadvantages that the inverse filter may excessively amplify noise at
frequencies where the folded channel spectrum has high attenuation.
2. The ZF equalizer thus neglects the effect of noise altogether, and os not often used for wireless links.
However, it performs well foe static channel with high SNR such as local wired telephone lines.
A more robust equalizer is the LMS equalizer where the criterion used is the minimization of the mean
square error (MSE) between the desired equalizer output and the actual equalizer output. Using the notation
developed in algorithm can be readily understood.
ek =dk - 𝑑k= xk - 𝑑k
ek = xk -𝑌𝑘𝑇 𝑤𝑘 = xk -𝑤𝑘𝑇 𝑦𝑘
To compute the mean square error |ek|2 at time instant k, Equation is squared to obtain
ξ = E*𝑒𝑘∗ ek]
The LMS algorithm seeks to minimize the mean square error given in Equation. For a specific channel
condition, the prediction error ek is dependent on the tap gain vector wN,
so the MSE of an equalizer is a function of wv. Let the cost function J(wN) denote the mean square
error as a function of tap gain vector wN in order to minimize the MSE zero.
𝜕
J( wN) = -2𝑝𝑁 + 2RNN𝑊𝑁 =0
𝜕𝑊𝑁
Simplifying Equation
2RNN𝑊𝑁 = 𝑝𝑁
Since the error is minimized and is made orthogonal to the projection related to the desired signal Xk.
when Equation is satisfied the MMSE of the equalizer is
To obtain the optimal tap gain vector 𝑊𝑁 , the normal equation in must be solved interactively as the
equalizer converges to an acceptably small value of Jopt. There are several ways to do this and many variants of
the LMS algorithm have been built upon the solution of equation. One obvious technique is to calculate.
𝑊 = R-1NN𝑝𝑁
However inverting a matrix requires O(N3) arithmetic operations.
Advantages
The advantages of these methods which directly solve Equation is that only N symbol inputs are required to
solve the normal equation. Consequently a long training sequence is not necessary.
The LMS algorithm is the simplest equalization algorithm and required only 2N+1 operation per
iteration.
The filter weights are updated by the equations given below. Letting the variable n denote the sequence of
iterations, LMS is compute iteratively by
Where the subscript N denotes the number of delay stages in the equalizer and α is the step size
which controls the convergence rate and stability of the algorithm.
The LMS equalizer maximize the signal to distortion ratio its output within the constraints of the
equalizer filter length. If an input signal has a time dispersion characteristic that is greater than the
propagation delay through the equalizer then the equalizer will be unable to reduce distortion.
Disadvantage
The convergence rate of the LMS algorithm is slow due to the fact that the there is only one parameter the
step α that controls the adaptation rate. To prevent the adaptation from becoming unstable the value of α is
chosen from
𝑁
0< α<2/ 𝑖=1 𝜆𝑖
The convergence rate of the gradient-based LMS algorithm is very slow, especially when the eigen
values of the input covariance matrix RNN have a very large speed, 𝜆 max/λmin>>1.
In order to achieve faster convergence, complex algorithms which involve additional parameters are used.
Faster converging algorithms are based on a least squares approach, as opposed to the statistical approach
used in the LMS algorithm.
That is rapid convergence relies on error measures expressed In terms of a time average of the actual received
signal instead of a statistical average. This leads to the family of powerful, albeit complex adaptive signal
processing techniques known as recursive least squares (RLS), which significantly the convergence of adaptive
equalizer.
Where 𝜆 is the weighting factor close to 1, but smaller than 1, e*(i, n) is the complex conjugate of e(i,
n), and the error e(i, n) is
Where YN(i) is the data input vector at time I, and WN(n) is the new tap gain vector at time n.
e(i, n) is the error using the new tap gain at time n to test the old data at time i, and
J(n) is the cumulative squared error of the new tap gains on all the old data.
To obtain the minimum of least square error J(n) the gradient of J(n) in equation is set to zero
𝜕
𝜕𝑊𝑁
J(n) =0
The matrix RNN(n) in equation is the deterministic correlation matrix of input data of the equalizer y N(i)
and PN(i) in equation is the deterministic cross-correlation vector between inputs of the equalizer yN(i) and the
desired output d(i), where d(i) = x(i). To compute the equalizer weight vector 𝑤𝑁 using equation it is required
to compute R-1NN(n).
From the definition of RNN(n) in equation it is possible to obtain a recursive equation expressing RNN(n)
in terms of RNN(n-1)
Since the three terms in equation are all N by N matrices a matrix inverse lemma can be used to
𝑇−1 𝑇−1
derive a recursive update for 𝑅𝑁𝑁 in terms of the previous inverse 𝑅𝑁𝑁 (n-1)
𝑇−1 𝑇 𝑇−1
𝑇−1 1𝑇−1 𝑅𝑁𝑁 (n−1)yN(n)𝑦𝑁 (n)𝑅𝑁𝑁 (n−1)
𝑅𝑁𝑁 (𝑛) = 𝜆 [𝑅𝑁𝑁 (n-1) - 𝜆+𝜇 (𝑛)
Where
Based on these recursive equations the RLS minimization leads to the following weight update
equations:
WN(n) = wN(n-1) + KN(n)e*(n,n-1)
Where
𝑇−1
𝑅𝑁𝑁 (n−1)yN(n)
KN(n) = 𝜆+𝜇 (𝑛)
1. Initialize w(0) = K(0) = x(0) = 0, R-1(0) = 𝛿𝐼 nn, where INN is an N*N identity matrix, and 𝛿 is a large
positive constant.
𝑑(n) = wT(n-1)y(n)
e(n) = x(n)-𝑑(n)
𝑅 −1 𝑛−1 𝑦(𝑛)
k(n) = 𝜆+𝑌 𝑇 𝑛 𝑅 −1 𝑛−1 𝑦(𝑛)
1
𝑅 −1 (n) = [𝑅 −1 𝑛 − 1 -k(n)yT(n)𝑅 −1 𝑛 − 1 ]
𝜆
w(n) =w(n-1) +k(n)e*(n)
In equation 𝜆 is the weighting coefficient that can change the performance of the equalizer. If a
channel is time-invariant, 𝜆 can be set to one. The value of 𝜆 has no influence on the rate of convergence, but
does determines the tracking ability of the RLS equalizers. The smaller the value of 𝜆 then better the tracking
ability of the equalizer. However, if 𝜆 is too small the equalizer will be unstable.
DIVERSITY TECHNIQUES:
Introduction
Diversity is a powerful communication receiver technique that provides wireless link improvement at
relatively low cost. Unlink equalizations, diversity requires no training overhead since a training sequence is
not required by the transmitter.
Diversity is a method used to develop information from several signal transmitted over independent
fading paths. It exploits the random nature of radio propagation by finding independent signal paths for
communications.
In such a system, the receiver is provided with multiple copies of the same information signal which
are transmitted over two or more real or virtual communication channels. Thus the basic idea of diversity
is repetition or redundancy of information. In virtually all the applications, the diversity decisions are made
by the receiver and are unknown to the transmitter.
It is a very simple concept where if one path undergoes to a deep fade, another independent path
may have a strong signal. As there is more than one path to select from both the instantaneous and average
SNRs at the receiver may be improved.
Consider the simple case of an Rx with two antennas. The antennas are assumed to be far enough
from each other that small scale fading is independent at the two antennas. The Rx always chooses the
antenna that has instantaneously larger receive power.
Classification of fading
There are two types of fading-small-scale and large-scale fading.
(i) Small-scale faders are characterized by deep and rapid amplitude fluctuations which occur as the
mobile moves over distances of just a few wavelengths. These faders are caused by multiple reflections from
the surrounding in the vicinity of the mobile.
In order to prevent deep fades from occurring, microscopic diversity techniques can exploit the rapidly
changing signal. For example the small-scale fading shown revels that if two antennas are separated by a
fraction of a meter, one may receive a null while the other receivers a strong signal. By selecting the best
signal at all times a receiver can mitigate small-scale fading effects.
(ii) Large-scale fading is caused by shadowing due to variations in both the terrain profile and the
nature of the surrounding. In deeply shadowed conditions the received signal strength at a mobile can drop
well below that of free space.By selecting a base station which is not shadowed when others are, the mobile
can improve substantially the average signal-to-noise ratio on the forward link. This is called macroscopic
diversity, since the mobile is taking advantage of large separations between the serving base stations.
Macroscopic diversity is also useful at the base station receiver. By using base station antennas that
are sufficiently separated in space the base station is able to improve the reverse link by selecting the antenna
with the strongest signal from the mobile.
MICRO DIVERSITY
The basic principle of diversity is that the Rx has multiple copies of the transmit signal, where each of
the copies goes through a statistically independent channel. For narrowband signals, small scale fading results
in a Rayleigh fading. In order to prevent deep fades from occurring microscopic technique can be used. The
diversity method that fight against small scale fading i.e. the fading created by interference of MPCs is called
as micro diversity.
The most five methods are:
1. Temporal diversity: Transmission of the transmit signal at different times
2. Spatial diversity: Several antenna element separated in space
3. Frequency diversity: Transmission of the signal on different frequencies
4. Angular diversity: Multiple antennas with different antenna pattern
5. Polarization diversity: Multiple antennas with different polarization.
TEMPORAL DIVERSITY
Principle
In the wireless propagation channel is time variant, signal that are received at different times are
𝟏
uncorrelated. For sufficient de-correlation, the temporal distance must be at least 𝟐𝛄 .
𝐦𝐚𝐱
where 𝛄𝐦𝐚𝐱 is the maximum Doppler frequency.
In a static channel, where neither transmitted (Tx), Rx, nor the IOs are moving, the channel state is the
same at all times. Temporal diversity cal be realized by the following ways:
1. Repetition coding
2. Automatic repeat request (ARQ)
3. Combining of interleaving and coding
1. REPETITION CODING
The signal is repeated several times, where the repetition intervals are long enough to achieve de-
correlation. This obviously achieves diversity, but is also highly bandwidth inefficient. Spectral efficiency
decreases by a factor that is equal to the number of repetitions.
Disadvantages
Retransmission occurs always
2. AUTOMATIC REPEAT REQUEST (ARQ)
The Rx sends a message to the Tx to ensure whether it received the data with sufficient quantity. If
the data is not transmitted successfully, then the transmission is repeated.
Advantages
1. The spectral efficiency of ARQ is better than that of repetition coding.
2. It requires multiple transmissions only when the first transmission occurs
in a bad fading state.
Disadvantages
1. It requires feedback channel.
Spatial Diversity
Switched diversity
Equal gain Diversity (EGD)
Feedback diversity
G1
G2 Switching logic or
Demodulators output
m
antenna
Gm
Variable gain
GENERALIZED BLOCK DIAGRAM FOR SPACE DIVERSITY
Antenna A
Rx filter
RSSI
Antenna B Comparator Demodulator
RSSI
DERIVATION OF SELECTING DIVERSITY IMPROVEMENT:
Consider M independent Rayleigh fading channels available at a receiver. Each channel is called a
diversity branch further assume that each branch has the same average SNR given by
𝐸
SNR = ⎾ = 𝑁𝑏 𝛼 2
0
Where we assume 𝛼 2 =1.
If each branch has an instantaneous SNR = 𝛾𝑖 , then from equation the pdf of 𝛾𝑖 is
−𝛾 𝑖
1
P(𝛾𝑖 ) = ⎾ 𝑒 ⎾ 𝛾𝑖 ≥0
Where ⎾ is the mean SNR of each branch. The probability that a single branch has an instantaneous
SNR less than some threshold 𝛾 is
−𝛾 𝑖 −𝛾 𝑖
𝛾 𝛾 1
pr[𝛾𝑖 ≤ 𝛾] = 0 P(𝛾𝑖 ) d𝛾𝑖 = 0 𝑒 ⎾ d𝛾𝑖 = 1-𝑒 ⎾
⎾
Now the probability that all M independent diversity branches receive signals which are
simultaneously less than some specific SNR threshold 𝛾 is
pr[𝛾𝑖 , …….𝛾𝑀 ≤ 𝛾] = (1- 𝑒 −𝛾 ⎾)M = pM(𝛾)
pM(𝛾)in equation is the probability of all branches failing to achieve instantaneous SNR= 𝛾. If a signal
branch achieves SNR >𝛾 then the probability that SNR >𝛾 for one or more branches is given by
𝑑 𝑀
pr[𝛾𝑖 ≤ 𝛾] = 𝑑𝛾 𝑃𝑀 (𝛾) = ⎾(1- 𝑒 −𝛾 ⎾ )M-1𝑒 −𝛾 ⎾
Then the mean SNR, 𝛾 may be expressed as
∞ ∞
𝛾 = 0 𝛾 𝑝𝑀 (𝛾)d 𝛾 = ⎾ 0 𝑀𝑥 -e-x)M-1 e-xdx
Where x= 𝛾/⎾. Note that ⎾ is the average SNR for a single branch equation is evaluated to yield the
average SNR improvement offered by selection diversity
𝛾 1
⎾
= 𝑀𝑘=1 𝑘
The following example illustrates the advantage that diversity provides.
From equation, it can be seen that the average SNR in the branch which is selected using selection
diversity naturally increases, since it is always guaranteed to be above the specified threshold. Thus selection
diversity offers an average improvement in the link margin without requiring additional transmitter power or
sophisticated receiver circuitry.
(ii) Bit – error –rate –driven diversity
Here we transmit a training sequence i.e. a bit sequence that is known at the Rx. The Rx then
demodulates the signal from each received antenna element and compares it with the transmit signal. The
antenna whose associated signal results in the smallest BER is identified as best signal and used for the
subsequent reception of data signals.
If the channel is time variant, the training sequence has to be repeated at regular intervals and
selection of the best antenna has to done. The necessary repetition rate depends on the coherence time of
the channel.
Disadvantages
1. Rx more complex here it requires N RF chains and demodulators.
2. Spectral efficiency decreases due to training sequence has to be repeated
for every Nr times, so that the signal at all antenna elements can be
evaluated.
3. The variance of BER around its true mean decreases as the duration of the
training sequence increases.
Antenna A
Rx Filter Demodulator
Correlation
Tx Sequence Comparison Detector
Antenna B
Correlation
2. SWITCHED DIVERSITY
In this the selection criterion of active diversity branch is monitored. If it falls below a certain
threshold, then the Rx switches to a different antenna. Switching only depends on the quality of the active
Rx Filter
diversity branch. Demodulator
It does not matter whether the other branch actually provides a better signal quality or not.
The parameters to be considered are switching threshold and hysteresis time.
Antenna
Control
Comparator Present
Threshold
Short-Term
Average
Receiver
Combining diversity
Combining diversity leads to better performance, as all available information is exploited. On the
downside it requires a more complex Rx than selection diversity. In most Rxs all processing is done in the
baseband. Thus the Rx with combining diversity needs to down – convert all available signals and combine
them appropriately in the baseband.
2. Equal gain combining (EGC) where all amplitude weights are the same (or no weighting but just a phase
correction)
1 γ1
G1
2 γ2
Cophase and Sum Detector
G2
m γm
m
Gm
Antenna
Adaptive control
MAXIMAL RATIO COMBINER
In this method the signal from all of the M branches are weighted according to their individual signal
voltage to noise power rations and then summed. Here, the individual signals must be co-phased before being
summed which generally requires an individual receiver and phasing circuit for each antenna element.
Maximal ratio combining produces an output SNR equal to the sum of the individual SNR as explained.
𝑁
𝑛−1 𝑊𝑛
∗ 𝑎𝑛 2
𝑃𝑛 𝑁
𝑤𝑛 2𝑛−1
Output SNR of the diversity combiner is the sum of the branch SNRs:
𝑁𝑟
𝛾𝑀𝑅𝐶 = 𝛾𝑛
𝑛−1
PDF can be expressed as
1 𝛾 𝑁 𝑟−1 𝛾
𝑝𝑑𝑓 𝛾 = (𝑁𝑟 −1)! 𝛾 𝑁 𝑟
exp
(− 𝛾 )
γ = Nr γ
Modern DSP techniques and digital receivers are now making this optimal form of diversity practical.
Advantages
(i) Thus it has the advantages of producing an output with an acceptable
SNR even when none of the individual signals are themselves
acceptable.
(ii) This technique gives the best statistical reduction of fading of any known
linear diversity combiner.
Disadvantages
(i) It requires individual receiver and phasing circuits for each antenna elements.
(ii) Needs high implementation cost.
In certain case it is not convenient to provide for the variable weighting capability required for true
maximal ratio combining. In such case, the branch weights are all set to unity, but the signals from each
branch are co-phased to provide equal gain combining diversity.
This allows the receiver to exploit signals that are simultaneously received on each branch. The
possibility of producing an acceptable signal from a number of unacceptable inputs is still retained and
performance is only marginally inferior to maximal ratio combining and superior to selection diversity.
Phase Correction
Measurement
Output
Σ Demodulator
Antenna B
Measurement
Advantages
(i) EGC is superior to selection diversity.
Disadvantages
(i) EGC performs worse than MRC by factor π/4.
(ii) EGC is inferior to MGC since interference and noise corrupted signals may be combined with high
quality signals.
FREQUENCY DIVERSITY:
Frequency diversity is implemented by transmitting information on one more than one carrier
frequency. The rationale behind this technique is that frequencies separated by more than the coherence
bandwidth of the channel will be uncorrelated and will thus not experience the same.
If the channels are uncorrelated the probability of simultaneous fading will be the product of the
individual fading probabilities.Frequency diversity is often employed in microwave line-of-sight links which
carry several channels in a frequency division multiplex mode (FDM).
Due to tropospheric propagation and resulting refraction, deep fading sometimes occurs. In practice,
1:N protection switching is provided by a ratio license wherein one frequency is nominally idle but is available
on a stand-by basis to provide frequency diversity switching for any one of the N other carriers (frequency)
being used on the same link, each carrying independent traffic. When diversity is needed, the appropriate
traffic is simply switched to the backup frequency.
Advantages
(i) This methods allow the transmission of information without wasting bandwidth.
(ii) Frequency diversity can be exploited by the system to make a more robust and decreases the
effects of fading.
Disadvantages
(i)This technique requires spare bandwidth
(ii) It also requires that there be as many receivers as there are channels used for the frequency
diversity.
PROARIZATION DIVERSITY:
At the base station space diversity is considerable less practical than at the mobile because the
narrow angle of incident fields requires large antennas spacing. The comparatively high cost of using space
diversity at the base station prompts the consideration of using orthogonal polarization to exploit polarization
diversity. While this only provides two diversity branches it does allow the antenna elements to be co-located.
Measured horizontal and vertical polarization paths between a mobile and a base station are reported
to be uncorrelated. The de-correlation for the signals in each polarization is caused by multiple reflections in
the channel between the mobile and base stations antennas.
Circular and linear polarized antennas have been used to characterize multipath inside building. When
the path was obstructed polarizations diversity was found to dramatically reduce the multipath delay spared
without significantly decreasing the received power.
While polarization diversity has been studied in the past, it has primarily been used for fixed ratio links
which vary slowly in time. Line-of-sight microwave links for example typically use polarization diversity to
support two simultaneous users on the same radio channel. Since the channel does not change much in such
a link there is little likelihood of cross polarization interference. As portable users proliferate, polarizations
diversity is likely to become more important for improving link margin and capacity.
Y
V2 V1
X
Multipath β
MACRO DIVERSITY
The diversity methods that combat large – scale fading i.e. the fading created by shadowing effect is
called as macro diversity.
Shadowing is almost independent of transmit frequency and polarization, so that frequency diversity
or polarization diversity is not effective. If correlation distances for large – scale fading are order of tens or
hundreds of meters, then the spatial diversity can be used.
The simplest method for macrodiversity is the use of on – frequency repeaters that receive the signal
and retransmit an amplified version of it.
Advantages
(i) Uses of on-frequency repeaters that receive the signal and retransmit an amplified version of it.
(ii) In cellular application the two BSs should be synchronized.
(iii) For compensating large signal fading, macro-diversity is used.
RAKE RECEIVER:
In CDMA spread spectrum systems, the chip rate is typically much greater than the flat-fading
bandwidth of the channel. Whereas a conventional modulation technique requires an equalizer to undo the
intersymbol interference between adjacent symbols, CDMA spreading codes are designed to provide very low
correlation between successive chips.
Thus propagation delay spread in the ratio channel merely provides multiple versions of the
transmitted signal at the receiver. If these multipath components are delayed in time by more than chip
duration, they appear like uncorrelated noise at a CDMA receiver and equalizations is not required. The
spread spectrum processing gain makes uncorrelated noise negligible after dispreading.
However since there is useful information in the multipath components, CDMA receivers may
combine the time delayed versions of the original signal transmission in order to improve the signal-to-noise
ratio at the receiver.
A RAKE receiver does just this – it attempts to collect the time-shifted versions of the original signal by
providing a separate correlation receiver for each of the multipath signals. Each correlations receiver may be
adjusted in time delay so that a microprocessor controller can cause different correlation receiver to search in
different time windows for significant multipath.
The range of time delays that a particular correlateor can search is called a window. The RAKE receiver
shown is essentially a diversity receiver designed specifically for CDMA where the diversity is provided by the
fact that the multipath components are practically uncorrelated from one another when their relative
propagation delays exceed a chip period.
Z1
To explore the performance of a RAKE receiver assume M Correlators are used in a CDMA receiver to capture
the M strongest multipath components. A weighting network is used to provide a linear combination of the
Correlator output for bit detection. Correlator 1 is synchronized to the strongest multipath m 1. Multipath
component m2 arrives𝜏1 later than component m1 where 𝜏2 − 𝜏1 is assumed to be greater than a chip
duration. The second Correlator is synchronized to m2. It correlates strongly with m2but has low correlation
with m1. Note that if only a single Correlator is used in the receiver, once the output of the single Correlator is
corrupted by fading, the receiver cannot correct the value. Bit decisions based on only single correlation may
produce a large bit error rate. In a RAKE receiver if the output from one Correlator is corrupted by fading, the
others may not be discounted through the weighting process. Decisions based on the combinations of the M
separate decision statistic offered by the RAKE provide a form of diversity which can overcome fading and
thereby improve CDMA reception.
The M decision statistics are weighted to from an overall decision statistics as shown. The outputs of
the M Correlators are denoted as z1,z2,…..and zm. they are weighted α 1, α 2 ….and α mrespectively. The
weighting coefficients are based on the power or the SNR from each Correlators output. If the power or SNR is
small out of a particular Correlator, it will be assigned a small weighting factor. Just as in the case of a maximal
ratio combining diversity scheme, the overall signal z’ is given by
Z’ = 𝑀 𝑚 =1 α𝑚 𝑍𝑚
The weighting coefficients, α m are normalized to the output signal power of the Correlator in such a
way that the coefficients sum to unity as shown.
2
𝑍𝑚
αm= 𝑀 2
𝑚 =1 𝑍𝑚
As in the case of adaptive equalizer and diversity combining there are many ways to generate the
weighting coefficients. However due to multiple access interference, RAKE fingers with strong multipath
amplitudes will not necessarily provide strong output after correlation. Choosing weighting confidents based
on the actual outputs of the Correlators yields better RAKE performance.
𝛾
b= 1+𝛾
CHANNEL CODING
Channel coding protects digital data from errors by selectively introduces redundancies in the
transmission data. Channel codes that are used to detect errors are called error detection codes, while codes
that can detect and correct errors are called error corrections codes
Block codes are a forward error correction (FEC) code that enables a limited number of errors to be
detected and corrected without retransmission. Block codes can be used to improve the performance of a
communications system when other means of improvements (such as increasing transmitter power or using a
more sophisticated demodulator) are impractical.
In block codes parity bits are added to block of message bits to make code words or code locks. Ina
blocks encoder, k information bits are encoded into n code bits. A total of n-k redundant bits are added to the
k information bits for the proposes of detecting and correcting errors. The block code is referred to as an (n,k)
code and the rate of the code is defined as Rc = k/n and is equal to the rate of information divided by the raw
channel rate.
DISTANCE OF CODE:
The distance between two code words is the number of elements in which two code words Ci and Cj
differ
d(Ci, Cj) = 𝑁
𝑙=1 𝐶𝑖 , l + Cj, l(modulo q)
Where d is the distance between the codes words and q is the total number of possible values of Ci and
Cj. the length of each code word are N elements or characters. If the code used is binary the distance is known
and the hamming distance. The minimum distance dmin is the smallest distance for the given code word set
and is given as
dmin = Min {d(Ci,Cj)}
WEIGHT OF A CODE:
The weight of a code word of length N is given by the number of nonzero elements in the code word.
For a binary code, the weight is basically the number of ls in the code word and is given as
w(Ci) = 𝑁 𝑙=1 𝐶𝑖
CODE RATE
Consider an encoder that takes k information bits and add q redundant bits for a total of n=k+q bits
per codeword. The code rate is the fraction k/n and the code is called a (n,k) error – control code.
CODE EFFICIENCY
It is the ratio of message bits in a block to the transmitted bits for the block by the encoder.
Message bits in a block
code Efficiency =
Transmitted bits for the block
LINEARITY- Suppose Ci and Cj are two code words in an (n,k) block code. Let α 1 and α 2 be any two
elements selected from the alphabet. Then the code the is said to be linear if and only if α 1C1 +α 2C2 is also a
code word a linear code must contain the all-zero code word Consequently, a constant-weight code is
nonlinear.
SYSTEMATIC:
A systematic code is one in which the parity bits are appended to the end of the information bits. For
an (n, k) code the first k bits are identical to the information bits and the remaining n-k bits of each code word
are linear combinations of the k information bits.
CYCLIC:
Cyclic codes are a subset of the class of linear codes which satisfy the following cyclic shift property: If
C = [Cn-1, Cn-2,…..C0] is a code word of a cyclic code, then [cn-2,Cn-3,…C0,Cn-1], obtained by a cyclic shift of the
elements of C,is also a codes possess a considerable amount of structure which can be exploited to greatly
simplify the encoding and decoding operations.
HAMMING CODES:
Hamming codes were among the first of the nontrivial error correction codes. These codes and their
variations have been used for error control in digital communications systems. There are both binary and non-
binary Hamming codes. A binary Hamming code has the property that
(n, k) = (2m – 1, 2m – 1- m)
Where k is the number if information bits used to form a n bit code word and m is any positive integer.
The number of parity symbols are n-k = m.
HADAMARD CODES:
Hadamard codes are obtained by selecting as code words the rows of a Hadamard matrix. A
Hadamard matrix A is a N x N matrix of l s and 0s such that each row differs from any other row in exactly N/2
locations. One row contains all zeros with the remainder containing N/2 zeros and N/2. The minimum
distance for these codes is N/2.
For n=2 , the Hadamard matrix A is
0 0
A=
0 1
In addition to the special case considered above when N=2m (m being a positive integer), Hadamard
codes of other block lengths are possible, but the codes are not linear.
GOLAY CODES:
Golay codes are linear binary codes with a minimum distance of seven and an error correction
capability of three bits. This is a special one of a kind code in that this is the only nontrivial example of a
perfect code. (Hamming codes and some repetition codes are also perfect). Every code word lies within
distance three of any code word thus making maximum likelihood decoding possible.
CYCLIC CODES:
Cyclic codes are a subset of the class of linear codes which satisfy the cyclic property as discussed
before. As a result of this property these possess a considerable amount of structure which van be exploited.
A cyclic code can be generated by using a generator polynomial g(p) of degree (n-k). The generator
polynomial of an (n, k) cyclic code is factor of pn+1 and has the general form
g(p) = Pn-k+gn-k-1Pn-k-1+…….+g1P+1
A message polynomial x(p) can also be defined as
X(p) = xk-1pk-1+ ……+x1p+x0
Where (xk-1,……x0) represents the k information bits. The resultant code word c(p) can be written as
C(p) = x(p)g(p)
Where c(p) is a polynomial of degree less than n.
Encoding for a cyclic code is usually performed by a linear feedback shift register based on either the
generator or parity polynomial.
BCH CODES:
BCH cyclic codes are among the most important block codes, since they exist for a wide range of rates,
achieve significant coding gains, and can be implemented even at high speeds. The block length of the codes is
n=2m-1 for m ≥3, and the number of errors that they can correct is bounded by t < (2m-1)/2. The binary BCH
codes can be generalized to create classes of non-binary codes which use m bits per code symbol. The most
important and common class of non-binary BCH codes is the family of codes known as Reed-Solomon codes.
The Reed-SOLOMON code in US cellular Digital Packet Data (CDPD) uses m=6 bits per code symbol.
REED_SOLOMON CODES:
Reed-Solomon (RS) are non-binary codes which are capable of correcting errors which appears in
bursts and are commonly used in concatenated coding systems. The block length of these codes is n=2 m-1.
These can be extended to 2m or 2m +1. The number of parity symbols that must be used to correct e errors is
n-k= 2e. the minimum distance dmin = 2e+1. RS codes achieve the largest possible dmin of any linear code.
MIMO SYSTEM:
MIMO system consists of several antenna elements plus adaptive signal
processing at both transmitter and receiver.
SISO – single input single output means that the transmitter and receiver of the
ratio system have only one antenna
Tx Ry
SIMO – single input multiple outputs means that the receiver has multiple
antennas while the transmitter has one antenna.
Tx Ry
MISO – Multiple input single output means that the transmitter has multiple
antennas while receiver has one antenna.
Tx Ry
MIMO – Multiple inputs multiple outputs means that the both the transmitter
and receiver have multiple antennas.
Tx Ry
1 1
h21
h h12
2
1
2 2
h22
BE UE
MULTIUSER MIMO:
When the individual streams are assigned to various to various users, this is
called multi user MIMO.
h11
1 1
h h21 h
h12
2 2 UE
1 1
2 2
h22 h UE
2
1
BE
Commonly used MIMO technology has most often been in reference to open
loop MIMI techniques. Closed loop MIMO techniques also known as Transmitter
Adaptive Antenna (TX-AA) technique. Ω are simply referred to by the industry as
beam foxing.
SYSTEM MODEL:
h11
X y1
X2
X2
1
TX X2 Y2 Ry
X2
Xn Ym
hmn
The transmitter and receiver are equipped with multiple antenna elements. The
transmit stream go through a matrix channel which consists of multiple receive
antennas at the receiver. Then the receiver gets the received s/l vectors by the multiple
receive antenna and decodes the received signal vectors into the original information
𝑦 = H𝑥 + 𝑁
H = Channel state
Beam forming
Transmit precoding
Receiver Shaping
Spatial multiplexing
Diversity coding.
PRECODING:
In general R symbols/s input data stream can be split into r-parallel. Independent
data streams, producing r-tuples at a rote R/r symbols/s. The actual input to the antenna
is generated through linear transformation on 𝑥 as
𝑥 = 𝑀𝑥 `
𝑥 = 𝑀𝑥 𝑦 = 𝑀𝑥 + 𝑁 𝑦 = 𝐹𝑦
Modulated
Symbol 𝑦
𝑥 𝑥 𝑦
P
r
e
CLASSIFICATION
c OF PRECODING:
o
d Precoding for single user MIMO
i Precoding for multi user MIMO
n
g
PRECODING
f FOR SINGLE USER MIMO:
o
r In
SU-MIMO, a transmitter equipped with multiplex antennas communicates
with a receiver that has multiple antennas. Most classic Precoding results assume
s
recommended
i
slow.
n
PRECODING FOR MULTI USER MIMO:
g
l
In
MU-MIMO a multiantenna transmitter communicates simultaneously with
e
multiple receivers. This is known as SDMA.
u
BEAM
s FORMING:
e
r Beam forming
is a technique that focuses radio signals directly on the target
antenna thereby improving range and performance by limiting interference.
M
I Beam forming is the method used to create the radiation patterns of an antenna
array.MIt can be applied in all antennas array system as well as MIMO systems. Beam
O
Forming is exactly analogous to frequency domain analysis of time signals.
P
r
e
c
x1 Y1
C1
X2 Y2
C2
x
Y3
X3
C3
A transmit strategy where the input contrarian‟s matrix has limit rank is called
beam forming. This corresponding to the producing matrix being just a column vector
M=C, the team forming vector.
𝐶 𝐻 𝐶 𝐻
= H𝐶x+ 𝑁
𝐶 𝐻 𝐶 𝐻
= 𝐻 𝐶 x+ 𝑁
Adaptive beam former deals with the problem and adjusts the beam in real time
to the moving UE. The complexity is high.
It increases the received signal again, by making signals emitted from different
antennas add up constructively and to reduce the multipath fading channel effect.
In transmit diversity there are multiple antennas available at the transmitter and
the transmitted signal s(t) is sent over the i th antenna with a branch weight αi transmit
diversity is desirable in system such as Cellular system where more space, power,
processing capabilities is available on the transmit side versus the receive side the path
𝑗𝜃𝑖
again associated with the i th antenna is 𝑟𝑖𝑒 and the signals transmitted over all
antennas are added “in the air”, which leads to s received signal given by
𝑀 𝑗𝜃𝑖
r (t) = 𝑖=1 𝛼𝑖 𝑟𝑖𝑒 s(t)
Delay Diversity
Phase Sweeping Diversity
Space Time Coding
RECEIVER DIVERSITY:
Consider a single user system model where in the received single is a sum of the
desired signal and noise
2 1 𝑇𝑠
= 𝑛 (𝑡) 𝑢(𝑡) 2 dt
𝑇𝑠 0
2
P= 𝑛
𝑛 2
E{|n(t)2} = 𝜍 2 , SNR(𝛾𝑛 ) =
𝜍2
1
𝛾𝑛 ≈ e-𝛾𝑛 𝑇
⎾
𝐸{|𝑛 |2 } 𝑃0
⎾ = E{𝛾𝑛 } = =
𝜍2 𝜍2
2 1 2
SNR = LSNR.
𝐿
No CSI & full TX does not RX learns the Archived Require calibration
CSIR use any CSI instant without F/B
anuous cs
from training
sequence
Noisy CSI RX learned _ _ Any received
the CS training pulse will
perfectly be affected
Non-fading channel:
H= [ 𝑈*] W
Ʃ DIAGONAL MATRIX
γ = Hs + n
γ = W ƩU*S+n
Multiplication of the transmit data vector by matrix U and the received signal
vector by diaogonlizes the channel
W* γ = W*WƩU*𝑆 + W*n
γ = Ʃ𝑆 +𝑛
The capacity of channel H is thus given by the sum of the capacities of the Eigen
modes of the channel.
𝑅𝑛 𝑃𝑘
C= 𝑘=1 log 2 1+ 𝜍𝑘 2
𝜍𝑛 2
𝛾
C = log 2 𝑑𝑒𝑡 𝐼𝑁𝑟 + 𝐻𝑅𝑠𝑠𝐻 ∗
𝑁𝑡
FADING CHANNEL:
We assume a describe time channel with stationary and ergodic time varying
gain 𝑔(𝑖). The channel power gain g(i) follows a given distribution. The channel g(i)
can change at each time I, either as an 11D processor with same correlation overtime.
𝑔(𝑖) n(i)
C= 𝑠∈𝑠 𝐶𝑠 𝑝 𝑆
∞
C= 0 γ
𝐶𝑝 γ 𝑑γ
∞
C= 0
𝐵 log2 (1+ γ) p(γ) d γ
The factor (λ/4πd)2 is also known as the free space loss factor.
Part-A
14. What are the techniques used to expand the capacity of cellular system?
Cell splitting, Sectoring, Coverage Zone approaches are the techniques used to expand
the capacity of cellular system.
Cell splitting – Cell-splitting is a technique which has the capability to add new smaller
cells in specific areas of the system. i.e. divide large cell size into small size.
Sectoring – use of directional antennas to reduce Co-channel interference.
Coverage Zone approaches – large central BS is replaced by several low power
transmitters on the edge of the cell.
Q= =
From the above equation, small of `Q' means small value of cluster size `N' and increase in
cellular capacity.
2. With the help of a neat diagram explain about frequency reuse and the advantages of it.
ANS: Refer section 3.2 in Wireless communication, Rappaport Pg.No: 58
Diagram
i. Explain in detail the spectrum limitations that carried out in wireless communication.
PART-B
1. Explain the different techniques of improving coverage and capacity in Cellular System.
Part-A
4. What is QPSK?
The Quadrature Phase Shift Keying (QPSK) is a 4-ary PSK signal. The phase of the
carrier in the QPSK takes 1 of 4 equally spaced shifts.
Two successive bits in the data sequence are grouped together. 1
symbol = 2 bits
This reduces bit rate and bandwidth of the channel. Coherent
QPSK = 2 x coherent BPSK system
The phase of the carrier takes on one of four equally spaced values such as π/4, 3π/4, 5π/4
and 7π/4.
9. How can we improve the performance of digital modulation under fading channels?
By the using of diversity technique, error control coding and equalization techniques
performance of the digital modulation under fading channels are improved.
PART-B
1. Write about the GMSK transmitter and receiver with neat diagram?
ANS: Refer section 11.3.1 in Wireless communication, Andreas f molisch Pg.No: 196
3. Write about the QPSK transmitter and receiver with neat diagram?
ANS: Refer section 11.3.2 in Wireless communication, Andreas f molisch Pg.No: 199
4. Explain the Free space propagation model?
ANS: Refer section 4.2 in Wireless communication, Rappaport Pg.No: 107
5. Write about the BFSK transmitter and receiver with neat diagram?
ANS: Refer section 11.3.6 in Wireless communication, Andreas f molisch Pg.No: 208
7. Explain in detail the power spectrum and error performance of Gausian MSK.
ANS: Refer section 11.3.9 in Wireless communication, Andreas f molisch Pg.No: 215
9. Explain in detail the error probability in delay and frequency dispersive fading
channels
ANS: Refer section 12.3 in Wireless communication, Andreas f molisch Pg.No: 339-
345
Part-A
1. What are the techniques used to improve the received signal quality?
Techniques such as,
Equalization
Diversity
Channel coding
are used to improve the received signal quality.
3. What is diversity?
Diversity is used to compensate the fading channel impairments and is usually
implemented by using two or more receiving antennas. Diversity improves transmission
performance by making use of more than one independently faded version of the transmitted
signal.
PART-B
communication channels.
ANS: Refer section 7.2 in Wireless communication, Rappaport Pg.No: 356
4. What is the non linear equalization? Explain the three non linear methods of Equalization
with Suitable diagrams?
ANS: Refer section 7.7 in Wireless communication, Rappaport Pg.No: 368
5. Draw the block diagram of LPC coding system and explain the different types of LPC used for
Wireless systems?
ANS: Refer section 8.7 in Wireless communication, Rappaport Pg.No: 431
6. Draw the diagram of a rate -1/2-convolution encoder with constraint length 3. What
is the
generator polynomial of the encoder? Find the encoded sequence you have
drawn, corresponding to the message sequence.
ANS: Refer section 14.3 in Wireless communication, Andreas F Molisch Pg.No: 285.
Part-A
The wireless system before MIMO is been constrained by network capacity which is
related with channel quality and coverage. To see how problem occurred, we need to
talk about the transmission on a multipath channel. In wireless communication the
propagation channel is characterized by multipath propagation due to scattering on
different obstacle. The multipath problem is a typical issue in communication system
with time variations and time spread. For time variations the channel is fading and
caused SNR variations. For time spread, it becomes important for suitable frequency
selectivity.
(1) Single User MIMO (SU-MIMO) vs. Multi User MIMO (MU-MIMO)
(2) Open loop MIMO vs. Close loop MIMO
When the individual streams are assigned to various users, this is called Multi
UserMIMO (MU-MIMO). This mode is particularly useful in the uplink because the
complexity on the UE side can be kept at a minimum by using only one transmitantenna. This
is also called 'collaborative MIMO'.
5. What is Space Time Transmit Diversity (STTD) MIMO
Space-time block coding based transmit diversity (STTD) is a method of transmit
diversity used in UMTSS third-generation cellular systems. STTD is optional in
the UTRANN air interface but mandatory for user equipment. STTD utilizes space-time
block code (STBC) in order to exploit redundancy in multiply transmitted versions of a
signal.The same data is coded and transmitted through different antennas, which effectively
doubles the power in the channel. This improves Signal Noise Ratio (SNR) for cell edge
performance.
7. what is beamforming?
Beamforming or spatial filtering is a signal processing technique used in sensor arrays for
directional signal transmission or reception.[1] This is achieved by combining elements in
a phased array in such a way that signals at particular angles experience
constructive interference while others experience destructive interference. Beamforming can
be used at both the transmitting and receiving ends in order to achieve spatial selectivity. The
improvement compared with omnidirectional reception/transmission is known as the
receive/transmit gain (or loss).
8. Define transmit precoding
Transmit diversity is radio communication using signals that originate from two or more
independent sources that have been modulated with identical information-bearing signals and
that may vary in their transmission characteristics at any given instant.
11. Define Spatial diversity
Spatial diversity employs multiple antennas, usually with the same characteristics, that
are physically separated from one another. Depending upon the expected incidence of the
incoming signal, sometimes a space on the order of a wavelength is sufficient. Other
times much larger distances are needed. Cellularization or sectorization, for example, is a
spatial diversity scheme that can have antennas or base stations miles apart. This is
especially beneficial for the mobile communication industry since it allows multiple users
to share a limited communication spectrum and avoid co-channel interference.
Pattern diversity consists of two or more co-located antennas with different radiation
patterns. This type of diversity makes use of directive antennas that are usually physically
separated by some (often short) distance. Collectively they are capable of discriminating
a large portion of angle space and can provide a higher gain versus a single
omnidirectional radiator.
Transmit/Receive diversity uses two separate, collocated antennas for transmit and
receive functions. Such a configuration eliminates the need for a duplexer and can protect
sensitive receiver components from the high power used in transmit.
This is the expected value of capacity (or) instantaneous capacity taken over all realizations
of the channel.
This is the minimum transmission rate that is achieved over a certain fraction of time of 90-
95%.
part-B
1. With diagram explain the system model for MIMO systems.