• DocumentCode
    2910681
  • Title

    Code assignment algorithm for highly parallel multiple-valued combinational circuits

  • Author

    Tamaki, Saneaki ; Kameyama, Michitaka ; Higuchi, Tatsuo

  • Author_Institution
    Fac. of Eng., Tohoku Univ., Sendai, Japan
  • fYear
    1992
  • fDate
    27-29 May 1992
  • Firstpage
    382
  • Lastpage
    388
  • Abstract
    A multivalued code assignment algorithm for locally computable combinatorial circuits, when the functional specification for a permutation operation is given by the mapping relationship between input and output alphabets or symbols, is described. Partition theory, usually used in the design of sequential circuit, is effectively used for the fast search for the code assignment problem. Some examples are shown to demonstrate the usefulness of the algorithm
  • Keywords
    combinatorial circuits; logic design; many-valued logics; code assignment algorithm; functional specification; highly parallel multiple-valued combinational circuits; mapping relationship; partition theory; permutation operation; sequential circuit; Arithmetic; Combinational circuits; Design engineering; Hardware; Logic circuits; Logic design; Partitioning algorithms; Real time systems; Very large scale integration; Wiring;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on
  • Conference_Location
    Sendai
  • Print_ISBN
    0-8186-2680-1
  • Type

    conf

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