The computational complexity of a direct implementation of (REF ) and (REF ) hinders the derivation of the optimum decision fusion rule for large size networks. Specifically, the problem with (REF ) and (REF ) is the exponential number of terms of the summation over \(\mathcal {I}_k\)  (\(\mathcal {I}_{n_B}\)  in (REF )). In this section, we show that an efficient implementation of such summations is possible based on Dynamic Programming (DP) [1]}.
