## Menu

## Publications

## Editor-in-Chief

**Nikiforov**

Vladimir O.

D.Sc., Prof.

Vladimir O.

D.Sc., Prof.

## Partners

## RELATIONAL THEORY APPLICATION FOR OPTIMAL DESIGN OF INTEGRATED CIRCUITS

**Read the full article**

**Article in**Russian

**Abstract**

This paper deals with a method of relational theory adaptation for integrated circuits CAD systems. A new algorithm is worked out for optimal search of implicit Don’t Care values for combinational multiple-level digital circuits. The algorithm is described in terms of the adapted relational theory that gives the possibility for a very simple algorithm description for both intuitive understanding and formal analysis. The proposed method makes it possible to apply progressive experience of relational databases in efficient implementation of relational algebra operations (including distributed ones). Comparative analysis of the proposed algorithm and a classic one for optimal search of implicit Don’t Cares is carried out. The analysis has proved formal correctness of the proposed algorithm and its considerably less worst-case complexity. The search of implicit Don’t Care values in the integrated circuits design makes it easier to optimize such characteristics of IC as chip area, power, verifiability and reliability. However, the classic algorithm for optimal search of implicit Don’t Care values is not used in practice due to its very high computational complexity. Application of algorithms for sub-optimal search doesn’t give the possibility to realize the potential of IC optimization to the full. Implementation of the proposed algorithm in IC CAD (a.k.a., EDA) systems is adequate due to much lower computational complexity, and potentially makes it possible to improve the quality-development time ratio of IC (chip area, power, verifiability and reliability). Developed method gives the possibility for creation of distributed EDA system with higher computational power and, consequently, for design automation of more complex IC.

**Keywords:**CAD, EDA, VLSI, optimization of combinational schemes, Boolean networks, partially defined Boolean functions, implicit Don’t Cares, ODC, relational theory, relational algebra, natural join

**References**

*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, 1991, vol. 10, no. 1, pp. 63–73. doi: 10.1109/43.62792

*Proc. of European Conference on Design Automation*. Amsterdam, Netherlands, 1992, pp. 184–191.

*Automatic Control and Computer Sciences*, 2012, vol. 46, no. 3, pp. 103–111. doi: 10.3103/S0146411612030029

*Technical Report UCB/ERL M92/41*, Electronics Research Lab, Univ. of California, Berkeley, 1992.

*The VIS Group. VIS: Verification Interacting with Synthesis*, 1995. Available at: http://embedded.eecs.berkeley.edu/Respep/Research/vis (accessed 04.12.2013).

*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, 1988, vol. 7, no. 6, pp. 723–740. doi: 10.1109/43.3211

*Logic Testing and Design for Testability*. Cambridge: MIT Press, 1985, 304 p.

*IEEE Transactions on Computers*, 1972, vol. C-21, no. 2, pp. 189–195.

*Automatic Control and Computer Sciences*, 2011, vol. 45, no. 5, pp. 268–276. doi: 10.3103/S014641161105004X

*Automatic Control and Computer Sciences*, 2011, vol. 45, no. 6, pp. 330–337. doi: 10.3103/S0146411611060046

*Scientific and Technical Journal of Information Technologies, Mechanics and Optics*, 2009, no. 5 (63), pp. 92–97.

*Scientific and Technical Journal of Information Technologies, Mechanics and Optics*, 2013, no. 4 (86), pp. 150–151.

*IEEE Transactions of Computers*, 1989, vol. 38, no. 10, pp. 1404–1424. doi: 10.1109/12.35836

*Proc. IEEE International Conference on Computer-Aided Design*, 1990, pp. 414–417.

*Logic Minimization Algorithms for VLSI Synthesis*. Kluwer Academic Publishers, 1985, 206 p.

*Proceedings - Design Automation Conference*. Las Vegas, USA, 1996, pp. 71–76.

*M.D. Computing*, 1998, vol. 15, no. 3, pp. 162–166.

*Foundations of Databases*. Addison-Wesley, 1995, 685 p.

*Foundation for Future Database Systems: The Third Manifesto*. 2

^{nd}ed. Addison-Wesley, 2000, 608 p.