Complex Digital Systems¶

Course Overview¶

• Institution: MIT
• Course code: 6.884
• Track: Digital VLSI and Chip Design
• Tier: B
• Role: Supplement
• Level: Not standardized by provider (use prerequisites)
• Last reviewed: 2026-07-28

MIT's Complex Digital Systems supplements complex digital and VLSI system design through notes, labs, and code, while commercial EDA dependencies and obsolete standard-cell assumptions impede reproduction.

Why choose this course

Supplement course. Useful for specific topics and best paired with a more complete mainline resource.

Before you start

• Recommended foundation: Microelectronics
• Recommended foundation: Digital Logic and Computation Structures

Verifiable learning outcomes

• Explain the core models in Digital VLSI and Chip Design, including their assumptions and limits
• Solve representative derivations and problems, checking units, limiting cases, or numerical results
• Complete a reproducible experiment or implementation with raw data, parameters, versions, and verification

Workload and pacing

7 weeks at 4 hours/week. This maintainer planning estimate is derived from course role and the density of public practice and labs; it is not a provider workload promise. Pilot two weeks while logging instruction, practice, lab, and review time, then adjust the remaining plan when actual effort differs by more than 25%.

Safety level

Simulation only. The default practice scope is software, computation, or simulation only; a lab label in the resource inventory does not authorize connecting physical equipment, and any hardware extension requires provider-scope verification and a new risk assessment.

Course Resources¶

Software, hardware, and cost

Software

• Maintainer-suggested open-source/free verification path: Yosys, OpenROAD, OpenSTA, Verilator, GTKWave, and KLayout
• The resource inventory lists public code coverage; pin interpreter, dependencies, toolchain, datasets, and PDK versions where applicable

Hardware

• The resource inventory lists lab coverage; the maintainer path treats it as computational/simulation work unless the provider lab manual explicitly says otherwise. It assumes only a computer with enough memory and storage for synthesis, place-and-route, and regressions; no tape-out is assumed. If the provider lists different equipment or compute requirements, follow its course page

Cost note

The suggested software stack is available open source or free; this is maintainer planning, not a provider requirement. If the provider specifies commercial licenses, cloud compute, storage, or institutional resources, costs vary by plan, region, and institution, so no fixed price is asserted here.

Public resource coverage

Resources and access

“Listed by official page” means the link was discovered on a successfully fetched official source on the verification date; it does not guarantee that every region or account can open the target directly. Access does not grant redistribution rights. Re-check the provider page, target link, and third-party notices before downloading, adapting, or publishing material.

Practice and Verification¶

Practice loop

Complex Digital Systems · MIT 6.884: RTL-to-Layout PPA and Equivalence Audit

This is a maintainer-suggested self-study project for Complex Digital Systems · MIT 6.884, not an official course assignment. Take a compact digital core through a lawfully available synthesis and place-and-route flow for Digital VLSI and Chip Design, auditing functional equivalence, timing, power proxies, and congestion.

Origin: Maintainer-suggested project

Deliverables

• RTL, interface, clock and reset specification, timing constraints, and PPA targets
• Reproducible synthesis, place-and-route, static-timing, and equivalence-check source files and scripts
• Netlists, constraints, raw area, timing, power-proxy, congestion, and DRC summaries
• A report comparing at least three constraint points and reviewing one timing or congestion failure

Verification

• Pass RTL-to-gate equivalence and functional regression with zero failures
• Cover slow and fast corners, minimum and maximum loads, and at least 2 clock targets
• Make a hand logic-depth estimate agree directionally with STA and explain the quantitative gap
• Tighten the clock until first negative slack, locate the path, and quantify the cost of the fix

Reproducibility

• Commit RTL, constraints, flow scripts, configurations, tests, and a README
• Pin the lawfully available PDK or cell-library version, EDA container or tools, and seeds
• Preserve raw logs, netlists, reports, failing-run configurations, and checksums

Safety boundary: Simulation only — Run only lawfully authorized digital EDA flows; do not submit for fabrication, handle restricted PDK data, or bypass licenses.

Risks, gaps, and boundaries

Commercial EDA dependencies and old standard-cell assumptions make the laboratories and projects difficult to reproduce.

Completion evidence

• Weekly learning log with time, questions, corrected errors, decisions, next steps, and links to that week's reproducible artifacts
• Design-review package with requirements and constraints, trade-offs, editable sources, applicable ERC/DRC/timing/stability checks, exports, and a reproduction test
• Code repository with pinned dependencies and toolchain, a minimal run command, tests or waveform/benchmark checks, expected output, and license notes
• Simulation package with model or netlist, inputs, solver and version, parameter-sweep script, benchmark comparison, expected results, and one rerun command