关于递归最小二乘估计的收缩数组的形式推导

Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94 Pub Date : 1996-03-01 DOI:10.1109/ISCAS.1994.408971

I. Proudler, J. McWhirter, M. Moonen

{"title":"关于递归最小二乘估计的收缩数组的形式推导","authors":"I. Proudler, J. McWhirter, M. Moonen","doi":"10.1109/ISCAS.1994.408971","DOIUrl":null,"url":null,"abstract":"We present the proof of a new systolic array for implementing a recursive least squares (RLS) algorithm based on the QR decomposition (QRD) inverse-updates method. In its basic formulation, this algorithm contains a long data feedback path which makes the construction of a systolic architecture very difficult. Here we show how to transform the algorithm so as to circumvent this problem.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"On the formal derivation of a systolic array for recursive least squares estimation\",\"authors\":\"I. Proudler, J. McWhirter, M. Moonen\",\"doi\":\"10.1109/ISCAS.1994.408971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present the proof of a new systolic array for implementing a recursive least squares (RLS) algorithm based on the QR decomposition (QRD) inverse-updates method. In its basic formulation, this algorithm contains a long data feedback path which makes the construction of a systolic architecture very difficult. Here we show how to transform the algorithm so as to circumvent this problem.<<ETX>>\",\"PeriodicalId\":140999,\"journal\":{\"name\":\"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAS.1994.408971\",\"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 IEEE International Symposium on Circuits and Systems - ISCAS '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.1994.408971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

我们提出了一种基于QR分解(QRD)逆更新方法实现递归最小二乘(RLS)算法的新收缩阵列的证明。在其基本公式中，该算法包含很长的数据反馈路径，这使得构造收缩结构非常困难。这里我们展示了如何变换算法来规避这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the formal derivation of a systolic array for recursive least squares estimation

We present the proof of a new systolic array for implementing a recursive least squares (RLS) algorithm based on the QR decomposition (QRD) inverse-updates method. In its basic formulation, this algorithm contains a long data feedback path which makes the construction of a systolic architecture very difficult. Here we show how to transform the algorithm so as to circumvent this problem.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94

自引率

0.00%

发文量