Abstract:
A flash memory error correction method and apparatus is provided. The method includes determining a first data bit in a flash memory page, where the first data bit corresponds to different data respectively in the data obtained by reading the flash memory page using the (n+1)th read voltage threshold and the data obtained by reading the flash memory page using the mth read voltage threshold; and then reducing a confidence level of the first data bit in the data obtained by reading the flash memory page using the (n+1)th read voltage threshold; and performing, according to an adjusted confidence level of the first data bit, error correction decoding on the data obtained by reading the flash memory page using the (n+1)th read voltage threshold. Present disclosure effectively improves a success rate of error correction decoding, thereby significantly improving performance of an SSD storage system.
Abstract:
The patent application relates to a method for recovering a sparse communication signal from a receive signal, the receive signal being a channel output version of the sparse communication signal, the channel comprising channel coefficients being arranged to form a channel matrix, the method comprising determining a support set indicating a set of first indices of non-zero communication signal coefficients from the channel matrix and the receive signal, determining an estimate of the sparse communication signal upon the basis of the support set, the channel matrix and the receive signal, determining second indices of communication signal coefficients which are not indicated by the support set, and determining the sparse communication signal upon the basis of the support set, the estimate of the sparse communication signal, the second indices and the channel matrix.
Abstract:
A task processing method comprising obtaining a first identifier (ID) sequence from a logical unit number (LUN) mapping table based on logical addresses of first data, where IDs in the first ID sequence are allocated based on a sequence of physical addresses, where the LUN mapping table includes mapping relationships between the logical addresses and the IDs; obtaining first physical addresses from an ID mapping table based on one ID in the first ID sequence when the IDs in the first ID sequence are consecutive, where the ID mapping table includes a mapping relationship between an ID and a physical address and the first physical addresses are a plurality of physical addresses corresponding to the first ID sequence; and reading the first data based on the first physical addresses.
Abstract:
A data reduction method, apparatus, and computing device and a storage medium are provided. The method includes: when reduction is to be performed on a to-be-reduced data block, obtaining a fingerprint of the to-be-reduced data block; forming an index set based on the fingerprint of the to-be-reduced data block by using index information of data blocks with identical fingerprints; and performing, in the to-be-reduced data block based on the fingerprint of the to-be-reduced data block, data reduction processing on a data block to which index information in a same index set belongs.
Abstract:
In a method for compressing data, a storage system determines whether deduplication can be performed on a target data block. When deduplication cannot be performed on the target data block, the storage system obtaining a similar fingerprint of the target data block, and determines, based on the similar fingerprint, a combined data block group to which the target data block belongs. The storage system then performs similar compression on the target data block based on a reference block in the combined data block group.
Abstract:
A data compression method includes providing one or more data block sets, where each data block set includes a plurality of data blocks with a same fingerprint; providing one or more compression groups based on a similarity degree between a plurality of data blocks included in each data block set, where one compression group includes a plurality of similar data blocks, the plurality of similar data blocks are a subset of data blocks included in the one or more data block sets, and a similarity degree between the plurality of similar data blocks meets a specific similarity condition; and compressing the plurality of similar data blocks included in the compression group.
Abstract:
Embodiments of the present application provide a decoding method and a decoding device. The decoding device receives a second code word, which is transmitted from an encoding device based on a first code word. The first code word is generated by the encoding device based on a first encoded data sequence. After determining that a second encoded data sequence based on the second code word is not a correct replica of the first encoded data sequence, the decoding device performs a series of code element update processes to determining the correct replica of the first encoded data sequence.
Abstract:
A data processing method based on a quasi-cyclic LDPC includes: when a size of service data is less than a magnitude of information bit of the quasi-cyclic LDPC, calculating a difference value between the magnitude of the information bit of the quasi-cyclic LDPC and the size of the service data, and filling the service data with the same amount of known data as the difference value (S103); coding the filled service data to obtain redundancy check data corresponding to the service data (S104); and sending the service data and the redundancy check data to a corresponding physical location in the storage unit (S105). It ensures that when a code length of the quasi-cyclic LDPC is constant, the code length ideally adapts to internal space of the storage unit, and the quasi-cyclic LDPC has a relatively high error correction capability, thereby improving reliability and service life of the storage unit.
Abstract:
The patent application relates to a method for recovering a sparse communication signal from a receive signal, the receive signal being a channel output version of the sparse communication signal, the channel comprising channel coefficients being arranged to form a channel matrix, the method comprising determining a support set indicating a set of first indices of non-zero communication signal coefficients from the channel matrix and the receive signal, determining an estimate of the sparse communication signal upon the basis of the support set, the channel matrix and the receive signal, determining second indices of communication signal coefficients which are not indicated by the support set, and determining the sparse communication signal upon the basis of the support set, the estimate of the sparse communication signal, the second indices and the channel matrix.
Abstract:
In a method for compressing data, a storage system determines whether deduplication can be performed on a target data block. When deduplication cannot be performed on the target data block, the storage system obtaining a similar fingerprint of the target data block, and determines, based on the similar fingerprint, a combined data block group to which the target data block belongs. The storage system then performs similar compression on the target data block based on a reference block in the combined data block group.