{"title":"A novel givens rotation based fast SQR-RLS algorithm","authors":"A. Carini","doi":"10.5281/ZENODO.36157","DOIUrl":null,"url":null,"abstract":"A novel Fast RLS Algorithm based on the Givens Rotation and developed from an UDUT square-root factorization of autocorrelation matrix is discussed. The algorithm presents excellent numerical properties and requires 14N multiplications and 6N divisions per sampling interval, where N is the linear filter order.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.36157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A novel Fast RLS Algorithm based on the Givens Rotation and developed from an UDUT square-root factorization of autocorrelation matrix is discussed. The algorithm presents excellent numerical properties and requires 14N multiplications and 6N divisions per sampling interval, where N is the linear filter order.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
