Inscrição na biblioteca: Guest
Journal of Automation and Information Sciences

Publicou 12 edições por ano

ISSN Imprimir: 1064-2315

ISSN On-line: 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

Volume 34, Edição 12, 2002, 10 pages
DOI: 10.1615/JAutomatInfScien.v34.i12.20
Get accessGet access

RESUMO

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.

Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa Políticas de preços e assinaturas Begell House Contato Language English 中文 Русский Português German French Spain