Syllabus for |
|
| EDA320 - Switching circuit theory and logic design |
| |
| Owner: TDATA |
|
|
4,0 Credits (ECTS 6) |
| Grading: TH - Five, Four, Three, Not passed |
| Level: A |
|
Department: 0735 - Computer engineering
|
Teaching language: Swedish
| Course module |
|
Credit distribution |
|
Examination dates |
|
Sp1 |
Sp2 |
Sp3 |
Sp4 |
|
No Sp |
| 0196 |
Examination |
3,0 c |
Grading: TH |
|
|
|
3,0 c
|
|
|
|
|
09 Mar 2004 pm M, |
14 Apr 2004 pm M, |
24 Aug 2004 am V |
| 0296 |
Laboratory |
1,0 c |
Grading: UG |
|
|
|
1,0 c
|
|
|
|
|
|
In programs
TITEA INFORMATION ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 2 (compulsory)
TTFYA ENGINEERING PHYSICS, Year 4 (elective)
TELTA ELECTRICAL ENGINEERING, Year 4 (elective)
Examiner:
Eligibility:
For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.
Course specific prerequisites
Fundamentals of digital systems and computer engineering (EDA450 or similar).
A basic course in Discrete Mathematics.
Aim
To give knowledge in digital design methodologies and to learn basic methods for optimization, verification, synthesis and testing of combinational and sequential logic circuits.
Content
Combinational networks:
- Boolean algebra, axiomatic presentation and fundamental theorems.
- Boolean forms and functions. Switching functions.
- Karnaugh map representation and simplification of Boolean functions.
- Algorithms for optimization of single and multiple output combinational logic. Methods by Quine-McCluskey, Petrick, Tison and Reusch.
- Realizations of combinational logic. Static and dynamic hazards. Multilevel logic, iterative networks. Logic design with decoders, multiplexers and programmable logic devices.
Sequential networks:
- Synchronous networks. Fundamental concepts, formal definition, Mealy and Moore networks.
- State assignment methods. Algorithms for state minimization of completely and incompletely specified networks.
- Design of iterative combinational networks using sequential network techniques.
- Asynchronous networks. Fundamental concepts. Cycles and races. Race-free state assignments. Essential hazards. State minimization.
Organisation
Lectures, exercises and labs.
Literature
E. Johnson: Switchnätteori med tillämpningar, Inst. för datorteknik, CTH.
Digitalteknik exempelsamling, CTH.
Examination
Written exam; passed laborations and home assignment