• DocumentCode
    1838860
  • Title

    A fast algorithm for the disjunctive decomposition of m-valued functions. I. The decomposition algorithm

  • Author

    Abugharbieh, Sami B. ; Lee, Samuel C.

  • Author_Institution
    Sch. of Electr. Eng., Oklahoma Univ., Norman, OK, USA
  • fYear
    1993
  • fDate
    24-27 May 1993
  • Firstpage
    118
  • Lastpage
    125
  • Abstract
    The binary function decomposition algorithm of V. Shen et al. (1971) is generalized to m-valued functions with m>2. The necessary condition for the decomposability for m-valued functions is obtained and used in generating candidate bound sets. A fast method for testing the necessary condition using partial partition tables whereby the decomposability of the function can be determined for a randomly chosen function in (nm)3 time is also obtained
  • Keywords
    many-valued logics; switching functions; binary function; decomposition algorithm; disjunctive decomposition; fast algorithm; m-valued functions; necessary condition; partial partition tables; randomly chosen function; Algorithm design and analysis; Circuit testing; Jacobian matrices; Logic circuits; Logic testing; Partitioning algorithms; Performance evaluation; Spectral analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 1993., Proceedings of The Twenty-Third International Symposium on
  • Conference_Location
    Sacramento, CA
  • Print_ISBN
    0-8186-3350-6
  • Type

    conf

  • DOI
    10.1109/ISMVL.1993.289571
  • Filename
    289571
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1838860