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.
Скачать электронную версию публикации
Загружен, раз: 107
- Title Pipelining combinational circuits
- Headline Pipelining combinational circuits
- Publesher
Tomsk State University - Issue Прикладная дискретная математика 1(23)
- Date:
- DOI
Ключевые слова
combinational circuit, pipelining, directed graphАвторы
Ссылки
Voevodin V. B. Mathematical Models and Methods in Concurrent Processes. Moscow: Nauka, 1986. 296p. (in Russian).
Kapitonova Yu. V. and Letichevskij A. A. Mathematical Theory of Computing System Design. Moscow: Nauka, 1988. 296p. (in Russian).
Kagan B. M. and Kanevskij M. M. Digital Computers and Systems. Moscow: Energiya, 1973. 680p. (in Russian).
Kukharev G. A, Tropchenko A. Yu., and ShmerkoV.P. Systolic Processors for Signal Processing. Minsk: Belarus, 1988. 127p. (in Russian).
Kukharev G. A, Shmerko V.P., and Zaitseva E. N. Algorithms and Systolic Processors for Multivalued Data Processing. Minsk: Navuka i Tekhnika, 1990. 296p. (in Russian).
Lukoshko G. and Konnov E. CMOS-base array chips of K1574 series // Radiolyubitel. 1997. No. 9. P. 39-40 (in Russian).
Agibalov G.P. and Belyaev V.A. Technique for Solving Combinatorial Logical Tasks by the Method of Shortcut Bypassing of a Search Tree. Tomsk: TSU, 1981. 126p. (in Russian).
Pipelining combinational circuits | Прикладная дискретная математика. 2014. № 1(23).
Скачать полнотекстовую версию
Полнотекстовая версияЗагружен, раз: 212