Read more
Informationen zum Autor KARL M. FANT is President of Theseus Research, Inc. After serving as a Research Fellow at Honeywell, he co-founded Theseus Research and then Theseus Logic, which is now commercializing NULL Convention LogicTM. He holds twenty-nine patents and has published numerous papers. Klappentext This seminal book presents a new logically determined design methodology for designing clockless circuit systems. The book presents the foundations, architectures and methodologies to implement such systems. Based on logical relationships, it concentrates on digital circuit system complexity and productivity to allow for more reliable, faster and cheaper products.* Transcends shortcomings of Boolean logic.* Presents theoritical foundations, architecture and analysis of clockless (asynchronous) circuit design.* Contains examples and exercises making it ideal for those studying the area. Zusammenfassung This seminal book presents a new logically determined design methodology for designing clockless circuit systems. The book presents the foundations, architectures and methodologies to implement such systems. Based on logical relationships, it concentrates on digital circuit system complexity and productivity to allow for more reliable, faster and cheaper products.* Transcends shortcomings of Boolean logic.* Presents theoritical foundations, architecture and analysis of clockless (asynchronous) circuit design.* Contains examples and exercises making it ideal for those studying the area. Inhaltsverzeichnis Preface. Acknowledgments. 1. Trusting Logic. 1.1 Mathematicianless Enlivenment of Logic Expression. 1.2 Emulating the Mathematician. 1.3 Supplementing the Expressivity of Boolean Logic. 1.4 Defining a Sufficiently Expressive Logic. 1.5 The Logically Determined System. 1.6 Trusting the Logic: A Methodology of Logical Confidence. 1.7 Summary. 1.8 Exercises. 2. A Sufficiently Expressive Logic. 2.1 Searching for a New Logic. 2.2 Deriving a 3 Value Logic. 2.3 Deriving a 2 Value Logic. 2.4 Compromising Logical Completeness. 2.5 Summary. 3. The Structure of Logically Determined Systems. 3.1 The Cycle. 3.2 Basic Pipeline Structures. 3.3 Control Variables and Wavefront Steering. 3.4 The Logically Determined System. 3.5 Initialization. 3.6 Testing. 3.7 Summary. 3.8 Exercises. 4. 2NCL Combinational Expression. 4.1 Function Classification. 4.2 The Library of 2NCL Operators. 4.3 2NCL Combinational Expression. 4.4 Example 1: Binary Plus Trinary to Quaternary Adder. 4.5 Example 2: Logic Unit. 4.6 Example 3: Minterm Construction. 4.7 Example 4: A Binary Clipper. 4.8 Example 5: A Code Detector. 4.9 Completeness Sufficiency. 4.10 Greater Combinational Composition. 4.11 Directly Mapping Boolean Combinational Expressions. 4.12 Summary. 4.13 Exercises. 5. Cycle Granularity. 5.1 Partitioning Combinational Expressions. 5.2 Partitioning the Data Path. 5.3 Two-dimensional Pipelining: Orthogonal Pipelining Across a Data Path. 5.4 2D Wavefront Behavior. 5.5 2D Pipelined Operations. 5.6 Summary. 5.7 Exercises. 6. Memory Elements. 6.1 The Ring Register. 6.2 Complex Function Registers. 6.3 The Consume / Produce Register Structure. 6.4 The Register File. 6.5 Delay Pipeline Memory. 6.6 Delay Tower. 6.7 FIFO Tower. 6.8 Stack Tower. 6.9 Wrapper for Standard Memory Modules. 6.10 Exercises. 7. State Machines. 7.1 Basic State Machine Structure. 7.2 Exercises. 8. Busses and Networks. 8.1 The Bus. 8.2 A Fan-out Steering Tree. 8.3 Fan-in Steering Trees Do Not...
List of contents
Preface.
Acknowledgments.
1. Trusting Logic.
2. A Sufficiently Expressive Logic.
3. The Structure of Logically Determined Systems.
4. 2NCL Combinational Expression.
5. Cycle Granularity.
6. Memory Elements.
7. State Machines.
8. Busses and Networks.
9. Multi-value Numeric Design.
10. The Shadow Model of Pipeline Behavior.
11. Pipeline Buffering.
12. Ring Behavior.
13. Interacting Pipeline Structures.
14. Complex Pipeline Structures.
Appendix A: Logically Determined Wavefront Flow.
Appendix B: Playing with 2NCL.
Appendix C: Pipeline Simulation.
References.
Index.
