mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Embedded and IoT
battery-management
battery management system
EV BMS
System
Techniques · 6
Primitives · 29
battery-management
Battery state estimation
embedded · medium: State of charge / health / power from coulomb counting, OCV curves and model-based observers
Equivalent circuit battery model
embedded · medium: Thevenin RC-network battery models with OCV-SoC curves and parameter identification
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Safety-critical coding standards
embedded · medium: Which rule sets (MISRA C, CERT C, JPL Power of Ten, Rust lint subsets) apply when software must not fail, what they forbid, and how to enforce them in CI.
›
Dataflow analysis
compilers · medium: Compute a fact per program point (live variables, reaching definitions, available expressions) by iterating transfer functions over the CFG to a fixed point.
›
Levenberg marquardt
numerics · medium: Damped Gauss-Newton nonlinear least squares for model calibration
Extended Kalman filter
robotics · low: Kalman filter for nonlinear motion and measurement models: linearize f and h with Jacobians at the current estimate each step. The default estimator in robot navigation.
›
Can bus framing
embedded · low: CAN / CAN FD frames, bitwise arbitration, bit stuffing, CRC and error confinement
Cc cv charging
embedded · low: Constant-current then constant-voltage Li-ion charging with temperature derating and termination
Cell balancing
embedded · low: Passive bleed or active charge-transfer balancing of series battery cells
End to end protection e2e
embedded · low: Per-message counter, ID and CRC over a black channel to detect loss, repetition, corruption, delay
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
+ 13 more primitives
System
Techniques · 6
Primitives · 29
battery-management
Battery state estimation
embedded · medium: State of charge / health / power from coulomb counting, OCV curves and model-based observers
Equivalent circuit battery model
embedded · medium: Thevenin RC-network battery models with OCV-SoC curves and parameter identification
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Safety-critical coding standards
embedded · medium: Which rule sets (MISRA C, CERT C, JPL Power of Ten, Rust lint subsets) apply when software must not fail, what they forbid, and how to enforce them in CI.
›
Dataflow analysis
compilers · medium: Compute a fact per program point (live variables, reaching definitions, available expressions) by iterating transfer functions over the CFG to a fixed point.
›
Levenberg marquardt
numerics · medium: Damped Gauss-Newton nonlinear least squares for model calibration
Extended Kalman filter
robotics · low: Kalman filter for nonlinear motion and measurement models: linearize f and h with Jacobians at the current estimate each step. The default estimator in robot navigation.
›
Can bus framing
embedded · low: CAN / CAN FD frames, bitwise arbitration, bit stuffing, CRC and error confinement
Cc cv charging
embedded · low: Constant-current then constant-voltage Li-ion charging with temperature derating and termination
Cell balancing
embedded · low: Passive bleed or active charge-transfer balancing of series battery cells
End to end protection e2e
embedded · low: Per-message counter, ID and CRC over a black channel to detect loss, repetition, corruption, delay
Fixed-rate control loop
embedded · low: Run a controller at an exact period using absolute deadlines and a fixed dt, so jitter never accumulates and the math stays valid.
›
Redundancy voting
embedded · low: N-modular redundancy and MooN voting (2oo3, TMR) with discrepancy detection
Watchdog timer
embedded · low: A hardware down-counter that resets the chip unless software proves, in time and in a plausible pattern, that it is still healthy.
›
Deterministic fixed-point math
game-networking · low: Bit-identical simulation math across CPUs, compilers and builds: integer fixed-point formats, the float traps (FMA, x87, fast-math, libm), deterministic trig, sqrt and RNG.
›
PID controller
robotics · low: Drive a measured value to a setpoint with three terms on the error: proportional, integral, derivative. The default feedback loop for motors, heaters, drones and gimbals.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Code coverage instrumentation
compilers · low: Insert counters into compiled code to record which blocks, edges or lines ran; a spanning tree of the control-flow graph cuts the counters needed.
›
Control-flow graph
compilers · low: Split a linear instruction list into basic blocks and connect them by jumps; the graph every optimizer, SSA builder and dataflow pass walks.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Finite differences
numerics · low: Replace derivatives with weighted differences of grid values; simple stencils plus a stability condition (CFL) turn PDEs like heat, advection and waves into array loops.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Dma transfers
embedded · low: DMA controllers: descriptors, circular buffers, cache coherence for zero-CPU data movement
PWM generation
embedded · low: A timer's counter, period and compare registers draw the pulse train; preload, dead time and DMA make duty changes glitch-free, shoot-through-free and cheap.
›
Minimum spanning tree
graphs · low: Cheapest set of edges connecting all vertices; Kruskal sorts edges and joins components with union-find, Prim grows one tree, Boruvka merges in parallel rounds.
›
Union-find
graphs · low: Disjoint-set forest with union by size and path compression; merges sets and answers same-set queries in effectively constant time.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
reactor-protection
33 %
safety-instrumented-system
25 %
rail-signalling
24 %
medical-device-firmware
21 %
infusion-pump
20 %