TY - GEN
T1 - Low-Power Cooling Codes with Efficient Encoding and Decoding
AU - Chee, Yeow Meng
AU - Etzion, Tuvi
AU - Kiah, Han Mao
AU - Vardy, Alexander
AU - Wei, Hengjia
N1 - Funding Information:
Note that Construction 4 can be viewed as a modification of the Concatenation construction (See Proposition 7). Construction 4 has an advantage on the Concatenation of Proposition 7 and other constructions with larger size for the same weight w and where the number of hottest wires is t. A complete analysis and comparison between all the constructions will be given in the full version of this paper. ACKNOWLEDGMENT Y. M. Chee was supported in part by the Singapore Ministry of Education under grant MOE2017-T3-1-007. T. Etzion was supported in part by the BSF-NSF grant 2016692 Binational Science Foundation (BSF), Jerusalem, Israel, under Grant 2012016. The research of T. Etzion and A. Vardy was supported in part by the National Science Foundation under grant CCF-1719139. The research of Y. M. Chee, H. M. Kiah and H. Wei was supported in part by the Singapore Ministry of Education under grant MOE2015-T2-2-086.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85052446459&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437451
DO - 10.1109/ISIT.2018.8437451
M3 - Conference contribution
AN - SCOPUS:85052446459
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1655
EP - 1659
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -