维特比译码算法是卷积编码的最大似然译码算法。
Viterbi algorithm is the most likelihood decode algorithm of convolution code.
在相同条件下，最大后验概率译码算法比最大似然译码算法有更低误比特率，但由于计算量和复杂度过大而不适合硬件实现。
While the MAP algorithm offers better performance than the ML algorithm, the computation is complex and not suitable for hardware implementation.
维特比译码算法是一种最大似然译码，它可以得到较高的译码速度以及译码计算时间固定，因而在深空通信中得到广泛应用。
Viterbi algorithm is a kind of maximum likelihood decoding method, which can obtain high decoding speed and cost fixed decoding time, so it is widely used in deep space communication.
最后针对空频码解码采用最大似然译码复杂度较高的问题，给出了球形译码算法的详细步骤。
Last, for the problem that the high decode complexity of space-frequency code, detailed steps of sphere decode algorithm is provided.
最后针对空频码解码采用最大似然译码复杂度较高的问题，给出了球形译码算法的详细步骤。
Last, for the problem that the high decode complexity of space-frequency code, detailed steps of sphere decode algorithm is provided.
应用推荐