摘要
离散无记忆信道容量求解就是在一定输入分布条件下的一个极值求解问题,但实际的输入分布求解时没有足够多条件用来建立方程,因此求解困难。但是借助计算机进行迭代计算可以消除输入分布的条件不足的缺点,计算出任意DMC信道的精确容量,并找出最佳的输入分布。经过计算推导与仿真验算,结果符合实际。
Solving the capacity of discrete memoryless channel( DMC) is a extreme-value problem under the condition of a certain input distribution. In practice,however,there are no conditions enough to establish the equations for solving the input distribution. But by utilizing the numerical computation of the computer,the iterative algorithm can eliminate the shortcomings of insufficient conditions of input distributions. Arbitrary DMC channel capacity can be calculated and the optimal distribution of inputs can be searched. The results show the mathematical derivation and simulation test are correct accord with the actual case.
引文
[1]曹雪虹.信息论与编码[M].北京:清华大学出版社,2010.
[2]郑宗汉,郑晓明.算法设计与分析[M].北京:清华大学出版社,2005.
[3]傅祖芸.信息论—基础理论与应用[M].北京:电子工业出版社,2005.