Coded data generation or conversion – Digital code to digital code converters – Adaptive coding
Reexamination Certificate
2003-01-16
2004-04-20
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
Adaptive coding
C341S050000
Reexamination Certificate
active
06724326
ABSTRACT:
BACKGROUND OF THE INVENTION
Noiseless/lossless data compression greatly increases communication speed and memory capacity without degrading data integrity. One conventional method of lossless data compression used for text compression is called autosophy data communication. In this process, each text word is replaced by a preassigned word-number or address token that is associated with the word. Only the address tokens are communicated from a source site to a destination site. Each of the sites contains identical libraries of words and the corresponding word-number or address token. When a destination site receives a string of address tokens, the destination site uses the library to reconstruct the string of words originally input at the source site. This scheme is simple to implement, but is text-based and has limited compression capability.
Many schemes exist to compress intelligence bearing signals, such as sound or voice. However, there is a significant need for faster schemes to compress intelligence bearing signals, particularly toll-grade speech, so that existing communication media, such as fiber optic telephone cables, can be used more efficiently. The present invention fulfills such a need.
BRIEF SUMMARY OF THE INVENTION
An intelligence bearing signal is communicated from a source site to a destination site. The signal is in the form of a string of digitized analog signal samples. A sub-string dictionary, a linked list and an ID list are provided at the source site and the destination site. The sub-string dictionary has a plurality of entries. Each entry is a unique sub-string having a defined length. The linked list has a plurality of entries. The linked list entries include an address pointer to the start of each sub-string in the sub-string dictionary. The ID list has a plurality of entries. Each entry in the ID list contains the characteristics of each sub-string, and a pointer to the linked list entry that points to the first sub-string entry that has the characteristics of a respective sub-string. In the communication process, a string of digitized analog signal samples are parsed into a plurality of sub-strings. The sub-string dictionary and the ID list are then used to identify any sub-strings in the sub-string dictionary that correspond to any of the sub-strings obtained by the parsing operation. Only the address pointer in the linked list that correspond to any identified sub-strings are communicated from the source site to the destination site.
REFERENCES:
patent: 5442350 (1995-08-01), Iyer et al.
patent: 5486826 (1996-01-01), Remillard
patent: 5513298 (1996-04-01), Stanford et al.
patent: 5570455 (1996-10-01), Remillard
patent: 5594435 (1997-01-01), Remillard
patent: 5615296 (1997-03-01), Stanford et al.
patent: 6128338 (2000-10-01), Behaghel et al.
Akin Gump Strauss Hauer & Feld & LLP
Lauture Joseph
Pathobiotek Inc.
Young Brian
LandOfFree
System and method for compressing an intelligence bearing... 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 an intelligence bearing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for compressing an intelligence bearing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3243279