Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,692,705 papers from all fields of science
Search
Sign In
Create Free Account
Reed–Muller expansion
Known as:
Reed-Muller expansion
In Boolean logic, a Reed–Muller (or Davio) expansion is a decomposition of a boolean function. For a boolean function we set with respect to : as the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Binary decision diagram
Decomposition (computer science)
Broader (1)
Boolean algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Application of Generalised Reed-Muller Expansion in Development of Programmable Logic Array
E. Zaitseva
,
V. Levashenko
,
I. Lukyanchuk
,
M. Kvassay
,
J. Rabcan
,
Patrik Rusnak
International Conference on Intelligent Data…
2019
Corpus ID: 208883720
The intensive development of information technologies and the need to process big information and data lead to elaboration of new…
Expand
2015
2015
Reed-Muller Realization of X (mod P)
D. Gorodecky
arXiv.org
2015
Corpus ID: 15209686
This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The…
Expand
2008
2008
A Galois Field Approach to Modelling Gene Expression Regulation
Hosam A. Aleem
,
F. Mavituna
,
D. Green
IEEE International Symposium on Multiple-Valued…
2008
Corpus ID: 206989325
Gene expression is the process by which the cell transforms the information in the DNA to functions, often carried out by…
Expand
1996
1996
Multiple Domain Logic Synthesis
J. Bullmann
,
U. Kebschull
1996
Corpus ID: 119034705
Field programmable gate arrays (FPGA) and other complex programmable devices (CPLD) require new logic minimization techniques…
Expand
1994
1994
Fast Logic Synthesis of Ternary Universal Logic Modules Uf Based on Reed-Muller Expansion
Heung-Soo Kim
,
E. Ohta
,
Hyeon-Kyeong Seong
1994
Corpus ID: 57066249
1993
1993
Efficient and fast algorithm to generate minimal Reed-Muller exclusive-or expansions with mixed polarity for completely and incompletely specified functions and its computer implementation
M. Habib
1993
Corpus ID: 62246508
1993
1993
The mapping synthesis of ternary functions under fixed polarities
Xiexiong Chen
,
Haomin Wu
Journal of Computational Science and Technology
1993
Corpus ID: 21329827
This paper proposes a mapping method simplifying the Reed-Muller expansion (“RM expansion”) of a ternary function under fixed…
Expand
1992
1992
FDD based technology mapping for FPGA
E. Schubert
,
U. Kebschull
,
Wolfgang Rosenstiel
Proceedings Euro ASIC '92
1992
Corpus ID: 61524472
Functional decision diagrams (FDD) are shown to be a very efficient alternative to binary decision diagrams (BDD). FDDs are a…
Expand
1984
1984
THE MINIMIZATION OF SWITCHING FUNCTIONS BASED UPON RM EXPANSION UNDER FIXED POLARITIES
Xun-Qian Xu
1984
Corpus ID: 124851210
In this paper, an expression of switching functions and various transformations in terms of Kronecker product is discussed…
Expand
1960
1960
Roy著, Ceramics, Mc-Graw-Hill Book Co., Inc.発行, 1954年版 / Interceram(1959), Velrag des Sprechsaal, Muller & Schmidt, Coburg, 1$ / 宮川愛太郎著, 陶磁器楽焼から本焼まで, 共立出版株式会社発行, A5判, 226ページ, \380
素木 洋一
1960
Corpus ID: 160043387
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE