-
公开(公告)号：US07426457B2
公开(公告)日：2008-09-16
申请号：US10768904
申请日：2004-01-29
CPC分类号： H03M7/30
摘要： Use of Generalized Context Trees to assign a unique state from a finite set to any string is provided. The method optionally refines the generalized context tree into a refined generalized context tree having a finite state machine (FSM) property. Refining occurs whenever the generalized context tree does not have the finite state machine property. Alternately, a method for constructing a representation of a source usable within an FSM is provided, comprising evaluating a node comprising a suffix tail and verifying the suffix tail is included in the representation, and inserting at least one node to the representation when the suffix tail is not in the representation.
摘要翻译： 使用广义上下文树将有限集中的唯一状态分配给任何字符串。 该方法可选地将广义上下文树细化为具有有限状态机（FSM）属性的精化广义上下文树。 每当广义上下文树不具有有限状态机属性时，就进行精炼。 或者，提供了一种用于构建可用于FSM内的源的表示的方法，包括评估包括后缀尾部和验证后缀尾的节点包括在所述表示中，并且当后缀尾部插入至少一个节点到所述表示时 不在代表中。
-
公开(公告)号：US20050168240A1
公开(公告)日：2005-08-04
申请号：US10768904
申请日：2004-01-29
CPC分类号： H03M7/30
摘要： Use of Generalized Context Trees, a means for assigning a unique state from a finite set to any string, is provided. The method optionally refines the generalized context tree into a refined generalized context tree having a finite state machine (FSM) property. Refining occurs whenever the generalized context tree does not have the finite state machine property. Alternately, a method for constructing a representation of a source usable within an FSM is provided, comprising evaluating a node comprising a suffix tail and verifying the suffix tail is included in the representation, and inserting at least one node to the representation when the suffix tail is not in the representation.
摘要翻译： 提供了广义上下文树的使用，一种将有限集中的唯一状态分配给任意字符串的方法。 该方法可选地将广义上下文树细化为具有有限状态机（FSM）属性的精化广义上下文树。 每当广义上下文树不具有有限状态机属性时，就进行精炼。 或者，提供了一种用于构建可用于FSM内的源的表示的方法，包括评估包括后缀尾部和验证后缀尾的节点包括在所述表示中，并且当后缀尾部插入至少一个节点到所述表示时 不在代表中。
-
公开(公告)号：US07265692B2
公开(公告)日：2007-09-04
申请号：US10821524
申请日：2004-04-09
IPC分类号： H03M7/00
CPC分类号： H03M7/30 , Y10S707/99942
摘要： A method for encoding and decoding a sequence is provided. The method comprises searching a set of candidate trees varying in size for a tree T having a plurality of states. Tree T provides a structure that relatively minimizes code length of the sequence from among all the candidate trees. The method further comprises encoding data conditioned on the tree T, which may be a generalized context tree (GCT), using a sequential probability assignment conditioned on the states of the tree T. This encoding may use finite state machine (FSM) closure of the tree. Also provided are methods for decoding an encoded binary string when the encoded string includes a full tree or generalized context tree, as well as decoding an encoded string using incomplete FSM closure, incremental FSM, and suffix tree construction concepts.
摘要翻译： 提供了一种对序列进行编码和解码的方法。 该方法包括搜索具有多个状态的树T的尺寸变化的一组候选树。 树T提供了相对最小化所有候选树中序列的代码长度的结构。 该方法还包括使用以树T的状态为条件的顺序概率分配来编码调节在树T上的数据，其可以是广义上下文树（GCT）。该编码可以使用有限状态机（FSM）关闭 树。 还提供了当编码的字符串包括全树或广义上下文树时对编码的二进制串进行解码的方法，以及使用不完全FSM关闭，增量FSM和后缀树构造概念来解码编码的字符串。
-
公开(公告)号：US20050171962A1
公开(公告)日：2005-08-04
申请号：US10821524
申请日：2004-04-09
CPC分类号： H03M7/30 , Y10S707/99942
摘要： A method for encoding and decoding a sequence is provided. The method comprises searching a set of candidate trees varying in size for a tree T having a plurality of states. Tree T provides a structure that relatively minimizes code length of the sequence from among all the candidate trees. The method further comprises encoding data conditioned on the tree T, which may be a generalized context tree (GCT), using a sequential probability assignment conditioned on the states of the tree T. This encoding may use finite state machine (FSM) closure of the tree. Also provided are methods for decoding an encoded binary string when the encoded string includes a full tree or generalized context tree, as well as decoding an encoded string using incomplete FSM closure, incremental FSM, and suffix tree construction concepts.
摘要翻译： 提供了一种对序列进行编码和解码的方法。 该方法包括搜索具有多个状态的树T的尺寸变化的一组候选树。 树T提供了相对最小化所有候选树中序列的代码长度的结构。 该方法还包括使用以树T的状态为条件的顺序概率分配来编码调节在树T上的数据，其可以是广义上下文树（GCT）。该编码可以使用有限状态机（FSM）关闭 树。 还提供了当编码的字符串包括全树或广义上下文树时对编码的二进制串进行解码的方法，以及使用不完全FSM关闭，增量FSM和后缀树构造概念来解码编码的字符串。
-
公开(公告)号：US08554746B2
公开(公告)日：2013-10-08
申请号：US12859220
申请日：2010-08-18
IPC分类号： G06F17/00
CPC分类号： G06F17/30584 , H03M7/3064 , H03M7/40 , H03M7/607
摘要： One embodiment of the present invention is directed to a method for compressing data generated by multiple data sources. The method includes steps of partitioning data generated by the multiple data sources into data partitions, the data included in each data partition containing inter-data-source redundancies and, for each data partition, compressing the data in the data partition to remove the inter-data-source redundancies.
摘要翻译： 本发明的一个实施例涉及一种用于压缩由多个数据源产生的数据的方法。 该方法包括以下步骤：将由多个数据源生成的数据划分为数据分区，每个数据分区中包含的数据包含数据间冗余，并且对于每个数据分区，压缩数据分区中的数据， 数据源冗余。
-
公开(公告)号：US20120047378A1
公开(公告)日：2012-02-23
申请号：US12859199
申请日：2010-08-18
IPC分类号： G06F1/32
CPC分类号： H04W52/0219 , H03M7/6047 , H04W52/0251 , H04W52/44 , Y02D70/00
摘要： One embodiment of the present invention is a sensor comprising one or more sensing devices, data-transmission components that transmit sensor data to a receiving component, and a processing component. The processing component executes routines to record sensing-device output as data for transmission to the receiving entity and to control the data-transmission components to transmit the data to the receiving entity. The processing component executes one or more compressing routines to compress data prior to transmission, when data compression is estimated to result in a lower power cost than transmitting uncompressed data, and controlling the data-transmission components to transmit data without compressing the data when data compression is estimated to result in a higher power cost than transmitting uncompressed data.
摘要翻译： 本发明的一个实施例是一种传感器，包括一个或多个感测装置，将传感器数据传送到接收部件的数据传输部件和处理部件。 处理组件执行例程以将感测设备输出记录为数据以传输到接收实体，并且控制数据传输组件将数据发送到接收实体。 处理组件执行一个或多个压缩例程以在发送之前压缩数据，当估计数据压缩导致比发送未压缩数据时更低的功率成本，并且当数据压缩时控制数据传输组件传送数据而不压缩数据 估计导致比传输未压缩数据更高的电力成本。
-
公开(公告)号：US20100278447A1
公开(公告)日：2010-11-04
申请号：US12387404
申请日：2009-04-30
IPC分类号： G06K9/40
CPC分类号： G06T5/002 , G06T2207/10008 , G06T2207/30176
摘要： One embodiment of the present invention is directed to an adaptive context-based predictor that predicts a value {circumflex over (x)} from a context, stored in an electronic memory, corresponding to a noisy-dataset symbol zi of a noisy dataset corrupted with noise modeled as being introduced by a noise-introducing channel. The adaptive context-based predictor is adapted according to one or more parameters that specify adaptive context-based-predictor operation, at least one of which functionally depends, or partially functionally depends, on a level of noise represented by the noise-introducing channel. The adaptive context-based predictor computes a number of intermediate values from the context, computes the predicted value {circumflex over (x)} from the intermediate values, and stores the predicted value {circumflex over (x)} in the electronic memory.
摘要翻译： 本发明的一个实施例涉及一种基于自适应基于上下文的预测器，其预测存储在电子存储器中的对应于噪声数据集符号的噪声数据集符号zi的值（从（x） 噪声被噪声引入通道引入。 基于自适应基于上下文的预测器操作的一个或多个参数来调整自适应基于上下文的预测器，所述参数中的至少一个在功能上取决于或部分地功能地取决于由噪声引入信道表示的噪声水平。 基于自适应基于上下文的预测器从上下文计算多个中间值，从中间值计算预测值{circumflex over（x）}，并将预测值{circumflex over（x）}存储在电子存储器中。
-
8.发明申请Method and system for denoising a noisy signal generated by an impulse channel 有权用于去噪由脉冲信道产生的噪声信号的方法和系统公开(公告)号：US20080075206A1
公开(公告)日：2008-03-27
申请号：US11527062
申请日：2006-09-25
IPC分类号： H03D1/04
摘要： In various embodiments of the present invention, a binary mask corresponding to a noisy symbol sequence is produced to indicate which of the symbols in the noisy symbol sequence has potentially been modified, or altered, by a noisy channel. DUDE, DUDE-CTI, and other denoising methods are modified to employ the bit mask in order to avoid the computational overhead and potential errors incurred in attempting to denoise symbols that are not likely to have been altered by the noisy channel.
摘要翻译： 在本发明的各种实施例中，产生对应于噪声符号序列的二进制掩码，以指示有噪声符号序列中的哪些符号可能被噪声信道修改或改变。 DUDE，DUDE-CTI和其他去噪方法被修改为采用位掩码，以避免在尝试去噪噪声信道不太可能改变的符号时产生的计算开销和潜在错误。
-
9.发明授权Method and system for minimizing the length of a defect list for a storage device 有权用于最小化存储设备的缺陷列表的长度的方法和系统公开(公告)号：US07013378B2
公开(公告)日：2006-03-14
申请号：US10427526
申请日：2003-04-30
IPC分类号： G06F12/16
CPC分类号： G11C29/40 , G11C29/802 , G11C2029/1208 , G11C2029/4402
摘要： A number of methods and systems for efficiently storing defective-memory-location tables. A asymmetrical-distortion-model vector quantization method and a run-length quantization method for compressing a defective-memory-location bit map that identifies defective memory locations within a memory are provided. In addition, because various different compression/decompression methods may be suitable for different types of defect distributions within a memory, a method is provided to select the most appropriate compression/decompression method from among a number of compression/decompression methods as most appropriate for a particular defect probability distribution. Finally, bit-map compression and the figure-of-merit metric for selecting an appropriate compression technique may enable global optimization of error-correcting codes and defective memory-location identification.
摘要翻译： 用于有效地存储缺陷存储器位置表的一些方法和系统。 提供了用于压缩识别存储器内的不良存储器位置的缺陷存储器位置位图的非对称失真模型向量量化方法和游程长度量化方法。 此外，由于各种不同的压缩/解压缩方法可能适合于存储器内的不同类型的缺陷分布，所以提供了一种方法来从多个压缩/解压缩方法中选择最合适的压缩/解压缩方法，最适合于 特定缺陷概率分布。 最后，位图压缩和用于选择适当压缩技术的品质因数度量可以实现误差校正码和缺陷存储器位置识别的全局优化。
-
10.发明申请公开(公告)号：US20130127637A1
公开(公告)日：2013-05-23
申请号：US13812037
申请日：2010-07-26
IPC分类号： H04W52/02
CPC分类号： H04W52/0209 , H04L67/12 , H04W4/38 , H04W52/0251 , Y02D70/00
摘要： A technology is provided for compressing digital discrete node data to reduce overall power consumption. Node data can be represented by a plurality of data units with a specified data width and can also be viewed as a plurality of bit planes corresponding to data at each bit position for the data units. A threshold bit position value may be selected for data units using an achievable compressibility estimate relative to an estimated energy consumption. The threshold bit position value can represent a boundary where an estimated energy consumption for compressing and transmitting a bit plane is less than an estimated energy consumption for transmitting the bit plane uncompressed. A bit plane is selected in the plurality of bit planes with a bit position value greater than the threshold bit position value. The bit plane is compressed using a compressor in the networked node.
摘要翻译： 提供了一种用于压缩数字离散节点数据以减少总功耗的技术。 节点数据可以由具有指定数据宽度的多个数据单元表示，并且还可以被视为对应于数据单元的每个位位置处的数据的多个比特平面。 可以使用相对于估计的能量消耗的可实现的可压缩性估计来为数据单元选择阈值位置值。 阈值位位置值可以表示用于压缩和发送位平面的估计能量消耗小于用于发送未压缩的位平面的估计能量消耗的边界。 在多个比特平面中选择比特平面，比特位置值大于阈值比特位置值。 使用联网节点中的压缩器对位平面进行压缩。
-
-
-
-
-
-
-
-
-
搜索结果
72 条记录 (耗时 0.033 秒)
