Course details

Digital Systems Design

INC Acad. year 2022/2023 Summer semester 5 credits

Current academic year

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

Guarantor

Fučík Otto, doc. Dr. Ing. (DCSY)

Course coordinator

Kořenek Jan, doc. Ing., Ph.D. (DCSY)

Language of instruction

Czech, English

Completion

Credit+Examination (written)

Time span

  • 39 hrs lectures
  • 10 hrs exercises
  • 3 hrs projects

Assessment points

  • 55 pts final exam (written part)
  • 25 pts mid-term test (written part)
  • 20 pts projects

Department

Department of Computer Systems (UPSY)

Lecturer

Fučík Otto, doc. Dr. Ing. (DCSY)
Kořenek Jan, doc. Ing., Ph.D. (DCSY)
Martínek Tomáš, doc. Ing., Ph.D. (DCSY)
Matoušek Jiří, Ing., Ph.D. (DCSY)

Instructor

Kekely Lukáš, Ing., Ph.D. (DCSY)
Kekely Michal, Ing.
Kořenek Jan, doc. Ing., Ph.D. (DCSY)
Matoušek Jiří, Ing., Ph.D. (DCSY)
Pánek Richard, Ing. (DCSY)

Subject specific learning outcomes and competences

Fundamental knowledge of selected methods for description, analysis and design of combinatorial and sequential logic in digital systems. 

Learning objectives

The goal is to obtain fundamental knowledge of methods for description, analysis, and design of combinatorial and sequential logic networks in digital systems.

Why is the course taught

Digital systems are the basis for computer architecture design. This course teaches the basic concepts of digital design as well as tools for the design of digital circuits and provides procedures suitable for a variety of digital systems.

