基于MDP解码算法的Trellis编码调制问题研究

A Study on the Questions of Trellis-coded Modulation Based MDP Decoding Algorithm

在无线数字通信中,编码符通常可以被trellis图形所表示,通过这种图形解决硬决定最大可能性问题可以被理解为接收码与发送码之间最小距离的问题。由于解码系统的线性性质,这类问题可以被看成是MDP(马尔科夫决策过程)问题,以此运用策略迭代方法解决相关问题。

In wireless digital communication, the codewords encoded can be described in the trellis diagram in which the problem to find hard- decision maximum likelihood decoder can be reduced to a find the minimum distance between the received code and the transmitted code. Because the linearity of the decoding system, this problem can also be viewed as a process of markov decision process（MDP） problem such that it can be solved by the policy iteration approach.