file.pdf (611.4 kB)
Download file

Hybrid Spectral Transform Diagrams

Download (611.4 kB)
journal contribution
posted on 01.01.1972, 00:00 by Edmund M Clarke, M Fujita, W Heinle
We give a uniform algebraic framework for computing hybrid spectral transforms in an efficient manner. Based on properties of the Kronecker product, we derive a set of recursive equations, which leads naturally to an algorithm for computing such transforms efficiently. As a result, many applications of transforms like the Walsh transform and the Reed-Muller transform, which were previously impossible because of memory constraints, have now become feasible. The same set of recursive equations also gives a new way of explaining hybrid transform diagrams, an efficient data-structure for integer valued Boolean functions

History

Publisher Statement

All Rights Reserved

Date

01/01/1972

Usage metrics

Exports