Constraint redundancy in baseline-noise minimization

ID: constraint-redundancy-in-baseline-noise-minimization

Constraint redundancy in baseline-noise minimization occurs when some signal-preservation or baseline-rejection conditions are linear combinations of others. In minimum-noise weights under baseline moment constraints, the estimator weights satisfy . A necessary and sufficient feasibility condition is
Indeed, multiplying the constraints by gives necessity. Sufficiency follows because the range of is the orthogonal complement of the kernel of . Redundant conditions are harmless only when their required responses obey the same dependencies.
For an original three-sample example, let the pulse template be and the constant baseline . The columns contain a duplicated baseline condition. The required response is feasible and gives the same minimum-noise weights as the two independent columns alone. With independent sample variance , its variance remains ; writing the constant condition twice adds no information.
By contrast, requiring responses would demand both and . The dependency has , exposing the inconsistency.
With positive-definite error covariance and feasible constraints, put . A redundant-column version of the optimum is
where is the Moore-Penrose inverse. Feasibility ensures . Without the null-space feasibility test for baseline-estimator constraints, this formula can silently return approximate responses instead of the requested exact cancellations. Variance still uses the full covariance quadratic form.[ref]
NIST's before/after pulse baselines motivate such cancellation constraints experimentally.[ref] A singular value decomposition can diagnose numerical dependence, but a small singular value caused by time units or poor scaling is not automatically permission to discard a physical drift-rejection requirement.

New to topics? Read the docs here!