Efficient spectral coefficient calculation using circuit output probabilities

Digital Signal Processing

Volumn 4, Issue 4, 1994, Pages 245-254

  Thornton, M A ^a   Nair, V S S ^a  

^a SOUTHERN METHODIST UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 43949160818     PISSN: 10512004     EISSN: None     Source Type: Journal    
DOI: 10.1006/dspr.1994.1024     Document Type: Article

References (32)

1. Edwards, C. R. The design of easily tested circuits using mapping and spectral techniques. Radio and Electron. Eng. 47(7) (1977), 321-342.
2. Hurst, S. L., Miller, D. M., and Muzio, J. C. Spectral Techniques in Digital Logic. Academic Press, Orlando, FL, 1985.
3. Karpovsky, M. G. Finite Orthogonal Series in the Design of Digital Devices. Wiley, New York, 1976.
4. Lloyd, A. M. A consideration of orthogonal matrices, other than the Rademacher-Walsh types, for the synthesis of digital networks. J. Electron. 47(3) (1979), 205-212.
5. Perkowski, M. A., Driscoll, M., Liu, J., Smith, D., Brown, J., Yang, L., Shamsapour, A., Helliwell, M., Flakowski, B., and Sarabi, A. Integration of logic synthesis and high-level synthesis into the diades design automation system. Proceedings of 22nd IEEE Int. Symp. on Circuits & Systems, pp. 748-751, 1989.
6. Stanković, M., Tošić, Z., and Nikolić, S. Synthesis of maitra cacades by means of spectral coefficients. IEE Proc. 130E(4) (July 1983), 101-108.
7. Thornton, M. A., and Nair, V. S. S. An iterative combinational logic synthesis technique using spectral information. Proceedings of the European Design Automation Conference, pp. 358-363, September 1993.
8. Ashenhurst, R. L. The decomposition of switching functions. Proceedings of an International Symposium on the Theory of Switching, pp. 74-116, April 1957.
9. Lechner, R. Harmonic analysis of switching functions. Recent Developments in Switching Theory, pp. 121-228, 1971.
10. Tokmen, V. M. Disjoint decomposability of multiple valued functions by spectral means. Proceedings IEEE 10th Int. Symp. Mult. Value Logic, pp. 88-93, 1980.
11. V’arma, D., and Trachtenberg, E. A. Design automation tools for efficient implementation of logic functions by decomposition. IEEE Trans. CAD 8(8) (August 1989), 901-916.
12. Damarla, T. Generalized transforms for multiple valued circuits and their fault detection. IEEE Trans. Comput. C41(9) (September 1992), 1101-1109.
13. Hsiao, T. C, and Seth, S. O. An analysis of the use of Rademacher-Walsh spectrum in compact testing. IEEE Trans. Comput. C33(10) (October 1984), 934-937.
14. Miller, D. M., and Muzio, J. C. Spectral fault signatures for single stuck-at faults in combinational networks. IEEE Trans. Comput. C33(8) (August 1984), 765-768.
15. Susskind, A. K. Testing by verifying Walsh coefficients. IEEE Trans. Comput. C32(2) (February 1983), 198-201.
16. Edwards, C. R. The application of the Rademacher-Walsh transform to Boolean function classification and threshold logic synthesis. IEEE Trans. Comput. C24 (1975), 48-62.
17. Cooley., J. W., and Tukey, J. W. An algorithm for the machine calculation of complex fourier series. Math. Comput. 19 (1965), 297-301.
18. Shanks, J. L. Computation of the fast Walsh-Fourier transform. IEEE Trans. Comput. C18 (May 1969), 457-459.
19. Akers, S. B. Binary decision diagrams. IEEE Trans. Comput. C27(6) (June 1978), 509-516.
20. Bryant, R. E. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C35(8) (August 1986), 677-691.
21. Clarke, E. M., McMillan, K. L., Zhao, X., and Fujita, M. Spectral transforms for extremely large boolean functions. Proceedings of the IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 86-90, September 1993.
22. Clarke, E. M., McMillan, K. L., Zhao, X., Fujita, M., and Yang, J. Spectral transformations for large boolean functions with applications to technology mapping. Proceedings of ACMI IEEE Design Automation Conference, pp. 54-60, 1993.
23. Clarke, E. M., Zhao, X., Fujita, M., Matsunaga, Y., McGeer, R., and Yan, J. Fast Walsh transform computation with binary decision diagram. Proceedings of the IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 82-85, September 1993.
24. Falkowski, B. J., Schäfer, I., and Perkowski, M. A. Calculation of the Rademacher-Walsh spectrum from a reduced representation of Boolean functions. Proceedings of the European Design Automation Conference, pp. 181-186, September 1992.
25. Parker, K. P., and McCluskey, E. J. Probabilistic treatment of general combinational networks. IEEE Trans. Comput. C24 (June 1975), 668-670.
26. Kumar, S. K., and Breuer, M. A. Probabilistic aspects of Boolean switching functions via a new transform. J. ACM 28(3) (July 1981), 502-520.
27. Jain, J., Bitner, J., Fussell, D. S., and Abraham, J. A. Probabilistic design verification. Tech. Rep., University of Texas at Austin, UT-CERC-TR-JAA91-01, April 1991.
28. Lee, C. Y. Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38 (July 1959), 985-999.
29. Thornton, M. A., and Nair, V. S. S. Iterative combinational logic synthesis techniques using spectral data. Technical Report, 93-CSE-8, 1993.
30. Green, D. Modern Logic Design. Addison-Wesley, Reading, MA, 1986.
31. Thornton, M. A., and Nair, V. S. S. A numerical method for Reed-Muller circuit synthesis. Proceedings of the IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 69-74, September 1993.
32. Mano, M. Digital Design. Prentice Hall, Englewood Cliffs, NJ, 1984.