-
公开(公告)号：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和后缀树构造概念来解码编码的字符串。
-
公开(公告)号：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内的源的表示的方法，包括评估包括后缀尾部和验证后缀尾的节点包括在所述表示中，并且当后缀尾部插入至少一个节点到所述表示时 不在代表中。
-
公开(公告)号：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和后缀树构造概念来解码编码的字符串。
-
公开(公告)号：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内的源的表示的方法，包括评估包括后缀尾部和验证后缀尾的节点包括在所述表示中，并且当后缀尾部插入至少一个节点到所述表示时 不在代表中。
-
-
-
搜索结果
4 条记录 (耗时 0.01 秒)
