Method and apparatus for using finite state machines to perform

Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

341 67, 341 58, 341 94, 341106, H03M 740, H03M 1300

Patent

active

054753880

ABSTRACT:
The present invention provides an encoding and decoding apparatus used for the compression and expansion of data. A state machine is provided having a plurality of states. Each state has at least one transition pair. Each element of the transition pair comprises zero or more bits representative of the compact code to be output and the identification of the next state to proceed to. The transition pair reflects an output for a yes and no response associated with the probability of the data to be compacted and whether the data falls within that probability.

REFERENCES:
patent: 4413251 (1983-11-01), Adler et al.
patent: 4488143 (1984-12-01), Martin
patent: 5265127 (1993-11-01), Betts et al.
Guazzo, A General Minimum Redundancy Source-Coding Algorithm, IEEE Transactions on Information Theory, vol. IT-26, No. 1 Jan. 1980, pp. 15-25.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for using finite state machines to perform does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for using finite state machines to perform , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for using finite state machines to perform will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1362932

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.