However, for their exponential complexity, these algorithms are practically unsuitable for large functions. Another disadvantage turns out if particular Walsh coefficients are to be computed separately. The algorithm always calculates the entire spectrum and, therefore, it is rather inefficient for applications where a subset of Walsh spectral coefficients, i.e., the pruned Walsh spectrum, is required. In this paper, we propose another BDD-based method for Walsh spectrum calculation adapted for application where the pruned Walsh spectrum is needed. Pairs of spectral coefficients are calculated and stored in the fields assigned to the root node.
Experimental results demonstrate the efficiency of the approach.
All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .