Design Logic Circuit
Skill Verified ActiveDesign combinational logic circuits from a functional specification through gate-level implementation. Covers AND, OR, NOT, XOR, NAND, NOR gates; NAND/NOR universality conversions; and standard building blocks including multiplexers, decoders, half/full adders, and ripple-carry adders. Use when translating a Boolean function or truth table into a hardware-realizable gate network and verifying it by exhaustive simulation.
To enable users to translate functional specifications into hardware-realizable gate networks and verify their correctness through exhaustive simulation.
Features
- Design combinational logic circuits
- Implement AND, OR, NOT, XOR, NAND, NOR gates
- Perform NAND/NOR universality conversions
- Build standard blocks like adders and multiplexers
- Verify circuits via exhaustive simulation
Use Cases
- Translating Boolean functions or truth tables into gate networks
- Designing standard combinational building blocks
- Converting circuits to NAND-only or NOR-only forms
- Teaching or reviewing digital logic design principles
Non-Goals
- Designing sequential logic circuits
- Simulating full CPU architectures
- Handling complex timing analysis beyond gate-level depth
Workflow
- Specify Circuit Function
- Derive Minimal Boolean Expression
- Map to Gate-Level Schematic
- Convert to Universal Gate Basis (Optional)
- Verify via Exhaustive Simulation
Practices
- Digital Logic Design
- Circuit Synthesis
- Hardware Verification
Installation
/plugin install agent-almanac@pjt222-agent-almanacQuality Score
VerifiedTrust Signals
Similar Extensions
Simulate Cpu Architecture
100Design and simulate a minimal CPU from scratch: define an instruction set architecture (ISA), build the datapath (ALU, register file, program counter, memory interface), design the control unit (hardwired or microprogrammed), implement the fetch-decode-execute cycle, and verify by tracing a small program clock cycle by clock cycle. The capstone "computer inside a computer" exercise that composes combinational and sequential building blocks into a complete processor.
Evaluate Boolean Expression
100Evaluate and simplify Boolean expressions using truth tables, algebraic laws (De Morgan, distributive, absorption, idempotent, consensus), and Karnaugh maps for up to six variables. Use when you need to reduce a Boolean expression to its minimal sum-of-products or product-of-sums form, verify logical equivalence between two expressions, or prepare a minimized function for gate-level implementation.
Qiskit
99IBM quantum computing framework. Use when targeting IBM Quantum hardware, working with Qiskit Runtime for production workloads, or needing IBM optimization tools. Best for IBM hardware execution, quantum error mitigation, and enterprise quantum computing. For Google hardware use cirq; for gradient-based quantum ML use pennylane; for open quantum system simulations use qutip.
Qutip
99Quantum physics simulation library for open quantum systems. Use when studying master equations, Lindblad dynamics, decoherence, quantum optics, or cavity QED. Best for physics research, open system dynamics, and educational simulations. NOT for circuit-based quantum computing—use qiskit, cirq, or pennylane for quantum algorithms and hardware execution.
Molecular Dynamics
99Run and analyze molecular dynamics simulations with OpenMM and MDAnalysis. Set up protein/small molecule systems, define force fields, run energy minimization and production MD, analyze trajectories (RMSD, RMSF, contact maps, free energy surfaces). For structural biology, drug binding, and biophysics.
COBRApy Metabolic Modeling
99Constraint-based metabolic modeling (COBRA). FBA, FVA, gene knockouts, flux sampling, SBML models, for systems biology and metabolic engineering analysis.