Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
\
|
+ |
.
|
\
|
|
.
|
\
|
+ |
.
|
\
|
=
2
2
2
4
2
2
2
1
4
1
4
4
r r
r r
=
=
I =
2
1
2
2
r
r
2
2 2
2 2
2
2 2
2 2
cos tan
cos tan
|
|
.
|
\
|
I +
I
=
|
|
.
|
\
|
I +
I
=
| o
| o
b a
b a
Polarization Diversity :Average Signal loss L
The average level of vertically polarized signal level
is
We have seen before that
Hence
The signal loss is
2
0
R
2
2
2
0
r R =
2
2
2 2
2
2 2
1
2
1
R b r a r R = + =
2
2
2
1
r
r
= I
2 2
2
2
2
1
b a
r
r
L + =
Frequency Diversity
Principle :
The same information signal is
transmitted and received simultaneously on
two or more independent fading carrier
frequencies.
Frequency Diversity
The rational behind this technique is that
frequencies separated by more than the
coherence bandwidth of the channel will not
experience the same fade.
The probability of simultaneous fade will be the
product of the individual fading probabilities.
This is often employed in microwave LOS links
which carry several channels in a frequency
division multiplex mode(FDM).
Frequency Diversity
This technique not only requires spare bandwidth, but
also requires that there be as many receivers as there
are channels used for the frequency diversity.
However, for critical traffic, the expense may be
justified.
Time Diversity
Principle :
The signals representing the
same information are sent over the
same channel at different times.
Time Diversity
Time Diversity repeatedly transmits
information at time spacing that exceeds
the coherence time of the channel.
Multiple repetitions of the signal will be
received with multiple fading conditions,
thereby providing for diversity.
A modern implementation of time diversity
involves the use of RAKE receiver for spread
spectrum CDMA, where multipath channel
provides redundancy in the transmitted
message.
Rake Receiver
- Price and Green
CHANNEL CODING
CHANNEL CODING
Block Codes
Data split into blocks
Checks are within the block
Convolutional code
Bit streamed data
Involves memory
Turbo codes
Uses conv. Codes
Special properties
Structured Redundency
Channel
encoder
Input word
k-bit
Output word
n-bit
Redundancy = (n-k)
Code rate = k/n
codeword
Code sequence
Convolutional Codes
Encoder consists of shift registers
forming a finite state machine
Decoding is also simple Viterbi
Decoder which works by tracking these
states
First used by NASA in the voyager
space programme
Extensively used in coding speech data
in mobile phones
A convolutional cod is generated by passing
the information sequence through a finite
state shift registers.
The shift register contains N k-bit stages and
m linear function generators based on
generator polynomials.
Generator matrix
Generator polynomials
Logic table
State diagram
Tree diagram
Trellis diagram
Decoding of convolutional
codes
Vitrebi Algorithm
Fanos sequencial coding
Stack Algorithm
Feedback decoding
Vitrebi Algorithm
Stack algorithm
The simplest algorithm to describe is the "stack
algorithm" in which the best N paths found so far are stored.
Sequential decoding may introduce an additional error above
Viterbi decoding when the correct path has N or more highly
scoring paths above it; at this point the best path will drop off
the stack and be no longer considered.
Fano algorithm
The famous Fano algorithm (named after Robert Fano)
has a very low memory requirement and hence is suited to
hardware implementations. This algorithm explores backwards
and forward from a single point on the tree.
Feedback decoding
Instead of computing the metrics, The
feedback decoder can be implemented
by computing the syndrome from the
received sequence and using a table
look up method to correct errors.
Coding advantages
P
n
E
b
/N
0
dB
10
-8
10
-3
8
19
Coding gain
Turbo Codes
Proposed by
Berrou & Glavieux
in 1993
Advantages
Use very large block lengths
Have feasible decoding complexity
Perform very close to capacity
Limitation delay, complexity
How Do they Work ( IEEE
spectrum)
Turbo Codes Applications
Deep space exploration
France SMART-1 probe
JPL equipped Pathfinder 1997
Mobile 3G systems
In use in Japan
UMTS
NTT DoCoMo
Turbo codes : pictures/video/mail
Convolutional codes : voice
Trellis coded Modulation