Low-Power Cooling Codes with Efficient Encoding and Decoding

A class of low-power cooling (LPC) codes, to control simultaneously both the peak temperature and the average power consumption of interconnects, were introduced recently. An (n, t, $w$)-LPC code is a coding scheme over $n$ wires that (A) avoids state transitions on the $t$ hottest wires (cooling), and (B) limit the number of transitions to $w$ in each transmission (low-power). A few constructions for large LPC codes that have efficient encoding and decoding schemes, are given. In particular, when $w$ is fixed, we construct LPC codes of size $(n/w)^{w-1}$ and show that these LPC codes can be modified to correct errors efficiently. We further present a construction for large LPC codes based on a mapping from cooling codes to LPC codes.

[1]  Zhen Zhang,et al.  Bounds on the sizes of constant weight covering codes , 1995, Des. Codes Cryptogr..

[2]  Alan Hartman,et al.  Towards a Large Set of Steiner Quadruple Systems , 1991, SIAM J. Discret. Math..

[3]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[4]  Alexander Vardy,et al.  Cooling Codes: Thermal-Management Coding for High-Performance Interconnects , 2017, IEEE Transactions on Information Theory.

[5]  Narsingh Deo,et al.  1 On One-factorization of Complete 3-Uniform Hypergraphs , 2003 .

[6]  Alexander Vardy,et al.  Domination mappings into the hamming ball: Existence, constructions, and algorithms , 2021, Advances in Mathematics of Communications.

[7]  Alexander Vardy,et al.  Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Alexander Sidorenko,et al.  What we know and what we do not know about Turán numbers , 1995, Graphs Comb..

[9]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[10]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[11]  Alexander Vardy,et al.  The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.

[12]  Alexander Vardy,et al.  Low-Power Cooling Codes With Efficient Encoding and Decoding , 2020, IEEE Transactions on Information Theory.

[13]  Tuvi Etzion,et al.  New lower bounds for constant weight codes , 1989, IEEE Trans. Inf. Theory.

[14]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[15]  Eitan Yaakobi,et al.  Explicit constructions of finite-length WOM codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).