RUS  ENG
Полная версия
ЖУРНАЛЫ // Прикладная дискретная математика // Архив

ПДМ, 2014, номер 1(23), страницы 106–113 (Mi pdm444)

Вычислительные методы в дискретной математике

Pipelining combinational circuits

Yu. V. Pottosin, S. N. Kardash

United Institute of Informatics Problems of NAS of Belarus, Minsk, Belarus

Аннотация: For a multilevel combinatorial circuit, the problem of increasing its performance is considered. The problem is to divide the circuit into a given number of cascades and to connect them via registers providing pipeline-wise development of incoming signals. The frequency of incoming signals is established in the process of dividing the circuit. This frequency must be as high as possible. To solve this problem a model based on the representation of the circuit in the form of a directed graph is used.

Ключевые слова: combinational circuit, pipelining, directed graph.

УДК: 519.7

Язык публикации: английский



© МИАН, 2024