Matrix analysis
Elements of information theory
Elements of information theory
Adventures in stochastic processes
Adventures in stochastic processes
Bus encoding to prevent crosstalk delay
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Formulae and applications of interconnect estimation considering shield insertion and net ordering
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Interconnect modeling and optimization in deep sub-micron technologies
Interconnect modeling and optimization in deep sub-micron technologies
Preventing Crosstalk Delay using Fibonacci Representation
VLSID '04 Proceedings of the 17th International Conference on VLSI Design
Computer Networks, Fourth Edition: A Systems Approach
Computer Networks, Fourth Edition: A Systems Approach
Forbidden transition free crosstalk avoidance CODEC design
Proceedings of the 45th annual Design Automation Conference
Coding for system-on-chip networks: a unified framework
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On codes that avoid specified differences
IEEE Transactions on Information Theory
Improved bit-stuffing bounds on two-dimensional constraints
IEEE Transactions on Information Theory
A Bus-Encoding Scheme for Crosstalk Elimination in High-Performance Processor Design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Motivated by the design of high speed switching fabrics, in this paper we propose a bit-stuffing algorithm for generating forbidden transition codes to mitigate the crosstalk effect between adjacent wires in long on-chip buses. We first model a bus with forbidden transition constraints as a forbidden transition channel, and derive the Shannon capacity of such a channel. Then we perform a worst case analysis and a probabilistic analysis for the bit-stuffing algorithm. We show by both theoretic analysis and simulations that the coding rate of the bit stuffing encoding scheme for independent and identically distributed (i.i.d.) Bernoulli input traffic is quite close to the Shannon capacity, and hence is much better than those of the existing forbidden transition codes in the literature, including the Fibonacci representation.