On low-power error-correcting cooling codes with large distances
Preprint
Abstract
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power consumption of on-chip buses, and error-correction for the transmitted information, simultaneously. Specifically, an $(n, t, w, e)$-LPECC code is a coding scheme over $n$ wires that avoids state transitions on the $t$ hottest wires and allows at most $w$ state transitions in each transmission, and can correct up to $e$ transmission errors. In this paper, we study the maximum possible size of an $(n, t, w, e)$-LPECC code, denoted by $C(n,t,w,e)$. When $w=e+2$ is large, we establish a general upper bound $C(n,t,w,w-2)\leq \lfloor \binom{n+1}{2}/\binom{w+t}{2}\rfloor$; when $w=e+2=3$, we prove $C(n,t,3,1) \leq \lfloor \frac{n(n+1)}{6(t+1)}\rfloor$. Both bounds are tight for large $n$ satisfying some divisibility conditions. Previously, tight bounds were known only for $w=e+2=3,4$ and $t\leq 2$. In general, when $w=e+d$ is large for a constant $d$, we determine the asymptotic value of $C(n,t,w,w-d)\sim \binom{n}{d}/\binom{w+t}{d}$ as $n$ goes to infinity, which can be extended to $q$-ary codes.
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Approximate generalized Steiner systems and near-optimal constant weight codesJournal of Combinatorial Theory, Series A, 2024
- Cooling Codes: Thermal-Management Coding for High-Performance InterconnectsIEEE Transactions on Information Theory, 2017
- Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition CodesIEEE Transactions on Information Theory, 2009
- On-chip bus thermal analysis and optimisationIET Computers & Digital Techniques, 2007
- Constructions for $q$-Ary Constant-Weight CodesIEEE Transactions on Information Theory, 2006
- Bus energy reduction by transition pattern coding using a detailed deep submicrometer bus modelIEEE Transactions on Circuits and Systems I: Regular Papers, 2003
- Covering and independence in triangle structuresDiscrete Mathematics, 1996
- An existence theory for pairwise balanced designs, III: Proof of the existence conjecturesJournal of Combinatorial Theory, Series A, 1975
- An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjecturesJournal of Combinatorial Theory, Series A, 1972
- An existence theory for pairwise balanced designs I. Composition theorems and morphismsJournal of Combinatorial Theory, Series A, 1972