基于Hopfield模型网络的LMS算法的收缩阵列结构

K. Takahashi, S. Mori
{"title":"基于Hopfield模型网络的LMS算法的收缩阵列结构","authors":"K. Takahashi, S. Mori","doi":"10.1109/MWSCAS.1991.252133","DOIUrl":null,"url":null,"abstract":"Presents a systolic array implementation of a modified LMS (least mean square) algorithm, which is based on the dynamics of the network in the Hopfield model network. The rate of the adaptation of the modified algorithm is n times as fast as the conventional LMS algorithm with the same control gain, where n is the number of iterations for each piece of sampled data in the network. However, the computational complexity of the algorithm increased. In the modified algorithm, the coefficients can be computed independently. Therefore, parallel array processing such as a systolic array is available. The systolic array consists of one kind of processing element, and the processing element consists on one multiplier, one adder, and one memory. The number of the processing element is the same as the order of the adaptive filter. The computation time for updating the coefficients of the adaptive filter is (L+1)n in time steps, where L is the number of coefficients of the adaptive filter and n is the number of iterations in the network.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"44 1","pages":"87-90 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Systolic array architecture for LMS algorithm using Hopfield model network\",\"authors\":\"K. Takahashi, S. Mori\",\"doi\":\"10.1109/MWSCAS.1991.252133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a systolic array implementation of a modified LMS (least mean square) algorithm, which is based on the dynamics of the network in the Hopfield model network. The rate of the adaptation of the modified algorithm is n times as fast as the conventional LMS algorithm with the same control gain, where n is the number of iterations for each piece of sampled data in the network. However, the computational complexity of the algorithm increased. In the modified algorithm, the coefficients can be computed independently. Therefore, parallel array processing such as a systolic array is available. The systolic array consists of one kind of processing element, and the processing element consists on one multiplier, one adder, and one memory. The number of the processing element is the same as the order of the adaptive filter. The computation time for updating the coefficients of the adaptive filter is (L+1)n in time steps, where L is the number of coefficients of the adaptive filter and n is the number of iterations in the network.<<ETX>>\",\"PeriodicalId\":6453,\"journal\":{\"name\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"volume\":\"44 1\",\"pages\":\"87-90 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1991.252133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.252133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于Hopfield模型网络中网络动态特性的改进LMS(最小均方)算法的收缩阵列实现。在控制增益相同的情况下,改进算法的自适应速度是传统LMS算法的n倍,其中n为网络中每条采样数据的迭代次数。然而,该算法的计算复杂度增加了。在改进的算法中,系数可以独立计算。因此,并行阵列处理,如收缩阵列是可用的。所述收缩数组由一种处理元件组成,所述处理元件由一个乘法器、一个加法器和一个存储器组成。处理单元的个数与自适应滤波器的阶数相同。更新自适应滤波器系数的计算时间为(L+1)n,以时间步长为单位,其中L为自适应滤波器的系数个数,n为网络的迭代次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Systolic array architecture for LMS algorithm using Hopfield model network
Presents a systolic array implementation of a modified LMS (least mean square) algorithm, which is based on the dynamics of the network in the Hopfield model network. The rate of the adaptation of the modified algorithm is n times as fast as the conventional LMS algorithm with the same control gain, where n is the number of iterations for each piece of sampled data in the network. However, the computational complexity of the algorithm increased. In the modified algorithm, the coefficients can be computed independently. Therefore, parallel array processing such as a systolic array is available. The systolic array consists of one kind of processing element, and the processing element consists on one multiplier, one adder, and one memory. The number of the processing element is the same as the order of the adaptive filter. The computation time for updating the coefficients of the adaptive filter is (L+1)n in time steps, where L is the number of coefficients of the adaptive filter and n is the number of iterations in the network.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信