Low-Power Cooling Codes With Efficient Encoding and Decoding

DOI10.1109/TIT.2020.2977871MaRDI QIDQ5124465zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.09535

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: A class of low-power cooling (LPC) codes, to control simultaneously both the peak temperature and the average power consumption of interconnects, was 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) limits 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. The efficiency of the encoding/decoding for the constructed LPC codes depends on the efficiency of the decoding/encoding for the related cooling codes and the ones for the mapping.

Cited in

(2)

• Combinatorial constructions of optimal low-power error-correcting cooling codes
• Domination mappings into the Hamming ball: existence, constructions, and algorithms

This page was built for publication: Low-Power Cooling Codes With Efficient Encoding and Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124465)