On some limits of XILINX based control logic implementations

Attila Katona, P. Szolgay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationField-Programmable Logic
Subtitle of host publicationArchitectures, Synthesis and Applications - 4th International Workshop on Field-Programmable Logic and Applications, FPL 1994, Proceedings
PublisherSpringer Verlag
Pages286-288
Number of pages3
ISBN (Print)9783540584193
Publication statusPublished - Jan 1 1994
Event4th International Workshop on Field-Programmable Logic and Applications, FPL 1994 - Prague, Czech Republic
Duration: Sep 7 1994Sep 9 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume849 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Workshop on Field-Programmable Logic and Applications, FPL 1994
CountryCzech Republic
CityPrague
Period9/7/949/9/94

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Katona, A., & Szolgay, P. (1994). On some limits of XILINX based control logic implementations. In Field-Programmable Logic: Architectures, Synthesis and Applications - 4th International Workshop on Field-Programmable Logic and Applications, FPL 1994, Proceedings (pp. 286-288). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 849 LNCS). Springer Verlag.