|
|
|
|
LEADER |
03228nam a22004815i 4500 |
001 |
978-0-387-21734-5 |
003 |
DE-He213 |
005 |
20151204164816.0 |
007 |
cr nn 008mamaa |
008 |
100301s2003 xxu| s |||| 0|eng d |
020 |
|
|
|a 9780387217345
|9 978-0-387-21734-5
|
024 |
7 |
|
|a 10.1007/b97562
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.L63
|
072 |
|
7 |
|a UYF
|2 bicssc
|
072 |
|
7 |
|a COM036000
|2 bisacsh
|
082 |
0 |
4 |
|a 621.395
|2 23
|
100 |
1 |
|
|a Stanković, Radomir S.
|e author.
|
245 |
1 |
0 |
|a Spectral Interpretation of Decision Diagrams
|h [electronic resource] /
|c by Radomir S. Stanković, Jaakko T. Astola.
|
264 |
|
1 |
|a New York, NY :
|b Springer New York,
|c 2003.
|
300 |
|
|
|a XX, 286 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
505 |
0 |
|
|a Signals -- Algebraic Structures for Signal Processing -- Spectral Techniques -- Fourier Analysis on Groups -- Spectral Interpretation of Decision Diagrams -- Advanced Topics in Decision Trees and Diagrams -- Optimization of Decision Diagrams -- Word-Level Decision Diagrams -- Spectral Interpretation of Edge-Valued Decision Diagrams -- Spectral Interpretation of Ternary Decision Diagrams -- Group Theoretic Approach to Optimization of Decision Diagrams -- Closing Remarks.
|
520 |
|
|
|a Decision diagrams (DDs) are data structures for efficient (time/space) representations of large discrete functions. In addition to their wide application in engineering practice, DDs are now a standard part of many CAD systems for logic design and a basis for severe signal processing algorithms. Spectral Interpretation of Decision Diagrams derives from attempts to classify and uniformly interpret DDs through spectral interpretation methods, relating them to different Fourier-series-like functional expressions for discrete functions and a group-theoretic approach to DD optimization. The book examines DDs found in literature and engineering practice and provides insights into relationships between DDs and different polynomial or spectral expressions for representation of discrete functions. In addition, it offers guidelines and criteria for selection of the most suitable representation in terms of space and time complexity. The work complements theory with numerous illustrative examples from practice. Moreover, the importance of DD representations to the verification and testing of arithmetic circuits is addressed, as well as problems related to various signal processing tasks.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Logic design.
|
650 |
|
0 |
|a Microprocessors.
|
650 |
|
0 |
|a Computer-aided engineering.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Logic Design.
|
650 |
2 |
4 |
|a Computer-Aided Engineering (CAD, CAE) and Design.
|
650 |
2 |
4 |
|a Register-Transfer-Level Implementation.
|
700 |
1 |
|
|a Astola, Jaakko T.
|e author.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9780387955452
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b97562
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|