Use of gray decoding for implementation of symmetric functions

K. Osnat; Ilya Levin; Radomir S Stankovic

Use of gray decoding for implementation of symmetric functions

K. Osnat, Ilya Levin, Radomir S Stankovic

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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 language	American English
Title of host publication	VLSI-SoC: Advanced Topics on Systems on Chip, Series: Advances in Information and Communication Technology, Vol. 291, Ricardo Reis‏, Vincent Mooney
Editors	Paul Hasler
Publisher	Springer
Pages	17-32
State	Published - 2009

Cite this

@inbook{e66dd8d7fbdd48418d53b4035889de8d,

title = "Use of gray decoding for implementation of symmetric functions",

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.",

author = "K. Osnat and Ilya Levin and Stankovic, {Radomir S}",

year = "2009",

language = "American English",

pages = "17--32",

editor = "Paul Hasler",

booktitle = "VLSI-SoC: Advanced Topics on Systems on Chip, Series: Advances in Information and Communication Technology, Vol. 291, Ricardo Reis‏, Vincent Mooney",

publisher = "Springer",

}

Use of gray decoding for implementation of symmetric functions. / Osnat, K.; Levin, Ilya; Stankovic, Radomir S.
VLSI-SoC: Advanced Topics on Systems on Chip, Series: Advances in Information and Communication Technology, Vol. 291, Ricardo Reis‏, Vincent Mooney. ed. / Paul Hasler. Springer, 2009. p. 17-32.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Use of gray decoding for implementation of symmetric functions

AU - Osnat, K.

AU - Levin, Ilya

AU - Stankovic, Radomir S

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://primoprd.tau.ac.il:1701/primo_library/libweb/action/search.do?fn=search&ct=search&initialSearch=true&mode=Basic&tab=default_tab&indx=1&dum=true&srt=rank&vid=TAU1&frbg=&tb=t&vl%28freeText0%29=Use+of+Gray+Coding+for+Implementation+of+Symmetric+Functi

M3 - Chapter

SP - 17

EP - 32

BT - VLSI-SoC: Advanced Topics on Systems on Chip, Series: Advances in Information and Communication Technology, Vol. 291, Ricardo Reis‏, Vincent Mooney

A2 - Hasler, Paul

PB - Springer

ER -

Use of gray decoding for implementation of symmetric functions

Abstract

Other files and links

Fingerprint

Cite this