信息论与编码习题参考答桉1

发布时间 : 星期六 文章信息论与编码习题参考答桉1更新完毕开始阅读

2002 Copyright EE Lab508

2.18试求下列各信道矩阵代表的信道的信道容量: (1)

b1 b2 b3 b4 a1?0010???[Pa21]??1000? a3?0001?a??0100?4?(2)

b1 b2 b3 a1?100?a??2?100?[Pa3?010?

2]?a??4?010?a5?001?a??6?001?(3)

b1 b2 b3 b4 b5 b6 b7 b8 a1?0.10.20.30.40000[P]?a?32?00000.30.700a3??0000000.40.2解:

(1)信道为一一对应确定关系的无噪信道?C?logr?log4?2 bit/symble(2)信道为归并性无噪信道?C?logs?log3?1.585 bit/symble

(3)信道为扩张性无噪信道:?C?logr?log3?1.585 bit/symble

2.19设二进制对称信道的信道矩阵为:

0 1[P]?0?3/41/4?

1??1/43/4??(1) 若p(0)=2/3,p(1)=1/3,求H(X),H(X/Y),H(Y/X)和I(X;Y);(2) 求该信道的信道容量及其达到的输入概率分布。

b9 b10 00?00??0.10.3???H.F.

2002 Copyright EE Lab508

解:

2(1)H(X)???p(xi)logp(xi)??(i?1223???log1313?1234?137?log13)?0.9183 bit/symblepy(0)?py(1)??i?12p(xi)p(y?0xi)?p(xi)p(y?1xi)?22323?34??125125122?i?1?14712?347H(Y)???p(yj)logp(yj)??(j?122?log122??log512

)?0.9799 bit/symbleH(YX)???i?1?j?1p(xiyj)logp(yjxi)???i?1?j?1p(xi)p(yjxi)logp(yjxi)14?13?34log34)?0.8113 bit/symble ??(23?34log34?13?14log14?23?14log?I(X;Y)?H(Y)?H(YX)?0.9799?0.8113?0.1686 bit/symbleH(XY)?H(X)?I(X;Y)?0.9183?0.1686?0.7497 bit/symble(2)本信道为强对称信道?C?logr?H(?)??log(r?1)?log2?H(0.25)?0.25log1?0.1887bit/symble信源输入为等概分布,即p(X?0)?p(X?1)?12时达到信道容量C.

2.20设某信道的信道矩阵为

b1 b2 b3 b4 b5 a1?0.60.10.10.10.1???a20.10.60.10.10.1??

[P]?a3?0.10.10.60.10.1???a40.10.10.10.60.1??a5??0.10.10.10.10.2??试求:

(1) 该信道的信道容量C;

(2) I(a3;Y); (3) I(a2;Y)。 解:

(1)本信道为强对称离散信道?C?logr?H(?)??log(r?1)?log5?H(0.4)?0.4log4?0.551bit/symble(2)、(3)I(a3;Y)?I(a5;Y)?C?0.551bit/symble

?H.F.

2002 Copyright EE Lab508

2.21设某信道的信道矩阵为

b1 b2 b3 b4 [P]?a1?1/3?a2?1/61/31/61/61/31/6?

?1/3?试求:

(1)该信道的信道容量C; (2)I(a1;Y); (3)I(a2;Y)。 解:

(1)本信道为对称离散信道1111?,p2?,p3?,p4?)?log4?H(,,,)?0.0817bit/symble ?C?logs?H(p13366(2)、(3)I(a1;Y)?I(a2;Y)?C?0.0817bit/bymble

2.22设某信道的信道矩阵为

?1/2[P]???1/41/41/21/81/81/8?? 1/8?试该信道的信道容量C; 解:

此信道为准对称离散信p(b11)?p(b21)?p(b12)?p(b22)?2道,且s1?2,s2?21218??1418]?]?1212??3414??3818?p(bl)l?1?p(bl)l?238log38?2?18log18]?H(1111,,,)24881r1r?[?[?,p2?,p3?,p4?)??[2??C???slp(bl)logp(bl)?H(p1l?1 ?0.0612bit/symble

2.23求下列二个信道的信道容量,并加以比较(其中0

?H.F.

2002 Copyright EE Lab508

解:

(1)此信道为准对称离散信p(bl)l?1?p(bl)l?2?2道,且s1?2,s2?112?(p?q?2?)1r1r?(p???q??)??(2?)?12?2????,p2?,p3?)?C1???slp(bl)logp(bl)?H(p1l?1 ??[2?12?(p?q?2?)log12?(p?q?2?)??log?]?H(p??,q??,2?)?(p??)log(p??)?(q??)log(q??)?2???log? ??(p?q?2?)log(2)此信道为准对称离散信p(bl)l?1?p(bl)l?2?2p?q?2?212道,且s1?2,s2?2?2???12?(p?q?2?)1r1r?(2??0)??(p???q??)??,p2?,p3?,p4?)?C2???slp(bl)logp(bl)?H(p1l?1 ??[2?log??2?12?(p?q?2?)logp?q?2?212?(p?q?2?)]?H(p??,q??,2?,0)

??(p?q?2?)log由上面C1、C2表达式可知?(p??)log(p??)?(q??)log(q??)?2?:C1?C2且当??0时等号成立.2.27设某信道的信道矩阵为 ?p1?[P]?????00p20?0?0???其中P1,P2,?,PN是N个离散信道的信道矩阵。令C1,C2,?,?pN??NCN表示N个离散信道的容量。试证明,该信道的容量C?logCi-C

?2i?1ci比特/符号,且当每个信

道i的利用率pi=2证明:

(i=1,2,?,N)时达其容量C。

设:Pm为lm行?km列(m?1,2,?N)ss由方程组?j?1p(bj/ai)?j?s?j?1jp(bj/ai)logp(bj/ai)(i?1,2,?r)???(1)NNm

m解出?j可得C?log[?j?12?](其中s?:?km?1,r??lm?1)由[P]特点,方程组(1)可以改写为?H.F.

联系合同范文客服:xxxxx#qq.com(#替换为@)