{"title":"阵列处理中有限样本累积量的协方差","authors":"T. Kaiser, J. Mendel","doi":"10.1109/HOST.1997.613536","DOIUrl":null,"url":null,"abstract":"In this paper we provide explicit formulas for the covariances of second-third-, and fourth-order sample cumulants as used in narrowband array processing. These covariances provide a basis for analysing the performance of cumulant based algorithms for finite-sample length, which is in contrast to usual asymptotic performance analyses. The use of these formulas, which consist of several thousand terms, will be demonstrated, and a rough idea of their applicability to a performance analysis for finite numbers of samples will be given.","PeriodicalId":305928,"journal":{"name":"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Covariance of finite-sample cumulants in array-processing\",\"authors\":\"T. Kaiser, J. Mendel\",\"doi\":\"10.1109/HOST.1997.613536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide explicit formulas for the covariances of second-third-, and fourth-order sample cumulants as used in narrowband array processing. These covariances provide a basis for analysing the performance of cumulant based algorithms for finite-sample length, which is in contrast to usual asymptotic performance analyses. The use of these formulas, which consist of several thousand terms, will be demonstrated, and a rough idea of their applicability to a performance analysis for finite numbers of samples will be given.\",\"PeriodicalId\":305928,\"journal\":{\"name\":\"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOST.1997.613536\",\"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 of the IEEE Signal Processing Workshop on Higher-Order Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOST.1997.613536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Covariance of finite-sample cumulants in array-processing
In this paper we provide explicit formulas for the covariances of second-third-, and fourth-order sample cumulants as used in narrowband array processing. These covariances provide a basis for analysing the performance of cumulant based algorithms for finite-sample length, which is in contrast to usual asymptotic performance analyses. The use of these formulas, which consist of several thousand terms, will be demonstrated, and a rough idea of their applicability to a performance analysis for finite numbers of samples will be given.