Additive Cellular Automata: Theory And Applications, Volume 1
Parimal Pal Chaudhuri
- 出版商: Wiley
- 出版日期: 1997-07-11
- 售價: $3,270
- 貴賓價: 9.5 折 $3,107
- 語言: 英文
- 頁數: 368
- 裝訂: Paperback
- ISBN: 0818677171
- ISBN-13: 9780818677175
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
Visual C++ 6 Bible 進階與程式應用篇$650$514 -
計算機組織與設計--軟硬體界面第二版 (Computer Organization & Design, 2/e)$680$537 -
Essentials of Management Information Systems: Managing the Digital Firm, 6/e$1,050$1,029 -
Thinking in Java 中文版 (Thinking in Java, 2/e)$920$727 -
$990Java Web Services Architecture -
STRUTS 實作手冊(Struts in Action: Building Web Applications with the Leading Java Framework)$690$538 -
Practical Java Programming Language Guide 中文版 (Practical Java Programming Language Guide)$560$442 -
SQL 設計與運用範例集$480$408 -
Professional XML Development with Apache Tools : Xerces, Xalan, FOP, Cocoon, Axi$1,580$1,501 -
JSP 2.0 技術手冊$750$593 -
發誓學會 Flash MX 2004 ActionScript$620$558 -
Flash MX 2004 ActionScript 語法參考詞典$580$452 -
Excel Plus 2004 商業管理實例應用$540$459 -
PowerPoint 商業簡報實例應用－人事管理、財務會計、金融投資 (2000、XP、2003 適用)$480$99 -
Perl 學習手札$390$351 -
Word 商業文書實例應用－行政管理、產品行銷、商務應用 (2000、XP、2003 適用)$540$459 -
WDM Driver 程式設計實務$650$514 -
MySQL 徹底研究 (The Definitive Guide to MySQL, 2/e)$650$507 -
新一代購物網站 TWE-Commerce 架設與管理$580$522 -
Flash MX 2004 跟 Macromedia 專家學 ActionScript (Macromedia Flash MX 2004 ActionScript : Training from the Source)$780$663 -
802.11 無線區域網路理論與實務$650$553 -
Fedora Core 3 Linux 安裝與系統管理$650$514 -
專案管理實作使用 Project 2003$520$442 -
XOOPS 2 大補帖－模組與佈景主題大全$460$391 -
Adobe Photoshop CS 創意實現 (Adobe Photoshop CS One-on-One)$650$514
相關主題
商品描述
Description:
This book presents an extensive survey and report of related research on important developments in cellular automata (CA) theory. The authors introduce you to this theory in a comprehensive manner that will help you understand the basics of CA and be prepared for further research. They illustrate the matrix algebraic tools that characterize group CA and help develop its applications in the field of VLSI testing.
The text examines schemes based on easily testable FSM, bit-error correcting code, byte error correcting code, and characterization of 2D cellular automata. In addition, it looks into CA-based universal pattern generation, data encryption, and synthesis of easily testable combinational logic. The book covers new characterizations of group CA behavior, CA-based tools for fault diagnosis, and a wide variety of applications to solve real-life problems.
Table of Contents:
PREFACE.
1 INTRODUCTION.
1.1 Cellular Automata Applications.
1.2 Overview of the Book.
2 CA AND ITS APPLICATIONS: A BRIEF SURVEY.
2.1 Introduction.
2.2 Initial Phase of Development.
2.3 CA-Based Models.
2.3.1 CA as Parallel Language Recognizer.
2.3.2 Biological Applications of CA.
2.3.3 CA as Parallel and Image Processing Systems.
2.4 New Phase of Development.
2.4.1 Polynomial Algebraic Characterization of CA Behavior.
2.4.2 Matrix Algebraic Characterization of CA.
2.5 Other Developments Under the New Phase of Activities.
2.5.1 Probabilistic Analysis of CA Behavior.
2.5.2 CA-Based Models for Physical Systems.
2.5.3 CA Machines (CAMs).
2.5.4 Fractional Dimensions in CA.
2.6 Consolidation in the VLSI Era.
2.6.1 Pseudorandom Pattern Generation.
2.6.2 Pseudoexhaustive Test Pattern Generation.
2.6.3 Deterministic Test Pattern Generation.
2.6.4 Signature Analysis.
2.6.5 CALBO (Cellular Automata Logic Block Observer).
2.6.6 Error Correcting Codes.
2.6.7 Low-Cost Associative Memory.
2.6.8 Finite-State Machine (FSM) Synthesis.
2.6.9 Synthesis of Easily Testable Combinational Logic.
2.6.10 Mod-p Multiplier.
2.6.11 Pattern Classification.
2.6.12 General and Perfect Hashing.
2.6.13 Design of a CA-Based Cipher System.
2.6.14 Modeling Amino Acid and Protein Chain.
2.7 Summary.
3 GROUP CA CHARACTERIZATION.
3.1 Introduction.
3.2 Characterization of the State-Transition Behavior.
3.3 Group Properties of CA.
3.3.1 Cycle Set Characterization of Group CA.
3.3.2 Characterization of Group CA with Inverse State-Transition Function.
3.3.3 Correlation of Length of a CA and a Group Rule.
3.3.4 Isomorphism between a CA and an LFSR Generating Exhaustive Pattern.
3.4 A Class of Null Boundary Group CA.
3.5 Group Properties of Periodic Boundary CA (PBCA) with Rules 90 and 150.
3.6 Analysis of Intermediate Boundary CA (IBCA).
3.6.1 Maximum-Length IBCA Configurations.
3.7 Phase Shift of PN-Sequences Generated by CA.
3.8 Programmable CA (PCA).
3.9 Summary.
4 CHARACTERIZATION OF NONGROUP CA.
4.1 Introduction.
4.2 General Characterization of Linear Nongroup CA.
4.2.1 Uniformity of the Tree-Structure in the State-Transition Diagram of a Linear Nongroup CA.
4.2.2 Characterization of Cyclic States.
4.2.3 Characterization of States in a Tree.
4.2.4 Characterization of States in an -Tree ( 6D0).
4.3 Characterization of Linear Multiple-Attractor Cellular Automata.
4.3.1 Construction of Multiple-Attractor CA (MACA).
4.4 Characterization of Complemented Additive CA.
4.4.1 General Characterization of Cyclic Behavior.
4.5 Behavior of Complemented CA Derived from Multiple-Attractor Linear CA.
4.5.1 An Acyclic State as the Complement Vector.
4.5.2 A Nonzero Attractor as the Complement Vector.
4.6 Characterization of D1*CA.
4.7 Summary.
5 CA AS A UNIVERSAL PATTERN GENERATOR.
5.1 Introduction.
5.2 Pseudoexhaustive Pattern Generation.
5.2.1 Analysis of PN Sequences Generated by a Primitive Polynomial.
5.2.2 Vector Space Theoretic Characterization.
5.2.3 Identification of n;m/Code Space and Exhaustive Pattern Generation by an m-Space.
5.2.4 CA as Pseudoexhaustive Test Pattern Generator.
5.3 On-Chip Deterministic Test Pattern Generation.
5.3.1 Overview of the Scheme.
5.3.2 Selection of a Primitive Polynomial.
5.3.3 Selection of CA/LFSR Structures.
5.3.4 Generation of Test Patterns with Multiple Seeds.
5.4 Exhaustive Two-and Three-Pattern Generation Capability of a CA.
5.4.1 Generation of Two-Pattern Test Vectors.
5.4.2 Generation of Three-Pattern Test Vectors.
5.4.3 90=150 CA as Exhaustive Two-/Three-Pattern Generator.
5.4.4 CA Selection Strategy for Generation of a Given -Pattern Set.
5.4.5 Experimental Results.
5.5 Summary.
6 CA-BASED ERROR CORRECTING CODE.
6.1 Introduction.
6.2 Review of Error Correcting Codes.
6.2.1 Bit Error Correcting/Detecting Codes.
6.2.2 Byte Error Detecting/Correcting Codes.
6.3 Design of Random Bit Error Correcting Codes.
6.3.1 CA-Based Error Correcting Code (CAECC).
6.3.2 Decoding of CA-Based Error Correcting Code.
6.3.3 Complexity Analysis.
6.4 CA-Based Byte Error Correcting Code.
6.4.1 Generation of CA-SbEC-DbED Code.
6.4.2 Decoding Scheme.
6.4.3 Generation of CA-DbEL/DbEC Code.
6.4.4 Implementation--Design of DbEL Cell.
6.4.5 General Design Methodology.
6.4.6 t-Byte Error Locating Code.
6.4.7 Reduction of Decoding Time.
6.5 CA Array-Based Diagnosis of Board-Level Faults.
6.5.1 Board-Level Fault Diagnosis Using Cellular Automata Array.
6.5.2 Encoding Output Responses of the Chips for Space Compression.
6.5.3 Time Compression of Check Symbols.
6.5.4 Syndrome Generation.
6.5.5 Detecting the t Number of Faulty Chips out of N Chips.
6.5.6 Performance.
6.6 Summary.
7 DESIGN OF CA-BASED CIPHER SYSTEM.
7.1 Introduction.
7.1.1 Permutation Groups.
7.2 Permutation Representation of CA States.
7.2.1 Permutation Representation of CA Having Equal Cycles of Even Length.
7.3 Definition of Fundamental Transformations.
7.4 PCA-Based Block Cipher Scheme.
7.4.1 Number of Enciphering Functions.
7.5 Stream Cipher Strategy.
7.5.1 Key Stream Generators.
7.5.2 PCA-Based Stream Cipher Scheme.
7.6 Invulnerability of the Scheme.
7.6.1 Block Ciphers.
7.6.2 Stream Ciphers.
7.7 Summary.
8 GENERATION OF HASHING FUNCTIONS.
8.1 Introduction.
8.2 CA-Based Scheme for General Hashing.
8.2.1 Analysis of CA-Based Hashing Scheme.
8.2.2 Implementation and Experimental Results.
8.3 Perfect Hashing.
8.4 TPSA CA-Based Perfect Hashing Scheme.
8.4.1 CA-Based Perfect Hashing.
8.5 Performance Evaluation of CA-Based Perfect Hashing Scheme.
8.5.1 Performance Evaluation.
8.6 Summary.
9 CA-BASED TESTABLE LOGIC SYNTHESIS.
9.1 Introduction.
9.2 Extended Characterization of D1*CA.
9.3 Synthesis of Testable FSM.
9.3.1 State Encoding Strategy.
9.3.2 Testing Scheme.
9.3.3 Fault Coverage.
9.3.4 Experimental Results.
9.3.5 Comparison of Test Time and Design Effort.
9.4 BIST Structure for Testing Combinational Logic.
9.4.1 New Results on D1*CA Behavior.
9.5 CA-Based Distributed BIST.
9.6 Test Methodology.
9.6.1 Test Procedure.
9.6.2 Discussions on Fault Coverage.
9.7 Experimental Results.
9.7.1 Test Parallelism and Fault Diagnosis.
9.8 Summary.
10 THEORY AND APPLICATION OF TWO-DIMENSIONAL CA.
10.1 Introduction.
10.2 Introduction to Two-Dimensional Cellular Automata.
10.2.1 Basic Concepts.
10.2.2 Partitioning of the T Matrix.
10.2.3 Characterization of 2-D CA.
10.2.4 Cycle Length for RVN CA.
10.2.5 Calculation of Depth and Cycle Length for Nongroup RVN CA.
10.3 Parallel PRPG Using 2-D CA.
10.3.1 Generating Test Patterns of Any Desired Length.
10.3.2 Applications of 2-D CA as a BIST Structure.
10.3.3 Pseudorandom Testing of Combinational Logic Circuits.
10.4 Design of Pseudoassociative Memory Using Cellular Automata.
10.4.1 CA-Based Hashing Scheme.
10.4.2 The Hardware for Pseudoassociative Memory.
10.4.3 Simulation Results.
10.4.4 Estimation of Worst-Case Performance.
10.4.5 Design of a Pseudoassociative Memory Chip.
10.5 Summary.
BIBLIOGRAPHY.
INDEX.
ABOUT THE AUTHORS.
商品描述(中文翻譯)
描述：
本書提供了有關細胞自動機（CA）理論重要發展的廣泛調查和報告。作者以全面的方式介紹這一理論，幫助讀者理解CA的基本概念，並為進一步研究做好準備。他們展示了特徵化群體CA的矩陣代數工具，並幫助發展其在VLSI測試領域的應用。
本書探討了基於易於測試的有限狀態機（FSM）、位元錯誤修正碼、位元組錯誤修正碼以及2D細胞自動機特徵化的方案。此外，還研究了基於CA的通用模式生成、數據加密和易於測試的組合邏輯合成。書中涵蓋了群體CA行為的新特徵、基於CA的故障診斷工具，以及各種應用以解決現實生活中的問題。
目錄：
前言
1 引言
1.1 細胞自動機的應用
1.2 本書概述
2 CA及其應用：簡要調查
2.1 引言
2.2 發展的初始階段
2.3 基於CA的模型
2.3.1 CA作為並行語言識別器
2.3.2 CA的生物應用
2.3.3 CA作為並行和圖像處理系統
2.4 新的發展階段
2.4.1 CA行為的多項式代數特徵化
2.4.2 CA的矩陣代數特徵化
2.5 新階段活動下的其他發展
2.5.1 CA行為的概率分析
2.5.2 用於物理系統的基於CA的模型
2.5.3 CA機器（CAMs）
2.5.4 CA中的分數維度
2.6 VLSI時代的整合
2.6.1 假隨機模式生成
2.6.2 假全測試模式生成
2.6.3 確定性測試模式生成
2.6.4 簽名分析
2.6.5 CALBO（細胞自動機邏輯塊觀察器）
2.6.6 錯誤修正碼
2.6.7 低成本聯想記憶體
2.6.8 有限狀態機（FSM）合成
2.6.9 易於測試的組合邏輯合成
