id: 05339390
dt: j
an: 05339390
au: Lee, H.-P.S.
ti: An algorithm for minimal TANT network generation.
so: IEEE Trans. Comput. 27, No. 12, 1202-1206 (1978).
py: 1978
pu: Institute of Electrical and Electronics Engineers (IEEE), Washington, DC
la: EN
cc: 
ut: TANT network; minimal gate design; prime permissible implicant; second
    level minimization; third level minimization; tail factor
ci: 
li: doi:10.1109/TC.1978.1675028
ab: Summary: An algorithm for constructing minimal TANT networks is presented.
    Using the upper prime permissible implicants as candidates, two
    particular networks, A and B, are constructed. Network A has the
    minimum number of third level gates among all networks that have the
    minimum number of second level gates. Network B has the minimum number
    of second level gates among all networks that have the minimum number
    of third level gates. For most functions with few variables, it can be
    shown that one or both of these two networks is a minimal TANT network.
    (No function with less than nine variables has been found which
    violates the above statement.) For other functions, upper and lower
    bounds for both the second level and third level gates are derived.
    These bounds provide extra constraints which can speed up the process
    for finding a minimal TANT network.
rv: