Algorithmic data compression

Pulse or digital communications – Spread spectrum – Direct sequence

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

358433, 36471502, H04B 166

Patent

active

050349686

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.

REFERENCES:
patent: 4204227 (1980-05-01), Gurley
patent: 4222076 (1980-09-01), Knowlton
patent: 4768082 (1988-08-01), Hiratsuka et al.
patent: 4772956 (1988-09-01), Roche et al.
patent: 4821119 (1989-04-01), Gharaui
patent: 4849812 (1989-07-01), Borgers et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Algorithmic data compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Algorithmic data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic data compression will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-438474

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.