{"title":"鲁棒递归最小二乘自适应波束形成算法","authors":"Xin Song, Jinkuan Wang, Han Wang","doi":"10.1109/ISCIT.2004.1412846","DOIUrl":null,"url":null,"abstract":"When adaptive arrays are applied to practical problems, the performance degradation of adaptive beamforming techniques may become even more pronounced than in ideal cases because some of the underlying assumptions on the environment, sources, or sensor array can be violated and this may cause a mismatch between the presumed and actual signal steering vectors. In fact, the performances of existing adaptive array algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of degradation can take place when the signal array response is known precisely but the training sample size is small. On the basis of the recursive least squares (RLS) algorithm, we propose a novel approach to robust adaptive beamforming. Our robust RLS adaptive beamforming algorithm provides excellent robustness against signal steering vector mismatches and small training sample size, offers faster convergence rate, makes the mean output array SINR consistently close to the optimal one, and improves the unitary mismatch. Computer simulations demonstrate a visible performance gain of the proposed robust RLS algorithm.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Robust recursive least squares adaptive beamforming algorithm\",\"authors\":\"Xin Song, Jinkuan Wang, Han Wang\",\"doi\":\"10.1109/ISCIT.2004.1412846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When adaptive arrays are applied to practical problems, the performance degradation of adaptive beamforming techniques may become even more pronounced than in ideal cases because some of the underlying assumptions on the environment, sources, or sensor array can be violated and this may cause a mismatch between the presumed and actual signal steering vectors. In fact, the performances of existing adaptive array algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of degradation can take place when the signal array response is known precisely but the training sample size is small. On the basis of the recursive least squares (RLS) algorithm, we propose a novel approach to robust adaptive beamforming. Our robust RLS adaptive beamforming algorithm provides excellent robustness against signal steering vector mismatches and small training sample size, offers faster convergence rate, makes the mean output array SINR consistently close to the optimal one, and improves the unitary mismatch. Computer simulations demonstrate a visible performance gain of the proposed robust RLS algorithm.\",\"PeriodicalId\":237047,\"journal\":{\"name\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2004.1412846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2004.1412846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust recursive least squares adaptive beamforming algorithm
When adaptive arrays are applied to practical problems, the performance degradation of adaptive beamforming techniques may become even more pronounced than in ideal cases because some of the underlying assumptions on the environment, sources, or sensor array can be violated and this may cause a mismatch between the presumed and actual signal steering vectors. In fact, the performances of existing adaptive array algorithms are known to degrade substantially in the presence of even slight mismatches between the actual and presumed array responses to the desired signal. Similar types of degradation can take place when the signal array response is known precisely but the training sample size is small. On the basis of the recursive least squares (RLS) algorithm, we propose a novel approach to robust adaptive beamforming. Our robust RLS adaptive beamforming algorithm provides excellent robustness against signal steering vector mismatches and small training sample size, offers faster convergence rate, makes the mean output array SINR consistently close to the optimal one, and improves the unitary mismatch. Computer simulations demonstrate a visible performance gain of the proposed robust RLS algorithm.