arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.0452cs.LG
收藏

Nakagami m分布估计量方差的一个下界

A Lower Bound for the Variance of Estimators for Nakagami m Distribution

Amity University(阿米蒂大学);University of Cape Town(开普敦大学)

Rangeet Mitra, Amit Kumar Mishra, Tarun Choubisa

摘要:

最近,我们提出了一个最大似然迭代算法估计的Nakagami-m分布的参数。该技术比用于该分布的现有技术估计技术执行得更好。这在低数据或基于块的估计问题中特别有用。在这些情况下,估计器应该能够用较少的数据量给出均方意义上的准确估计。此外,估计数应随着收到的区块数的增加而改善。在本文中,我们看到通过我们的模拟,我们的建议是精心设计的,这样的要求。此外,在文献中众所周知,对于Nakagami-m分布不存在有效的估计。在本文中,我们推导出我们提出的估计方差的理论表达式。我们发现,这个表达式清楚地适合实验曲线的方差估计。这个表达式非常接近克拉美-劳下界(CRLB)。

英文摘要:

Recently, we have proposed a maximum likelihood iterative algorithm for estimation of the parameters of the Nakagami-m distribution. This technique performs better than state of art estimation techniques for this distribution. This could be of particular use in low data or block based estimation problems. In these scenarios, the estimator should be able to give accurate estimates in the mean square sense with less amounts of data. Also, the estimates should improve with the increase in number of blocks received. In this paper, we see through our simulations, that our proposal is well designed for such requirements. Further, it is well known in the literature that an efficient estimator does not exist for Nakagami-m distribution. In this paper, we derive a theoretical expression for the variance of our proposed estimator. We find that this expression clearly fits the experimental curve for the variance of the proposed estimator. This expression is pretty close to the cramer-rao lower bound(CRLB).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