Paper Info
Title
Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching
Abstract
The crosstalk effect is one of the main problems in deep submicron designs of high-speed buses. To mitigate the crosstalk effect, there are several types of crosstalk avoidance codes proposed in the literature. In this paper, we are particularly interested in generating forbidden transition codes that do not have opposite transitions on any two adjacent wires. For this, we propose a sequential bit-stuffing algorithm and a parallel bit-stuffing algorithm. For the sequential bitstuffing algorithm, we perform a worst-case analysis and a probabilistic analysis. We show by both theoretic analysis and simulations that the coding rate of the sequential bit-stuffing encoding scheme is quite close to the Shannon capacity. In particular, for a bus with n = 10 parallel wires, the difference is only 2.2%. Using a Markov chain analysis, we show that the coding rate of the parallel bit-stuffing algorithm is only slightly lower than that of the sequential bit-stuffing algorithm. The implementation complexity of the parallel bit-stuffing algorithm is linear with n. In comparison with the existing forbidden transition codes that use the Fibonacci representation in the literature, our bit-stuffing algorithms not only achieve higher coding rates but also have much lower implementation complexity.
Year
DOI
Venue
2015
10.1109/TC.2015.2409862
IEEE Transactions on Computers
Keywords
Field
DocType
Bit-stuffing, high-speed switching, bus encoding, crosstalk
Bit stuffing,Algorithm design,Code rate,Computer science,Markov chain,Algorithm,Real-time computing,Probabilistic analysis of algorithms,Decoding methods,Channel capacity,Bus encoding
Journal
Volume
Issue
ISSN
PP
99
0018-9340
Citations 
PageRank 
References 
3
0.40
17
Authors
6
Name
Order
Citations
PageRank
Cheng-Shang Chang12392246.97
Jay Cheng215314.40
Tien-Ke Huang3212.98
Xuan-Chao Huang461.87
Duan-Shin Lee567071.00
Chao-Yi Chen630.40