TY - GEN
T1 - Two-tone Shift-XOR Storage Codes
AU - Fu, Ximing
AU - Wu, Chenhao
AU - Guo, Yuanxin
AU - Yang, Shenghao
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
N2 - Storage codes using shift and XOR operations have been studied to achieve lower encoding and decoding computation costs, compared with the codes using large finite field operations. In this paper, we introduce a new class of shift-XOR codes using two-tone generator matrices, which generalize the existing increasing-difference generator matrices. Compared with the latter, our codes only have 1/3 to 1/2 storage overhead for practical cases, and have a decoding algorithm that preserves the desired properties. For two-tone shift-XOR codes, the reflected Vandermonde matrices achieve the smallest storage overhead; and for increasing-difference shift-XOR codes, the Vandermonde matrices achieve the smallest storage overhead. To verify the practical performance, we implement two-tone shift-XOR storage codes using C++ and compare the encoding/decoding throughput with the state-of-the-art implementation of Reed-Solomon codes. For certain practical cases, our codes can achieve from 50% to 100% higher encoding/decoding throughput than that of Reed-Solomon codes.
AB - Storage codes using shift and XOR operations have been studied to achieve lower encoding and decoding computation costs, compared with the codes using large finite field operations. In this paper, we introduce a new class of shift-XOR codes using two-tone generator matrices, which generalize the existing increasing-difference generator matrices. Compared with the latter, our codes only have 1/3 to 1/2 storage overhead for practical cases, and have a decoding algorithm that preserves the desired properties. For two-tone shift-XOR codes, the reflected Vandermonde matrices achieve the smallest storage overhead; and for increasing-difference shift-XOR codes, the Vandermonde matrices achieve the smallest storage overhead. To verify the practical performance, we implement two-tone shift-XOR storage codes using C++ and compare the encoding/decoding throughput with the state-of-the-art implementation of Reed-Solomon codes. For certain practical cases, our codes can achieve from 50% to 100% higher encoding/decoding throughput than that of Reed-Solomon codes.
UR - https://www.scopus.com/pages/publications/85115065312
U2 - 10.1109/ISIT45174.2021.9518205
DO - 10.1109/ISIT45174.2021.9518205
M3 - 会议稿件
AN - SCOPUS:85115065312
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2996
EP - 3001
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
Y2 - 12 July 2021 through 20 July 2021
ER -