Table 1 Complete list of hypotheses \( {\left\{{\mathrm{H}}_h\right\}}_{h=1}^{12} \) regarding feasible commuting-pruning implementation structures

H₁ : y = Ax

x = input

H₂ : y = Bx

y = output

H₃ : y = Fx

A = DIF

H₄ : y = ABx

B = DIT

H₅ : y = BAx

F = 2BF filtering

H₆ : y = ABFx

D = DFT _N

H₇ : y = BAFx

H₈ : y = Dx

H₉ : H₄ ∪ H₆

H₁₀ : H₅ ∪ H₇

H₁₁ : H₉ ∪ H₃ ∪ H₈

H₁₂ : H₁₀ ∪ H₃ ∪ H₈