.\" /*
.\"  * Revision Control Information
.\"  *
.\"  * $Source: /vol/opua/opua2/sis/sis-1.1/common/src/sis/sis_lib/help/RCS/xl_decomp_two.1,v $
.\"  * $Author: sis $
.\"  * $Revision: 1.2 $
.\"  * $Date: 1992/05/06 19:04:01 $
.\"  *
.\"
.XX
xl_decomp_two [-n support] [-l lower_common_bound]
            [-L cube_support_lower_bound] [-f MAX_FANIN]
            [-c MAX_COMMON_FANIN] [-u MAX_UNION_FANIN] [-v]
.PP
Given an infeasible network, does decomposition
knowing that each Xilinx3090 CLB can have two functions if they have
no more than MAX_FANIN (default = 4) fanins each, their union has at
most MAX_UNION_FANINS (default = 5) fanins and they have at most
MAX_COMMON_FANINS (default = 4) common fanins. It does so by
considering certain cubes of all the infeasible nodes of the network, and
associating an affinity value with each cube-pair. Extracts
cube-pairs with high affinity. Need to do a decomposition later to
make the network feasible.
.PP
\fB-n\fP: support is the size of the TLU block (default = 5)
.br
.PP
\fB-l\fP: do not consider a cube-pair for extraction if their number of
common inputs is less than lower_common_bound (default = 2).
.br
.PP
\fB-L\fP: do not consider a cube if it has less than
cube_support_lower_bound inputs.
.br
.PP
\fB-v\fP: turns on the verbosity flag.  When used, information about the
   algorithm is printed as it executes.

