公开(公告)号：US20130229292A1

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

申请号：US13586416

申请日：2012-08-15

申请人： Doo Hyun KIM ,  Do Hyung Kim ,  Shi Hwa Lee

发明人： Doo Hyun KIM ,  Do Hyung Kim ,  Shi Hwa Lee

IPC分类号： H03M7/40

CPC分类号： H03M7/425 ,  H03M7/4043 ,  H03M7/4062 ,  H04N19/91

摘要： A decoding apparatus and method store at least one table including at least one code, receive at least one instruction signal, and extract a symbol value and a symbol length from the at least one table based on the at least one instruction signal. The decoding apparatus calculates a target suffix length that minimizes the size of a generated table and minimizes the size of a non-prefix length of the at least one code.

摘要翻译： 解码装置和方法存储至少一个表，该表至少包括一个代码，接收至少一个指令信号，以及基于至少一个指令信号从所述至少一个表提取符号值和符号长度。 解码装置计算使生成的表的大小最小化的目标后缀长度，并且使至少一个代码的非前缀长度的大小最小化。

公开(公告)号：US09219500B2

公开(公告)日：2015-12-22

申请号：US13382956

申请日：2010-07-09

申请人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber ,  Simone Tertoolen

发明人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber ,  Simone Tertoolen

IPC分类号： G01C21/34 ,  H03M7/30 ,  G08G1/0968 ,  H03M7/40

CPC分类号： G01C21/3453 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3664 ,  G01C21/367 ,  G08G1/096827 ,  G08G1/09685 ,  G08G1/096866 ,  H03M7/3068 ,  H03M7/40 ,  H03M7/4043 ,  H03M7/70 ,  H03M7/705

摘要： This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions at different times and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost at the travel time.

摘要翻译： 本发明涉及使用包括多个可导航路径的地图数据来确定路线的方法，该地图数据被分成多个区域。 该方法包括使用至少一个处理装置：在地图数据和行进时间上接收原点和目的地，使用地图数据和识别区域之间的最小成本路径的最小成本数据确定从原点到目的地的路线 的地图数据。 如果在不同时间的一对区域之间存在不同的最小成本路径，并且确定路线包括从包括原点的一对区域的最小成本路径中识别最小成本数据，则识别一对区域之间的多于一个最小成本路径 和目的地，在旅行时间具有最低成本的最小成本路径。

公开(公告)号：US20180167084A1

公开(公告)日：2018-06-14

申请号：US15577680

申请日：2016-06-10

申请人： GURULOGIC MICROSYSTEMS OY

发明人： Ossi KALEVO

IPC分类号： H03M7/48 ,  H03M7/40

CPC分类号： H03M7/48 ,  H03M7/4006 ,  H03M7/4043 ,  H03M7/607 ,  H04L69/04

摘要： An encoder is provided. The encoder is operable to analyze input data (D1) to identify at least one mode symbol therein. The encoder is operable to generate data values of a first type including non-mode symbols and data values of a second type including runs of the at least one mode symbol. Moreover, the encoder is operable to generate information that is indicative of a count of the non-mode symbols and information that is indicative of the at least one mode symbol. Furthermore, the encoder is operable to assemble or encode the information that is indicative of the at least one mode symbol, the information that is indicative of the count of the non-mode symbols, the data values of the first type including the non-mode symbols and the data values of the second type including the runs of the at least one mode symbol, to generate encoded data (E2).

公开(公告)号：US09513813B1

公开(公告)日：2016-12-06

申请号：US14975153

申请日：2015-12-18

申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

发明人： Tobias Blaettler ,  Thomas Mittelholzer ,  Nikolaos Papandreou ,  Thomas Parnell ,  Charalampos Pozidis

IPC分类号： G06F12/00 ,  G06F3/06

CPC分类号： G06F3/0608 ,  H03M7/3086 ,  H03M7/4043

摘要： A set of K prefix codes for use in pseudo-dynamic compression are determined by seeding each of K clusters with a respective one of K data pages selected from a training data set, where K is a positive integer greater than 1. For each of the K randomly selected data pages, a prefix code is determined for its cluster utilizing Huffman encoding. Each remaining data page of the training data set is assigned to one of the K clusters whose prefix code yields the highest compression ratio. For each of the K clusters, the prefix code is updated by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. The set of K prefix codes determined for the K clusters is then output.

摘要翻译： 用于伪动态压缩的一组K个前缀码是通过用从训练数据集中选出的K个数据页中的相应一个K个簇进行种子来确定的，其中K是大于1的正整数。 K随机选择的数据页面，使用霍夫曼编码确定其簇的前缀码。 将训练数据集的每个剩余数据页分配给其前缀码产生最高压缩比的K个簇中的一个。 对于K个集群中的每一个，通过在分配给该集群的所有页面上执行Lempel-Ziv（LZ）编码来更新前缀码，从LZ编码的结果形成序列，并且从集群中提取更新的前缀码 序列利用霍夫曼编码。 然后输出为K个群集确定的K个前缀码的集合。

公开(公告)号：US20160178386A1

公开(公告)日：2016-06-23

申请号：US14949985

申请日：2015-11-24

申请人： TomTom Navigation B.V.

发明人： Heiko Schilling ,  Simone Francine Tertoolen ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber

IPC分类号： G01C21/34 ,  G01C21/36

CPC分类号： G01C21/3453 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3664 ,  G01C21/367 ,  G08G1/096827 ,  G08G1/09685 ,  G08G1/096866 ,  H03M7/3068 ,  H03M7/40 ,  H03M7/4043 ,  H03M7/70 ,  H03M7/705

