Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical c...Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a "sub-code nesting framework" to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.展开更多
Compressed Sensing (CS) is an emerging technology in the field of signal processing, which can recover a sparse signal by taking very few samples and solving a linear programming problem. In this paper, we study the a...Compressed Sensing (CS) is an emerging technology in the field of signal processing, which can recover a sparse signal by taking very few samples and solving a linear programming problem. In this paper, we study the application of Low-Density Parity-Check (LDPC) Codes in CS. Firstly, we find a sufficient condition for a binary matrix to satisfy the Restricted Isometric Property (RIP). Then, by employing the LDPC codes based on Berlekamp-Justesen (B-J) codes, we construct two classes of binary structured matrices and show that these matrices satisfy RIP. Thus, the proposed matrices could be used as sensing matrices for CS. Finally, simulation results show that the performance of the proposed matrices can be comparable with the widely used random sensing matrices.展开更多
基金Supported by 973 Project of China (No. 2012CB315803)Research Fund for the Doctoral Program of Higher Education of China (No. 20100002110033)Open research Fund of National Mobile Communications Research Laboratory, Southeast University (No. 2011D11)
文摘Erasure code is widely used as the redundancy scheme in distributed storage system. When a storage node fails, the repair process often requires to transfer a large amount of data. Regenerating code and hierarchical code are two classes of codes proposed to reduce the repair bandwidth cost. Regenerating codes reduce the amount of data transferred by each helping node, while hierarchical codes reduce the number of nodes participating in the repair process. In this paper, we propose a "sub-code nesting framework" to combine them together. The resulting regenerating hierarchical code has low repair degree as hierarchical code and lower repair cost than hierarchical code. Our code can achieve exact regeneration of the failed node, and has the additional property of low updating complexity.
基金Supported by the NSFC project (No. 60972011)the Research Fund for the Doctoral Program of Higher Education of China (No. 20100002110033)the open research fund of National Mobile Communications Research Laboratory of Southeast University (No. 2011D11)
文摘Compressed Sensing (CS) is an emerging technology in the field of signal processing, which can recover a sparse signal by taking very few samples and solving a linear programming problem. In this paper, we study the application of Low-Density Parity-Check (LDPC) Codes in CS. Firstly, we find a sufficient condition for a binary matrix to satisfy the Restricted Isometric Property (RIP). Then, by employing the LDPC codes based on Berlekamp-Justesen (B-J) codes, we construct two classes of binary structured matrices and show that these matrices satisfy RIP. Thus, the proposed matrices could be used as sensing matrices for CS. Finally, simulation results show that the performance of the proposed matrices can be comparable with the widely used random sensing matrices.