In this work, a coding theory approach to error control in redundant residue number systems is presented. We introduce the concepts of Hamming weight, minimum distance, weight distribution, and error detection and correction capabilities in redundant residue number systems. The necessary and sufficient conditions for the desired error control capability are derived from the minimum distance point of view. Closed-form expressions are derived for approximate weight distributions. Finally, computationally efficient procedures are described for correcting single errors. This paper is in two parts. In Part I, a coding theory framework is developed for redundant residue number systems, and an efficient numerical procedure is derived for a single error correction. Part I1 will deal with the extension of this framework and algorithms for correcting multiple errors and simultaneous error correction and detection.

No abstract

No abstract

In circuit simulation, Relaxation-based algorithms have been proven to be faster and more flexible than the standard direct approach used in SPICE. ITA (Iterated Timing Analysis) algorithm has even been widely used in industry. This paper describes accelerating techniques that enable ITA to utilize circuits' multi-rate behaviors. These techniques are based on the latency property of subcircuits and the Strength of Signal Flow (SSF) between subcircuits. A more powerful technique using both latency and SSF is also proposed. Experimental examples are given to justify the superior properties of proposed methods.