In this paper, the problem of the estimation of the error bound for a class of simplest Markov sources is discussed.
本文讨论了一类最简单的遍历马氏信源的误差界估计问题。
Unbiased estimation of flow size, the upper bound of relative error and the time and space complexity are deduced theoretically.
理论上给出了算法的流大小的无偏估计，相对误差的上界以及时间和空间复杂度。
The way of choosing the forgetting factor is stated so that the minimum upper bound of the parameter estimation error is obtained.
阐述了最佳遗忘因子的选择方法，以获得最小参数估计上界。
Theoretical results of the lower bound of the bit error rate as well as the channel estimation error of the proposed algorithm were given.
从理论上分析了该算法所能达到的信道估计误差下限和比特误码率下限，并提出了最优叠加导频序列的设计准则。
Theoretical results of the lower bound of the bit error rate as well as the channel estimation error of the proposed algorithm were given.
从理论上分析了该算法所能达到的信道估计误差下限和比特误码率下限，并提出了最优叠加导频序列的设计准则。
应用推荐