Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2014_1_a11, author = {Yu. V. Pottosin and S. N. Kardash}, title = {Pipelining combinational circuits}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {106--113}, publisher = {mathdoc}, number = {1}, year = {2014}, language = {en}, url = {http://geodesic.mathdoc.fr/item/PDM_2014_1_a11/} }
Yu. V. Pottosin; S. N. Kardash. Pipelining combinational circuits. Prikladnaâ diskretnaâ matematika, no. 1 (2014), pp. 106-113. http://geodesic.mathdoc.fr/item/PDM_2014_1_a11/
[1] Kagan B. M., Kanevskij M. M., Digital Computers and Systems, Energiya, Moscow, 1973, 680 pp. (in Russian) | Zbl
[2] Voevodin V. B., Mathematical Models and Methods in Concurrent Processes, Nauka, Moscow, 1986, 296 pp. (in Russian)
[3] Kapitonova Yu. V., Letichevskij A. A., Mathematical Theory of Computing System Design, Nauka, Moscow, 1988, 296 pp. (in Russian) | Zbl
[4] Kukharev G. A., Tropchenko A. Yu., Shmerko V. P., Systolic Processors for Signal Processing, Belarus, Minsk, 1988, 127 pp. (in Russian)
[5] Kukharev G. A., Shmerko V. P., Zaitseva E. N., Algorithms and Systolic Processors for Multivalued Data Processing, Navuka i Tekhnika, Minsk, 1990, 296 pp. (in Russian)
[6] Lukoshko G., Konnov E., “CMOS-base array chips of K1574 series”, Radiolyubitel, 1997, no. 9, 39–40 (in Russian)
[7] Agibalov G. P., Belyaev V. A., Technique for Solving Combinatorial Logical Tasks by the Method of Shortcut Bypassing of a Search Tree, TSU, Tomsk, 1981, 126 pp. (in Russian)