This paper presents a data redundancy method for distributed storage by applying Erasure code to storage system. The method involves some key technologies such as data read and written, failure detection and node redirection, and restoration algorithms. According to the theoretical analysis, this method can efficiently improve the use ratio of storage space as well as enhance reliability and availability for a storage system. Also, it can obtain the same availability of data at the cost of lower redundancy degree compared with many others storage methods. The quantitative analysis of this method’s performance is also given in the paper.
KEYWORDS: Convolution, Clocks, Very large scale integration, Information technology, Fourier transforms, Algorithm development, Statistical analysis, Data processing, Digital filtering, Computer architecture
This paper presents a hardware-efficient design for the one-dimensional (1-D) discrete Fourier transform (DFT). Once
the 1-D DFT is formulated as the cyclic convolution form, the first-order moments-based structure can be used as the
basic computing unit for the DFT computation, which only contains a control module, a statistical module and an
accumulation module. The whole calculation process only contains shift operations and additions, with no need for
multipliers and large memory. Compared with the traditional DA-based structure for DFT, the proposed design has better
performance in terms of the area-throughput ratio and the power consumption, especially when the length of DFT is
slightly longer. Similar efficient designs can be obtained for other computations, such as the DCT/IDCT, DST/IDST,
digital filter and correlation, by transforming them into the forms of the first-order moments-based cyclic convolution.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.