公开(公告)号：US07945842B2

公开(公告)日：2011-05-17

申请号：US11764876

申请日：2007-06-19

申请人： Dake He ,  Ashish Jagmohan ,  Jing Jiang

发明人： Dake He ,  Ashish Jagmohan ,  Jing Jiang

IPC分类号： H03M13/00

CPC分类号： H03M13/1102 ,  H03M7/30 ,  H03M13/6312 ,  H03M13/6362

摘要： 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.

摘要翻译： 公开了一种用于无源源编码的方法和系统。 该方法包括以下步骤：提供一组低密度奇偶校验（LDPC）码，每一个码接受数据输入长度的范围和目标压缩率的范围; 识别具有数据输入长度的数据输入; 并识别期望的压缩率。 该方法包括以下步骤：基于所述数据输入长度和期望的压缩率来选择所述LDPC码之一; 使用所选择的LDPC码对数据输入进行编码，以生成数据值序列; 以及对某些所述编码的数据值进行穿孔以实现所需的压缩率。 优选地，编码步骤包括以下步骤：从数据输入产生校正子和奇偶校验序列，对所生成的奇偶校验序列进行穿孔，以及将输入的数据的剩余部分与标点奇偶校验序列进行混合。

公开(公告)号：US20080320363A1

公开(公告)日：2008-12-25

申请号：US11764876

申请日：2007-06-19

申请人： Dake He ,  Ashish Jagmohan ,  Jing Jiang

发明人： Dake He ,  Ashish Jagmohan ,  Jing Jiang

IPC分类号： G06F11/10

CPC分类号： H03M13/1102 ,  H03M7/30 ,  H03M13/6312 ,  H03M13/6362

摘要： 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.

摘要翻译： 公开了一种用于无源源编码的方法和系统。 该方法包括以下步骤：提供一组低密度奇偶校验（LDPC）码，每一个码接受数据输入长度的范围和目标压缩率的范围; 识别具有数据输入长度的数据输入; 并识别期望的压缩率。 该方法包括以下步骤：基于所述数据输入长度和期望的压缩率来选择所述LDPC码之一; 使用所选择的LDPC码对数据输入进行编码，以生成数据值序列; 以及对某些所述编码的数据值进行穿孔以实现所需的压缩率。 优选地，编码步骤包括以下步骤：从数据输入产生校正子和奇偶校验序列，对所生成的奇偶校验序列进行穿孔，以及将输入的数据的剩余部分与标点奇偶校验序列进行混合。

公开(公告)号：US08341612B2

公开(公告)日：2012-12-25

申请号：US11749295

申请日：2007-05-16

申请人： Dake He ,  Ashish Jagmohan ,  Jian Lou ,  Ligang Lu

发明人： Dake He ,  Ashish Jagmohan ,  Jian Lou ,  Ligang Lu

IPC分类号： G06F9/455 ,  G06F17/50 ,  G06F9/45

CPC分类号： G06F9/30 ,  G06F8/4441 ,  G06F9/45525

摘要： 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.

摘要翻译： 公开了一种用于优化的动态数据相关程序执行的方法和系统。 所公开的系统包括统计计算机，其计算当前时刻的输入数据的统计量，其中所述统计包括输入数据的概率分布，由输入数据引起的程序模块上的概率分布，所引入的概率分布 输入数据的程序输出和输入数据的每个程序模块的时间 - 复杂度，其中根据当前和过去数据以及先前计算的统计量来计算所述统计; 通过使用适当的源代码在运行时间之前设计的多个替代执行路径命令; 源代码选择器，其根据由统计计算机计算出的统计量的函数选择执行路径顺序之一; 测量当前选择的执行路径顺序的时间 - 复杂度的复杂度测量。

公开(公告)号：US20090122868A1

公开(公告)日：2009-05-14

申请号：US11939882

申请日：2007-11-14

申请人： Jun Chen ,  Dake He ,  Ashish Jagmohan ,  Ligang Lu ,  Vadim Sheinin

发明人： Jun Chen ,  Dake He ,  Ashish Jagmohan ,  Ligang Lu ,  Vadim Sheinin

IPC分类号： H04N7/26

CPC分类号： H04N19/149 ,  H03M7/30 ,  H04N19/395 ,  H04N19/46 ,  H04N19/61

摘要： 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.

摘要翻译： 公开了一种用于视频压缩的方法和系统，其中视频编码器具有低计算复杂度和高压缩效率。 所公开的系统包括视频编码器和视频解码器，其中用于编码的方法包括以下步骤：将源帧转换成空间频率表示; 估计至少一个空 - 频系数矢量的条件统计; 基于所述条件统计估计编码率; 以及使用所述计算的编码速率的Slepian-Wolf码。 优选的解码方法包括以下步骤： 基于先前解码的源数据，编码器统计量和源频率向量的先前重建来生成频率系数的侧信息向量; 并且基于所生成的侧信息，Slepian-Wolf码比特和编码器统计，对至少一个源频率向量执行Slepian-Wolf解码。

公开(公告)号：US20080165853A1

公开(公告)日：2008-07-10

申请号：US11621882

申请日：2007-01-10

申请人： Dake He ,  Ashish Jagmohan ,  Ligang Lu ,  Vadim Sheinin

发明人： Dake He ,  Ashish Jagmohan ,  Ligang Lu ,  Vadim Sheinin

IPC分类号： H04N7/32 ,  H04B1/66

CPC分类号： H04N19/192 ,  H04N19/44 ,  H04N19/46

摘要： 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.

摘要翻译： 提供了一种用于仅解码侧信息在数据压缩系统中解压缩数据的方法和装置。 一方面，该方法包括使用所生成的侧面信息使用源重构和解码来生成边信息以生成新的源重构。 所述方法还包括使用至少由先前解码步骤进行的新的源重构输出的生成步骤和使用由前一生成步骤输出的侧信息的解码步骤来迭代生成和解码的步骤。 当满足一个或多个预定标准时，该方法可以停止迭代。

