DATA COMPRESSING COMPUTER SYSTEM AND PROCESS THERETO

Abstract: The prior art compression of a data in computer memory and transmission of compressed data has proved to be uneconomical and too slow. The present process uses dimensional co-ordinates of the place of the data as its value for coding purposes. The coding process, as shown by the flow chart of Fig. 2C, is based on a compression of the distances between "on" and "off" states of bits of data bytes as they progress through stages (34, 35, 36, 37 and 38) and a decoding process of Fig. 2C, as shown by other stages (40, 41, 42 and 43). The coding and decoding processes are controlled by a repeating control stage (39) that increases the compression of the data as many times as ordered. By using the repeated coding of the dimensioned co-ordinates of the place of the data in the transmitted/received data in the computer system or in the transmission system, the volume of the computer memory is increased and the communications are done more economically.

Description: DATA. COKESESSING COMPUTER STSTEM JLUD IROCESS THERETO TECHNICAL FIELD The present invention relates to new and useful process and devices for coding and compression any numerical, al¬ phabetical and special characters, or just numbers into memory s stems and for transmission and reception the data in communication systems more economical way tkat used at now, and it relates particularly to repeated *•*_!»£ pro¬ cess and devices for compression the data into memory sys¬ tems, communication systems amd related devices that in¬ crease the level of compression respectively. BACKGROUND ART Since the first computers were built, it became a trivi¬ al fact that most advantagieus way of representation of the data in a* computer memory was tho binary system of numbers, although the base 3 could give some omlargmont in a compu¬ ter memory, as well as an additional difficulty of electro¬ nic realization. It were also known some packed formats for a numerical data and some methods of compressing tho data, using better density of coding, that gave some not signifi¬ cant improvement of the volume of tho data. Smch methods of compressing tho data may bo presented by following examples: I. U.S. patent 3,717,851, -John Coeke ant others, Job. 20, 1973 used groups of alphabetical characters (a. re ix of a word) rather than as single characters (a letter) in order to compact the data. 2. U.S. patent 3,936,808, Joseph L. O'Neill, Jr., 7ob. 3, 1976 used to compact the data for use by a video display momitor. Sach coded repeat sequence specifies a repeat ope¬ ration and a particular number of times that a display data character is to be repeated in a display line. 23_.e inventi¬ on compacts the data by gating rid of the unsubstantial da- ta. 3. U.S. patent 4,150,400, Kwan T. Wong, Apr. 17, 1979 used a coarse seaming device for analog signals that were encoded and compressed to distinguish between tho white background and black elements of the character. The inven¬ tion compacts the data by geting rid of seme elements of the data. 4. U.S. patent 4,232,375, John ?. Paugstat, Hev. 4, 1980 used to generate a compressed data record for the type of merchandise transaction being processed. The invention com¬ pacts the data by using specified cedes for tho limited groups of data. 5. U.S. patemt 4,282,546, Glenn A. Heitmeier, Aug. 4, 1981 used cemproasing the television image size using in- terpelated pixel values amd geting rid of seme unsubstan¬ tial data. 6. U.S., Reference Manual-IBM 1401 Data Processing Sys¬ tem, Apr., 1982. The IBM System used zero-suppression epe- ratiems in order to compact the data. In all examples above the previous art was based en previous theory. Thus, the development of coding systems in meaning of compressing the data was given in the mathe- matieal theory of infermatiom, particularly by C. Shanmem, where It was shewn that the speed of transmissiem cannot be better then a technical speed of a channel of trans¬ mission, that means the impossibility to compress the data but emly to improve the quality of coding, as was shewn in examples above. Particularly for binary systems the best speed is: speed/ .32...(numbers per second), that is very close to speed/4 for the hexadecimal numerical system. According to the above -memtiened statement of the pri¬ or theory and shewn examples, the prior art in significant compressiem of a data>d« not exist. As for embodiments of block diagram*, that are shewn em the drawi gs, tho similarity in appearanee of previous block diagrams that might occur would net represent the process of the present inven ten, as far as it was not known the cempresβimg process that is invented by the au- ther of the*- present invention. The author of the present invention challenged the base of tho theory of information amd mad* a discovery, that βentradiet; to an impossibility to compress.a data beyemd speed of the channel of transmission and trivial at new practice, and he based on it the novelty of tho invention. As far as the now mathematical conception, that was oreated by author, was never published, it is described and explained below.. Tho terminology and the symbols that are used below and partially in: seetion "description of tho pro erod embodiment* are net eertainly using the com¬ puter language, but rather they using language of mathe¬ matics. 0ml7 the invention itself are using the language to enable any person skilled in the art to make amd to use t. So, t e? mew mathematical cemceptiem consist of: If * itfc eeulel.be found out enee a process that decrease a number of bits, or a number of any ether representation of the data, at least (X + a) times, where (a) is any number or fraction, it would bo possible to increase the eapicity of memory, or the speed of the transmission channel, as many times (n) as ordered, by repeating the- process (m) times, so that: n » (I •+* a) x . However the theory of infbrmatiom examine only mathema¬ tical structure* s the sums as well as ether the*. rove that the-- best speed of transmission is los^n, that make* it im¬ possible to incre se the speed e_T transmission even (I + a) time*. Xt should be used seme stronger structure* and proces¬ ses. The author of the: present invention uses a ooding process that uses the dimemtienal co-ordinate of the plaoe of the data as it value, as described in this section and the section, entitled "deβeriptien of the preferred embodi¬ ment 11 . __hi_F process-- allows to lmorease the speed of the transmission (I + a) times Let's take a group of bytes: where b is a number of bits in each byte, so it earn rep¬ resent (n) numbers from (0) to (2 ), or lββ j o ('2* » n) di- gits. It can be changed into: where eac dark area m the t in the state en n (or "off"), and each blank is the group of one or more bits in the state "iff (or "en"), that determine the distamβe d-_. At least for seme d fc , the distameo is big emough to be eoded by the proeess that reprosemtimg d fc as new group of bits, and it will occupy only lg 2 d k ) bits. The probable amount of such giving in bits, for a big enough amount of data, is a 75 «f all bits, as will bo shown in the section entitled "description of the prefer¬ red embodiment". So, it earn be ceded (I + a) bits of information for each bit for big enough amoumt of data, that comtradiot to the theory of infermatiom and break through it limita¬ tion. The practical algorithm of the coding proeess is desc¬ ribed in the section "description of tho preferred embe- dimβnt". DISCLOSURE OF THE INVENTION The present invention break through oapicity limitation of memory and give also increasing of speed of computers and related devices'. It allows to build (or suply with ne¬ cessary improvement) less expensive computers, computer systems and related devices with practically unlimited me¬ mory eapieity for most of existent problems, using with invention existent at now technological level in conputers that will give also a possibility to have instead of main storage and auxiliary storage more compact representation of them in computer system that allows also to use less expensive and portable memory in many traditional and new areas. Last object will increase the processing speed, or at least compensate coding and decoding time, because of absence of auxiliary devices. Other object of the invention is the possibility to use new coding and decoding process for transmission and re- ception in communication and information systems, that will increase in nany times the density of transmission existent at now. BRIEF DESCRIPTION OF THE DRAWING Thus present invention will beconβ more readily in grea¬ ter detail hereinafter relative to non-linitativo embodi¬ ment- of the invention and the attached drawings, wherein show first drawing as block diagrams of systems and devices that nay bo build on principles of tho invention or nay bo used with it and useful in explaining these principles and next drawings are block diagrams of omβ ef useful variation of the process, so: PIG. IA is a block diagram of coding system that may be used with the invention. FIG. IB is a block diagram of decoding system that may be used with the invention. FIG*. IC is a bloek diagram of control unit for repea¬ ted cedli systems that may be used with the invention. FIG. 2A is a block diagram of one of useful variation of the coding proeess that may bo used with the invention. FIG. 2B ϊi t. block diagram of one of useful variation of the decoding process that may be used with the invention. ' FIG. 2C is a block diagram of one of useful variation of the- repeated ceding process for coding and decoding that may be used with the invention. DESCRIPTION OF THE PREFERRED EMBODIMENT Hereinafter, for illustrative purposes, omly the one example of each type ef systems amd processes is described without however limiting the scope ef the invention there¬ to. FIG. XA diagramatically illustrates am arrangement ef a ceding system that cedes seme data and it is compressing it into less number ef bits, using the ceding proeess that use* the co-ordinate ef the plaoe ef the "on" (or "off") bit a* the mew value ef the data. FIG. 2A illustrates the compressing ooding process that may be used a* following: Step one (25) consist of greupping the original bytes in one set ef numbers, big enough to make work the proba¬ bility ef average data and to give may compreβsiom. Xt can group for instance a thousand bits er mere for erne coding. If the process ef the ceding will be repeated, the bigger group of bytes has to be taken. Xf different arrangement ef the process was cheesen, this step earn be emited. Step two (26) comsist of enlarging ef the original bytes. Shis step is used only if different base ef the original bytes from the cheeβen base is represented, in erder te have th number ef bit* in the group as ehoesem. Stop three (27) say be used as following: Let's choose as original byte any number ef bits. __he group of cheesen bytes is changed into a set ef bits. The distances between each ef two "en" (or "off") states ef nearest bits will put together a new set ef numbers. For b ff enough amount of data the probability te find a dis¬ tance ef (Θ) is 25 ef all bits. Accordingly for each next distance: (I, 2, 3, •••* a) the probability will be 12.5 , 6.25 , ..., (1/(2* + 2 ))*IOO%. General ease can be as any correlation of distances. This step may consist ef fellcwimg substeps: I. From the last set ef distances between nea- rest states of "em" (or "off") bits the new set is chee¬ sen. It represents only distances (0) and (I), so that the first set of bits is coded into 57 * 5 ef bits plus several bits for identification ef the length ef the new set, eoded separately, that will occupy only lβg p L + e, where (L) is the length ef the new set ami (β) is seme number ef bits for additional coding. This subset can be defined using any ef the known oemputer processings er by other means,and it can be ceded as following: From the original set of dista ees it is choeβem one subset that includes distances bigger then (0) amd (X), and* secend subset that shews thir place in the original set ef distamees. The left numbers are ceded into memory as subset of distances (0) and (I), cheesem from the ori¬ gins! set, with identification ef the beginning and the end ef th subset in the memory, as was deeeribed above* 2. the two subsets, that were drawn out, are ce¬ ded into memory the same way, that was ceded the original set of distances in the substep before. The process could be continued at least until it la economical to represemt the last ef lefted subsets as subset ef distamees ceded directly. Xt earn be the secemd subset, that already is economical enough * X that ease it will give 5 subsets and 5 specified bytes te identify the length of eaeh subset t (I) length! subset (O.I) (2) length] subset (Q,...) ce-erd. ef distances of secend subset (5) length] subset (2,3) from secemd subset W longthl ,Isubset (>3) (5) longthj Isubset (0,...) ee-ord. of distances ef subset (4-) 3 * All subsets that consist of mere them two different numbers (subset (4) in the last example) are ce¬ ded directly, using fer economy bytes with different num¬ ber of bits, for instance: 6, 7 β t 9 Subsets (2) and (5) are added te set ef original dis¬ tances ef the next process ef compressing en the same da¬ ta. Step four (23) consist of ceding each ef the beginnings amd ends ef oeded into memory subsets as distances B. ■*■*. - B, , as was already found as the length ef each subset abo¬ ve, by giving an address te this specified bytes and sub¬ sets and placing then in memory in known order. Step five (29) consist ef rewriting the ceded data into memory as group ef bytes, original for using computer sys¬ tem, if it is the last process ef compressing em the same data. This step sight be emited if differe t arrangement ef the ceding process was cheesen. JTG. IB diagrammatically illustrates am arrangement ef decoding system that decodes the ceded data to original form for using computer system. FIG. 2S illustrates the decoding process for data that was ceded? by the ceding process abeve, and may be used as followin r Step one (30) consist of greupping the data, in shape ef original-bytes to-one se -e -bits, as it was- ceded in the ceding proeess. Step two (31) consist ef decoding the beginnings and ends of each of the ceded subsets in precise order. Step three (32) consist ef decoding each ef subsets, te ereate the original set ef numbers that was before the ce¬ ding, using any known computer preoessing, from subsets ef distances and its values. For instance, the 5 subsets from the last example ef ceding, can be used te reconstruct the original set ef bits. Step four (33) converts the decoded set ef bits te ori¬ ginal for using computer system form ef bytes, if it was required in cheesen arrangement ef the process.— II FIG. IC di grammatically illustrates am arrangenent for control unit for repeated process of the codings and decodings. FXG. 2C illustrates an repeated process of the ccdings and decedings, and nay be used as ellowing: Steps (34), (35), (36), (37), (38) and steps (40), (41), (42), (43) are the same as the steps (25), (26), (27), (28), (29) amd the steps (30), (3D, (32), (33) respectively. The ordered level of repeated compressimg the data (39) order the number ef codimgs amd dβeβdings, using a control umit, depemdimg em the volume ef the me¬ mory that is occupied by the data after each ef the co¬ dimgs. The number ef the codings on the sane data is wri- tten into specified byte ef the memory. The process earn be repeated as many times as necessary te receive desira¬ ble compression of a data. In order te avoid the possible nistako during the coding it can be used the deseding process and it eemparisem with the original data. It nay be involved equipment FIG. IA, FIG. IB, as sen¬ ding umits (I), (6) and as receiving units (5), (10), that are in infermatiom, cemmumicatien, computer amd re¬ lated systems amd devices. Xt also cam be created separa¬ ted data processing and eenpressing systems and devices, including software and hardware that are based en the ceding and decoding precessis above. Such systems and de¬ vices can use different level ef βempressiem tho data for different information, depending en ordered accessibility of information ef different priority of the ceded data. Xt weud be a "multilevel depth process", as far as it re¬ quires mere time for a higher level ef compression of the data. So, the mere compressed data will be deeper in the memory amd will requires mere time for access. She aeeos- sebility ef the data cam be i creased by the ooding the data tree, involving with each level ef the ooding new ceded blocks, la case tf decoding that infermatiom, the minimum aecess time will be needed for each block ef in¬ formation.

Claims: THE CLAIMS 1. A process for ceding and compressimg a data using the co-ordinate of the "en" (er "off") state ef the bit as the new value ef the data; any information can be represented as combination ef "on" aad "off" states ef bits ef memory, them it earn be determine the distances between "on" (or "off") states ef bits, er just "points" (or "blanks"), aad such distances can be ceded in a new group ef in ormation, software and hardware fer such pro¬ cess and data storage and processing apparatus. X3 2. A eeding and decoding processes in accordance with claim X wherein; from original set ef distamees it is ehoesen one subset expeling distances (0) and. (X), aad secend subset that shews the place ef that distances in the origi¬ nal set, the left numbers are ceded into memory as a subset ef distamees (0) amd (I), cheesem from ori¬ ginal set, with identification ef the beginning and end ef the last subset in the memory, the two subsets that were drawn out before are ceded imte memory the same way that was ceded the original set for distan¬ ces (0) and (I) and the process is continuing at le¬ ast until it is eceaoaical te represent the last ef the lefted subsets as subset ef distamees ceded di¬ rectly; from the set ef ceded data the bytes that idemtlfled the beginnings and the ends ef each ef the ceded sub¬ sets are deceded in precise order, according te each of deceded subsets, it is created the original set ef numbers as before the ceding, that process earn be al so used te compare the coding data te original. 3. A process of ceding and decoding in accordan¬ ce with claim I wherein the whole proeess can be repeated aβ many tines as neeessary according to the desired level •of compression ef the data, according with accβssebility •aad volume of data, using the ceded numbers again as a new •data for compressiem. 4. A data storage amd a processing apparatus in a«cerdance with claim I wherein: the systems and devices for repeated compressing ef the data using a control unit that order the number ef codings and decodings depending ea the volume ef the infermatiom and priority ef accessibility ef the in- formation; tho control unit that also uses in a control unit a di¬ fferent level ef compression the data for informati¬ on ef different priority and aecβssβbility.

Inventors: BERIDZE KONSTANTINE, BERIDZE, KONSTANTINE
Applicants: BERIDZE KONSTANTINE, BERIDZE, KONSTANTINE
Application year: 1985
Main classification: G06F5
IPC codes: G06F5, H03M7, H04L23