咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >SYSTOLIC ALGORITHMS FOR THE SO... 收藏

SYSTOLIC ALGORITHMS FOR THE SOLUTION OF TOEPLITZ MATRICES

为 TOEPLITZ 矩阵的答案的收缩算法

作     者:D. J. Evans[a] S. A. Amin[b] 

作者机构:[a] Computer Studies Department Parallel Algorithms Research Center (PARC) Lougborough University Lougborough Leices UK [b] Informatic and Software Engineering Research Centre (ISERC) Chatham Kent UK 

出 版 物:《Parallel Algorithms and Applications》 (并行、紧急、分布式系统国际杂志)

年 卷 期:1997年第12卷第4期

页      面:321-339页

学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

主  题:Toeplitz circulant systolic array 

摘      要:In this paper a factorisation of certain symmetric circulant banded linear systems proposed by Evans [Evans 1981] is described. It can be shown that a banded Toeplitz matrix can be factorised into the product of easily inverted cyclic matrices. By using this factorisation, a solution can be derived for such *** matrices have become increasingly important with the rapid growth of signal and image processing. To achieve high performance, new systolic array designs for the algorithm shown above are implemented, A full description of the systolic array designs are given in a later section. The performance of the designs are discussed.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分