| Patent application number | Description | Published |
|---|
| 20100277989 | INCREASED CAPACITY HETEROGENEOUS STORAGE ELEMENTS - Providing increased capacity in heterogeneous storage elements including a method for storing data including a write process writing to a memory and a read process reading from the memory. Physical characteristics of memory cells in the memory support different sets of data levels. The write process takes into account the different sets of data levels when writing to the memory. The read process first obtains data in the memory and subsequently determines how to interpret the data. | 11-04-2010 |
| 20100281340 | ADAPTIVE ENDURANCE CODING OF NON-VOLATILE MEMORIES - Adaptive endurance coding including a method for storing data that includes receiving write data and a write address. A compression algorithm is applied to the write data to generate compressed data. An endurance code is applied to the compressed data to generate a codeword. The endurance code is selected and applied in response to the amount of space saved by applying the compression to the write data. The codeword is written to the write address. | 11-04-2010 |
| 20110019002 | Method and System for Low Complexity Analysis of Multiple Signals Using a Combined Sparse Set of Samples - A method of and system for signal analysis includes acquiring multiple signals from the environment by using multiple sensor elements, applying a transform which combines the multiple acquired signals into a single combined signal, and reduces the number of samples in the combined signal, applying a single signal analysis and event detection operation on the resultant combined, sparse signal, and performing a complete signal analysis using multiple analysis elements for the multiple input signals only in the case where the sparse signal analysis indicates that the event of interest may be present. | 01-27-2011 |
| 20110103580 | COMPRESSING ENCRYPTED DATA WITHOUT THE ENCRYPTION KEY - A method, system and computer program product are disclosed for compressing encrypted data, wherein the data is encrypted by using a block encryption algorithm in a chained mode of operation, and the encrypted data is comprised of a set of N encrypted blocks, C | 05-05-2011 |
| 20110138104 | MULTI-WRITE CODING OF NON-VOLATILE MEMORIES - Multi-write coding of non-volatile memories including a method that receives write data, and a write address of a memory page. The memory page is in either an erased state or a previously written state. If the memory page is in the erased state: selecting a first codeword from a code such that the first codeword encodes the write data and is consistent with a target set of distributions of electrical charge levels in the memory page; and writing the first codeword to the memory page. If the memory page is in the previously written state: selecting a coset from a linear code such that the coset encodes the write data and includes one or more words that are consistent with previously written content of the memory page; selecting a subsequent codeword from the one or more words in the coset; and writing the subsequent codeword to the memory page. | 06-09-2011 |
| 20110138105 | NON-VOLATILE MEMORIES WITH ENHANCED WRITE PERFORMANCE AND ENDURANCE - Enhanced write performance for non-volatile memories including a memory system that includes a receiver for receiving a data rate of a data sequence to be written to a non-volatile flash memory device. The memory system also includes a physical page selector for selecting a physical address of an invalid previously written memory page from a group of physical addresses of invalid previously written memory pages located on the non-volatile memory device, and for determining if the number of free bits in the invalid previously written memory page at the selected physical address is greater than or equal to the data rate. The memory system also includes a transmitter for outputting the selected physical address of the invalid previously written memory page, the outputting in response to the physical page selector determining that the number of free bits is greater than or equal to the data rate. | 06-09-2011 |
| 20110187565 | EFFICIENT RATELESS DISTRIBUTED COMPRESSION OF NON-BINARY SOURCES - A method, system and computer program product are disclosed for rateless compression of non-binary sources. In one embodiment, the method comprises representing a sequence of non-binary source symbols as a sequence of sets of binary values; selecting a code for compressing the sets of binary values; determining a puncturing pattern, based on the selected code; and puncturing the sets of binary values, in patterns based on the puncturing pattern, to form a sequence of unpunctured values. A sequence of computed syndromes is determined based on the sequence of non-binary source symbols; and the sequence of unpunctured values and the sequence of computed syndromes are combined to form an output stream of data representing said sequence of non-binary source symbols. In one embodiment, none of the sets of binary values is punctured completely, and, for example, each of the sets of binary values may be punctured only partially. | 08-04-2011 |
| Patent application number | Description | Published |
|---|
| 20080288929 | METHOD AND APPARATUS FOR RUN-TIME STATISTICS DEPENDENT PROGRAM EXECUTION USING SOURCE-CODING - Disclosed are a method and system for optimized, dynamic data-dependent program execution. The disclosed system comprises a statistics computer which computes statistics of the incoming data at the current time instant, where the said statistics include the probability distribution of the incoming data, the probability distribution over program modules induced by the incoming data, the probability distribution induced over program outputs by the incoming data, and the time-complexity of each program module for the incoming data, wherein the said statistics are computed on as a function of current and past data, and previously computed statistics; a plurality of alternative execution path orders designed prior to run-time by the use of an appropriate source code; a source code selector which selects one of the execution path orders as a function of the statistics computed by the statistics computer; a complexity measurement which measures the time-complexity of the currently selected execution path-order. | 11-20-2008 |
| 20080320363 | METHOD AND APPARATUS FOR RATELESS SOURCE CODING WITH/WITHOUT DECODER SIDE INFORMATION - A method of and system for rateless source coding are disclosed. The method comprises the steps of providing a set of low-density parity check (LDPC) codes, each of which accepts a range of data input lengths and a range of target compression rates; identifying a data input having a data input length; and identifying a desired compression rate. The method comprises the further steps of selecting one of said LDPC codes based on said data input length and desired compression rate; encoding the data input, using the selected LDPC code, to generate a sequence of data values; and puncturing some of said encoded data values to achieve the desired compression rate. Preferably, the encoding step includes the steps of generating a syndrome and a parity sequence from the data input, puncturing the generated parity sequence, and mixing a remaining portion of the data input with the punctuated parity sequence. | 12-25-2008 |
| 20090030922 | Method and Apparatus for Constructing Efficient Slepian-Wolf Codes With Mismatched Decoding - Disclosed is a method for constructing Slepian-Wolf codes, wherein the designed Slepian-Wolf codes are robust to mismatched decoding. The disclosed method for constructing Slepian-Wolf codes includes the steps of: choosing representative probability distributions from a set of possible probability distributions; choosing a probability distribution as a decoding metric; converting the chosen decoding metric to a cyclic-symmetric channel; computing the initial message value given the cyclic-symmetric channel; computing a set of probability distributions of the initial message given the initial message values and the representative probability distributions; optimizing the degree distribution given the set of probability distributions of the initial message; optimizing the decoding metric. | 01-29-2009 |
| 20090122868 | METHOD AND SYSTEM FOR EFFICIENT VIDEO COMPRESSION WITH LOW-COMPLEXITY ENCODER - Disclosed are a method and system for video compression, wherein the video encoder has low computational complexity and high compression efficiency. The disclosed system comprises a video encoder and a video decoder, wherein the method for encoding includes the steps of converting a source frame into a space-frequency representation; estimating conditional statistics of at least one vector of space-frequency coefficients; estimating encoding rates based on the said conditional statistics; and applying Slepian-Wolf codes with the said computed encoding rates. The preferred method for decoding includes the steps of; generating a side-information vector of frequency coefficients based on previously decoded source data, encoder statistics, and previous reconstructions of the source frequency vector; and performing Slepian-Wolf decoding of at least one source frequency vector based on the generated side-information, the Slepian-Wolf code bits and the encoder statistics. | 05-14-2009 |
| 20090323798 | METHOD AND SYSTEM FOR LOW-COMPLEXITY SLEPIAN-WOLF RATE ESTIMATION IN WYNER-ZIV VIDEO ENCODING - A method and system for low-complexity Slepian-Wolf rate estimator in a hybrid Wyner-Ziv video encoder determines the minimum Slepian-Wolf code rate required to allow correct decoding. The Slepian-Wolf estimator does not assume ideality of source and side-information statistics and does not require the presence of a feedback channel from the decoder to the encoder in order to determine the correct Slepian-Wolf coding rate. Instead, it adapts to the statistical properties of the video steam. The Slepian-Wolf estimator provides very efficient compression performance while avoiding Slepian-Wolf decoding failures. | 12-31-2009 |
| 20100095116 | Method and System for Secure Collaboration Using Slepian-Wolf Codes - A method and system provide for secure sharing of arbitrary data between users with limited mutual trust. A user can encode its information by using a Slepian-Wolf code at a rate which enables a second user to correctly decode only if the side-information it has satisfies a conditional entropy constraint. The key advantages are as follows. Firstly, it is very flexible, in that it enables secure sharing for general data including multimedia data. Secondly, by appropriate Slepian-Wolf code selection, it enables compression in conjunction with security. Thirdly, it can be used for the case where the data model is imperfectly known and trust is to be built up incrementally. | 04-15-2010 |
