Further results on Bayesian and deterministic CRBs in the context of blind SIMO channel estimation

Samir-Mohamad Omar, D. Slock, O. Bazzi
{"title":"Further results on Bayesian and deterministic CRBs in the context of blind SIMO channel estimation","authors":"Samir-Mohamad Omar, D. Slock, O. Bazzi","doi":"10.1109/ICTEL.2012.6221253","DOIUrl":null,"url":null,"abstract":"The performance of channel estimation is often assessed by deriving the proper Cramér-Rao Bound (CRB). However, in the blind case a special treatment is required due to the singularity of the Fisher Information Matrix (FIM). Usually a constraint is introduced to overcome the blind ambiguity and ensuing singularity. Hence, a constrained CRB has been derived in the literature since a long time ago. Although this constrained CRB has been proven to be a valid lower bound in the medium and high SNR regimes, it fails completely in the low SNR regime because unlike the MSE it does not saturate. Motivated by the shortcoming of the constrained CRB, we derive in this paper a modified constrained CRB (MCCRB) for deterministic blind channel estimation. The MCCRB is valid over the whole SNR regime. In the second part of the paper we address Bayesian blind channel estimation and explore the apparent discrepancy between channel unidentifiability with a non-singular FIM. We highlight that in the less familiar Bayesian case this relationship needs to be interpreted differently. The analytical formulas for the introduced bounds are validated by some Monte-Carlo simulations.","PeriodicalId":413534,"journal":{"name":"2012 19th International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 19th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2012.6221253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The performance of channel estimation is often assessed by deriving the proper Cramér-Rao Bound (CRB). However, in the blind case a special treatment is required due to the singularity of the Fisher Information Matrix (FIM). Usually a constraint is introduced to overcome the blind ambiguity and ensuing singularity. Hence, a constrained CRB has been derived in the literature since a long time ago. Although this constrained CRB has been proven to be a valid lower bound in the medium and high SNR regimes, it fails completely in the low SNR regime because unlike the MSE it does not saturate. Motivated by the shortcoming of the constrained CRB, we derive in this paper a modified constrained CRB (MCCRB) for deterministic blind channel estimation. The MCCRB is valid over the whole SNR regime. In the second part of the paper we address Bayesian blind channel estimation and explore the apparent discrepancy between channel unidentifiability with a non-singular FIM. We highlight that in the less familiar Bayesian case this relationship needs to be interpreted differently. The analytical formulas for the introduced bounds are validated by some Monte-Carlo simulations.
盲SIMO信道估计中贝叶斯和确定性crb的进一步结果
信道估计的性能通常通过推导合适的cram - rao界(CRB)来评估。然而,由于Fisher信息矩阵(FIM)的奇异性,在盲情况下需要进行特殊处理。通常引入约束来克服盲模糊和由此产生的奇异性。因此,在很早以前的文献中就推导出了约束CRB。尽管这种受限的CRB已被证明在中信噪比和高信噪比条件下是有效的下界,但它在低信噪比条件下完全失效,因为与MSE不同,它不会饱和。针对约束CRB算法的不足,提出了一种用于确定性盲信道估计的改进约束CRB算法。MCCRB在整个信噪比范围内有效。在论文的第二部分,我们讨论了贝叶斯盲信道估计,并探讨了信道不可识别与非奇异FIM之间的明显差异。我们强调,在不太熟悉的贝叶斯情况下,需要对这种关系进行不同的解释。通过一些蒙特卡罗仿真验证了所引入边界的解析公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信