Classifications

• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
  • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Definitions

• the present invention relates to new and useful process and devices for coding and compression any numerical, alphabetical and special characters, or just numbers into memory systems and for transmission and reception the data in communication systems more economical way that used at now, and it relates particularly to repeated coding process and devices for compression the data into memory systems, communication systems and related devices that increase the level of compression respectively.
• U.S. patent 4,232,375, John F. Paugstat, Nov. 4, 1980 used to generate a compressed data record for the type of merchandise transaction being processed.
• the invention compacts the data by using specified codes for the limited groups of data.
• the author of the present invention challenged the base of the theory of information and made a discovery, that contradiet to an impossibility to compress a data beyend speed of the channel of transmission and trivial at new practice, and he based on it the novelty of the invention.
• the author of the present invention uses a coding process that uses the dimentional co-ordinate of the plase of the data as it value, as described in this section and the section, entitled “description of the preferred embodiment". This process allows to increase the speed of the transmission (I + a) times:
• each dark area is the bit in the state “on” (or “off")
• each blank is the group of one or more bits in the state “off” (or “on”), that determine the distanse dk .
• the distance is big enough to be coded by the process that representing d k 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% of all bits, as will be shown in the section entitled "description of the preferred embodiment".
• 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 necessary improvement) less expensive computers, computer systems and related devices with practically unlimited memory eapieity for most of existent problems, using with invention existent at now technological level in computers 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 auxillary devices.
• Another object of the invention is the possibility to use new coding and decoding process for transmission and reception in communication and information systems, that will increase in many times the density of transmission existent at now.
• FIG. 1A is a block diagram of coding system that may be used with the invention.
• FIG. 1B is a block diagram of decoding system that may be used with the invention.
• FIG. 1C is a bloek diagram of control unit for repeated codig systems that may be used with the invention.
• FIG. 2A is a block diagram of one of useful variation of the coding process that may be used with the invention.
• FIG. 2B is a 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 coding process for coding and decoding that may be ussd with the invention.
• FIG. 1A diagramatically illustrates an arrangement of a coding system that codes some data and it is compressing it into less number of bits, using the coding process that uses the co-ordinate of the place of the "on” (or “off") bit as the new value of the data.
• FIG. 2A illustrates the compressing coding process that may be used as following:
• Step one (25) consist of groupping the original bytes in one set of numbers, big enough to make work the probability of average data and to give may compression. It can group for instance a thousand bits or more for one coding. If the process of the coding will be repeated, the bigger group of bytes has to be taken. If different arrangement of the process was choosen, this step can be emited.
• Step two (26) consist of enlarging of the original bytes. This step is used only if different base of the original bytes from the choosen base is represented, in order to have the number of bits in the group as choosen.
• Stop three (27) may be used as following:
• This step may consist of following substeps:
• the two subsets, that were drawn out, are coded into memory the same way, that was coded the original set of distances in the substep before.
• the process could be continued at least until it is economical to represemt the last of lefted subsets as subset of distances coded directly. It can be the second subset, that already is economical enough. In that case it will give 5 subsets and 5 specified bytes to identify the length of each subset:
• Subsets (2) and (5) are added to set of original distances of the next process of compressing on the same data.
• Step four (23) consist of coding each of the beginnings and ends of coded into memory subsets as distances B i +I B i , as was already found as the length of each subset above, by giving an address to this specified bytes and subsets and placing them in memory in known order.
• Step five (29) consist of rowriting the coded data into memory as group of bytes, original for using computer system, if it is the last process of compressing on the same data. This step might be emited if different arrangement of the coding process was choosen.
• FIG. 1B diagrammatically illustrates an arrangement of decoding system that decodes the coded data to original form for using computer system.
• FIG. 2B illustrates the decoding process for data that was coded by the coding process above, and may be used as following:
• Step one (30) consist of groupping the data in shape of original bytes to one set of bits, as it was coded in the coding process.
• Step two (31) consist of decoding the beginnings and ends of each of the coded subsets in precise order.
• Step three (32) consist of decoding each of subsets, to create the original set of numbers that was before the coding, using any known computer processing, from subsets of distances and its values. For instance, the 5 subsets from the last example of coding, can be used to reconstruct the original set of bits.
• Step four (33) converts the decoded set of bits to original for using computer system form of bytes, if it was required in choosen arrangement of the process.
• FIG. IC diagrammatically illustrates an arrangement for control unit for repeated process of the codings and decodings.
• FIG. 2C illustrates an repeated process of the codings and decodings, and may be used as following:
• Steps (34), (35), (36), (37), (38) and steps (40), (41), (42), (43) are the same as the steps (25), (26), (27), (28), (29) and the steps (30), (31), (32), (33) respectively.
• the ordered level of repeated compressing the data (39) order the number of codings and decodings, using a control unit, depending on the volume of the memory that is occupied by the data after each of the codings.
• the number of the codings on the same data is written into specified byte of the memory.
• the process can be repeated as many times as necessary to receive desirable compression of a data. In order to avoid the possible mistake during the coding it can be used the decoding process and it comparison with the original data.
• FIG. IA, FIG. IB It may be involved equipment FIG. IA, FIG. IB, as sending units (I), (6) and as receiving units (5), (10), that are in infermation, communication, computer and related systems and devices. It also can be created separated data processing and compressing systems and devices, including software and hardware that are based on the coding and decoding precessis above. Such systems and devices can use different level of compression the data for different information, depending on ordered accessibility of information of different priority of the coded data. It woud be a "multilevel depth process", as far as it requires more time for a higher level of compression of the data. So, the more compressed data will be deeper in the memory amd will requires more time for access. The accessebility of the data can be increased by the coding the data tree, involving with each level of the coding new coded blocks, In case of decoding that information, the minimum access time will be needed for each block of information.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)

Applications Claiming Priority (2)

Publications (2)

Family

ID=24697336

Family Applications (1)

Country Status (3)

Family Cites Families (12)

• 1985
  • 1985-11-15 WO PCT/US1985/002252 patent/WO1986003037A1/fr not_active Application Discontinuation
  • 1985-11-15 JP JP50536485A patent/JPS62501115A/ja active Pending
  • 1985-11-15 EP EP19850906108 patent/EP0204763A4/fr not_active Withdrawn

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events