A new approach to the decomposition of Boolean functions by the method of q-partitions. III. Joint decomposition of a function system

2007 ◽  
Vol 43 (2) ◽  
pp. 192-207
Author(s):  
B. E. Rytsar
2007 ◽  
Vol 17 (06) ◽  
pp. 1985-1996 ◽  
Author(s):  
L. Z. GUO ◽  
S. A. BILLINGS

The identification of binary cellular automata from spatio-temporal binary patterns is investigated in this paper. Instead of using the usual Boolean or multilinear polynomial representation, the Fourier transform representation of Boolean functions is employed in terms of a Fourier basis. In this way, the orthogonal forward regression least-squares algorithm can be applied directly to detect the significant terms and to estimate the associated parameters. Compared with conventional methods, the new approach is much more robust to noise. Examples are provided to illustrate the effectiveness of the proposed approach.


2004 ◽  
Vol 1 (1) ◽  
pp. 39
Author(s):  
A. H. M. Ashfak Habib ◽  
Md. Abdus Salam ◽  
Zia Nadir ◽  
Hemen Goswami

There are many benefits to simplifying Boolean functions before they are implemented in hardware. A reduced number of gates decreases considerably the cost of the hardware, reduces the heat generated by the chip and, most importantly, increases the speed. But no method is effective for the simplification of Boolean functions, if it involves more than six variables. This paper presents a new manual method of simplification that can be effectively applied to problems with a large number of variables. 


Sign in / Sign up

Export Citation Format

Share Document