EE531: Practice questions with Solutions

Instructor: Dr. K. Karthik

Question 1: Estimating the Channel Coefficients
The output of an UNKNOWN discrete channel abstraction is given by,
= 0 + 1 1 +
Where the coefficients 0 and 1 are to be estimated. Given all observations up to the most recent one
(time index n) and the fact that it is known priori that the auto-correlation of the input sequence is a
UNIT DELTA FUNCTION, devise a suitable procedure for estimating the values of the channel coefficients.
Solution:
[ + ] = {(0 + 1 1 + )(0 + + 1 +1 + + )}
() = (02 + 12 )() + 0 1 ( 1) + 0 1 ( + 1) + 2 ()
(0) = 02 + 12 + 2
(1) = 0 1
Assuming ERGODICITY,
{}

()
= =
+

+1
{=0}

Approximating the ensemble average as the ergodic average,

()
= ()

{}

(0)
=
2 = 02 + 12 + 2

+1
{=0}

{}

(1)
=
+1 = 0 1

+1
{=0}

Solve for the channel coefficients, 0 and1 .

Question 2: Exploiting DIVERSITY in PARALLEL INDEPENDENT Channels

When correlated signals are sent through independent parallel channels, it is possible to enhance the
common mode information, viz. the signal information while suppressing independent interfering noise
components. This methodology is called DIVERSITY UTILIZATION in wireless or wireline transmission. A
particular receiver acquires two parallel sets of observations through different channels as follows
= +
And = 1 +
Where, is the input sequence (IID equiprobable) and , are independent white noise variables with
equal variance 2 . Suggest an optimal decoding strategy for recovering the sequence from observation
pairs,
[ , ]_{ = + 1, , 1 . . ,0}
Solution:
= ( [ , ]=+1,,1,2,.0 )
= ( [+1 , , {1} , {+1} , , {1} ])
= ( [ , {+1} ])
= ([ , {+1} ] )
= ( / )({+1} /_)
= (

{+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} .

Question 3: Role of PRE-CODING towards combating INTERFERENCE in BROADCAST Channels

Signal interference in broadcast transmissions, can become a serious issue. Consider the following
interference channel abstraction:
= + +
Here the elements are as follows:
is a binary equi-probable IID sequence sent originally by the transmitter.
is the interfering signal: Binary equi-probable and IID.
is simply AWGN with variance 2 .
The goal is recover from the mixture given the fact that the observation seen by the receiver is .
PART-A:
Devise an optimal decoding strategy for estimating from and the corresponding probability of error.
Solution:
= ( )

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

exp[ 2 ( 1 (1))2 ] + exp[ 2 ( + 1 (1))2 ]

exp[ 2 ( 1 1)2 ]
2
2
2
2
2
2
1
1
1
+ exp[ 2 ( + 1 1)2 ]
2
2
+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

If the noise standard deviation, < 1,

1
2
1
() = ( ) +
2

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.

Question 4: Decision making in RELAY CHANNELS

A single bit is sent over a series of relay channels to a particular receiver. Each relay reserves the option
of forming an inference regarding the received observation. The sub-channels from the transmitter to the
relay or between relays are identical and AWGN with variance 2 .
Thus the option that rests with the relay is as follows:
( ) = = {+1} .
( ) = ( ) {1, +1} = {+1} . (1 )
Where, is the observation at relay-i.
Consider the two extremes: () = 1 (final decision taken at the receiver);
() = 0 (Inference formed at every relay); and determine the probability of error at the receiver.
Solution:
1
( ) = (
)
+ 1
Let = 1; and the number of intermediate relays.
Note that an error on relay-i, could be offset by an error in relay i+m down the chain. Hence if we define
a composite binary random variable,
= 1 2 3 +1
( ) = ( = 1) =

[ +1 ] (1 )+1

{=1,3,5, }

Where,
1
= ( )

Consider the trivial case when = 1 ( ),

1
2

( ) = (

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.

Question 5: Pre-coding in MIMO channels

Two parallel AWGN channels are available for broadcast particularly in a MIMO transmission system. Two
different encoding strategies have been employed and compared over the same MIMO system:
Let the symbol alphabet being transmitted be the pair [ , ] where, both and are both
independent IID binary equi-probable sequences. In the first case no pre-coding is employed and the
symbols received are:
= +
= +
In the second case when pre-coding is employed, the received symbols are:
= + +
= +
Determine the optimal decoding strategy in both the cases and the corresponding probability of error.
Solution:
In the first case the optimal strategy is a channel by channel and symbol by symbol detection.
= ( ) and

= ( )
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).

Question 6: Impact of PRE-CODING on Noise suppression/amplification

Examine the effect of pre-coding on the SNR of the received and decoded signal. The model abstraction
is given by,
() = + {1} + 1
Where, [0,1] is the pre-coding parameter. Sketch the SNR as a function of .
Solution:
() = + {1} + 1
( 1) = 1 + {2} + 2
( 2) = 2 + {3} + 3

= () ( 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

Question 7: SLOT UTILIZATION in a CUMULATIVE BROADCAST CHANNEL

Three users A, B and C wish to share single independent bits , over a broadcast
channel with the other two users. Simultaneous transmissions are cumulative and AWGN is unavoidable.
Explore various strategies for communicating the bits over the broadcast channel with minimal CHANNEL
SLOT USE.
Solution:
A) ORTHOGONAL TRANSMISSION
A
B
C

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

( 1): () = (1/) for receiving ( + + ) out of which

.
( 2): () = (1/) for receiving ( + + ) out of which
.
( 1): () = (1/) for receiving ( + + ) out of which
.
( 3): () = (1/) for receiving ( + + ) out of which
.
Similar argument can be provided for User-B.
It is surprising to find strategies A and B yielding identical results.