Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method and system are disclosed for selecting a mode to encode video data. The method comprises the steps of (a) transforming a source video frame into a set of coefficients, (b) partitioning said set of coefficients into a plurality of subsets of the coefficients on the basis of probability statistics corresponding to a plurality of encoding modes, wherein each of said subsets is identified for encoding by one of the plurality of encoding modes. The method comprises the further steps of (c) for each of the plurality of subsets of coefficients, computing defined parameters of an associated probability distribution for said subset, and (d) repeating steps (b) and (c) until a predetermined termination condition is satisfied. When this predetermined termination condition is satisfied, the subsets of coefficients, as they exist at that time, are output to a video encoder, which preferably is a Wyner-Ziv encoder.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system for the introduction of controlled correlation among multiple redundant representations of predictively encoded signals while avoiding predictive mismatch at a receiver when any given sub-set of the multiple representations is received. The system embodies a signal encoder and decoder. The decoder can comprise at least two signal adders for respectively receiving coefficient values and adding at least one predictive value transform to the coefficient value in order to generate and transmit a second set of coefficient values. The second set of coefficient values is subsequently received by a decoder means, wherein the decoder means transforms the received coefficient values and transmits the resultant coefficient values to a signal adder. Upon reception of the transformed coefficient values, the signal adder generates a third set of coefficient values; the third set of coefficients being used to reconstruct an approximate version of an encoded signal.

Abstract: A computer-implemented method for decompression in data compression systems with decpder side-information including a plurality of signals each of which is correlated to a source, includes determining a conditional probability function of the source conditioned upon a subset of decoder side-information signals, wherein the decoder side-information signals include pre-stored and received statistical information, estimating an a-posteriori probability function based on the conditional probability function and extrinsic information, evaluating a stopping criterion for decompresiion, generating the extrinsic information based on the a-posteriori probability function, and determining a likelihood threshold for determining a most probable value of a quantized source signal based on the a-posteriori probability function and outputting the quantized source upon determining to stop decompression.

Abstract: A method and apparatus for decompressing data in a data-compression system with decoder-only side information is provided. In one aspect, the method comprises generating side information using a source reconstruction and decoding using the generated side information to generate a new source reconstruction. The method further includes iterating the steps of generating and decoding, the generating step using at least the new source reconstruction output by the previous decoding step, and the decoding step using the side information output by the previous generating step. The method may stop the iteration when one or more predetermined criteria are met.

Abstract: A system for the introduction of controlled correlation among multiple redundant representations of predictively encoded signals while avoiding predictive mismatch at a receiver when any given sub-set of the multiple representations is received. The system embodies a signal encoder and decoder. The decoder can comprise at least two signal adders for respectively receiving coefficient values and adding at least one predictive value transform to the coefficient value in order to generate and transmit a second set of coefficient values. The second set of coefficient values is subsequently received by a decoder means, wherein the decoder means transforms the received coefficient values and transmits the resultant coefficient values to a signal adder. Upon reception of the transformed coefficient values, the signal adder generates a third set of coefficient values; the third set of coefficients being used to reconstruct an approximate version of an encoded signal.

Abstract: The present invention relates to a method, system and computer program product for the predictive encoding of digital video sequences. The objectives of the invention are accomplished by dynamically determining the resolution of a current frame being encoded and outputting the determination. The determination process is based on statistical and coding information of a plurality of frames, including at least one previous frame and the current frame. Further, general encoding parameters and the encoding parameters of a current frame at a chosen resolution are determined, wherein the encoding parameter selection step takes into account the determination of the dynamic resolution determination step in determining the encoding parameters.

Abstract: The present invention relates to a method, system and computer program product for the predictive encoding of digital video sequences. The objectives of the invention are accomplished by dynamically determining the resolution of a current frame being encoded and outputting the determination. The determination process is based on statistical and coding information of a plurality of frames, including at least one previous frame and the current frame. Further, general encoding parameters and the encoding parameters of a current frame at a chosen resolution are determined, wherein the encoding parameter selection step takes into account the determination of the dynamic resolution determination step in determining the encoding parameters.

Abstract: A system for the introduction of controlled correlation among multiple redundant representations of predictively encoded signals while avoiding predictive mismatch at a receiver when any given sub-set of the multiple representations is received. The system embodies a signal encoder and decoder. The decoder can comprise at least two signal adders for respectively receiving coefficient values and adding at least one predictive value transform to the coefficient value in order to generate and transmit a second set of coefficient values. The second set of coefficient values is subsequently received by a decoder means, wherein the decoder means transforms the received coefficient values and transmits the resultant coefficient values to a signal adder. Upon reception of the transformed coefficient values, the signal adder generates a third set of coefficient values; the third set of coefficients being used to reconstruct an approximate version of an encoded signal.

Abstract: A method and apparatus are described for constructing efficient Slepian-Wolf codes for inputs that do not have uniform probability distributions, and for channels which are not symmetric. Whereas conventional Wyner-Ziv video compression systems assume symmetrical probability distributions and ignore the marginal distribution component, the invention incorporates the marginal distribution component by combining the marginal distribution and conditional distributions as input to a transform that generates a symmetrical output, which is then fed into the conventional density evolution method.

Abstract: An improvement to a predictive video encoding method or apparatus that includes selecting a mode class within which to choose an encoding algorithm to encode individual blocks of video information. Rather than implementing each algorithm in each mode class to ascertain an acceptable compression, the improvement eliminates searching through a class of encoding modes based simply on heuristics. The method comprises obtaining statistical information related to previous blocks of encoded video information, determining a mode class within which to chose a particular encoding algorithm based on the statistical information (e.g., heuristics) gathered, choosing an algorithm within the selected mode class using conventional techniques, and encoding the video information according to the chosen algorithm. Statistical information may include quantization parameters, prior encoding decisions, intensity or frequency values, or Hadamard transform coefficients of previously encoded macroblocks.

Abstract: The present invention relates to a method, system and computer program product for the predictive encoding of digital video sequences. The objectives of the invention are accomplished by dynamically determining the resolution of a current frame being encoded and outputting the determination. The determination process is based on statistical and coding information of a plurality of frames, including at least one previous frame and the current frame. Further, general encoding parameters and the encoding parameters of a current frame at a chosen resolution are determined, wherein the encoding parameter selection step takes into account the determination of the dynamic resolution determination step in determining the encoding parameters.