Researches on the Design of Highly Reliable High-Speed Arithmetic Circuits with Redundant Coding

点击翻译按钮获取中文摘要

We conducted researches for the design of highly reliable high-speed arithmetic circuits with redundant coding.For (1) hardware algorithms for arithmetic operations with redundant coding and fault torelant design of circuits based on them and.(2) design verification of circuits and test generation, we got the following research results:1. We designed an on-line error-detectable fast array divider based on a division algorithm with a redundant binary representation and a residue code which we had previously proposed.2. We proposed a fast hardware algorithm for modular multiplication with a redundant representation. Modular multiplication with a large modulus is widely used in public key cryptosystems.3. We clarified various properties of the redundancy of a redundant binary representation.4. We proposed a time-symbolic simulation method as a new method for timing verification of logic circuits. We also implemented a simulator based on the method and a result analysis system.5. We designed an algorithm for satisfiability problems of regular temporal logic, which we had proposed before for formal verification.6. We presented a dynamic two-dimensional parallel method for fast fault simulation using a vector processor and implemented a fault simulator based on the method. We also presented a test pattern generation method using random patterns and implemented a program based on the method.7. We showed an efficient method for locally exhaustive testing of combinational circuits using linear logic circuits.We also researched on a method for generating prime implicants of logic functions, a representation method for logic functions and a hardware design language and got some results.