Sparse signals have most coefficients near zero, but which coefficients are active changes over time. Adaptive filters must track this changing support — identifying which coefficients are currently significant and estimating their values. The fundamental difficulty: a small active coefficient and a zero inactive coefficient produce similar observations. Distinguishing them requires tracking estimation error over time.
The dual-domain approach maintains two representations simultaneously: the signal domain (where coefficients have physical meaning) and a transform domain (where sparsity may have different structure). Each domain provides information the other lacks. A coefficient that looks ambiguous in one domain may be clearly active or inactive in the other.
The key innovation is error-memory tracking. Rather than deciding at each time step whether a coefficient is active, the filter accumulates evidence across time steps. A coefficient with persistently small updates is probably inactive; one with occasional large updates is probably active but intermittent. The error memory provides the temporal context that instantaneous observations cannot.
The dual-domain structure enables a clean separation: the signal domain handles estimation (what are the coefficient values?), while the transform domain handles detection (which coefficients are active?). Neither task interferes with the other because they operate on different representations of the same signal.
The algorithm converges faster than single-domain methods because the dual representation breaks symmetries that trap single-domain filters. A coefficient pair that is indistinguishable in one domain may be separated in the other, preventing the filter from oscillating between two equally plausible explanations.