摘要
提出了一种构造ＴＣＭ好码的动态规划算法（ＤＰ）．ＤＰ算法在建立了ＴＣＭ好码规则、编码器及信号网格图间的对应关系的基础上，采用动态规划算法进行寻优，从而获得ＴＣＭ好码．与常规ＴＣＭ好码构造算法［４，５］相比，本算法在精度、计算复杂度和灵活性上均有所改进．
In this paper, Dynamic Programming (DP) algorithm of constructing trellis modulation optimum codes is presented. Based on the relationship among rules of TCM optimum codes, encoder structure and signal trellis map, dyamic programming algorithm is used to attain TCM optimum codes. compred with the conventional algorithm, DP algorithm makes improvement on accuracy, complexity and flexibility.
出处
《华南理工大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1998年第7期50-55,共6页
Journal of South China University of Technology(Natural Science Edition)
关键词
网格编码调制
动态规划
DP算法
欧氏自由距
trellis coded modultion
dynamic programming
Euclidean free distance
signal trellis map
coding gain
