Bitwise adaptive encoding using prefix prediction

Details Bitwise adaptive encoding using prefix prediction Bitwise adaptive encoding using prefix prediction

2007-09-25

2007-09-25

To, Doris H. (Department: 2616)

Multiplex communications

Network configuration determination

Using a particular learning algorithm or technique

C370S400000, C370S408000, C341S065000, C341S067000, C341S107000, C709S247000

Reexamination Certificate

active

09780912

ABSTRACT:
A technique is presented for compressing data which leverages the frequency of an escape symbol for better compression. The prefix of a data string is evaluated and the probability of all characters that might succeed it is predicted in tabular form. Symbols are designated “Hit” or “Miss” based upon whether they are in the table. A binary tree is generated by partitioning nodes into Zero and One groups based on a single bit value. A partition bit is chosen to maximize the difference of probability sums of Hit symbols in Zero and One groups, with exceptions for partitions having non Hit symbols in one of the groups. A probability value is assigned to each branch, based on the probabilities of Hit and Miss symbols. Encoding or decoding a symbol is facilitated by encoding or decoding the branch probabilities on the shortest path from the root to the leaf node containing the symbol using arithmetic encoding or decoding method.

REFERENCES:
patent: 3716851 (1973-02-01), Neumann
patent: 4168513 (1979-09-01), Hains et al.
patent: 4500955 (1985-02-01), Chang
patent: 4646061 (1987-02-01), Bledsoe
patent: 5270712 (1993-12-01), Iyer et al.
patent: 5796356 (1998-08-01), Okada et al.
patent: 5801648 (1998-09-01), Satoh et al.
patent: 5844508 (1998-12-01), Murashita et al.
patent: 5973626 (1999-10-01), Berger et al.
patent: 6061398 (2000-05-01), Satoh et al.
patent: 6112208 (2000-08-01), Ikegami
patent: 6401188 (2002-06-01), Benayoun et al.
patent: 6535150 (2003-03-01), Ross
patent: 2002/0141422 (2002-10-01), Hu
patent: 2003/0174077 (2003-09-01), Acharya et al.
patent: 2003/0210164 (2003-11-01), Acharya et al.
patent: 0 079 442 (1983-05-01), None
patent: 1 231 717 (2002-08-01), None
Howard et al. “Practical Implementations of Arithmetic Coding.” Image and Text Compression, 1992, pp. 85-112, Kluwer, Boston, US.
Isal et al. “Word-Based Block-Sorting Text Compression.” Computer Science Conference, Proceedings of the 24thAustralasian Gold Coast, pp. 92-99, Jan. 29-Feb. 4, 2001, IEEE Computing Society, Los Alamitos, CA, USA.
Klappenecker et al. “Lossless Compression of 3D MRI and CT Data.” Proceedings of the SPIE, 1998, pp. 140-149, vol. 3458, SPIE, Bellingham, VA, US.

Affiliated with

Also associated with

Rating

Bitwise adaptive encoding using prefix prediction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bitwise adaptive encoding using prefix prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bitwise adaptive encoding using prefix prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3798814