Advertisement

The Connection Layout in a Lattice of Four-Terminal Switches

Conference paper
  • 279 Downloads
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 561)

Abstract

A non classical approach to the logic synthesis of Boolean functions based on switching lattices is considered, for which deriving a feasible layout has not been previously studied. All switches controlled by the same literal must be connected together and to an input lead of the chip, and the layout of such connections must be realized in superimposed layers. Inter-layer connections are realized with vias, with the overall goal of minimizing the number of layers needed. The problem shows new interesting combinatorial and algorithmic aspects. Since the specific lattice cell where each switch is placed can be decided with a certain amount of freedom, and one literal among several may be assigned for controlling a switch, we first study a lattice rearrangement (Problem 1) and a literal assignment (Problem 2), to place in adjacent cells as many switches controlled by the same literal as possible. Then we study how to build a feasible layout of connections onto different layers using a minimum number of such layers (Problem 3). We prove that Problem 2 is NP-hard, and Problems 1 and 3 appear also intractable. Therefore we propose heuristic algorithms for the three phases that show an encouraging performance on a set of standard benchmarks.

Keywords

Circuit layout Switching lattices Logic synthesis Hard problems Heuristics 

References

  1. 1.
    Micheli, G.D.: Synthesis and Optimization of Switching Theory. McGrow Hill, New York (1994)Google Scholar
  2. 2.
    Akers, S.B.: A rectangular logic array. IEEE Trans. Comput. 21(8), 848–857 (1972)CrossRefGoogle Scholar
  3. 3.
    Altun, M., Riedel, M.D.: Lattice-based computation of Boolean functions. In: Proceedings of the 47th Design Automation Conference, DAC 2010, pp. 609–612, Anaheim, California, USA, 13–18 July 2010Google Scholar
  4. 4.
    Altun, M., Riedel, M.D.: Logic synthesis for switching lattices. IEEE Trans. Comput. 61(11), 1588–1600 (2012)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Gange, G., Søndergaard, H., Stuckey, P.J.: Synthesizing optimal switching lattices. ACM Trans. Des. Autom. Electron. Syst. 20(1), 6:1–6:14 (2014)CrossRefGoogle Scholar
  6. 6.
    Bernasconi, A., Boffa, A., Luccio, F., Pagli, L.: Two combinatorial problems on the layout of switching lattices. In: IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC) (2018)Google Scholar
  7. 7.
    Bernasconi, A., Luccio, F., Pagli, L., Rucci, D.: Literal selection in switching lattice design. In: Proceedings of the 13th International Workshop on Boolean Problems (IWSBP 2018), pp. 205–220 (2018)Google Scholar
  8. 8.
    Luccio, F., Xia, M.: The MPA graph problem: definition and basic properties. Technical report, University of Pisa, Department of Informatics (2018)Google Scholar
  9. 9.
    Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(2), 135–140 (1981)MathSciNetCrossRefGoogle Scholar
  10. 10.
    de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting fáry embeddings of planar graphs. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 426–433, Chicago, Illinois, USA, 2–4 May 1988Google Scholar
  11. 11.
    Ratner, D., Warmuth, M.K.: Finding a shortest solution for the N \(\times \) N extension of the 15-puzzle is intractable. In: Proceedings of the 5th National Conference on Artificial Intelligence, Volume 1: Science, pp. 168–172, Philadelphia, PA, 11–15 August 1986Google Scholar
  12. 12.
    Chu, C.C.N., Wong, Y.: FLUTE: fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design. IEEE Trans. CAD Integr. Circ. Syst. 27(1), 70–83 (2008)CrossRefGoogle Scholar
  13. 13.
    Fox, J., Pach, J., Suk, A.: Approximating the rectilinear crossing number. In: Hu, Y., Nöllenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 413–426. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-50106-2_32CrossRefGoogle Scholar
  14. 14.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)CrossRefGoogle Scholar
  15. 15.
    Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach. Prentice Hall Series in Artificial Intelligence, 2nd edn. Prentice Hall, Upper Saddle River (2003)zbMATHGoogle Scholar
  16. 16.
    Yang, S.: Logic synthesis and optimization benchmarks user guide version 3.0. user guide, Microelectronic Center (1991)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2019

Authors and Affiliations

  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations