Pipelining of combinational circuits | Applied Discrete Mathematics. Supplement. 2013. № 6.

HomeIssuesPipelining of combinational circuits | Applied Discrete Mathematics. Supplement. 2013. № 6.

Pipelining of combinational circuits

The problem is set to divide a given multilevel combinational circuit into a given number of cascades with registers providing pipeline-wise development of incoming signals. To solve this problem a model based on representation of combinational circuit in the form of digraph is used.

Download file
Counter downloads: 301

Keywords

комбинационная схема, конвейеризация, ориентированный граф, combinational circuit, pipelining, directed graph

Authors

NameOrganizationE-mail
Pottosin Yu.V.United Institute of Informatics Problems of the National Academy of Sciences of Belarus (Minsk)pott@newman.bas-net.by
Kardash S.N.United Institute of Informatics Problems of the National Academy of Sciences of Belarus (Minsk)
Всего: 2

References

Каган Б. М., Каневский М. М. Цифровые вычислительные машины и системы. М.: Энергия, 1973.
Кухарев Г. А., Шмерко В. П., Зайцева Е. Н. Алгоритмы и систолические процессоры для обработки многозначных данных. Минск: Навука i тэхнжа, 1990.
Кнут Д. Искусство программирования для ЭВМ. Т. 1. Основные алгоритмы. М.: Мир, 1976.
Pipelining of combinational circuits | Applied Discrete Mathematics. Supplement. 2013. № 6.

Pipelining of combinational circuits | Applied Discrete Mathematics. Supplement. 2013. № 6.