Bounds on Asymptotic Rate of Capacitive Crosstalk Avoidance Codes for On-chip Buses

TL;DR

This paper analyzes the maximum achievable rate of capacitive crosstalk avoidance codes for on-chip buses by relating it to the subgraph domatic number, providing bounds and a specific rate example.

Contribution

It establishes a theoretical connection between crosstalk avoidance code rates and the subgraph domatic number, deriving bounds and an achievable rate.

Findings

Maximum rate equals subgraph domatic number of transition free graph

Derived lower and upper bounds on asymptotic rate

Achieved rate of 0.8325 for (10,01)-transition free sequences

Abstract

In order to prevent the capacitive crosstalk in on-chip buses, several types of capacitive crosstalk avoidance codes have been devised. These codes are designed to prohibit transition patterns prone to the capacity crosstalk from any consecutive two words transmitted to on-chip buses. This paper provides a rigorous analysis on the asymptotic rate of (p,q)-transition free word sequences under the assumption that coding is based on a pair of a stateful encoder and a stateless decoder. The symbols p and q represent k-bit transition patterns that should not be appeared in any consecutive two words at the same adjacent k-bit positions. It is proved that the maximum rate of the sequences equals to the subgraph domatic number of (p,q)-transition free graph. Based on the theoretical results on the subgraph domatic partition problem, a pair of lower and upper bounds on the asymptotic rate is derived. We also present that the asymptotic rate 0.8325 is achievable for the (10,01)-transition free word sequences.