FIELD: information technology, physics.
SUBSTANCE: Boolean logic function is constructed when recording the memorising information in the accomplished normal disjunctive form. The argument of this form is the address of memorised information and its value is the memorised information. After that the Boolean logic function gets converted into Zhegalkin polynomial, then the number of elementary Boolean operations, being a part of Zhegalkin polynomial, gets minimised, and then the minimised Zhegalkin polynomial gets realised on the programmed integrated circuit logic.
EFFECT: decrease of general-circuit expenditures for memorising the digital information.
2 tbl
Title | Year | Author | Number |
---|---|---|---|
METHOD OF FORMING S-BLOCKS WITH MINIMUM NUMBER OF LOGIC ELEMENTS | 2014 |
|
RU2572423C2 |
METHOD OF FORMING S-BLOCK | 2015 |
|
RU2607613C2 |
METHOD OF TESTABLE REALISATION OF LOGICAL CONVERTERS | 2008 |
|
RU2413282C2 |
SHIFT REGISTER | 2017 |
|
RU2691852C2 |
METHOD FOR TESTABILITY OF REALISATION OF LOGIC CONVERTERS | 2011 |
|
RU2497182C2 |
FUNCTION GENERATOR | 0 |
|
SU781822A1 |
METHOD OF RESTORING RECORDS IN STORAGE DEVICE, SYSTEM FOR REALISING SAID METHOD AND MACHINE-READABLE MEDIUM | 2010 |
|
RU2448361C2 |
METHOD OF TRANSMITTING INFORMATION IN COMMUNICATION SYSTEMS WITH NOISE-SHAPED SIGNALS | 2016 |
|
RU2633614C1 |
DEVICE FOR COMPUTING POLYNOMIAL VALUES | 0 |
|
SU1048481A1 |
DEVICE FOR DETERMINATION OF VALUE OF BOOLEAN FUNCTIONS | 0 |
|
SU1805462A1 |
Authors
Dates
2008-08-20—Published
2006-08-24—Filed