Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method, comprising: obtaining data from a memory, the data needing to be decoded; comparing the data from the memory to a list of patches; and augmenting the data from the memory when the comparing the data from the memory to the list of patches indicates a match of the data to a specific patch to produce an augmented data; and decoding the augmented data.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. If the retrieved data matches a specific patch from the list, the data is modified or enhanced (augmented) based on that matching patch. Finally, this augmented data is subjected to a decoding process to determine the correct decoded data set. This approach improves decoding by pre-processing data using known patterns.
2. The method according to claim 1 , wherein the data is a sample of bits of a block of data.
This invention describes a method for decoding data. First, a sample of bits from a larger block of data that needs decoding is retrieved from a memory. This retrieved bit sample is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. If the retrieved bit sample matches a specific patch from the list, the bit sample is modified or enhanced (augmented) based on that matching patch. Finally, this augmented bit sample is subjected to a decoding process to determine the correct decoded data set. This approach improves decoding by pre-processing data using known patterns, specifically operating on bit samples.
3. The method according to claim 1 , wherein the list of patches include a distance metric.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. This comparison uses a "distance metric" associated with the patches to determine how closely the data matches. If the retrieved data matches a specific patch from the list (based on the distance metric), the data is modified or enhanced (augmented) based on that matching patch. Finally, this augmented data is subjected to a decoding process to determine the correct decoded data set. This approach improves decoding by pre-processing data using known patterns and a distance-based comparison.
4. The method according to claim 1 , wherein the list of patches include a probability metric.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. This comparison or subsequent augmentation uses a "probability metric" associated with the patches, perhaps indicating the likelihood of a patch being correct or the confidence in a match. If the retrieved data matches a specific patch from the list, the data is modified or enhanced (augmented) based on that matching patch and its probability metric. Finally, this augmented data is subjected to a decoding process to determine the correct decoded data set.
5. The method according to claim 1 , wherein the list of patches is predetermined.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a "list of patches," which are essentially known data patterns or correction templates that have been established or defined in advance. If the retrieved data matches a specific patch from this predetermined list, the data is modified or enhanced (augmented) based on that matching patch. Finally, this augmented data is subjected to a decoding process to determine the correct decoded data set. This approach improves decoding by pre-processing data using a fixed set of known patterns.
6. The method according to claim 1 , further comprising: checking the decoding of the augmented data.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. If the retrieved data matches a specific patch from the list, the data is modified or enhanced (augmented) based on that matching patch. The augmented data is then subjected to a decoding process. After decoding, the method includes an additional step of checking or verifying the success and correctness of this decoding operation to ensure the output is valid.
7. The method according to claim 6 , further comprising: updating the data in the memory when the decoding of the augmented data is not successful.
This invention describes a method for decoding data. First, data that needs decoding is retrieved from a memory. This retrieved data is then compared against a predefined "list of patches," which are essentially known data patterns or correction templates. If the retrieved data matches a specific patch from the list, the data is modified or enhanced (augmented) based on that matching patch. The augmented data is then subjected to a decoding process. After decoding, the method checks the success of this decoding. If the decoding is not successful, the original data stored in memory is updated, possibly to reflect errors or to prepare for a retry.
8. The method according to claim 7 , further comprising: checking a number of iterations performed on updating the data in the memory; ending the method when the number of iterations performed equals a maximum number of iterations allowed; and performing another iteration of the comparing the data to the list of patches when the number of iterations performed is less than the maximum number of iterations.
This invention describes an iterative method for decoding data. First, data needing decoding is retrieved from memory. This data is compared against a predefined "list of patches." If a match occurs, the data is augmented based on the patch, then decoded. The decoding success is checked. If unsuccessful, the data in memory is updated. The method then checks the total number of iterations performed on updating the data. If this count reaches a maximum allowed, the process ends. Otherwise, if more iterations are allowed, the method loops back to comparing the updated data against the list of patches, effectively retrying the decoding process with potentially corrected data.
9. A method comprising: obtaining data of a memory block, wherein the data is a sample of bits of a block of data of a given length, each of the bits having a bit value; comparing the obtaining of the data to a predetermined data pattern; estimating at least one bit value for the data based on the comparison; adjusting the bit values based on the estimation; and lengthening an amount of obtained with each execution of the method.
This invention describes an iterative method for processing data from a memory block. It begins by obtaining a sample of bits, each with a bit value, from a memory block of a given length. This obtained data is then compared to a specific, predetermined data pattern. Based on this comparison, the method estimates at least one bit value for the data. Subsequently, these bit values are adjusted according to the estimation. A key feature is that with each subsequent execution of this method, the amount of data obtained from the memory block is progressively increased, allowing for a more complete analysis over time.
10. The method of claim 9 , wherein adjusting the bit values includes generating and applying a correction term to the bit values.
This invention describes an iterative method for processing data from a memory block. It begins by obtaining a sample of bits, each with a bit value, from a memory block of a given length. This obtained data is then compared to a specific, predetermined data pattern. Based on this comparison, the method estimates at least one bit value for the data. The adjustment of these bit values is specifically performed by generating a correction term and then applying this term to the estimated bit values. A key feature is that with each subsequent execution of this method, the amount of data obtained from the memory block is progressively increased.
11. The method of claim 9 , wherein the method is executed multiple times with snapshots of different blocks of data of the memory block.
This invention describes an iterative method for processing data from a memory block. It begins by obtaining a sample of bits, each with a bit value, from a memory block of a given length. This obtained data is then compared to a specific, predetermined data pattern. Based on this comparison, the method estimates at least one bit value for the data. Subsequently, these bit values are adjusted according to the estimation. A key feature is that with each subsequent execution of this method, the amount of data obtained from the memory block is progressively increased. Importantly, this entire method is designed to be executed multiple times using different "snapshots" or instances of data from various blocks within the memory.
12. The method of claim 9 , wherein the predetermined data pattern is a mathematical linear function.
This invention describes an iterative method for processing data from a memory block. It begins by obtaining a sample of bits, each with a bit value, from a memory block of a given length. This obtained data is then compared to a specific data pattern, which is defined as a mathematical linear function. Based on this comparison, the method estimates at least one bit value for the data. Subsequently, these bit values are adjusted according to the estimation. A key feature is that with each subsequent execution of this method, the amount of data obtained from the memory block is progressively increased, leveraging the linear function for pattern recognition.
Unknown
August 4, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.