Garmin Corporation

Stephen C Robinson

Darin J Beesley

Thomas H Walters

Michael E Childs

Chunyen Liu

Shane R Runquist

Mark D Tompkins

Systems, devices and methods are provided to display or otherwise provide addresses in proximity to the device, and to periodically update the addresses as the navigational aid device is transported along a road. The device is adapted to be transported on a road. The device includes a processor and a memory adapted to communicate with the processor. The processor and the memory are adapted to cooperate to provide an address that is proximate to the device. Another aspect includes a method. According to one method embodiment, an address proximate to a navigational aid device is estimated and displayed on the navigational aid device. Other aspects are provided herein.

System, device and method for providing proximate addresses

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 2-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.

System and method for compressing data

Systems, devices and methods are provided to compress data, and in particular to code and decode data in a PDA. 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 2 -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.

System and method for compressing data in a PDA

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 2 -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.

A system and method for constructing an R-Tree index structure, and packing spatial data in the structure to permit parameters of the R-Tree to be constructed to be selected, within provided ranges, by an operator of the system. The spatial data features to be packed into the R-Tree constructed, are sorted, according to fractal geometry, and placed in a table of records. Each record is individually selected from the table, and data associated with each record is temporarily stored in one of a plurality of buffer storage locations according to a plurality of packing algorithms. The data in a buffer storage location is split, into first and second groups of data, upon the occurrence of one of a plurality of predetermined conditions. Data is selectively removed from the buffer for placement in the R-Tree being packed, such that data representing nearby geographical areas is most optimally clustered together. A portable electronic device such as a navigational aid, has a processor, a display, an input, and a memory, all housed by a housing, wherein the memory has spatial data indexed by an R-Tree index embedded therein.

System and method for packing spatial data in an R-tree

A electronic navigation device utilizing a desired orientation to adjust an electronic map displayed on the device. Acquiring global positioning system data, a processor calculates the current position of the navigation device. Scanning into cartographic memory located in memory, the processor locates a predefined thoroughfare containing or most adjacent the calculated position. Utilizing points located nearest the calculated position, the processor establishes the heading of the thoroughfare at that location. The processor adjusts the orientation of the map display to reflect the calculated heading of the adjacent thoroughfare. The processor continues to update the current position and the heading of the map display on a real time basis.

Use of desired orientation in automotive navigation equipment

A method and device implementing a three-level hierarchy for storing, recalling and processing navigational and graphical data. A vehicle is equipped with an electronic navigation thoroughfare planning device capable of calculating the distance to a desired thoroughfare. To calculate a distance, a driver inputs a plurality of variables, including cartographic data and a final desired destination, as well as several potential additional variables. Upon receiving the driver inputs, the navigation device implements a three-level hierarchy for storing, recalling and processing cartographic data. After the cartographic data is stored in memory, the navigation unit can calculate distance to a thoroughfare utilizing a cascading search method beginning with searching the most specific first level and progressing to the broader second and third levels until a common network between the two locations is established. The navigation device can also utilize the three level hierarchy to display cartographic data as a graphical map on the unit utilizing the same cascading method to display detail on the display screen and locate the specific details on any coordinate on the screen. Therefore the navigation unit utilizes the same three level hierarchy to calculate distance to a desired destination and to display a graphical representation of the map.

Method and apparatus for storing cartographic route data

A portable electronic navigational aid device and method calculates estimated time en route and estimated time of arrival. A user inputs a plurality of variables, including identity, cartographic data, final destination. Upon receiving the inputs, the device determines from cartographic data the estimated distance to the final destination and the type of thoroughfare the inputted trip will traverse. During operation, the device recalls the average driving velocity for the inputted driver over each different type of thoroughfare traversed. Using prestored average velocity data, the device calculates an initial estimated time en route and an estimated time of arrival for a desired route. The device continues to receive GPS data as to the driver's position and velocity and updates the average velocity record for that driver on the specific type of thoroughfare. As the average velocity fluctuates, the device adjusts the estimated time en route and the estimated time of arrival. The device further has control processes for potentially erroneous sampling. The device has a predetermined threshold in which data inputs below that threshold will not be averaged into the memory. The second control process of the present invention allows for zero velocity sampling without necessitating a reset of the entire system. If the device samples a zero speed, it will not average that velocity into the system as explained above. Rather, a stop time measured by a counter will be added to the estimated time en route and estimated time to arrival.

Calculation of estimated time of arrival (ETA) based on thoroughfare

A system for buffering data has a processor connected to a memory for storing mass data, connected to a single buffer having a plurality of buffer storage locations in a chain, and connected to a plurality of counters, wherein each counter corresponds to one of the buffer storage locations. The processor selects a sector of memory containing desired data associated with an open file, scans the buffer storage locations to determine whether the data is in the buffer and, when the data is not within the buffer, reads the data from the selected sector of memory into a selected buffer storage location that is unallocated to an open file. The processor then points to that allocated buffer storage location, so that the data can be retrieved from the buffer for processing. As additional data is desired that is not found in the buffer, the buffer storage location allocated to the open file is de-allocated and, if not allocated to any other open files, moved to the beginning of the chain of buffers. The sector of data containing the desired data is then read into a selected buffer that is not allocated to an open file, preferably the last unallocated buffer in the chain of buffers. In accordance with the present invention, a buffer storage location can be allocated to multiple open files. De-allocation of a buffer storage location from an open file will not cause the buffer storage location to be moved to the beginning of the chain when the buffer storage location is allocated to one or more other open files. When data within a buffer storage location has been modified, prior to de-allocation of that buffer storage location with respect to an open file, the processor writes the data, including the modifications, back to the associated sector in mass memory. In one embodiment, the system of the present invention is incorporated in a portable electronic device including a keyboard and a display, and a housing for housing the keyboard, display, processor, buffer, and memory. In a preferred embodiment, the portable electronic device is a navigation aid and selected data is map data.

System and method for buffering data

The storage space required for representing geographic features is reduced by determining an optimum number of bits that can be used to store coordinate data along each separate axis. Any coordinate change that cannot directly fit within the optimum bit size is subjected to an escape sequence made up of one or more special values and a normal value that fits in the optimum bit size. The special values are obtained by a predetermined calculation for each bit size. If all changes for one axis are in the same direction and special values are not needed, a global sign can be used to further enhance use of the available space on the storage medium.

Growing community of inventors

Olathe, KS, United States of America

Stephen C Robinson