摘要： This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions at different times and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost at the travel time.

摘要翻译： 本发明涉及使用包括多个可导航路径的地图数据来确定路线的方法，该地图数据被分成多个区域。 该方法包括使用至少一个处理装置：在地图数据和行进时间上接收原点和目的地，使用地图数据和识别区域之间的最小成本路径的最小成本数据确定从原点到目的地的路线 的地图数据。 如果在不同时间的一对区域之间存在不同的最小成本路径，并且确定路线包括从包括原点的一对区域的最小成本路径中识别最小成本数据，则识别一对区域之间的多于一个最小成本路径 和目的地，在旅行时间具有最低成本的最小成本路径。

公开(公告)号：US20180310012A1

公开(公告)日：2018-10-25

申请号：US15496562

申请日：2017-04-25

申请人： Intel Corporation

发明人： Gregory B. Tucker ,  James D. Guilford ,  Daniel F. Cutter ,  Vinodh Gopal ,  Wajdi K. Feghali

IPC分类号： H04N19/426 ,  H04N19/66

CPC分类号： H03M7/40 ,  H03M7/3086 ,  H03M7/4043

摘要： Methods and apparatus are described by which data is compressed using semi-dynamic Huffman code generation. Embodiments generate symbol statistics over a portion of data. The symbol statistics are expanded to include all possible literals that could appear within the data. Any literal or reference added to the statistics may be given a frequency of one. The statistics are used to generate a semi-dynamic Huffman code. The entire data is then compressed using the semi-dynamic Huffman code.

公开(公告)号：US08788202B2

公开(公告)日：2014-07-22

申请号：US13544028

申请日：2012-07-09

申请人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber ,  Dominique Pelle

发明人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber ,  Dominique Pelle

IPC分类号： G01C21/34

CPC分类号： G01C21/3453 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3664 ,  G01C21/367 ,  G08G1/096827 ,  G08G1/09685 ,  G08G1/096866 ,  H03M7/3068 ,  H03M7/40 ,  H03M7/4043 ,  H03M7/70 ,  H03M7/705

摘要： A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map.

摘要翻译： 一种创建包括搜索加速度数据的地图数据的方法，所述地图数据被布置成增加跨越包括多个可导航段的电子地图可以规划路线的速度，每个可导航段代表由所述地图覆盖的区域中的可导航路线的一段 。

公开(公告)号：US20130173152A1

公开(公告)日：2013-07-04

申请号：US13544028

申请日：2012-07-09

申请人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber

发明人： Heiko Schilling ,  Ewgenij Gawrilow ,  Moritz Hilger ,  Andreas Profous ,  Jürgen Werber ,  Dominique Pelle

IPC分类号： G01C21/34

CPC分类号： G01C21/3453 ,  G01C21/3446 ,  G01C21/3492 ,  G01C21/3664 ,  G01C21/367 ,  G08G1/096827 ,  G08G1/09685 ,  G08G1/096866 ,  H03M7/3068 ,  H03M7/40 ,  H03M7/4043 ,  H03M7/70 ,  H03M7/705

摘要： A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map.

摘要翻译： 一种创建包括搜索加速度数据的地图数据的方法，所述地图数据被布置成增加跨越包括多个可导航段的电子地图可以规划路线的速度，每个可导航段代表由所述地图覆盖的区域中的可导航路线的一段 。

公开(公告)号：US20190097650A1

公开(公告)日：2019-03-28

申请号：US15771370

申请日：2016-11-01

申请人： GURULOGIC MICROSYSTEMS OY

发明人： Kai WILLNER ,  Ossi KALEVO

IPC分类号： H03M7/40 ,  H03M7/30

CPC分类号： H03M7/4043 ,  H03M7/4031 ,  H03M7/6005 ,  H03M7/6035

摘要： An encoder for encoding input data to generate corresponding encoded data is provided. The encoder (10) is operable to process a sequence of elements in the input data from a first element thereof to a last element thereof. The elements have corresponding symbols. The encoder is operable to compute probabilities of symbols present in the sequence, wherein the probabilities of the symbols are computed whilst disregarding those elements of the sequence that have already been encoded into the encoded data. Moreover, the probabilities of the symbols are adaptively changed as the sequence of elements is progressively encoded into the encoded data. Furthermore, information describing the probabilities is delivered; optionally, the probabilities of the symbols are accompanied with additional information indicating how the probabilities are adaptively changing. There is also provided a decoder for performing an inverse of encoding performed by the encoder.

公开(公告)号：US08674857B2

公开(公告)日：2014-03-18

申请号：US13586416

申请日：2012-08-15

申请人： Doo Hyun Kim ,  Do Hyung Kim ,  Shi Hwa Lee

发明人： Doo Hyun Kim ,  Do Hyung Kim ,  Shi Hwa Lee

IPC分类号： H03M7/40

CPC分类号： H03M7/425 ,  H03M7/4043 ,  H03M7/4062 ,  H04N19/91

摘要： A decoding apparatus and method store at least one table including at least one code, receive at least one instruction signal, and extract a symbol value and a symbol length from the at least one table based on the at least one instruction signal. The decoding apparatus calculates a target suffix length that minimizes the size of a generated table and minimizes the size of a non-prefix length of the at least one code.

摘要翻译： 解码装置和方法存储至少一个表，该表至少包括一个代码，接收至少一个指令信号，以及基于至少一个指令信号从所述至少一个表提取符号值和符号长度。 解码装置计算使生成的表的大小最小化的目标后缀长度，并且使至少一个代码的非前缀长度的大小最小化。