{"title":"自适应线性约束逆QRD-RLS波束形成器抑制多干扰","authors":"Chung-Yao Chang, Shiunn-Jang Chern","doi":"10.1109/SPAWC.2001.923907","DOIUrl":null,"url":null,"abstract":"A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the \"fast\" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.","PeriodicalId":435867,"journal":{"name":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression\",\"authors\":\"Chung-Yao Chang, Shiunn-Jang Chern\",\"doi\":\"10.1109/SPAWC.2001.923907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the \\\"fast\\\" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.\",\"PeriodicalId\":435867,\"journal\":{\"name\":\"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2001.923907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2001.923907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive linearly constrained inverse QRD-RLS beamformer for multiple jammers suppression
A new general linearly constrained recursive least squares (RLS) array beamforming algorithm, based on an inverse QR decomposition, is developed for multiple jammer suppression. It is known the LS weight vector can be computed without back substitution in the inverse QRD-based algorithms and is suitable to be implemented using the systolic array. Also, the problem of the unacceptable numerical performance in limited-precision environments, occurring in the "fast" RLS filtering algorithms, can be avoided. To document the advantage of this new constrained algorithm, performance, in terms of convergence property of the learning curve and the capability of jammer suppression, is investigated. We show that our proposed algorithm outperforms the LCLMS algorithm and the linearly constraint fast LS algorithm (LCFLS) and its robust version (LCRFSL) algorithm.