维特比译码算法是卷积编码的最大似然译码算法。
Viterbi algorithm is the most likelihood decode algorithm of convolution code.
空时分组码采用最大似然译码，译码复杂度相对较低。
The STBC uses Maximum Likelihood (ML) decoding and its complexity of decoding is very low.
计算机模拟表明，在加性高斯噪声下，使用该神经网络可以达到最大似然译码。
The computer simulation shows that the decoder can achieve maximum likelihood decoding in the environmemts of additive white Gaussian noise.
最后针对空频码解码采用最大似然译码复杂度较高的问题，给出了球形译码算法的详细步骤。
Last, for the problem that the high decode complexity of space-frequency code, detailed steps of sphere decode algorithm is provided.
维特比译码算法是一种最大似然译码，它可以得到较高的译码速度以及译码计算时间固定，因而在深空通信中得到广泛应用。
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.
在相同条件下，最大后验概率译码算法比最大似然译码算法有更低误比特率，但由于计算量和复杂度过大而不适合硬件实现。
While the MAP algorithm offers better performance than the ML algorithm, the computation is complex and not suitable for hardware implementation.
为了提高模型的容错性，提出了基于最大似然译码原理的监测信号信息校正方法，然后利用编码基本网在无畸变信号的基础上进行故障诊断。
In order to enhance the fault tolerance ability of the fault diagnosis model, information correction is thus adopted based on the maximum likelihood decoding theory.
针对酉空时码最大似然检测复杂度高的问题，提出了一种酉空时星座的设计及低复杂度译码方法。
A decoding algorithm based on the tree-structured constellation design was presented in order to reduce the decoding complexity of unitary space-time codes.
针对酉空时码最大似然检测复杂度高的问题，提出了一种酉空时星座的设计及低复杂度译码方法。
A decoding algorithm based on the tree-structured constellation design was presented in order to reduce the decoding complexity of unitary space-time codes.
应用推荐