并行VLSI实现了一种新的简化卡尔曼滤波器结构

C.J.B. Fayomii, M. Sawan, S. Bennis
{"title":"并行VLSI实现了一种新的简化卡尔曼滤波器结构","authors":"C.J.B. Fayomii, M. Sawan, S. Bennis","doi":"10.1109/CCECE.1995.528088","DOIUrl":null,"url":null,"abstract":"A new approach for implementing a parallel VLSI architecture of a simplified Kalman filter (information filter) with unknown noise statistics is described. At the system level, the proposed approach is applied to a semi-systolic VLSI array to accelerate the matrix operations required in each iteration. In order to maximize the parallelism, a new architecture called the tri-trapezoidal array for implementing the Schur complement algorithm is proposed. The computations steps are decomposed into 2(m+1) parts executable in parallel. This decomposition decreases the computation time by 55%. The overall architecture exhibits a high performance and can be used for real time applications.","PeriodicalId":158581,"journal":{"name":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Parallel VLSI implementation of a new simplified architecture of Kalman filter\",\"authors\":\"C.J.B. Fayomii, M. Sawan, S. Bennis\",\"doi\":\"10.1109/CCECE.1995.528088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach for implementing a parallel VLSI architecture of a simplified Kalman filter (information filter) with unknown noise statistics is described. At the system level, the proposed approach is applied to a semi-systolic VLSI array to accelerate the matrix operations required in each iteration. In order to maximize the parallelism, a new architecture called the tri-trapezoidal array for implementing the Schur complement algorithm is proposed. The computations steps are decomposed into 2(m+1) parts executable in parallel. This decomposition decreases the computation time by 55%. The overall architecture exhibits a high performance and can be used for real time applications.\",\"PeriodicalId\":158581,\"journal\":{\"name\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1995.528088\",\"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 1995 Canadian Conference on Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1995.528088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种新的实现具有未知噪声统计量的简化卡尔曼滤波器(信息滤波器)并行VLSI结构的方法。在系统层面,该方法被应用于半收缩VLSI阵列,以加速每次迭代所需的矩阵运算。为了最大限度地提高并行度,提出了一种实现Schur补码算法的三梯形阵列结构。计算步骤被分解为2(m+1)个可并行执行的部分。这种分解减少了55%的计算时间。整体架构表现出高性能,可用于实时应用程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Parallel VLSI implementation of a new simplified architecture of Kalman filter
A new approach for implementing a parallel VLSI architecture of a simplified Kalman filter (information filter) with unknown noise statistics is described. At the system level, the proposed approach is applied to a semi-systolic VLSI array to accelerate the matrix operations required in each iteration. In order to maximize the parallelism, a new architecture called the tri-trapezoidal array for implementing the Schur complement algorithm is proposed. The computations steps are decomposed into 2(m+1) parts executable in parallel. This decomposition decreases the computation time by 55%. The overall architecture exhibits a high performance and can be used for real time applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信