摘要
本文利用码的群结构提出了几何均衡格子码的一种新译码算法。该算法复杂度与网格状态数无关。
Based on the exploitation of the group structure of the codes,a new decoding algorithm for geometrically uniform trellis codes is presented in this paper. The algorithm complexity does not depend on the number of states of the trellis describing the code. The performance of the algorithm is evaluated through simulation,and its complexity is compared with the Viterbi algorithm.
关键词
几何均衡格子码
译码
算法
geometrically uniform trellis code
ML sequence
Euclidean distance
