05267nam 2200649 a 450 991014457690332120170815122410.01-281-00216-X97866110021690-470-12521-70-470-12520-9(CKB)1000000000376972(EBL)315213(OCoLC)180191752(SSID)ssj0000227399(PQKBManifestationID)11175697(PQKBTitleCode)TC0000227399(PQKBWorkID)10264309(PQKB)11537372(MiAaPQ)EBC315213(EXLCZ)99100000000037697220061004d2007 uy 0engur|n|---|||||txtccrPrinciples of modern digital design[electronic resource] /Parag K. LalaHoboken, N.J. Wiley-Intersciencec20071 online resource (437 p.)Description based upon print version of record.0-470-07296-2 Includes bibliographical references and index.PRINCIPLES OF MODERN DIGITAL DESIGN; CONTENTS; Preface; 1 Number Systems and Binary Codes; 1.1 Introduction; 1.2 Decimal Numbers; 1.3 Binary Numbers; 1.3.1 Basic Binary Arithmetic; 1.4 Octal Numbers; 1.5 Hexadecimal Numbers; 1.6 Signed Numbers; 1.6.1 Diminished Radix Complement; 1.6.2 Radix Complement; 1.7 Floating-Point Numbers; 1.8 Binary Encoding; 1.8.1 Weighted Codes; 1.8.2 Nonweighted Codes; Exercises; 2 Fundamental Concepts of Digital Logic; 2.1 Introduction; 2.2 Sets; 2.3 Relations; 2.4 Partitions; 2.5 Graphs; 2.6 Boolean Algebra; 2.7 Boolean Functions2.8 Derivation and Classification of Boolean Functions2.9 Canonical Forms of Boolean Functions; 2.10 Logic Gates; Exercises; 3 Combinational Logic Design; 3.1 Introduction; 3.2 Minimization of Boolean Expressions; 3.3 Karnaugh Maps; 3.3.1 Don't Care Conditions; 3.3.2 The Complementary Approach; 3.4 Quine-MCCluskey Method; 3.4.1 Simplification of Boolean Function with Don't Cares; 3.5 Cubical Representation of Boolean Functions; 3.5.1 Tautology; 3.5.2 Complementation Using Shannon's Expansion; 3.6 Heuristic Minimization of Logic Circuits; 3.6.1 Expand; 3.6.2 Reduce; 3.6.3 Irredundant3.6.4 Espresso3.7 Minimization of Multiple-Output Functions; 3.8 NAND-NAND and NOR-NOR Logic; 3.8.1 NAND-NAND Logic; 3.8.2 NOR-NOR Logic; 3.9 Multilevel Logic Design; 3.9.1 Algebraic and Boolean Division; 3.9.2 Kernels; 3.10 Minimization of Multilevel Circuits Using Don't Cares; 3.10.1 Satisfiability Don't Cares; 3.10.2 Observability Don't Cares; 3.11 Combinational Logic Implementation Using EX-OR and AND Gates; 3.12 Logic Circuit Design Using Multiplexers and Decoders; 3.12.1 Multiplexers; 3.12.2 Demultiplexers and Decoders; 3.13 Arithmetic Circuits; 3.13.1 Half-Adders; 3.13.2 Full Adders3.13.3 Carry-Lookahead Adders3.13.4 Carry-Select Adder; 3.13.5 Carry-Save Addition; 3.13.6 BCD Adders; 3.13.7 Half-Subtractors; 3.13.8 Full Subtractors; 3.13.9 Two's Complement Subtractors; 3.13.10 BCD Substractors; 3.13.11 Multiplication; 3.13.12 Comparator; 3.14 Combinational Circuit Design Using PLDs; 3.14.1 PROM; 3.14.2 PLA; 3.14.3 PAL; Exercises; References; 4 Fundamentals of Synchronous Sequential Circuits; 4.1 Introduction; 4.2 Synchronous and Asynchronous Operation; 4.3 Latches; 4.4 Flip-Flops; 4.4.1 D Flip-Flop; 4.4.2 JK Flip-Flop; 4.4.3 T Flip-Flop4.5 Timing in Synchronous Sequential Circuits4.6 State Tables and State Diagrams; 4.7 Mealy and Moore Models; 4.8 Analysis of Synchronous Sequential Circuits; Exercises; References; 5 VHDL in Digital Design; 5.1 Introduction; 5.2 Entity and Architecture; 5.2.1 Entity; 5.2.2 Architecture; 5.3 Lexical Elements in VHDL; 5.4 Data Types; 5.5 Operators; 5.6 Concurrent and Sequential Statements; 5.7 Architecture Description; 5.8 Structural Description; 5.9 Behavioral Description; 5.10 RTL Description; Exercises; 6 Combinational Logic Design Using VHDL; 6.1 Introduction6.2 Concurrent Assignment StatementsA major objective of this book is to fill the gap between traditional logic design principles and logic design/optimization techniques used in practice. Over the last two decades several techniques for computer-aided design and optimization of logic circuits have been developed. However, underlying theories of these techniques are inadequately covered or not covered at all in undergraduate text books. This book covers not only the ""classical"" material found in current text books but also selected materials that modern logic designers need to be familiar with.Logic designLogic circuitsDesign and constructionDigital electronicsElectronic books.Logic design.Logic circuitsDesign and construction.Digital electronics.621.395621.39732Lala Parag K.1948-9381MiAaPQMiAaPQMiAaPQBOOK9910144576903321Principles of modern digital design2239894UNINA03435nam 2200553Ia 450 991043815300332120200520144314.03-642-31695-610.1007/978-3-642-31695-1(CKB)3400000000102751(SSID)ssj0000788854(PQKBManifestationID)11462938(PQKBTitleCode)TC0000788854(PQKBWorkID)10828719(PQKB)10974478(DE-He213)978-3-642-31695-1(MiAaPQ)EBC3070963(PPN)16832007X(EXLCZ)99340000000010275120121007d2013 uy 0engurnn|008mamaatxtccrIntroduction to stokes structures /Claude Sabbah1st ed. 2013.Berlin Springerc20131 online resource (XIV, 249 p. 14 illus., 1 illus. in color.) Lecture notes in mathematics,1617-9692 ;2060Bibliographic Level Mode of Issuance: Monograph3-642-31694-8 Includes bibliographical references and index.1.T-filtrations --2.Stokes-filtered local systems in dimension one --3.Abelianity and strictness --4.Stokes-perverse sheaves on Riemann surfaces --5.The Riemann-Hilbert correspondence for holonomic D-modules on curves --6.Applications of the Riemann-Hilbert correspondence to holonomic distributions --7.Riemann-Hilbert and Laplace on the affine line (the regular case) --8.Real blow-up spaces and moderate de Rham complexes --9.Stokes-filtered local systems along a divisor with normal crossings --10.The Riemann-Hilbert correspondence for good meromorphic connections (case of a smooth divisor) --11.Good meromorphic connections (formal theory) --12.Good meromorphic connections (analytic theory) and the Riemann-Hilbert correspondence --13.Push-forward of Stokes-filtered local systems --14.Irregular nearby cycles --15.Nearby cycles of Stokes-filtered local systems.This research monograph provides a geometric description of holonomic differential systems in one or more variables. Stokes matrices form the extended monodromy data for a linear differential equation of one complex variable near an irregular singular point. The present volume presents the approach in terms of Stokes filtrations. For linear differential equations on a Riemann surface, it also develops the related notion of a Stokes-perverse sheaf. This point of view is generalized to holonomic systems of linear differential equations in the complex domain, and a general Riemann-Hilbert correspondence is proved for vector bundles with meromorphic connections on a complex manifold. Applications to the distributions solutions to such systems are also discussed, and various operations on Stokes-filtered local systems are analyzed.Lecture notes in mathematics (Springer-Verlag) ;2060.Differential equations, LinearStokes' theoremDifferential equations, Linear.Stokes' theorem.515/.354Sabbah Claude311999MiAaPQMiAaPQMiAaPQBOOK9910438153003321Introduction to Stokes structures241611UNINA