摘要
提出了计算非规则篱笆图的最小欧几里德距离和最小乘积距离的一种有效算法，该算法是在Ｖｉｔｅｒｂｉ算法的基础上，对起始于任意状态和终止于任意状态所有参考路径上的距离进行了计算，求得最小欧几里德距离和最小乘积距离．它适用于搜索高斯信道和衰落信道中的ＴＣＭ好码．
An efficient algorithm for computing the minimum free Euclidean distance and the minimum product distance of irregular TCM codes is described. The algorithm is based on the Viterbi algorithm and it computes the minimum free Euclidean distance and the minimum product distances among all pairs of paths divaning from any initial state and merging into any end state. The algorithm can be applied to search for good TCM codes on Gauss channels and fading channels.
出处
《北京理工大学学报》
EI
CAS
CSCD
1995年第3期311-316,共6页
Transactions of Beijing Institute of Technology
基金
国家自然科学基金
