收缩阵列实现有序递归最小二乘自适应滤波算法

F. Ling
{"title":"收缩阵列实现有序递归最小二乘自适应滤波算法","authors":"F. Ling","doi":"10.1109/ARRAYS.1988.18054","DOIUrl":null,"url":null,"abstract":"Three systolic arrays suitable for implementation of order-recursive least-squares (ORLS) adaptive algorithms are considered. It is shown that they can be constructed using two types of elementary cells. A classification of systolic implementations of the ORLS adaptive algorithms is given by exploiting the possible variations of the elementary cells. The investigation of the array structures and variations of the elementary cells leads to a systematic approach to designing reconfigurable systolic arrays for implementation of ORLS algorithms. As an application of this approach, a novel least-squares (LS) lattice algorithm based on Givens rotations is derived.<<ETX>>","PeriodicalId":339807,"journal":{"name":"[1988] Proceedings. International Conference on Systolic Arrays","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Systolic arrays for implementation of order-recursive least-squares adaptive filtering algorithms\",\"authors\":\"F. Ling\",\"doi\":\"10.1109/ARRAYS.1988.18054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Three systolic arrays suitable for implementation of order-recursive least-squares (ORLS) adaptive algorithms are considered. It is shown that they can be constructed using two types of elementary cells. A classification of systolic implementations of the ORLS adaptive algorithms is given by exploiting the possible variations of the elementary cells. The investigation of the array structures and variations of the elementary cells leads to a systematic approach to designing reconfigurable systolic arrays for implementation of ORLS algorithms. As an application of this approach, a novel least-squares (LS) lattice algorithm based on Givens rotations is derived.<<ETX>>\",\"PeriodicalId\":339807,\"journal\":{\"name\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"volume\":\"149 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARRAYS.1988.18054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. International Conference on Systolic Arrays","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARRAYS.1988.18054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

考虑了适合实现有序递归最小二乘(ORLS)自适应算法的三种收缩阵列。结果表明,它们可以用两种类型的基本细胞来构建。通过利用基本细胞的可能变化,给出了ORLS自适应算法的收缩实现分类。通过对阵列结构和基本细胞变化的研究,为实现ORLS算法设计可重构收缩阵列提供了系统的方法。作为该方法的应用,提出了一种新的基于Givens旋转的最小二乘(LS)格算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Systolic arrays for implementation of order-recursive least-squares adaptive filtering algorithms
Three systolic arrays suitable for implementation of order-recursive least-squares (ORLS) adaptive algorithms are considered. It is shown that they can be constructed using two types of elementary cells. A classification of systolic implementations of the ORLS adaptive algorithms is given by exploiting the possible variations of the elementary cells. The investigation of the array structures and variations of the elementary cells leads to a systematic approach to designing reconfigurable systolic arrays for implementation of ORLS algorithms. As an application of this approach, a novel least-squares (LS) lattice algorithm based on Givens rotations is derived.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信