Theoretical analysis of bus-invert coding

Abstract

Absfruct-Exact formulas to compute the switching activities of the invert line and each bus line for both even and odd bus widths are presented. This enables us to understand the finite and asymptotic behaviors of the bus-invert coding process. It is found that the previous published theoretical results form only a subset of our contributions.

Coupling Reduction Analysis of Bus-Invert Coding

“…The main theoretical results included some closed-form formulas for computing the number of couplings on a partitioned and a non-partitioned bus. Using these results along with those presented in [23], we could obtain the following facts:…”

“…Here we investigate Hamming-distance-based (HDB) and weight-based (WB) bus-invert methods [23]. We assume that the invert line is numbered as line n and placed next to line 1 − n .…”

“…Otherwise, the data value is unchanged and the invert line is set to zero. To facilitate our discussion, some results from [23] for HDB are given below. For even bus width n:…”

“…The WB approach [23] works essentially the same as the HDB approach except that the weight of the next data value, which is the number of 1's on the next data value, is used to decide whether a data value should be inverted before transmission.…”

“…Bus-invert coding was first proposed by Fletcher [1], later elaborated by Stan and Burleson [2,3], and recently theoretically analyzed by Lin and Tsai [23]. The previous analysis performed by Lin and Tsai mainly focuses on switching activity and weight reduction.…”