On some limits of XILINX based control logic implementations

  • Attila Katona
  • Péter Szolgay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 849)


In this paper we gave some methods how the complexity of a design description can be quantified and what is the largest complexity that can be implemented on a given type of XILINX chip using the standard XACT design system. These methods can be used to partition a large design task, given by either a circuit schematic or an algorithm, to smaller ones which can be implemented in FPGA chips.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P.Szolgay,” On algorithms in the parallel design of logic and layout of circuits with functional blocks”, Int. J. of Circuit Theory and Applications, Vol.20, pp.411–429, (1992.)Google Scholar
  2. [2]
    The Programmable Gate Array Data Book 1992, Xilinx, San Jose, CaliforniaGoogle Scholar
  3. [3]
    M.H.Halstead, Elements of Software Science, Elsevier North-Holland, Amsterdam, 1977.Google Scholar
  4. [4]
    Special Section on Field Programmable Gate Arrays (ed. A. El Gammal), Proc. of the IEEE Vol. 81, No. 7, July 1993 pp. 1011–1083Google Scholar
  5. [5]
    A.Katona and P.Szolgay, “Limits of XILINX based control logic implementations”, IT-2-1993, University of VeszprémGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Attila Katona
    • 1
  • Péter Szolgay
    • 1
    • 2
  1. 1.Department of Information Technology and AutomationUniversity of VeszprémHungary
  2. 2.Computer and Automation Institute of HASHungary

Personalised recommendations