Data processing: vehicles – navigation – and relative location – Navigation
Reexamination Certificate
2005-01-04
2005-01-04
Zanelli, Michael J. (Department: 3661)
Data processing: vehicles, navigation, and relative location
Navigation
C341S065000
Reexamination Certificate
active
06839624
ABSTRACT:
Systems, devices and methods are provided to compress data, and in particular to code and decode data. One aspect of the present subject matter is a data structure. The data structure includes a field representing a decoding structure to decode canonical Huffman encoded data, and a field representing a symbol table. The decoding structure includes a field representing an accelerator table to provide a 2N-deep direct-index lookup to provide high-frequency symbols for high-frequency data and to provide bracketing indices for low-frequency data. The decoding structure also includes a field for a binary search table to provide a low-frequency symbol index using a binary search bounded by the bracketing indices provided by the accelerator table. The symbol table is adapted to provide a symbol associated with the low-frequency index.
REFERENCES:
patent: 3883847 (1975-05-01), Frank
patent: 5208593 (1993-05-01), Tong et al.
patent: 5528248 (1996-06-01), Steiner et al.
patent: 5821887 (1998-10-01), Zhu
patent: 5938721 (1999-08-01), Dussell et al.
patent: 6021406 (2000-02-01), Kuznetsov
patent: 6047280 (2000-04-01), Ashby et al.
patent: 6219457 (2001-04-01), Potu
patent: 6266612 (2001-07-01), Dussell et al.
patent: 6317684 (2001-11-01), Roeseler et al.
patent: 6317687 (2001-11-01), Morimoto et al.
patent: 6321158 (2001-11-01), DeLorme et al.
patent: 6393149 (2002-05-01), Friederich et al.
patent: 6411899 (2002-06-01), Dussell et al.
patent: 6504496 (2003-01-01), Mesarovic et al.
patent: 6563440 (2003-05-01), Kangas
patent: 20030006918 (2003-01-01), Barnett
Nekritch, Y.;Byte-oriented decoding of canonical Huffman codes; IEEE-Information Theory 2000; Jun. 2000; p. 371.
Chung et al.;Level-Compressed Huffman Decoding; IEEE-Transactions on Communications; Oct. 1999; vol. 47, No. 10; pp. 1455-1457.
An optimal pathfinder for vehicles in real-world digital terrain maps; http://www.neas.net/jamsoft/shortestpath/pathfinder/4.html, 11 pages (1999).
Informed Search Methods, Artif icial Intelligence, A Modern Approach, Prentice Hall, Inc., pp. 92-115 (1995).
Real-Time Vehicle Routing in Dynamic and Stochastic Urban Traffic Networks, http://www/gpu.srv.ualberta.ca/lfu/research.htm, pp. 103 (1997).
Ahuja, R., et al.,Faster Algorithms for the Shortest Path Problem, Journal of the Association for Computing Machinery, 37(2), pp. 213-223 (1990).
Chung, V., et al.,An Efficient Implementation of Parallel A, CFPAR, Montreal, Canada, pp. 153-167 (1994).
Fredman, M. et al.,Fibonaci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34(3), 2 pages (1987).
Fu, L.,Heuristic Shortest Path Algorithms and their Potential IVHS Applications, Proceedings of the Fourth University of Alberta—University of Calgary, Joint G raduate Student Symposium in Transportation Engineering, pp. 83-109 (1995).
Ikeda, T., et al.,A Fast Algorithm for Finding Better Routes by Al Search Techniques, Vehicle Navigation and Information Sy stems Conf erence Proceedings, pp. 291-296 (1994).
Kaindl, H., et al.,Memory-Bounded Bidirectional Search, Proceedings of the 12thNational Conference on Art, AAI Press, Seattle, WA, pp. 1359-1364 (1994).
Laporte, G.,The Vehicle Routing Problem: An overview of exact and approximate algorithms, European Journal of Operational Research, 59, pp. 345-358 (1992).
Myers, B.,Date Structures for Best-First Search, http://w ww4.ncsu.edu/ibmyers/dsai.htm, pp. 1-6 (1997).
Ronngren, R., et al.,Parallel and Sequential Priority Queue Algorithms, ACM Transactions on Modeling and Computer Simulation, 7(2),pp. 168-172, 198, 199 (1997).
Stout, B.,Smart Moves: Intelligent Pathf inding, Gamasutra, http://www.gamasutra.com/features/programming/080197/pathfinding.htm, pp. 1-11 (1997).
Wai, L. et al.,Comparative Study of Shortest Path Algorithm for Transport Network, USRP Report2, http://www.comp.nus.edu.sg/leonghoa/USRPreport-txt.html, pp. 10-10 (1999).
Zhan, F.B.,Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures, Journal of Geographic Information and Decision Analy sis, 1(1), http://www.geog.uwo.ca/gimda/journal/vol.1.1/Zhan/Zhan.html 11 pages (1997).
Zhao, Y., et al.,An Adaptive Route-Guidance Algorithm for Intelligent Vehicle Highway Systems, American Control Conf erence, Boston, MA, Department of Electrical Engineering and Computer Science, The University of Michigan, pp. 2568-2573 (1991).
Beesley Darin J.
Childs Michael
Liu Chunyen
Robinson Stephen C.
Garmin Ltd.
Rolf Devon A.
Zanelli Michael J.
LandOfFree
System and method for compressing data does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for compressing data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for compressing data will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3427414