Course details

Digital Systems Design (in English)

INCe Acad. year 2018/2019 Winter semester 5 credits

Current academic year

Binary digit system: positional notation, conversion of base, binary codes, binary arithmetic. Boolean algebra, logic functions and their representations: logic expressions, reduction methods, design of combinational logic networks. Analysis of logic networks behaviour: signal races, hazards. Selected logic modules: adder, subtractor, multiplexer, demultiplexer, decoder, coder, comparator, arithmetic and logic unit. Sequential logic networks, latches and flip-flops. State machines and their representations. Design of synchronized sequential networks: state assigment, optimization and implementation. Register, counter, shift register, impulse divider. Design of simple digital equipment: design CAD tools, description tools, design strategy. Integrated circuits families: SSI, MSI, LSI. Programmable logic devices: gate arrays, PROM, PLA, PAL. Simple asynchronous networks: design, analysis of behaviour, hazards.

Guarantor

Eysselt Miloš, Ing., CSc.

Language of instruction

English

Completion

Examination (written)

Time span

  • 39 hrs lectures
  • 13 hrs exercises

Assessment points

  • 60 pts final exam (written part)
  • 40 pts mid-term test (written part)

Department

Department of Computer Systems (UPSY)

Lecturer

Eysselt Miloš, Ing., CSc.

Instructor

Eysselt Miloš, Ing., CSc.

Subject specific learning outcomes and competences

A practical use of selected methods for specification of combinational and sequential logic networks. An encompassment of analysis and design of simple combinational and sequential networks. An encompassment of analysis and design of simple digital equipments using combinational and sequential circuits and blocks.

Learning objectives

To obtain an overview and fundamental knowledge of a practical use of selected methods for description of combinational and sequential logic networks which are inside digital equipments. To learn how to analyze and design combinational logic devices. To learn how to analyze and design sequential logic devices. To learn about design of digital circuits consisting of combinational and sequential logic devices.

Prerequisite knowledge and skills

The sets, relations and mappings. Basic terms and axioms of Boolean algebra. The elementary notions of the graph theory. Rudiments of electrical engineering phenomena and basic active and passive electronic elements.

