{"title":"Reduced-complexity RLS estimation for shallow-water channels","authors":"M. Kocic, D. Brady, S. Merriam","doi":"10.1109/AUV.1994.518621","DOIUrl":null,"url":null,"abstract":"An adjustable complexity, recursive least squares (RLS) estimation algorithm is presented, which is suitable for adaptive equalization and source localization in shallow-water acoustic channels. The algorithm adjusts its computational complexity, measured in FLOPS per update, in a decreasing fashion with the relative signal strength, by ignoring \"insignificant\" dimensions of the channel. The algorithm reverts to the well-known fast RLS algorithms when the signal quality is weak, and may be combined with reduced period updating techniques. Examples illustrate computational savings in excess of one order of magnitude, permitting a tripling of the maximum data rate through these complexity-limited communication channels.","PeriodicalId":231222,"journal":{"name":"Proceedings of IEEE Symposium on Autonomous Underwater Vehicle Technology (AUV'94)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE Symposium on Autonomous Underwater Vehicle Technology (AUV'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AUV.1994.518621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
An adjustable complexity, recursive least squares (RLS) estimation algorithm is presented, which is suitable for adaptive equalization and source localization in shallow-water acoustic channels. The algorithm adjusts its computational complexity, measured in FLOPS per update, in a decreasing fashion with the relative signal strength, by ignoring "insignificant" dimensions of the channel. The algorithm reverts to the well-known fast RLS algorithms when the signal quality is weak, and may be combined with reduced period updating techniques. Examples illustrate computational savings in excess of one order of magnitude, permitting a tripling of the maximum data rate through these complexity-limited communication channels.