Efficient algorithm for the calculation of generalized adding and arithmetic transforms from disjoint cubes of Boolean functions

VLSI Design

Volumn 9, Issue 2, 1999, Pages 135-146

  Falkowski, Bogdan J ^a,c,d,e   Chang, Chip Hong ^a,b,f,g,h  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SCHOOL OF ENGINEERING   (Singapore)

^c WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^d PORTLAND STATE UNIVERSITY   (United States)

^e Portland State University   (United States)

^f NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^g Electronic Design   (United States)

^h IEEE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; LOGIC DESIGN;

ARITHMETIC TRANSFORMS;

BOOLEAN FUNCTIONS;

EID: 0032641615     PISSN: 1065514X     EISSN: None     Source Type: None    
DOI: 10.1155/1999/45607     Document Type: Article

References (32)

1. Bennets, R. (1982). "Analysis of Reliability Block Diagrams by Boolean Techniques," IEEE Trans. on Reliability, 31, 156-166.
2. Falkowski, B. J., Shmerko, V. P. and Yanushkevich, S. N., "Arithmetical Logic - Its Status and Achievements," Invited Paper, Proc. of the 4th Int. Conf. on Applications of Computer Systems, Szczecin, Poland, pp. 208-223, Nov. 1997.
3. Heidtmann, K. D. (1991). "Arithmetic Spectrum Applied to Fault Detection for Combinational Networks," IEEE Trans. on Computers, 40(3), 320-324.
4. Kukharev, G. A., Shmerko, V. P. and Yanushkevich, S. N. (1991). Technique of Binary Data Parallel Processing for VLSI, Minsk: University Press (in Russian).
5. Kumar, S. K. and Breuer, M. A. (1981). "Probabilistic Aspects of Boolean Switching Functions via a New Transform," Journal ACM, 28, 502-520.
6. Sasao, T. and Fujita, M. (1996). Representations of Discrete Functions, Boston: Kluwer Academic.
7. Schneeweiss, W. G. (1989). Boolean Functions with Engineering Applications and Computer Programs, Berlin: Springer-Verlag.
8. Hammer, P. L. and Rudeanu, S. (1968). Boolean Methods in Operational Research and Related Areas, Berlin: Springer-Verlag.
9. Ivanescu, P. and Rudeanu, S. (1966). Pseudo-Boolean Methods for Bivalent Programming, Lecture Notes in Mathematics, Vol. 23, Berlin: Springer-Verlag.
10. Hunt, S. (1975). Artificial Intelligence, Reading: Addison-Wesley.
11. Papadimitriou, C. H. (1994). Computational Complexity, Reading: Addison-Wesley.
12. Falkowski, B. J. and Chang, C. H., "Generation of Multi-Polarity Arithmetic Transform from Reduced Representation of Boolean Functions," Proc. of 28th IEEE Intnl. Symp. on Circuits and Systems, Seattle, Washington, pp. 2168-2171, May 1995.
13. Falkowski, B. J. and Chang, C. H., "Fast Generalized Arithmetic and Adding Transforms," Proc. of 8th IFIP WG 10.5 Int. Conf. on Very Large Scale Integration, Makuhari, Chiba, Japan, pp. 723-728, Sep. 1995.
14. Parker, K. P. and McCluskey, E. J. (1975). "Analysis of Logic Circuits with Faults using Input Signal Probabilities," IEEE Trans. on Computers, 23(5), 573-578.
15. Parker, K. P. and McCluskey, E. J. (1975). "Probabilistic Transform of General Combinational Networks," IEEE Trans. on Computers, 24(6), 668-670.
16. Falkowski, B. J. and Perkowski, M. A., "On the Calculation of Generalized Reed-Muller Canonical Expressions from Disjoint Cube Representation of Boolean Functions," Proc. of 33rd IEEE Midwest Symp. on Circuits and Systems, Calgary, Alberta, pp. 1131-1134, August 1990.
17. Falkowski, B. J. and Chang, C. H., "Generation of Fixed Polarity Reed-Muller Expansions from Subset of Walsh Spectral Coefficients for Completely Specified Boolean Functions," Proc. of 5th Intnl. Workshop on Spectral Techniques, Beijing, China, pp. 214-219, March 1994.
18. Falkowski, B. J. and Perkowski, M. A., "A Family of All Essential Radix-2 Addition/Subtraction Multi-Polarity Transforms: Algorithms and Interpretations in Boolean Domain," Proc. of 23rd IEEE Intnl. Symp. on Circuits and Systems, New Orleans, Louisiana, pp. 2913-2916, May 1990.
19. Chattopadhyay, S., Roy, S. and Pal Chaudhuri, P. (1994). "KGPMAP: Library-Based Technology Mapping Technique for Antifuse based FPGAs," IEE Proc., Comput. Digit. Techn., 141(6), 361-368.
20. Falkowski, B. J. and Chang, C. H., "Efficient Algorithms for the Calculation of Arithmetic Spectrum from OBDD and Synthesis of OBDD from Arithmetic Spectrum for Incompletely Specified Boolean Functions," Proc. of 27th IEEE Int. Symp. on Circuits and Systems, London, United Kingdom, 1, 197-200, May 1994.
21. Falkowski, B. J. and Chang, C. H. (1997). "Calculation of Arithmetic Spectra from Free Binary Decision Diagrams," Proc. of 30th IEEE Int. Symp. on Circuits and Systems, Hong Kong, 3, 1764-1767.
22. Chang, C. H. and Falkowski, B. J. (1996). "Operations on Boolean Functions and Variables in Spectral Domain of Arithmetic Transform," Proc. of 29th IEEE Int. Symp. on Circuits and Systems, Atlanta, Georgia, 4, 400-403.
23. De Micheli, G. (1994). Synthesis and Optimization of Digital Circuits, New York: McGraw Hill.
24. Hachtel, G. D. and Somenzi, F. (1996). Logic Synthesis and Verification Algorithms, Boston: Kluwer Academic.
25. Falkowski, B. J., Schaefer, I. and Perkowski, M. A. (1992). "Generation of Adding and Arithmetic Multi-Polarity Transforms for Incompletely Specified Boolean Functions," Int. Journal of Electronics, 73(2), 321-331.
26. Falkowski, B. J., Schaefer, I. and Chang, C. H., "An Efficient Computer Algorithm for the Calculation of Disjoint Cubes Representation of Boolean Functions," Proc. of 36th IEEE Midwest Symp. on Circuits and Systems, Detroit, Michigan, pp. 1308-1311, August 1993.
27. Falkowski, B. J., Schaefer, I. and Perkowski, M. A., "Effective Computer Methods for the Calculation of Rademacher-Walsh Spectrum for Completely and Incompletely Specified Boolean Functions," IEEE Trans. on Computer-Aided Design, 11(10), 1207-1226, October 1992.
28. Karpovsky, M. G. (1976). Finite Orthogonal Series in Design of Digital Devices, New York: Wiley.
29. Riege, M. W. and Besslich, Ph. W., "Low-complexity Synthesis or Incompletely Specified Multiple-output Mod-2 Sums," IEE Proc., Pt. E, 139(4), 355-361, July 1992.
30. Varma, D. and Trachtenberg, E. A., "Computation of Reed-Muller Expansions of Incompletely Specified Boo-lean Functions from Reduced Representations," IEE Proc., Pt. E, 138(2), 85-92, March 1991.
31. Ciesielski, M. J., Yang, S. and Perkowski, M. A., "Minimization of Multiple-Valued Logic based on Graph Coloring," Tech. Rep. TR-CSE-90-13, Dept. Elect. Comp. Eng., Univ of Massachusetts, Amherst, September 1990. (Earlier version of this paper appeared as: "Multiplevalued Minimization based on Graph Coloring," Proc. of IEEE Int. Conf. on Computer Design: VLSI in Computers & Processors, pp. 262-265, October 1989).
32. Ciesielski, M. J., Yang, S. and Perkowski, M. A., "Minimization of Multiple-Valued Logic based on Graph Coloring," Tech. Rep. TR-CSE-90-13, Dept. Elect. Comp. Eng., Univ of Massachusetts, Amherst, September 1990. (Earlier version of this paper appeared as: "Multiplevalued Minimization based on Graph Coloring," Proc. of IEEE Int. Conf. on Computer Design: VLSI in Computers & Processors, pp. 262-265, October 1989).