源分离的约束Cramer-Rao界

Brian M. Sadler, R. Kozick
{"title":"源分离的约束Cramer-Rao界","authors":"Brian M. Sadler, R. Kozick","doi":"10.1109/ISIT.2001.936071","DOIUrl":null,"url":null,"abstract":"Constrained Cramer-Rao bounds (CRBs) are developed for multiple-input multiple-output (MIMO) scenarios, including both instantaneous and convolutive mixing. We find the convolutive MIMO Fisher information matrix (FIM) and study its properties. While this FIM is generally rank deficient, we establish equality constraints to achieve regularity. We employ the constrained CRB formulation of Gorman and Hero (1990) and Stoica and Ng (see IEEE SPL, vol.6, no.7, p.177-79, 1998), allowing the incorporation of side information into the bounds. This framework provides bounds on many algorithms proposed in the literature for MIMO channel and source estimation that exploit various kinds of side information, including semi-blind, constant modulus, and others.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Constrained Cramer-Rao bounds on source separation\",\"authors\":\"Brian M. Sadler, R. Kozick\",\"doi\":\"10.1109/ISIT.2001.936071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constrained Cramer-Rao bounds (CRBs) are developed for multiple-input multiple-output (MIMO) scenarios, including both instantaneous and convolutive mixing. We find the convolutive MIMO Fisher information matrix (FIM) and study its properties. While this FIM is generally rank deficient, we establish equality constraints to achieve regularity. We employ the constrained CRB formulation of Gorman and Hero (1990) and Stoica and Ng (see IEEE SPL, vol.6, no.7, p.177-79, 1998), allowing the incorporation of side information into the bounds. This framework provides bounds on many algorithms proposed in the literature for MIMO channel and source estimation that exploit various kinds of side information, including semi-blind, constant modulus, and others.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对多输入多输出(MIMO)场景,包括瞬时混合和卷积混合,开发了约束Cramer-Rao边界(crb)。我们找到了卷积MIMO Fisher信息矩阵(FIM)并研究了它的性质。由于该FIM通常是秩不足的,我们建立了相等约束来实现正则性。我们采用Gorman和Hero(1990)以及Stoica和Ng(见IEEE SPL, vol.6, no. 6)的约束CRB公式。7, p.177-79, 1998),允许将边信息纳入边界。该框架为文献中提出的用于MIMO信道和源估计的许多算法提供了边界,这些算法利用各种侧面信息,包括半盲,恒模等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constrained Cramer-Rao bounds on source separation
Constrained Cramer-Rao bounds (CRBs) are developed for multiple-input multiple-output (MIMO) scenarios, including both instantaneous and convolutive mixing. We find the convolutive MIMO Fisher information matrix (FIM) and study its properties. While this FIM is generally rank deficient, we establish equality constraints to achieve regularity. We employ the constrained CRB formulation of Gorman and Hero (1990) and Stoica and Ng (see IEEE SPL, vol.6, no.7, p.177-79, 1998), allowing the incorporation of side information into the bounds. This framework provides bounds on many algorithms proposed in the literature for MIMO channel and source estimation that exploit various kinds of side information, including semi-blind, constant modulus, and others.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信