A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}

Marek Bolanowski, Andrzej Paszkiewicz

Abstract


In the paper we present a method for synthesis of a set of connection networks, which fulfill the designer’s assumption. In order to do that, the designed network is presented as a system of Diophantine constraints in a special form. A method to resolve those systems is proposed, which is characterized by lower computational complexity, especially in the case of rare topologies design.

Full Text:

PDF


DOI: http://dx.doi.org/10.17951/ai.2013.13.1.11-21
Data publikacji: 2015-01-04 00:00:00
Data złożenia artykułu: 2016-04-28 09:09:37

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.