Polytechnic University, Dept.

Electrical and Computer Engineering

EE3414 Multimedia Communication System
Spring !""#, $ao %ang
__________________________________________________________________________________________________
&ome'or( 11 )Digital Communication*
(Solution)
%ritten +ssignment:
1. Consider the two digital modulation schemes shown in the figure below. For each scheme, determine the minimum
distance between two symbols dmin , the average energy er symbol !av, and the average energy er transmitted bit !b.
"hich scheme is more efficient in terms of transmission energy usage#
Solution:
For $%ary &'(, the distance between any two ad)acent symbols (e.g. *'+ and *,'+) is -', therefore dmin.-'. /he
energy for symbols *'+ and *%'+ are both '
-
0 and the energy for symbols *,'+ and *%,'+ are both 1'
-
. /herefore the
average energy er symbol is !av .('
-
21'
-
)3-.4'
-
. 5ecause each symbol carries - bits, the average energy er bit is !b
. !av 3-.4'
-
3-.
For $%6'(, the distance between two closest symbols (say *77+ and *71+) is -', therefore dmin.-'. /he length from
the origin to each symbol is
A -
. So the energy for each symbol is -'
-
. /herefore the average energy er symbol is
!av .-'
-
. 5ecause each symbol carries - bits, the average energy er bit is !b . !av 3-.'
-
.
5ecause the two schemes have the same dmin the robability of one symbol be decoded to its nearest neighboring
symbol because of channel noise is roughly e8ual. 5ecause in both schemes, each symbol contains - bits, the
robability of bit error will be roughly the same. 5ut $%6'( re8uires less energy er bit, and therefore is more efficient
in ma9ing use of transmission energy.
-. "hat is the function of arity chec9# Consider the scheme where we aend a arity bit to each grou of : bits to
generate 1 byte so that each byte has an *even+ arity. "hat is the arity bit you will add to *1717177+# "ith this
added arity bit, can you detect that some bits in a received byte get inverted# "hat cases of errors can be detected and
what cases cannot be detected#
Solution: &arity chec9 is a simle method of detecting bit errors. For the articular e;amle, because there are , *1+s in the
given : bits, to ma9e the number of *1+s to be even, we should add a *1+. /he resulting se8uence is *17171771+. <on
receiving = bits, if the number of *1+s is odd, then we 9now some bits must be wrong. >n fact, it could be 1 bit (any one of
the = bits) or , bit or : bits got flied, which will all cause the total number of *1+s being odd, rather than even. /herefore,
this method can detect all error atterns containing odd number of inverted bits. 5ut it cannot detect any error attern
containing even number of erroneous bits.

A -A
; ; ; ;
-3A
3A
11
17 77 71

;
; ;
;
17 77
71 11
'
'
;
; ;
;
17 77
71 11
'
'
(a) $%ary &'( (b) $%6'(
,. Consider reetition coding with a redundancy factor of ,, i.e., to send an information bit *7+, we send *777+0 to send an
information bit *1+, we send *111+. Suose the robability that any one bit gets inverted during transmission is .7.1,
what is the robability that an information bit is decoded wrong#
Solution: >f the information bit is *7+, we will send *777+. >f the received , bits has - or , bits that are *7+, then we will
decode the information bits to *7+, otherwise, to *1+. /herefore, *7+ will be decoded to *1+ only if - or , bits are inverted.
/hat is *777+ is changed to either of the following: *111+ (, bit error, with robability ?,), *711+,+171+,+117+ (- bit
errors, , ossibilities, each with robability ?- (1%) ). So the total robability is
). 1 ( ,
- ,
p p p p
e
+ = For .7.1, . 7-= . 7 =
e
p
$. Consider a channel with bandwidth 1(@A.
(a) Suose the channel is noiseless, what is the ma;imum number of bits that can be transmitted reliably if you use -%
'SB for modulation# "hat if you use =%'SB#
(b) Suose the channel suffers from noise with a signal to noise ratio of 17 d5. "hat is the ma;imum number of bits
that can be transmitted reliably# "hat if the channel SCD is ,7 d5#
Solution: (a) when the channel is noiseless, the channel caacity C.-5m, where 5 is the channel bandwidth, m is the
number of bits er modulation symbol. >n our case, 5.1(@A. "ith -%'SB, m.1, C.- ( bit3s. "ith =%'SB, m.,, C. E
(bit3s.
(b) "hen the channel is noisy, the channel caacity . C=B log2 (1+SNR) bits/second.
With SNR=10 dB=10, C=10! log2(11)=
With SNR="0 dB = 1000, C=10! log2(1001)=