Delay-Insensitive, Point-to-Point Interconnect Using M-of-N Codes
نویسندگان
چکیده
m-of-n codes can be used for carrying data over selftimed on-chip interconnect links. Such codes can be chosen to have low redundancy, but the costs of encoding/decoding data is high. The key to enabling the cost-effective use of m-of-n codes is to find a suitable mapping of the binary data to the code. This paper presents a new method for selecting suitable mappings through the decomposition of the complex m-of-n code into an incomplete m-of-n code constructed from groups of smaller, simpler m-of-n and 1-of-n codes. The circuits used both for completion detection and for encoding/decoding such incomplete codes show reduced logic size and delay compared to their full m-of-n counterparts. The improvements mean that the incomplete m-of-n codes become attractive for use in on-chip interconnects and network-on-chip designs.
منابع مشابه
Delay Insensitive System-on-Chip Interconnect using 1-of-4 Data Encoding
The demands of System-on-Chip (SoC) interconnect increasingly cannot be satisjed through the use of a shared bus. A common alternative, using unidirectional, point-to-point connections and multiplexers, results in much greater area requirements and still suffersfrom some of the same problems. This paper introduces a delay-insensitive, asynchronous approach to interconnect over long paths using ...
متن کاملUncountably many bounded positive solutions for a second order nonlinear neutral delay partial difference equation
In this paper we consider the second order nonlinear neutral delay partial difference equation $Delta_nDelta_mbig(x_{m,n}+a_{m,n}x_{m-k,n-l}big)+ fbig(m,n,x_{m-tau,n-sigma}big)=b_{m,n}, mgeq m_{0},, ngeq n_{0}.$Under suitable conditions, by making use of the Banach fixed point theorem, we show the existence of uncountably many bounded positive solutions for the above partial difference equation...
متن کاملCalculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملFast High - Order Variation - Aware Ic Interconnect Analysis
Fast High-Order Variation-Aware IC Interconnect Analysis. (August 2007) Xiaoji Ye, B.E., Wuhan University Chair of Advisory Committee: Dr. Peng Li Interconnects constitute a dominant source of circuit delay for modern chip designs. The variations of critical dimensions in modern VLSI technologies lead to variability in interconnect performance that must be fully accounted for in timing verifica...
متن کاملPositive solutions of $n$th-order $m$-point boundary value problems
In this paper, by using four functionals fixed point theorem, we obtain sufficient conditions for the existence of at least one positive solution of an $n$th-order $m$-point boundary value problem. As an application, we give an example to demonstrate our main result.
متن کامل