宇航学报

宇航学报 ›› 2012, Vol. 33 ›› Issue (11): 1654-1659.doi: 10.3873/j.issn.1000-1328.2012.11.014

• 电子信息 • 上一篇    下一篇

基于组合矩阵的精确修复MDS编码

陈勇1,2,3, 武国强1,2,3, 林宝军1   

  1. 1. 中国科学院光电研究院，北京 100190；2. 北京国科环宇空间技术有限公司，北京 100190；
    3. 中国科学院研究生院，北京 100190
  • 收稿日期:2011-11-15 修回日期:2012-03-26 出版日期:2012-11-15 发布日期:2012-12-05
  • 作者简介:10001328（2012）11165406
  • 基金资助:
    国家高科技发展计划资助（2008AA12A221）

Exact Repair MDS Code Construction Using Compound Matrix

CHEN Yong1,2,3, WU Guo   

  1. 1. The Academy of OPTO\|Electronics, Chinese Academy of Sciences, Beijing 100190, China； 2. Beijing Transuniverse Space Technology Limited Company, Beijing, 100190, China； 3. Graduate University of Chinese Academy of Science, Chinese Academy of Sciences, Beijing 100049, China
  • Received:2011-11-15 Revised:2012-03-26 Online:2012-11-15 Published:2012-12-05

PDF

729

摘要： 针对分布式存储系统中精确修复故障节点数据的问题，构造了一类最小存储再生编码。本文利用线性无关矢量以及分块矩阵构造了编码的生成矩阵。所有编解码运算都属于GF(2)域，编码后的数据混合存放在存储节点中。采用该编码的存储系统，能够仅经过2k个基本异或运算精确修复任意单节点故障。修复故障的最小带宽为M×(k+1)/n，且在系统正常工作时，能够为单用户提供最高n×B的可用带宽。与其它最小存储再生码相比，编码矩阵简单，解码计算量较小，为用户提供较高的可用带宽。

关键词: 组合矩阵, 精确修复, 最大距离可分码, 分布式存储

Abstract: A kind of minimum storage regenerating (MSR) code is constructed in this paper for
exact\|repair error node in the distributed storage systems. The generation matrix is built by using the compound\|matrix and the linear independent vectors. The system data and the redundancy data are mixed and stored in each storage node. All the operations of the encoding and the decoding are belong to the GF(2). Only after 2k basic XOR operations, the storage system can be exactly repaired for single node’s error with the minimum bandwidth of M×(k+1)/n, and it can provide the maximum bandwidth of n×B for the single user in the normal conditions. Compared with the other MSR codes, the codes proposed by the paper have more straight forward structure and less decoding operation, and it can provide the most available bandwidth for users.

Key words: Compound matrix, Exact-repair, MDS code, Distributed storage

中图分类号: