Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Compression/Decompression Technique for Character Sets

IP.com Disclosure Number: IPCOM000042767D
Original Publication Date: 1984-Jun-01
Included in the Prior Art Database: 2005-Feb-04

Publishing Venue

IBM

Related People

Authors:
Foster, RLJ [+details]

Abstract

Character cell oriented dot matrix character sets tend to have certain characteristics which can be used to reduce the data required to define them. The particular characteristics made use of by this algorithm are: A lot of the data in a given cell consists of zeros (non-displayed). Only part of the cell is normally used for the character definition. Horizontal slices within the cell are often repeated. The compression process starts with the selection of a cell and matrix size for the character set and the location of the matrix within the cell. These parameters are then used to perform the full compression. Compression of each cell starts with a scan of all slices within the cell from the first matrix slice to the last cell slice inclusive. The first data bit in the compressed data defines the extent of non- zero data.