Systolic array implementation of recursive bispectrum estimation

R. J. Perry, M. Amin
{"title":"Systolic array implementation of recursive bispectrum estimation","authors":"R. J. Perry, M. Amin","doi":"10.1109/HOST.1993.264590","DOIUrl":null,"url":null,"abstract":"Presents the systolic array implementation of recursive higher order spectrum in which the bispectrum estimate is updated every data sample. Forward and reverse sequence running Fourier transforms are first systolically realized. The results are then used to drive a second systolic array whose outputs represent the FT of the data third order moment. The proposed systolic array has no global communications with a number of PEs independent of the size of the employed two dimensional lag window.<<ETX>>","PeriodicalId":439030,"journal":{"name":"[1993 Proceedings] IEEE Signal Processing Workshop on Higher-Order Statistics","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993 Proceedings] IEEE Signal Processing Workshop on Higher-Order Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOST.1993.264590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Presents the systolic array implementation of recursive higher order spectrum in which the bispectrum estimate is updated every data sample. Forward and reverse sequence running Fourier transforms are first systolically realized. The results are then used to drive a second systolic array whose outputs represent the FT of the data third order moment. The proposed systolic array has no global communications with a number of PEs independent of the size of the employed two dimensional lag window.<>
收缩阵列实现递归双谱估计
提出了一种递归高阶谱的收缩阵列实现方法,该方法在每个数据样本中更新双谱估计。首先系统地实现了正反序运行傅里叶变换。结果然后用于驱动第二个收缩阵列,其输出表示数据三阶矩的FT。所提出的收缩阵列与许多pe没有全局通信,而这些pe与所采用的二维滞后窗口的大小无关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信