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

    Abstract

    We study a problem of 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. We propose a method, based on the Gray decoding, for reduction of the number of product terms, and, consequently, the implementation cost of the symmetric functions. The method is founded on the principles of linear transformations of the input variables of an initial function. It provides significant simplification both of the SOPs and the FPRMs representations of the functions. Mathematical analysis as well as experimental results demonstrate the efficiency of the proposed method.

    Original languageEnglish
    Title of host publicationVLSI-SoC
    Subtitle of host publicationAdvanced Topics on Systems on a Chip: A Selection of Extended Versions of the Best Papers of the Fourteenth Int. Conf. on Very Large Scale Integration of System on Chip (VLSI-SoC2007)
    EditorsRicardo Reis, Paul Hasler, Vincent Mooney
    Pages17-32
    Number of pages16
    DOIs
    StatePublished - 2009

    Publication series

    NameIFIP International Federation for Information Processing
    Volume291
    ISSN (Print)1571-5736

    Fingerprint

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

    Cite this