Adaptive display refresh and data compression in a radio frequency environment
First Claim
1. A method of compressing data comprising:
- (a) first implementing a run length compression scheme to output repeated characters in a stream of input data as flags followed by a count of the number of repetitions;
(b) second implementing a sliding dictionary scheme to output a character itself if it is occurring for the first time in the stream of input data, and to output a pointer to a previously compressed character if the character has already occurred in the stream of input data;
(c) formatting the output of step (b) by adding an additional bit to each character or pointer to indicate whether it represents a character or a pointer; and
(d) accumulating the additional bits into a first byte of a set of data bytes to indicate whether each byte in the set is a character or a pointer,such that data communication speed is improved without an increase in memory storage used.
3 Assignments
0 Petitions
Accused Products
Abstract
An adaptive display refresh and data compression solution for use in an RF network environment is described, where a network controller and portable terminals maintain an adaptive history of commonly used past information in order that is may be repeated quickly and communication speeds can be increased. A network controller maintains a separate history for each of the terminals in the RF network, and transmits a coded reference for the activities that are contained in the history, which is stored in the memory of both the controller and the portable terminal. Terminals and the controller additionally may negotiate to determine the data compression features which will be supported in communication between the two devices. Data is compressed according to the present invention by utilizing a hybrid run length and sliding dictionary compression scheme. Data is precompressed by a run length compressor, and is further compressed by a specialized sliding dictionary technique designed to minimize memory storage and transmission time requirements, resulting in an efficient data compression method requiring little additional storage.
-
Citations
1 Claim
-
1. A method of compressing data comprising:
-
(a) first implementing a run length compression scheme to output repeated characters in a stream of input data as flags followed by a count of the number of repetitions; (b) second implementing a sliding dictionary scheme to output a character itself if it is occurring for the first time in the stream of input data, and to output a pointer to a previously compressed character if the character has already occurred in the stream of input data; (c) formatting the output of step (b) by adding an additional bit to each character or pointer to indicate whether it represents a character or a pointer; and (d) accumulating the additional bits into a first byte of a set of data bytes to indicate whether each byte in the set is a character or a pointer, such that data communication speed is improved without an increase in memory storage used.
-
Specification
-
- Resources
-
Current AssigneeIntermec IP Corporation (Honeywell International Inc.)
-
Original AssigneeNorand Corporation (Baker Hughes Company)
-
InventorsSpiess, Gary N.
-
Primary Examiner(s)Chin, Stephen
-
Assistant Examiner(s)Le, Amanda T.
-
Application NumberUS08/270,239Time in Patent Office921 DaysField of Search375/240, 375/253, 375/259, 375/377, 341/51, 341/55, 341/59, 341/63, 341/67, 341/87, 341/95, 341/99, 341/106, 358/426, 358/261.1, 358/261.2, 358/261.4, 370/109, 370/118, 348/384, 348/400US Class Current375/240CPC Class CodesH03M 7/3086 employing a sliding window,...H03M 7/46 Conversion to or from run-l...
