Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Includes bibliographical references (pages 153-160) and index.

12. References on index generation functions -- 12.1. Reduction of variables -- 12.2. Realization with multiple IGUs -- 12.3. Decomposition -- 12.4. Analysis -- 12.5. Architecture -- 12.6. Applications -- 12.7. Survey -- 12.8. Miscellaneous -- 13. Conclusions.

1. Introduction -- 1.1. Motivation -- 1.2. Organization of the book

2. Applications -- 2.1. IP address table -- 2.2. Terminal access controller -- 2.3. URL list -- 2.4. Computer virus scanning circuit -- 2.5. Memory patch circuit -- 2.6. List of English words -- 2.7. Code converter -- 2.8. Remarks

3. Definitions and basic properties -- 3.1. Logic functions -- 3.2. Functional decomposition -- 3.3. Symmetric functions -- 3.4. Linear functions -- 3.5. Constant-weight code -- 3.6. Euler’s number e and its property -- 3.7. Remarks -- 3.8. Exercises

4. Index generation functions and their realizations -- 4.1. Index generation function -- 4.2. LUT cascade realization -- 4.3. Index generation unit (IGU) -- 4.4 Remarks -- 4.5. Exercises

5. Minimization of primitive variables -- 5.1. Minimization algorithm -- 5.2. Detection of essential variables -- 5.3. Random index generation functions -- 5.4. Remarks -- 5.5. Exercises

6. Linear transformations of input variables -- 6.1. Linear decomposition -- 6.2. Reduction by linear transformations -- 6.3. Heuristic method to find linear transformations -- 6.4. Experimental results -- 6.5. Remarks -- 6.6. Exercises

7. Iterative reduction of compound variables -- 7.1. Improved upper bound -- 7.2. Illustrative examples -- 7.3. Iterative method to reduce compound variables -- 7.4. Comparison of minimization methods -- 7.5. Remarks -- 7.6. Exercises

8. Irreducible index generation function -- 8.1. Irreducible index generation function -- 8.2. Minimum-weight irreducible index generation functions -- 8.3. Normal minimum-weight irreducible index generation functions -- 8.4. Remarks -- 8.5. Exercises

9. SAT-based method to find linear transformations -- 9.1. Sat-based formulation -- 9.2. Reduction of search space for general functions -- 9.3. Reduction of search space for cf-symmetric functions -- 9.4. Experimental results -- 9.5. Remarks -- 9.6. Exercises

10. Statistical approach -- 10.1. Hash function -- 10.2. Number of vectors realized by main memory -- 10.3. Hybrid method -- 10.4. Super hybrid method -- 10.5. Parallel sieve method -- 10.6. Remarks -- 10.7. Exercises

11. Realization using four IGUs -- 11.1. Realization using four IGUs -- 11.2. Selection of linear transformations -- 11.3. Experimental results -- 11.4. Remarks

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

Index generation functions are binary-input integer valued functions. They represent functions of content addressable memories (CAMs). Applications include: IP address tables; terminal controllers; URL lists; computer virus scanning circuits; memory patch circuits; list of English words; code converters; and pattern matching circuits. This book shows memory-based realization of index generation functions. It shows: 1. methods to implement index generation functions by look-up table (LUT) cascades and index generation units (IGU), 2. methods to reduce the number of variables using linear transformations, and 3. methods to estimate the sizes of memories, with many illustrations, tables, examples, exercises, and their solutions.

Also available in print.

Title from PDF title page (viewed on October 27, 2019).