图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

On Construction of Algorithms with the Bounded Parallelism for Solving Problems of Digital Filtering

卷 34, 册 12, 2002, 10 pages
DOI: 10.1615/JAutomatInfScien.v34.i12.20
Get accessGet access

摘要

We propose the algorithm with the bounded number of branches executed in parallel for numerical solving the two- and three-dimensional problems of digital filtering. Estimations of acceleration of these parallel algorithms are given.

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain