Run length data compression

Runs of the same bit value are identified within the data to be compressed and decompressed into a series of groups of bits wherein the number of bits in each group progressively increases as compared to the preceding groups until all of the bits of the run can be represented. In a run of thirteen b...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	SIMON PHIPPS, PAUL STUART ADAMS, BENEDICT DANIEL GLADWYN, VINCE SINGLETON
Format:	Patent
Sprache:	eng
Schlagworte:	BASIC ELECTRONIC CIRCUITRY CALCULATING CODE CONVERSION IN GENERAL CODING COMPUTING COUNTING DECODING ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY IMAGE DATA PROCESSING OR GENERATION, IN GENERAL PHYSICS PICTORIAL COMMUNICATION, e.g. TELEVISION
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Runs of the same bit value are identified within the data to be compressed and decompressed into a series of groups of bits wherein the number of bits in each group progressively increases as compared to the preceding groups until all of the bits of the run can be represented. In a run of thirteen bits, the initial bit valve is output followed by a 0 bit indicating that a 13 bit run cannot be represented by 1 bit. A 000 bit code is then output indicating that a 12 bit run (13-1) cannot be represented by 3 bits (1+2). A 00101 bit code is output indicating that the remaining 5 bits (12-7) can be represented by 5 bits (3+2).