Pipelining of combinational circuits
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 121-123
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
Keywords:
combinational circuit, pipelining, directed graph.
@article{PDMA_2013_6_a54,
author = {Yu. V. Pottosin and S. N. Kardash},
title = {Pipelining of combinational circuits},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {121--123},
year = {2013},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a54/}
}
Yu. V. Pottosin; S. N. Kardash. Pipelining of combinational circuits. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 121-123. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a54/
[1] Kagan B. M., Kanevskii M. M., Tsifrovye vychislitelnye mashiny i sistemy, Energiya, M., 1973 | Zbl
[2] Kukharev G. A., Shmerko V. P., Zaitseva E. N., Algoritmy i sistolicheskie protsessory dlya obrabotki mnogoznachnykh dannykh, Navuka i tekhnika, Minsk, 1990
[3] Knut D., Iskusstvo programmirovaniya dlya EVM, v. 1, Osnovnye algoritmy, Mir, M., 1976