公开(公告)号：US08532220B2

公开(公告)日：2013-09-10

申请号：US12712740

申请日：2010-02-25

申请人： Ligang Lu ,  Ashish Jagmohan ,  Dake He

发明人： Ligang Lu ,  Ashish Jagmohan ,  Dake He

IPC分类号： H04L27/00

CPC分类号： H03M7/30

摘要： Methods and apparatus are provided for secure distribution and storage of data using N channels. An input data sequence, X, is distributed using a plurality, N, of channels. In one embodiment, the input data sequence, X, is split into N subsequences; and the N subsequences are encoded into N bit streams using a set of Slepian-Wolf codes with N separate encoders and a joint decoder. The Slepian-Wolf codes can be selected to ensure a computational complexity to obtain a portion of the input data sequence grows exponentially with respect to a length of the input data sequence unless all of the N bit streams are compromised. In another embodiment, the input data sequence, X, is compressed using a lossless data compressing techniques; and the compressed input data sequence is split into N subsequences that are distributed.

摘要翻译： 提供了使用N个信道来安全地分发和存储数据的方法和装置。 使用多个N个信道来分配输入数据序列X。 在一个实施例中，输入数据序列X被分成N个子序列; 并且使用具有N个分离编码器和联合解码器的Slepian-Wolf码集合将N个子序列编码为N个比特流。 可以选择Slepian-Wolf码，以确保获得输入数据序列的一部分相对于输入数据序列的长度指数地增长的计算复杂度，除非所有N个比特流都受到损害。 在另一个实施例中，使用无损数据压缩技术来压缩输入数据序列X; 并且压缩的输入数据序列被分割成分布的N个子序列。

公开(公告)号：US07233269B1

公开(公告)日：2007-06-19

申请号：US11427970

申请日：2006-06-30

申请人： Jun Chen ,  Dake He ,  Ashish Jagmohan

发明人： Jun Chen ,  Dake He ,  Ashish Jagmohan

IPC分类号： H03M7/00

CPC分类号： H03M7/30 ,  H04N19/00 ,  H04N19/44 ,  H04N19/90

摘要： 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.

摘要翻译： 描述了一种用于为不具有均匀概率分布的输入构建有效的Slepian-Wolf码以及对于不对称的信道的方法和装置。 而传统的Wyner-Ziv视频压缩系统假设对称概率分布并忽略边际分布分量，本发明通过将边际分布和条件分布组合作为生成对称输出的变换的输入来并入边缘分布分量，然后将其输入 常规密度演化方法。

公开(公告)号：US08804837B2

公开(公告)日：2014-08-12

申请号：US13545414

申请日：2012-07-10

申请人： Dake He ,  Ashish Jagmohan ,  Ligang Lu

发明人： Dake He ,  Ashish Jagmohan ,  Ligang Lu

IPC分类号： H04N11/02

CPC分类号： H04N19/395 ,  H04N19/103 ,  H04N19/18 ,  H04N19/48

摘要： 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.

摘要翻译： 公开了一种用于选择对视频数据进行编码的模式的方法和系统。 该方法包括以下步骤：（a）将源视频帧变换成一组系数，（b）基于对应于多个编码模式的概率统计，将所述系数集合划分成系数的多个子集， 其中所述子集中的每一个被识别用于通过所述多个编码模式之一进行编码。 该方法还包括以下步骤：（c）针对所述多个系数子集中的每一个，计算所述子集的关联概率分布的定义参数，以及（d）重复步骤（b）和（c）直到预定终止条件 满意 当满足该预定终止条件时，如同在那时存在的系数子集被输出到视频编码器，其优选地是Wyner-Ziv编码器。

公开(公告)号：US08111755B2

公开(公告)日：2012-02-07

申请号：US12145920

申请日：2008-06-25

申请人： Dake He ,  Ashish Jagmohan

发明人： Dake He ,  Ashish Jagmohan

IPC分类号： H04N7/12

CPC分类号： H04N19/395 ,  H04N19/513 ,  H04N19/537 ,  H04N19/59 ,  H04N19/80

摘要： 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.

摘要翻译： 混合Wyner-Ziv视频编码器中的低复杂度Slepian-Wolf速率估计器的方法和系统确定了允许正确解码所需的最小Slepian-Wolf码率。 Slepian-Wolf估计器不假定源和侧信息统计的理想，并且不需要存在从解码器到编码器的反馈信道，以便确定正确的Slepian-Wolf编码率。 相反，它适应视频流的统计特性。 Slepian-Wolf估计器提供非常有效的压缩性能，同时避免Slepian-Wolf解码失败。

公开(公告)号：US07679536B2

公开(公告)日：2010-03-16

申请号：US11782249

申请日：2007-07-24

申请人： Jun Chen ,  Dake He ,  Ashish Jagmohan

发明人： Jun Chen ,  Dake He ,  Ashish Jagmohan

IPC分类号： H03M7/30

CPC分类号： H03M7/30

摘要： 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.

摘要翻译： 披露了一种用于构造Slepian-Wolf码的方法，其中设计的Slepian-Wolf码对于不匹配的解码是鲁棒的。 所公开的用于构造Slepian-Wolf码的方法包括以下步骤：从一组可能的概率分布中选择代表性概率分布; 选择概率分布作为解码度量; 将所选择的解码度量转换为循环对称信道; 计算给定循环对称信道的初始消息值; 给出初始消息值和代表性概率分布的初始消息的一组概率分布; 优化给定初始消息的概率分布集的度数分布; 优化解码度量。