Digital Systems Design

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

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. Mastering of design of digital circuits consisting of combinational and sequential logic devices.

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.

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.

• 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. University of South Florida, WWW vydání.
• Bout, D.V.: Pragmatic Logic Design With Xilinx Foundation 2.1i. XESS Corporation, WWW vydání.
• Bolton, M.: Digital Systems Design with Programmable Logic. Addison-Wesley Publishing Company, Cornwall, GB, ISBN 0-201-14545-6, 1990.
• 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. 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.: 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.

• Mano, M. M. R, Ciletti, D.: Digital Design (4th Edition), Prentice-Hall, ISBN:0131989243, 2006.

• 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.
• Design of simple digital equipment: 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.

• 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.

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Requirements for class accreditation are not defined.

Mid-term exam (incl. test if it is declared), laboratory practice supported by homework (or project work) and final exam are the monitored, and points earning, education.
Mid-term exam and laboratory practice (supported by the homework) are without correction eventuality. Points for homework may be obtained at the last laboratory class after successful modelling of all laboratory statements. Final exam has two additional correction eventualities.