000 04553nam a2200661 i 4500
001 6813740
003 IEEE
005 20200413152906.0
006 m eo d
007 cr cn |||m|||a
008 120714s2012 caua foab 001 0 eng d
020 _a9781608459438 (electronic bk.)
020 _z9781608459421 (pbk.)
024 7 _a10.2200/S00420ED1V01Y201205DCS037
_2doi
035 _a(OCoLC)799365241
035 _a(CaBNVSL)swl00401090
040 _aCaBNVSL
_cCaBNVSL
_dCaBNVSL
050 4 _aQA9.45
_b.S727 2012
082 0 4 _a511.3
_223
100 1 _aStanković, Radomir S.
245 1 0 _aRepresentation of multiple-valued logic functions
_h[electronic resource] /
_cRadomir S. Stanković, Jaakko T. Astola, Claudio Moraga.
260 _aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) :
_bMorgan & Claypool,
_cc2012.
300 _a1 electronic text (xiii, 154 p.) :
_bill., digital file.
490 1 _aSynthesis lectures on digital circuits and systems,
_x1932-3174 ;
_v# 37
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat Reader.
500 _aPart of: Synthesis digital library of engineering and computer science.
500 _aSeries from website.
504 _aIncludes bibliographical references (p. 127-150) and index.
505 0 _aAcknowledgments -- 1. Multiple-valued logic functions -- 1.1 Tabular representations -- 1.2 Cubes -- 1.3 Encoding of variables -- 1.4 Other representations -- 1.5 Algebraic structures for multiple-valued functions -- 1.6 Functions with various properties --
505 8 _a2. Functional expressions for multiple-valued functions -- 2.1 Functional expressions -- 2.2 Generalizations to multiple-valued functions -- 2.3 Sum-of-product expressions -- 2.4 Galois field expressions -- 2.5 Fixed-polarity GF-expressions -- 2.6 Efficiency of representations -- 2.7 Arithmetic expressions for multiple-valued functions -- 2.8 Haar-like expressions for multiple-valued functions -- 2.9 Sparse representations from covering codes --
505 8 _a3. Spectral representations of multiple-valued functions -- 3.1 Fourier representations of logic functions -- 3.2 Construction of group characters -- 3.3 Haar series for multiple-valued logic functions --
505 8 _a4. Decision diagrams for multiple-valued functions -- 4.1 Decision trees and decision diagrams -- 4.2 Reduction rules -- 4.3 Multiple-place decision diagrams -- 4.4 Reduction of decision trees -- 4.5 Functional decision diagrams for MV functions -- 4.6 Reed-Muller-Fourier decision diagrams -- 4.7 Vilenkin-Chrestenson decision diagrams -- 4.8 Haar spectral transform decision diagrams -- 4.9 Edge-valued decision diagrams -- 4.10 Construction of EVDDs -- 4.11 Construction of transforms from decision diagrams --
505 8 _a5. Fast calculation algorithms -- 5.1 Illustrative examples of FFT-like algorithms -- Bibliography -- Authors' biographies -- Index.
506 1 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 _aCompendex
510 0 _aINSPEC
510 0 _aGoogle scholar
510 0 _aGoogle book search
520 3 _aCompared to binary switching functions, the multiple-valued functions (MV) offer more compact representations of the information content of signals modeled by logic functions and, therefore, their use fits very well in the general settings of data compression attempts and approaches. The first task in dealing with such signals is to provide mathematical methods for their representation in a way that will make their application in practice feasible.
530 _aAlso available in print.
588 _aTitle from PDF t.p. (viewed on July 14, 2012).
650 0 _aMany-valued logic
_xMathematical models.
650 0 _aSignal processing
_xDigital techniques
_xMathematical models.
650 0 _aLogic design.
653 _amultiple-valued logic functions
653 _aReed-Muller expressions
653 _aReed-Muller-Fourier expressions
653 _aGalois field expressions
653 _aspectral expressions
653 _adecision diagrams
700 1 _aAstola, Jaakko.
700 1 _aMoraga, Claudio.
776 0 8 _iPrint version:
_z9781608459421
830 0 _aSynthesis digital library of engineering and computer science.
830 0 _aSynthesis lectures on digital circuits and systems ;
_v# 37.
_x1932-3174
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6813740
999 _c561925
_d561925