Recommended prerequisites

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

  • Eysselt, M.: Logické systémy. Studijní opora, Učební text VUT Brno, vydáno 1980, 1985, 1990. Rozebráno: Lze si zapůjčovat v knihovnách v Brně, i na FIT.
  • Frištacký, N., Kolesár, M., Kolenička, J., Hlavatý, J.: Logické systémy. SNTL Praha, ALFA Bratislava, 1986.
  • Maurer, P.M.: Logic Design (http://www.csee.usf.edu/~maurer/logic/). University of South Florida, WWW vydání.
  • Bolton, M.: Digital Systems Design with Programmable Logic. Addison-Wesley Publishing Company, Cornwall, GB, ISBN 0-201-14545-6, 1990.
  • Bout, D.V.: Pragmatic Logic Design With Xilinx Foundation 2.1i (http://www.xess.com/pragmatic-2_1.html). XESS Corporation, WWW vydání.
  • 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.
  • 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.
  • Sasao, T.: SWITCHING THEORY FOR LOGIC SYNTHESIS. Kluwer Academic Publishers, Boston, USA, ISBN 0-7923-8456-3, 1999.
  • Eysselt, M.: Vybrané příklady podporující návrh číslicových systémů. Studijní opora, Učební text, FIT, 2002, 38 str. Tento text zapůjčuje autor ke kopírování. Zde je WWW verze přístupná evidovaným studentům.
  • Eysselt, M.: Logická a funkční schémata, výňatek z oborové normy ONT345553. Studijní opora, Učební text, FIT, 2002, 30 str. Tento text zapůjčuje autor ke kopírování. Zde je WWW verze přístupná evidovaným studentům.
  • Eysselt, M.: Digital Systems Design: Programmable Logic Devices (http://www.fit.vutbr.cz/research/view_pub.php?id=7088). Studijní opora, Učební text, FIT VUT v Brně, 2003. Zde je WWW verze (http://www.fit.vutbr.cz/~eysselt/inc/inc-pld1.htm) přístupná evidovaným studentům.
  • Eysselt. M.: Funkční značky integrovaných obvodů, kreslení spojů. Studijní opora, Učební text, FIT, 2002, 12 str. Tento učební text zapůjčuje autor ke kopírování. Zde je WWW verze přístupná evidovaným studentům.
  • Eysselt, M.: Digital Systems Design: Programmable Logic Devices. Studijní opora, Učební text, FIT VUT v Brně, 2003. Zde je WWW verze přístupná evidovaným studentům.
  • Harris, D., Harris, S.: Digital Design and Computer Architecture 2nd Edition, Morgan Kaufmann, eBook ISBN: 9780123978165, paperback ISBN: 9780123944245, 2012.
  • Wakerly, J. F.: Digital Design: Principles and Practices (4th Edition, Book only) 4th Edition, PEARSON, ISBN: 9788131713662, 8131713660, Edition: 4th Edition, 2008.
  • Wakerly, J. F.: Digital Design: Principles and Practices (4th Edition, Book only) 4th Edition, PEARSON, ISBN: 9788131713662, 8131713660, Edition: 4th Edition, 2008.
  • Mano, M. M. R, Ciletti, D.: Digital Design (4th Edition), Prentice-Hall, ISBN:0131989243, 2006.

Fundamental literature

  • Harris, D., Harris, S.: Digital Design and Computer Architecture 2nd Edition, Morgan Kaufmann, eBook ISBN: 9780123978165, paperback ISBN: 9780123944245, 2012.
  • Wakerly, J. F.: Digital Design: Principles and Practices (4th Edition, Book only) 4th Edition, PEARSON, ISBN: 9788131713662, 8131713660, Edition: 4th Edition, 2008.
  • Mano, M. M. R, Ciletti, D.: Digital Design (4th Edition), Prentice-Hall, ISBN:0131989243, 2006.

Syllabus of lectures

  1. Binary number system: binary codes, binary arithmetic.
  2. Boolean algebra, logic functions and their representations, logic expressions.
  3. Reduction methods: Karnaugh maps, Quine-McCluskey tabular method, Petrick's cover function.
  4. Logic and functional diagrams. Analysis of logic networks behaviour: signal races, hazards.
  5. Combinational logic: multiplexer, demultiplexer, decoder, coder.
  6. Combinational logic: comparator, adder, subtractor, arithmetic and logic unit.
  7. State machines and their representations. Latches and flip-flops.
  8. Synchronized sequential networks: state coding, optimization and implementation.
  9. Sequential logic: Registers, counters, shift registers, frequency dividers.
  10. VHDL language, logic circuits synthesis.
  11. Design of simple digital circuits: CAD tools, design methodology.
  12. Programmable logic devices.
  13. Integrated circuits families.

Syllabus of numerical exercises

  1. Binary number system: positional notation, conversion of the base, binary codes, binary arithmetic.
  2. Boolean algebra, logic functions and their representations, a behaviour analysis of contact-switch networks.
  3. Logic expressions. Quine-McCluskey tabular reduction method, Petrick's cover function.
  4. Reduction methods: Karnaugh maps, logic and functional diagrams.
  5. Logic functions implementation using logic components.
  6. Selected logic modules: multiplexer, demultiplexer, encoder, decoder, adder, ALU.
  7. State machines and their representations. Design of synchronized sequential networks.
  8. Design of logic networks using programmable logic devices.

Syllabus - others, projects and individual work of students

  1. Three-hour project.

Progress assessment

Standard students in Czech Programme:

  • Mid-term exam: 25 points.
  • Homework and its evaluation in PC laboratory: 20 points.
  • Final exam: 55 points.

The passing boundary for ECTS assessment: 50 points

International students:

  • Test: 20 points.
  • Mid-term exam: 20 points.
  • Final exam: 60 points.

The passing boundary for ECTS assessment: 50 points.

Controlled instruction

The knowledge of students is examined by the mid-exam (25 points), the project (20 points), and by the final exam.

The minimal number of points, which can be obtained from the final exam, is 25 (of 55 points). Otherwise, no points will be assigned to a student.

Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

Exam prerequisites

For receiving the credit and thus for entering the exam, students have to obtain at least five points from the project. Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action may be initiated.

Course inclusion in study plans

  • Programme BIT, 1st year of study, Compulsory
  • Programme BIT (in English), 1st year of study, Compulsory
  • Programme IT-BC-3, field BIT, 1st year of study, Compulsory
Back to top