摘要
本文在Ｂａｈｌ算法的基础上给出了一种新的矩阵算法，此算法使Ｂａｈｌ算法中求后验概率和转移概率的复杂计算转化成一系列简单的适合于大规模集成电路实现的矩阵运算，从而使运算速度得到相应的提高，并使Ｂａｈｌ译码算法中复杂的数据存取和传输得到进一步简化。
A new matrix decoding algorithm for minizing symbol error rate is derived from Bahl ed al. algorithm. The complex operations of estimating posteriori probabilities and transition probabilities in Bahl ed al. algorithm are paralleled and well formulated into a set of simple matrix operations which are fit to design efficient VLSI circuits. Thus, the matrix algorithm increase the decoding spreed and simplify the excessive memory accesses and complicatied data tranfer demanded by Bahl ed al. algorithm.
出处
《通信学报》
EI
CSCD
北大核心
1998年第8期1-6,共6页
Journal on Communications
基金
国家教委博士点
国家自然科学基金
关键词
Bahl算法
纠钷编码
马尔柯夫过程
矩阵算法
Bahl ed al.algorithm, errorcorrcting codes, Markov process, transition probability, DMC.
