The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 23, 1991

Filed:

Jul. 03, 1989
Applicant:
Inventors:

Gene Willey, Kechi, KS (US);

John Wakefield, Menlo Park, CA (US);

Chris Radcliffe, Redwood City, CA (US);

Assignee:

Other;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04B / ;
U.S. Cl.
CPC ...
375122 ; 358433 ; 36471502 ;
Abstract

The present invention is for an algorithmic method for compressing data. The data is compressed one cycle at a time and stores a data block each cycle. The method includes the steps of forming a storage array of binary bits. The array has a first plurality of columns, a second plurality of rows, a third plurality of right diagonals and a fourth plurality of left diagonals. In the preferred embodiment the array has 30 rows, 30 columns, 59 left diagonals and 59 right diagonals. The array also has a data entry site. The array is also segmented into a plurality of morsels each comprising a collection of a binary bits. A new data block is entered into the data entry site. A fifth plurality of sums is formed representing the sum of binary 1's in each column, each row, each right diagonal and each left diagonal. Each sum is right diagonal and each left diagonal. Each sum is stored into a morsel thereby forming a summation array. Each summation array contains sufficient information to decompress the parent array and a compressed bit of information.


Find Patent Forward Citations

Loading…