NSAF-NKP-II: Type-II NKP-Based Adaptive Filtering

• The paper introduces NSAF-NKP-II, an adaptive filtering algorithm that uses nearest Kronecker product decomposition to reduce computational overhead and enhance performance.
• NSAF-NKP-II employs a critically sampled subband model, enabling robust handling of correlated inputs, impulsive noise, and nonlinear system responses.
• It offers significant improvements in convergence, stability, and efficiency compared to conventional NSAF and earlier NKP-based variants.

The type-II nearest Kronecker product-based normalized subband adaptive filter (NSAF-NKP-II) algorithm is an advanced adaptive filtering scheme that achieves rapid convergence and substantial computational efficiency by integrating the principles of nearest Kronecker product (NKP) decomposition into the normalized subband adaptive filter (NSAF) framework. NSAF-NKP-II facilitates robust identification and signal processing in scenarios with highly correlated inputs, impulsive noise, and nonlinear system responses, including sparse system identification, echo cancellation, and active noise control. Its design offers a marked reduction in computational overhead compared to both conventional NSAF and the earlier NSAF-NKP-I variant, while providing explicit stability and steady-state performance guarantees (Ye et al., 15 Jan 2026).

1. Subband Signal and Filter Model

The NSAF-NKP-II algorithm operates by transforming the adaptive filtering task into critically sampled subband domains. At time $r$, the system models the relationship between the input vector $x_r \in ℝ^D$, the unknown system $m₀ \in ℝ^D$, and additive noise $v_r$ via:

$d_r = x_r^T m₀ + v_r$

where $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$. The analysis filter bank decomposes the input into $N$ subbands using filter matrix $F = [f_1, ..., f_N] \in ℝ^{L \times N}$, yielding subband inputs and desired signals at decimated time $r$:

$$x_{r,j} = f_j^T [x_r, ..., x_{r-L+1}]^T \ d_{r,j} = f_j^T [d_r, ..., d_{r-L+1}]^T$$

Aggregated subband signals are given by $x_r \in ℝ^D$0 and $x_r \in ℝ^D$1.

2. Nearest Kronecker Product Decomposition Principle

NKP decomposition approximates the unknown filter $x_r \in ℝ^D$2 as a sum of Kronecker products when $x_r \in ℝ^D$3:

$x_r \in ℝ^D$4

with $x_r \in ℝ^D$5 and $x_r \in ℝ^D$6. Equivalently, $x_r \in ℝ^D$7 for suitable $x_r \in ℝ^D$8 and $x_r \in ℝ^D$9. The best rank-$m₀ \in ℝ^D$0 approximation uses the leading $m₀ \in ℝ^D$1 singular vector pairs from the matricization $m₀ \in ℝ^D$2 of $m₀ \in ℝ^D$3. This structure forms the mathematical foundation for efficient adaptive filtering.

3. NSAF-NKP-II Algorithmic Derivation

The NSAF-NKP-II algorithm parameterizes the adaptive filter at iteration $m₀ \in ℝ^D$4 as:

$m₀ \in ℝ^D$5

This representation enables efficient arithmetic based on Kronecker identities, facilitating flexible filter updates. Subband error signals are computed as:

$m₀ \in ℝ^D$6

which can be reformulated using projections into NKP parameter subspaces:

$m₀ \in ℝ^D$7

The normalized subband cost functions are:

$m₀ \in ℝ^D$8

Gradient updates for step sizes $m₀ \in ℝ^D$9, $v_r$0 follow:

$v_r$1

After every $v_r$2 subband updates, the fullband estimate is synthesized:

$v_r$3

4. Computational Complexity and Comparisons

The NSAF-NKP-II algorithm is engineered for computational efficiency. For $v_r$4, decimation interval $v_r$5, filter length $v_r$6, number of subbands $v_r$7, and Kronecker rank $v_r$8:

Algorithm	Multiplications per $v_r$9 samples	Big-O Complexity
NSAF	$d_r = x_r^T m₀ + v_r$0	$d_r = x_r^T m₀ + v_r$1
NSAF-NKP-I	$d_r = x_r^T m₀ + v_r$2 (see full formula)	$d_r = x_r^T m₀ + v_r$3
NSAF-NKP-II	$d_r = x_r^T m₀ + v_r$4	$d_r = x_r^T m₀ + v_r$5

A plausible implication is that NSAF-NKP-II, for $d_r = x_r^T m₀ + v_r$6, $d_r = x_r^T m₀ + v_r$7, realizes a 50–90% reduction in multiplications relative to NSAF-NKP-I, primarily by eliminating $d_r = x_r^T m₀ + v_r$8 terms.

5. Stability and Steady-State Analysis

Under independence and small-step assumptions, stability is dictated by:

$d_r = x_r^T m₀ + v_r$9

For the symmetric choice $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$0, this reduces to $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$1, a stricter bound than the typical $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$2 for NSAF, though practical choices $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$3 remain feasible.

Theoretical steady-state excess mean-square error (EMSE) is given, with subband excess error $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$4 and input orthogonality/noise variance $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$5:

$x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$6

Special case $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$7 yields:

$x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$8

6. Robust and Nonlinear NSAF-NKP-II Extensions

To address impulsive noise environments, robust variants are constructed:

• RNSAF-NKP-MCC: based on the maximum correntropy criterion, achieving stable convergence under $x_r = [x_r, x_{r-1}, ..., x_{r-D+1}]^T$9-stable noise.
• RNSAF-NKP-LC: leveraging a logarithmic criterion for similar robustness.

Nonlinear extensions further generalize NSAF-NKP-II:

• TFLN-NKP-NSAF: incorporates trigonometric functional link networks for handling asymmetric nonlinear distortions.
• Volterra-NKP-NSAF: utilizes Volterra series expansion for higher-order nonlinear modeling.

In ANC scenarios, the filtered-x NSAF-NKP-II (NKP-FxNSAF) algorithm extends the framework for real-time adaptive noise cancellation.

7. Empirical Performance and Application Domains

Simulation experiments demonstrate NSAF-NKP-II's efficacy:

• Sparse system identification: Matches NSAF-NKP-I convergence (30% computational cost), surpassing NLMS, NSAF, NLMS-NKP, and RLS-NKP under highly correlated inputs.
• Acoustic echo cancellation: Delivers faster ERLE rise than alternatives, with comparable performance to NKP-APA but 2–3× fewer multiplications.
• Impulsive noise robustness: Standard NSAF-NKP-II diverges for heavy impulsive noise, but RNSAF-NKP-MCC and RNSAF-NKP-LC combat this effectively.
• Nonlinear filtering: TFLN-NKP-NSAF and Volterra-NKP-NSAF outperform fullband and other subband methods in convergence rate and MSE.
• Active noise control: NKP-FxNSAF achieves faster ANR growth than competing ANC algorithms with half the complexity of comparable methods.

In summary, type-II NSAF-NKP algorithms offer optimized convergence-speed and computational efficiency, consolidating adaptive Kronecker product decomposition with subband normalization for robust, high-performance adaptive signal processing (Ye et al., 15 Jan 2026).