Professional Documents
Culture Documents
EE531 Practice Questions - Nov 16, 2015
EE531 Practice Questions - Nov 16, 2015
EE531 Practice Questions - Nov 16, 2015
()
= =
+
+1
{=0}
()
= ()
{}
(0)
=
2 = 02 + 12 + 2
+1
{=0}
{}
(1)
=
+1 = 0 1
+1
{=0}
{+1}
) + (
)
( )2 ({+1} )
2 2
2 2
2
( )2 ({+1} )
+
2 2
2 2
2 +1
( 1)2 ({+1} 1)
( + 1)2 ({+1} + 1)
2 2
2 2
2 2
2 2
1
+1
1
+1
2 2{+1}
+
2
2
1
( + {+1} )
2
The same solution can also be devised intuitively, by simply averaging and {+1} to yield,
( +{+1} )
2
1
2
= + ( + {+1} )
is a sufficient statistic for estimating the input sequence . The effective noise variance because of
this DIVERSIFICATION is 2 /2.
Note here that the estimation procedure is non-causal, as the receiver must wait for one additional
observation before forming a joint opinion regarding both the observations and {+1} .
1
1
= (( 1) ) + (( + 1) )
2
2
1
1
1
1
= exp[
( 1 )2 ] + exp[ 2 ( + 1 )2 ]
2
2
2
2
2
+1
1
1
1
1
1
1
1
1
exp[ 2 ( + 2)2 ]
exp[ 2 ( 2)2 ]
2
2
1
+1
( 2)2
( + 2)2
1
+1
The probability of error analysis can be done by combining and into one single composite noise
variable.
(( ) ) = (( ) = 1 = +1)
(( ) = 1 = +1) = ( < 0 = +1)
( < 0 = +1) = ( = +1 < 2) + ( = 1 < 0)
1
2
1
() = (( ) = 1 = +1) = ( ) +
2
4
PART-B
The interference with the sequence cannot be avoided. However the question that remains is whether
it is possible to pre-code the sequence by creating reflected copies of the same sequence to combat
this signal interference. Pre-coding tends to increase the correlation between adjacent symbols, thereby
increasing the temporal redundancy, making the sequence less vulnerable to signal interference and
AWGN.
Now consider the following channel abstraction:
= + {1} + + = + {1}
= ( )
= (( + {1} ) )
= (( ) )
+1
1
+1
{1}
1
> +1; + 1
< 1; 1
(1, +1); + + 1 1
() = (( ) = 1 = +1)
(( ) = 1 = +1) = ( < 1 = +1)
(( ) = 1 = +1)
= ( < 1 = +1) + ( ^ = +1)
1
2
1
1
( < 1 = +1) = ( ) + (4/) + = () = 1
2
4
8
( ^ = +1) = ( ).
1
2
1
2
4
3
1
3
( ) = { ( ) ( )} + { ( ) ( )}
4
1
2
1
1 1
2
4
3
1
3
() = ( ) + (4/) + + { ( ) ( )} + { ( ) ( )}
2
4
8 8
4
5
2
1 3
1
() ( ) + + ( )
8
8 8
The comparison between parts A and B is rather interesting. On one hand because of the reflective
inclusion of a delayed version of in the form of {1} , there is a boost in amplitude whenever the
signs of the original and delayed versions are in cohesion. However when the signs are opposites, there is
an ambiguity regarding the actual value of . This creates a DEAD ZONE, which is much larger than the
dead-zone in Part-A. The gain from a boost in amplitude is therefore offset by the increase in the size of
the dead zone. The ERROR probabilities in Parts A and B therefore match when the decision in Part-B is
effected on a symbol by symbol basis.
Further reduction in error probability is possible through SEQUENCE ESTIMATION.
[ +1 ] (1 )+1
{=1,3,5, }
Where,
1
= ( )
( ) = (
1
1
( ) = 2(1 ) = 2 ( ) [1 ( )]
It is anticipated that results are likely to be poor in both these extremes. In part-A there is noise
accumulation and a linear growth in variance, while in the case of the latter uncertainty associated with
the inference mechanism in each relay tends to increase down the line as every relay is forced to make a
decision without monitoring the magnitude of the observation carefully. A judicious combination of softmetrics with hard decisions may lead to a superior performance. Subsequently the optimal value of is
likely to be a number in the range (0,1), depending on the noise standard deviation . Incidentally the
value (1 ) also indicates the fraction of relays which may indulge in decision making. The rest are just
passive relays.
= ( )
In the second case the observations in the two channels can be linearly combined to form the optimal
decision rule,
= [( + )] and
( )
= [
]
2
The probability of error in parts A and B are: (1/) and (2/) respectively (lower as expected in the
case of the latter).
= () ( 1) + 2 ( 2) 3 ( 3) + (0)
= + 1 2 + 2 3 . . + {+1}
= (1 + 2 + 4 + . + 2 ) 2 =
=
1 2
2
1/ 2
()
1
2
1 2
Slot-1
X
Slot-2
Slot-3
Y
Z
() = (1/) for receiving the other two bits for each user.
B) SIMULTANEOUS TRANSMISSION-1
A
B
C
Slot-1
X
Slot-2
X
Y
Slot-3
Y
Z