mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Telecom
gnss-receiver
GNSS receiver
GPS chips
System
Techniques · 7
Primitives · 27
gnss-receiver
Orbit propagation
numerics · medium: Propagate satellite orbits (Kepler, SGP4, numerical with perturbations) and frame transforms
Gnss signal acquisition
signal-processing · medium: FFT-based parallel code-phase and Doppler search to detect satellite signals
Gnss tracking loops
signal-processing · medium: DLL/FLL/PLL loops with early-prompt-late correlators tracking code and carrier
Pseudorange least squares positioni…
signal-processing · medium: Iterative least-squares position and clock bias from pseudoranges with atmospheric corrections
Rtk ambiguity resolution
signal-processing · medium: RTK carrier-phase differencing and integer ambiguity resolution (LAMBDA) for cm positioning
Spherical harmonic transform
numerics · medium: Fast spherical harmonic transforms via FFT in longitude and Legendre in latitude
Fft convolution
signal-processing · medium: Overlap-add and uniformly partitioned convolution for long FIR filters and reverb
Fast Fourier transform
numerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.
›
Digital down conversion
signal-processing · low: NCO mixing to baseband, CIC/FIR decimation and IQ handling for SDR receivers
Phase-locked loop (digital)
signal-processing · low: Feedback loop that locks a local oscillator to the phase and frequency of an input tone; the core of carrier recovery, clock recovery and GNSS tracking.
›
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.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
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.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
Convolutional codes and the Viterbi…
signal-processing · low: Streaming error-correcting code: each output bit is a parity of the last K input bits; the Viterbi decoder finds the most likely path through a 2^(K-1)-state trellis.
›
Adaptive Runge-Kutta (Dormand-Princ…
numerics · low: An embedded 5(4) Runge-Kutta pair estimates each step's error for free and resizes the step to meet a tolerance; the default non-stiff solver.
›
Rigid-body transforms (SE(3) poses)
robotics · low: Represent, compose, invert, integrate and interpolate 3D poses as unit quaternion plus translation, with exp/log maps for small motions and uncertainty.
›
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Peak detection
signal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periods
IIR and FIR filters
signal-processing · low: Two ways to shape a sampled signal's spectrum: FIR (finite taps, always stable, exact linear phase) or IIR (feedback, a few coefficients, cheap but phase-distorting).
›
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²).
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
Robust statistics
statistics · low: Location and scale estimates (median, MAD, trimmed mean, Huber M-estimator) that stay correct when a minority of the data is garbage.
›
+ 11 more primitives
System
Techniques · 7
Primitives · 27
gnss-receiver
Orbit propagation
numerics · medium: Propagate satellite orbits (Kepler, SGP4, numerical with perturbations) and frame transforms
Gnss signal acquisition
signal-processing · medium: FFT-based parallel code-phase and Doppler search to detect satellite signals
Gnss tracking loops
signal-processing · medium: DLL/FLL/PLL loops with early-prompt-late correlators tracking code and carrier
Pseudorange least squares positioni…
signal-processing · medium: Iterative least-squares position and clock bias from pseudoranges with atmospheric corrections
Rtk ambiguity resolution
signal-processing · medium: RTK carrier-phase differencing and integer ambiguity resolution (LAMBDA) for cm positioning
Spherical harmonic transform
numerics · medium: Fast spherical harmonic transforms via FFT in longitude and Legendre in latitude
Fft convolution
signal-processing · medium: Overlap-add and uniformly partitioned convolution for long FIR filters and reverb
Fast Fourier transform
numerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.
›
Digital down conversion
signal-processing · low: NCO mixing to baseband, CIC/FIR decimation and IQ handling for SDR receivers
Phase-locked loop (digital)
signal-processing · low: Feedback loop that locks a local oscillator to the phase and frequency of an input tone; the core of carrier recovery, clock recovery and GNSS tracking.
›
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.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
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.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
Convolutional codes and the Viterbi…
signal-processing · low: Streaming error-correcting code: each output bit is a parity of the last K input bits; the Viterbi decoder finds the most likely path through a 2^(K-1)-state trellis.
›
Adaptive Runge-Kutta (Dormand-Princ…
numerics · low: An embedded 5(4) Runge-Kutta pair estimates each step's error for free and resizes the step to meet a tolerance; the default non-stiff solver.
›
Rigid-body transforms (SE(3) poses)
robotics · low: Represent, compose, invert, integrate and interpolate 3D poses as unit quaternion plus translation, with exp/log maps for small motions and uncertainty.
›
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Peak detection
signal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periods
IIR and FIR filters
signal-processing · low: Two ways to shape a sampled signal's spectrum: FIR (finite taps, always stable, exact linear phase) or IIR (feedback, a few coefficients, cheap but phase-distorting).
›
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²).
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
Robust statistics
statistics · low: Location and scale estimates (median, MAD, trimmed mean, Huber M-estimator) that stay correct when a minority of the data is garbage.
›
Gaussian quadrature
numerics · low: Approximate an integral by a weighted sum of n function values at roots of orthogonal polynomials; exact for polynomials up to degree 2n-1.
›
Spherical grids
numerics · low: Lat-lon, cubed-sphere and icosahedral grids for global models; pole and area issues
Homogeneous transforms
geometry · low: 4x4 affine and projective matrices, homogeneous coordinates, view and projection, normal matrices
Quaternion rotations
geometry · low: Unit quaternions as 3D rotations: 4 floats, cheap composition, no gimbal lock, plus the conversions, interpolation choices and numerical care needed in practice.
›
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.
›
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.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Runge-Kutta 4
numerics · low: The classic four-stage, fourth-order ODE step; error drops 16× when the step halves, with no derivatives or past steps needed.
›
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.
›
Biquad filters
signal-processing · low: Second-order IIR sections (RBJ cookbook): low/high pass, peaking EQ; stable cascades
Copy for AI
Similar systems
Share the most building blocks with this one.
ground-station
20 %
baseband-modem
18 %