Study literature

  • Bout, D.V.: Pragmatic Logic Design With Xilinx Foundation 2.1i. XESS Corporation, WWW Edition.
  • Sasao, T.: SWITCHING THEORY FOR LOGIC SYNTHESIS (http://www.wkap.nl/prod/b/0-7923-8456-3). Kluwer Academic Publishers, Boston, USA, ISBN 0-7923-8456-3, 1999.
  • Amaral, J.N.: COMPUTER ORGANIZATION AND ARCHITECTURE I (http://www.cs.ualberta.ca/~amaral/courses/229/). University of Alberta, Edmonton, CA, 2003.
  • Amaral, J.N.: COMPUTER ORGANIZATION AND ARCHITECTURE II (http://www.cs.ualberta.ca/~amaral/courses/329/). University of Alberta, Edmonton, CA, 2003.
  • Eysselt, M.: Digital Systems Design: Basic Set of Problems 1 (http://www.fit.vutbr.cz/research/view_pub.php.en?id=7130) (SSI Circuits Networks). Student-Text of the FIT, Brno UT, 2003 (WWW version (http://www.fit.vutbr.cz/~eysselt/inc/inc-1se1.htm)).
  • Eysselt, M.: Digital Systems Design: Basic Set of Problems 2 (http://www.fit.vutbr.cz/research/view_pub.php?id=7140) (MSI Circuits Networks). Student-Text of the FIT, Brno UT, 2003 (WWW version (http://www.fit.vutbr.cz/~eysselt/inc/inc-2se1.htm)).
  • Eysselt, M.: Digital Systems Design: Binary Logic Elements (http://www.fit.vutbr.cz/research/view_pub.php.en?id=7132) (Grafic Symbols for Diagrams). Student-Text of the FIT, Brno UT, 2003 (WWW version (http://www.fit.vutbr.cz/~eysselt/inc/inc-bsy1.htm)).
  • Eysselt, M.: Digital Systems Design: Laboratory (http://www.fit.vutbr.cz/research/view_pub.php.en?id=7131) (TTL Family Circuits and Functional Diagrams). Student-Text of the FIT, Brno UT, 2003 (WWW version (http://www.fit.vutbr.cz/~eysselt/inc/inc-lab1.htm)).
  • Eysselt, M.: Digital Systems Design: Slides 2003 (http://www.fit.vutbr.cz/research/view_pub.php.en?id=7133) (Set of Basic Slides). Student-Text of the FIT, Brno UT, 2003.
  • Eysselt, M.: Digital Systems Design: Programmable Logic Devices (http://www.fit.vutbr.cz/research/view_pub.php.en?id=7088) (Foundations & Examples). Student-Text of the FIT Brno UT, FIT Brno UT, 2003 (WWW version (http://www.fit.vutbr.cz/~eysselt/inc/inc-pld1.htm)).
  • McCluskey, E.J.: LOGIC DESIGN PRICIPLES. Prentice-Hall, USA, ISBN 0-13-539768-5, 1986.
  • Cheung, J.Y., Bredeson, J.G.: MODERN DIGITAL SYSTEMS DESIGN. West Publishing Company, USA, ISBN 0-314-47828-0, 1990.
  • Bolton, M.: Digital Systems Design with Programmable Logic. Addison-Wesley Publishing Company, Cornwall, GB, ISBN 0-201-14545-6, 1990.
  • Katz, R.H.: Contemporary Logic Design. Addison-Wesley/Benjamin-Cummings Publishing CO, Redwood City, CA, USA, ISBN 0-8053-2703-7, 1993.
  • Sasao, T.: SWITCHING THEORY FOR LOGIC SYNTHESIS. Kluwer Academic Publishers, Boston, USA, ISBN 0-7923-8456-3, 1999.

Fundamental literature

  • McCluskey, E.J.: LOGIC DESIGN PRICIPLES. Prentice-Hall, USA, ISBN 0-13-539768-5, 1986.
  • Cheung, J.Y., Bredeson, J.G.: MODERN DIGITAL SYSTEMS DESIGN. West Publishing Company, USA, ISBN 0-314-47828-0, 1990.
  • Bolton, M.: Digital Systems Design with Programmable Logic. Addison-Wesley Publishing Company, Cornwall, GB, ISBN 0-201-14545-6, 1990.
  • Sasao, T.: SWITCHING THEORY FOR LOGIC SYNTHESIS. Kluwer Academic Publishers, Boston, USA, ISBN 0-7923-8456-3, 1999.

Syllabus of lectures

  • Binary digit system: positional notation, conversion of base, binary codes, binary arithmetic.
  • Boolean algebra, logic functions and their representations, logic expressions.
  • Reduction methods: Qiune-McCluskey tabular method, Petrick's cover function.
  • Reduction methods: Karnaugh maps, logic and functional diagrams.
  • Analysis of logic networks behaviour: signal races, hazards.
  • Selected logic modules: adder, subtractor, multiplexer, demultiplexer, decoder, coder, comparator, arithmetic and logic unit.
  • Sequential logic networks, latches and flip-flops.
  • State machines and their representations. Design of synchronized sequential networks: state assigment, optimization and implementation. Register, counter, shift register, impulse divider.
  • Integrated circuits families: SSI, MSI, LSI. Programmable logic devices: gate arrays, PROM, PLA, PAL.
  • Simple asynchronous networks: design, analysis of behaviour, hazards.

Syllabus of numerical exercises

  • Binary digit system: positional notation, conversion of base, binary codes, binary arithmetic.
  • Boolean algebra, logic functions and their representations, a behaviour analysis of contact-switch networks.
  • Logic expressions. Qiune-McCluskey tabular reduction method, Petrick's cover function.
  • Reduction methods: Karnaugh maps, logic and functional diagrams.
  • Logic functions implementation using SSI i.cs. Behaviour analysis of logic networks: signal races, hazards.
  • Selected logic modules: adders, subtractor.
  • State machines and their representations. Design of synchronized sequential networks.
  • Design of logic networks based on MSI and LSI i.cs. Programmable logic devices: gate arrays, PROM, PLA, PAL.

Progress assessment

  • Stop and Check Test: 20 points.
  • Mid-Semester Exam: 20 points.
  • Final Exam: 60 points.
    Passing bounary for ECTS assessment: 50 points.


Exam prerequisites:
Requirements for class accreditation are not defined.

Controlled instruction

Test, mid-term exam and final exam are the monitored, and points earning, education. Test and mid-term exam are without correction eventuality. Final exam has two additional correction eventualities.

Exam prerequisites

Requirements for class accreditation are not defined.

Back to top