{"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}
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.