|
Prikladnaya Diskretnaya Matematika, 2014, Number 1(23), Pages 106–113
(Mi pdm444)
|
|
|
|
Computational Methods in Discrete Mathematics
Pipelining combinational circuits
Yu. V. Pottosin, S. N. Kardash United Institute of Informatics Problems of NAS of Belarus, Minsk, Belarus
Abstract:
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.
Keywords:
combinational circuit, pipelining, directed graph.
Citation:
Yu. V. Pottosin, S. N. Kardash, “Pipelining combinational circuits”, Prikl. Diskr. Mat., 2014, no. 1(23), 106–113
Linking options:
https://www.mathnet.ru/eng/pdm444 https://www.mathnet.ru/eng/pdm/y2014/i1/p106
|
Statistics & downloads: |
Abstract page: | 304 | Full-text PDF : | 121 | References: | 38 | First page: | 1 |
|