Browse Prior Art Database

Systematic Method for Information Compression

IP.com Disclosure Number: IPCOM000077251D
Original Publication Date: 1972-Jun-01
Included in the Prior Art Database: 2005-Feb-25
Document File: 3 page(s) / 71K

Publishing Venue

IBM

Related People

Ling, H: AUTHOR [+2]

Abstract

This is a method for compressing data. Referring to Fig. 1, input information is entered to the shift register R and shifted downward 1 bit at a time. Before each shift, the contents of Rs is loaded into the next storage position in storage A. After k shifts, there are k vectors formed in storage A, where A can be any storage component, such as core or registers. These vectors are sent from storage A to arithmetic unit B. In unit B, k sets of modulo two addition are performed according to the rules of Equation (1), below: (Image Omitted)

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 3

Systematic Method for Information Compression

This is a method for compressing data. Referring to Fig. 1, input information is entered to the shift register R and shifted downward 1 bit at a time. Before each shift, the contents of Rs is loaded into the next storage position in storage A. After k shifts, there are k vectors formed in storage A, where A can be any storage component, such as core or registers. These vectors are sent from storage A to arithmetic unit B. In unit B, k sets of modulo two addition are performed according to the rules of Equation (1), below:

(Image Omitted)

1

Page 2 of 3

2

[This page contains 7 pictures or other non-text objects]

Page 3 of 3

3

[This page contains 2 pictures or other non-text objects]