Use of gray decoding for implementation of symmetric functions

Osnat Keren, Ilya Levin, Radomir S. Stankovic

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations

    Abstract

    This paper discusses reduction of the number of product terms in representation of totally symmetric Boolean functions by Sum of Products (SOP) and Fixed Polarity Reed-Muller (FPRM) expansions. The suggested method reduces the number of product terms, correspondingly, the implementation cost of symmetric functions based on these expressions by exploiting Gray decoding of input variables. Although this decoding is a particular example of all possible linear transformation of Boolean variables, it is efficient in the case of symmetric functions since it provides a significant simplification of SOPs and FPRMs. Mathematical analysis as well as experimental results demonstrate the efficiency of the proposed method.

    Original languageEnglish
    Title of host publication2007 IFIP International Conference on Very Large Scale Integration, VLSI-SoC
    Pages25-30
    Number of pages6
    DOIs
    StatePublished - 2007
    Event2007 IFIP International Conference on Very Large Scale Integration, VLSI-SoC - Atlanta, GA, United States
    Duration: 15 Oct 200717 Oct 2007

    Publication series

    Name2007 IFIP International Conference on Very Large Scale Integration, VLSI-SoC

    Conference

    Conference2007 IFIP International Conference on Very Large Scale Integration, VLSI-SoC
    Country/TerritoryUnited States
    CityAtlanta, GA
    Period15/10/0717/10/07

    Keywords

    • Autocorrelation
    • Gray code
    • Linear transformation
    • Symmetric function

    Fingerprint

    Dive into the research topics of 'Use of gray decoding for implementation of symmetric functions'. Together they form a unique fingerprint.

    Cite this