WO2001054284A2 - Procede de tassement de tout message concernant des sujets d'une tres grande variete a une dimension fixe et canal de communication destine au transfert du message tasse - Google Patents

Procede de tassement de tout message concernant des sujets d'une tres grande variete a une dimension fixe et canal de communication destine au transfert du message tasse Download PDF

Info

Publication number
WO2001054284A2
WO2001054284A2 PCT/RU2000/000534 RU0000534W WO0154284A2 WO 2001054284 A2 WO2001054284 A2 WO 2001054284A2 RU 0000534 W RU0000534 W RU 0000534W WO 0154284 A2 WO0154284 A2 WO 0154284A2
Authority
WO
WIPO (PCT)
Prior art keywords
subscriber
database
message
sending
augmentation
Prior art date
Application number
PCT/RU2000/000534
Other languages
English (en)
Other versions
WO2001054284A3 (fr
Inventor
Mikhail Mikhailovich Makarchuk
Vladimir Iliich Bodyakin
Alexandr Alexandrovich Chistyakov
Original Assignee
Zakrytoe Aktsionernoe Obschestvo 'mezhotraslevoe Juridicheskoe Agentstvo 'jurpromkonsalting''
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from RU2000128210/09A external-priority patent/RU2000128210A/ru
Application filed by Zakrytoe Aktsionernoe Obschestvo 'mezhotraslevoe Juridicheskoe Agentstvo 'jurpromkonsalting'' filed Critical Zakrytoe Aktsionernoe Obschestvo 'mezhotraslevoe Juridicheskoe Agentstvo 'jurpromkonsalting''
Priority to AU25618/01A priority Critical patent/AU2561801A/en
Publication of WO2001054284A2 publication Critical patent/WO2001054284A2/fr
Publication of WO2001054284A3 publication Critical patent/WO2001054284A3/fr

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion 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/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method

Definitions

  • This invention relates to communication (telephony, television, telemetry, Internet) where the following things occur: a frequent transfer of large information contents to a subscriber or a frequent exchange of large messages through wire or wireless communication lines under conditions of limited transmission (receiving) or low capacity of a transmission line, or high ether noisiness, or the demand to exclude unauthorized access to the data transferred as well as various combinations of these factors.
  • the invention enables to design telecommunication networks with the least number of lines (channel groups) and to increase a number of subscribers using a communication channel in already existing networks. It is achieved by means of message compaction (size reduction), i.e. reduction of the message transmission time.
  • the message coded in that way by a sending subscriber is transferred through a communication line to a receiving subscriber where it is decoded by means of the same database as a hierarchical database of the sending subscriber. While coding a transition to higher levels of a database take place; while decoding - to lower levels so long as the initial decoded form of the message sent will be restored at the lowest level.
  • a hierarchical database With the developed hierarchical database, data in the message transferred (coded) are compacted considerably as compared with the decoded form of the message to be transferred.
  • the sending subscriber's message coded with the aid of his augmented database cannot be restored (decoded) no longer by means of the non-augmented database of the receiving subscriber. Therefore to restore the initial decoded form of the message the receiving subscriber's database needs to be augmented with the new elements of the sending subscriber's database, i.e. the databases of the sending subscriber and receiving subscriber should be made identical.
  • Message transfer is a sending of the element of a fixed length address from a certain level of the sending subscriber's database.
  • the shortcoming of this method lies in the fact that the user's database (database of the receiving subscriber) is merged with the sending subscriber's database that eliminates the possibility to transfer the compacted message to the archive user.
  • the nearest prototype of the applied communication channel is the multilevel system for coding and decoding of a character string given in Appendix 3 of the above book of V.I. Bodiakin.
  • This system at each level of a hierarchical database has a level dictionary not fixed and not limited beforehand.
  • the coding is realized consecutively from a lower to an upper level, and decoding - from an upper to a lower one.
  • the level dictionary is used in operation at each a database level.
  • the message for the next level is composed of references (figures, numbers) to combinations (numbers) in the coded message at the current level, which are available in the dictionary of that current level of the hierarchical database. If the required combination is not found, this dictionary of the level is augmented with this new not found combination with assignment of its own number to it.
  • the decoding process is realized in a reversed order from an upper to the next lower level of the hierarchical database through expansion of every (number) of the decoded message with use of a dictionary of the next lower level, at which a certain combination of numbers corresponds every such number.
  • the message for the next lower level is composed of such combinations.
  • the technical problem of the applied method is augmentation of the sending subscriber's hierarchical database to achieve identity of the sending and receiving subscribers' databases.
  • the object of this invention is the method of compaction of any message relative to extremely wide subjects to a fixed size and maintenance of identity of the sending and receiving subscribers' databases mutually associated in this way under various conditions of their interaction as well as the communication channel for transfer of compacted messages.
  • the applied method has no imperfection of the nearest prototype as it duplicates the sending subscriber's database for the receiving subscriber at a "zero" spatial length of the communication channel between them.
  • the duplication is realized by means of augmentation of the initial coincident (for instance, zero) database of the sending subscriber for the purpose to bring it to correspondence with the sending subscriber's database.
  • the method of compaction of any message relative to extremely wide subjects to a fixed size by at least one sending subscriber with a hierarchical database includes provision of at least one receiving subscriber with the hierarchical database being identical the sending subscriber's database, and formation by this at least one subscriber pair as well as transfer of the message in the form of level number and address of the element in the sending subscriber's database to the receiving subscriber.
  • a transfer of elements, which augment the sending subscriber's database over the communication channel is realized to the same levels at the receiving subscriber's hierarchical database and to the same addresses which the augmentation elements have in the sending subscriber's database
  • the sending subscriber should provide the element with data of the level of the database and its address at this level according to which this augmentation element is to be arranged, and the receiving subscnber should have a program for decoding of such data, i e a transfer protocol for this database pair should be available
  • the transmitter and the receiver may from time to time change their roles If message coding, resulted in database augmentation, is realized by both parties in non-overlapping periods of time, the new elements of this base appeared during coding are transferred to the other hierarchical database of the subscriber pair
  • the above non-overlapping periods of time are determined by assignment of the sending role to one of the subscribers connected through a communication channel, that is realized in response to a signal initially transferred by one of these subscribers and confirmed by the other subsc ⁇ ber This role is transferred from one subscriber to the other one by means of the similar confirmed signal
  • the non-overlapping periods of time during which augmentation elements are transferred to any database of the subscriber pair over the communication channel with the purpose to maintain identity of the databases are determined completely All the above does not exclude, of course, the transfer by the receiving subscriber of coded counter-messages not requiring augmentation of his database.
  • the augmentation elements appearing at each subscriber are firstly fixed in the buffer dedicated in his database and only then, upon determination of buffers sequence, the groups of elements fixed in buffers are transferred, for example, in this sequence at first to the database of the first subscriber and then to the database of the second subscriber or, for example, from one buffer to the first subscriber's database and to the second subscriber's database, and then from the other buffer to the first subscriber's database and to the second subscriber's database.
  • the sequence of buffers and databases is specified in a transfer protocol which also regulates moments of the beginning and completion of this transfer.
  • the moment of transfer beginning may, for example, be determined by the later moment of completion of own message coding by one of the two subscribers or by the fact of complete fill of a buffer.
  • To simplify the transfer protocol it is expedient to provide for availability of own buffer at each subscriber in a subscriber pair.
  • Some databases at such a subscriber station may contain the same elements. As a result total size of databases of a subscriber station may increase.
  • the subscriber station database is composed of this non-augmentable database and a number of augmentable databases according to a number of connections of this subscriber station with other subscribers of a communication network.
  • the same non-augmentable database is included in a hierarchical database of each subscriber or each subscriber station connected with this subscriber station.
  • the non-augmentable database being the same for all subscribers is additionally included in each subscriber station or a database of each individual subscriber not belonging to any subscriber station of a communication network of various subscribers.
  • the applied communication channel is intended to deliver ensemble N of various messages characterized by corresponding information contents I (byte, bit) to a receiving subscriber.
  • i ⁇ l includes new, previously not encountered elements represented in I and intended to continue augmentation of the receiving subscriber's hierarchical database.
  • i ⁇ l includes previously not encountered combinations of elements of the subscriber's augmented database, which in their turn also augment his databases.
  • the applied communication channel avoids the shortcomings described for the nearest prior art owing to use of the known wire or radio circuits for message (information) transfer at the required distance, through which after coding of the message to be transferred by the transmitter coding block with simultaneous augmentation of its hierarchical database the message preparation block generates the message of the structure agreed with the receiver and transfers it over a communication line to the receiver, where the message analysis block extracts the part of the message intended for augmentation of the hierarchical database levels of the receiver decoding block, and the other part - the coded message itself, decoded by the decoding block with use of level dictionaries augmented in this way of his database.
  • the message analysis block extracts the part of the message intended for augmentation of the hierarchical database levels of the receiver decoding block, and the other part - the coded message itself, decoded by the decoding block with use of level dictionaries augmented in this way of his database.
  • the first part of the prepared message consists of newly appeared on coding augmentations to hierarchical databases beginning from the upper level (i.e. in the order convenient for operation of the decoding block), and the second part - of the decoded message.
  • the transmitter should include the decoding block and the message analysis block connected by means of an augmentation circuit with a database and connected with each other, as well as the control unit with two gates controlled by it and installed: the first one in the augmentation circuit of the database from the message analysis block and the second one in the augmentation circuit of the database from the coding block. Besides that the control unit is connected both with the message analysis block and the message preparation block. Altogether they form one terminal device.
  • the receiver includes the message preparation block and the coding block connected by means of an augmentation circuit with a database and connected with each other, as well as the control unit with two gates controlled by it and installed: the first one in the augmentation circuit of the database from the decoding block and the second one in the augmentation circuit of the database from the message analysis block.
  • the control unit as for the device considered above, is connected both with the message analysis block and the message preparation block.
  • the both terminal devices look absolutely symmetric and similar, it is favorable to break such symmetry in order to prevent uncertain situation during operation of such a communication channel by means of assigning of one terminal device as a master device and the second one as a slave device.
  • the master device while transfer to the slave device of a signal with a directive of operation of the slave device in the only transfer or in the only receive mode confirmed by the slave device prevents cases of transfer of counter messages with database augmentation that may lead to non-identity of the master and slave device database.
  • such regulation of the slave device operation does not limit the possibility to transfer in the only receive mode as well as the possibility to receive messages in the only transfer mode on coding and analysis of which augmentation of its database does not take place.
  • the same relates to the operation modes of the master terminal device.
  • the transceiver of the transmitter contains the digital-analog converter for the first dedicated carrier frequency connected with the message preparation block and the digital-analog converter for the second dedicated carrier frequency connected with the message analysis block
  • the transceiver of the receiver includes the digital-analog converter for the second dedicated carrier frequency connected with the message preparation block and the digital-analog converter for the first dedicated carrier frequency connected with the message analysis block.
  • Fig. 1 shows the block diagram of a communication channel with one-way message transmission.
  • Fig. 2 shows the block diagram of a terminal device of a communication channel with two-way message transmission.
  • the block diagram of the communication channel given on Fig. 1 contains a multilevel coding block 1 with the sending subscriber's hierarchical database 2, message preparation block 3 and transceiver 4 forming altogether the transmitter, as well as a transceiver 5, message analysis block 6, multilevel decoding block 7 with the receiving subscriber's hierarchical database 8 forming altogether the receiver, and also a wireless or wire communication line 9.
  • the device shown on Fig. 1 operates in the following way.
  • On delivery of message A to be transferred to the coding block 1 its coding (compaction) occurs and as a consequence of it the message coded in the form C is transferred to the message preparation block 3.
  • coding of message A codes P nv which augment levels of the database 2 from the lower level to the upper level and at the same time they are delivered to the block 3 and as a result of this message B is prepared in which augmenters represented in a transposed way P vn (i.e. from the upper level to the lower level).
  • Message B through the transceiver 4, line 9 and device 5 comes to the message analysis block 6 where it is divided into P vn and C parts.
  • P vn part is delivered to the block 8 for augmentation of the database levels beginning from the upper level, and C part - for decoding in the block 7 used augmented from P vn part levels of the block 8.
  • the transferred message A is prepared.
  • the block diagram of a terminal device of a communication channel with two-way message transmission shown on Fig. 2 includes the multilevel coding block 10, message preparation block 11 , hierarchical database 12, message analysis block 13, multilevel decoding block 17, control unit 15, gates 16 and 17 and transceiver 18.
  • the device shown on Fig. 2 operates in the following way.
  • the device operates in two modes:
  • gate 16 is opened and gate 17 is closed - transmission with database augmentation while coding in the block 10;
  • 2 nd mode gate 16 is closed and gate 17 is opened - receiving with database augmentation while analysis of the message received in the block 13.
  • the control unit 15 of the master device which through the block 11 sends signal Kd of a change of operation mode of terminal devices.
  • the sent signal Kd comes to the block 13 of the slave device from which it comes to its control unit 15, which change positions of its gates 16 and 17 and through the block 11 of this device sends a confirmation of the received signal Kd to the master terminal device.
  • This confirmed signal Kd received by the master device comes from the block 13 to the control unit 15 of the master device and as a consequence of it the unit 15 also changes positions of its gates 16 and 17.
  • the received by the coding block 10 message A to be transferred is coded and augments, if necessary, the database 12 through the open gate 16.
  • the message is prepared and transferred to the other terminal device through the transceiver 18.
  • the terminal device given on Fig. 2 may at the same time not only transfer messages, but also receive them to the message analysis block 13.
  • the message received does not contain a part for augmentation of the database 12, it may be decoded and given to a subscriber from the output of the block 14 as an outgoing message D. Otherwise taking into account that the gate 17 is closed, the message, as a rule, cannot be decoded.
  • the 2 nd mode The message received by the message analysis block 13 from the other terminal device augments, if necessary, the database 12 through the open gate 17 and is decoded by the block 14 and is given as an outgoing message in the D form.
  • the terminal device given on Fig. 2 may at the same time not only receive messages, but also transfer them. Any message A to be transferred is decoded by the block 10, but without augmentation of the database 12, as the gate 16 is closed.
  • the message coded in this way and prepared by the block 11 is transferred through the transceiver 18 to the other terminal device of the communication channel, where, in case if there is no need in augmentation of the database 12 while its coding, it is necessarily decoded and is given to a subscriber as it was noted in description of the 1 st mode. Otherwise it, as a rule, cannot be decoded.
  • both the terminal devices of the communication channel have main, declared modes of operation (message transfer in the 1 st mode and message receiving in the 2 nd mode) and "auxiliary" ones (receiving in the 1 st mode and transfer in the 2 nd mode).
  • the expression “as a rule” used on description of the "auxiliary” modes takes into account those possible cases when augmentation of the database 12 made on operation in main modes is sufficient for message decoding.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)

Abstract

L'invention concerne la communication (téléphonie, télévision, télémesure, Internet) et permet de créer des réseaux de télécommunication avec le moins de lignes possible (groupement de canaux) et d'augmenter le nombre d'abonnés en utilisant le canal de communication des réseaux déjà existants. Ceci est obtenu par tassement du message (réduction de la longueur) et réduction du temps de transmission du message. Le tassement à une dimension fixe de tout message concernant des sujets d'une très grande diversité par au moins un abonné émetteur avec une base de données hiérarchique est associé à au moins un abonné récepteur avec la même base de données hiérarchique que l'abonné émetteur. Le message formé par l'abonné est transféré sous forme du numéro de niveau et adresse de l'élément dans la base de données de l'abonné émetteur à l'abonné récepteur.
PCT/RU2000/000534 2000-01-06 2000-12-28 Procede de tassement de tout message concernant des sujets d'une tres grande variete a une dimension fixe et canal de communication destine au transfert du message tasse WO2001054284A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU25618/01A AU2561801A (en) 2000-01-06 2000-12-28 Method of compaction of any message relative to extremely wide subjects to a fixed size and communication channel for compacted message transfer

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
RU2000100064 2000-01-06
RU2000100064 2000-01-06
RU2000128210/09A RU2000128210A (ru) 2000-11-13 2000-11-13 Способ сокращения до фиксированного объема любого сообщения по предельно широкой тематике
RU2000128210 2000-11-13

Publications (2)

Publication Number Publication Date
WO2001054284A2 true WO2001054284A2 (fr) 2001-07-26
WO2001054284A3 WO2001054284A3 (fr) 2002-05-16

Family

ID=26654034

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/RU2000/000534 WO2001054284A2 (fr) 2000-01-06 2000-12-28 Procede de tassement de tout message concernant des sujets d'une tres grande variete a une dimension fixe et canal de communication destine au transfert du message tasse

Country Status (2)

Country Link
AU (1) AU2561801A (fr)
WO (1) WO2001054284A2 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6996394B2 (en) * 2002-08-30 2006-02-07 Qualcomm Incorporated Server processing in providing messages for a wireless device connecting to a server

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4906991A (en) * 1988-04-29 1990-03-06 Xerox Corporation Textual substitution data compression with finite length search windows
EP0449612A2 (fr) * 1990-03-30 1991-10-02 Oki Electric Industry Co., Ltd. Circuit analogique polyvalent d'entrée
US5424732A (en) * 1992-12-04 1995-06-13 International Business Machines Corporation Transmission compatibility using custom compression method and hardware
US5592667A (en) * 1991-05-29 1997-01-07 Triada, Ltd. Method of storing compressed data for accelerated interrogation
EP0794530A2 (fr) * 1996-03-04 1997-09-10 Lucent Technologies Inc. Système de compression et de mémorisation tampon d'un flux de données

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4906991A (en) * 1988-04-29 1990-03-06 Xerox Corporation Textual substitution data compression with finite length search windows
EP0449612A2 (fr) * 1990-03-30 1991-10-02 Oki Electric Industry Co., Ltd. Circuit analogique polyvalent d'entrée
US5592667A (en) * 1991-05-29 1997-01-07 Triada, Ltd. Method of storing compressed data for accelerated interrogation
US5424732A (en) * 1992-12-04 1995-06-13 International Business Machines Corporation Transmission compatibility using custom compression method and hardware
EP0794530A2 (fr) * 1996-03-04 1997-09-10 Lucent Technologies Inc. Système de compression et de mémorisation tampon d'un flux de données

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SALOMON D: "DATA COMPRESSION: THE COMPLETE REFERENCE" DATA COMPRESSION: THE COMPLETE REFERENCE, NEW YORK, NY: SPRINGER, US, 1998, pages 101-162,357-360, XP002150106 ISBN: 0-387-98280-9 *

Also Published As

Publication number Publication date
AU2561801A (en) 2001-07-31
WO2001054284A3 (fr) 2002-05-16

Similar Documents

Publication Publication Date Title
JP3020246B2 (ja) データ転送のための混合モード圧縮
CN1135007C (zh) 用于话音和非话音通信的系统、方法和通信站
US5757792A (en) Mobile communication system and a method of communication mode transition
JPH0738654B2 (ja) Isdnマルチプロトコル通信制御装置
CN1097933C (zh) 采用数据压缩转换一系列数据包的方法和设备
DE69633865T2 (de) Verfahren und system zur verarbeitung von telefonanrufen zwischen zwei digitalen schnurlosen teilnehmern unter vermeidung doppelter sprachkodierung
Neelakanta A textbook on ATM telecommunications: Principles and implementation
JPH11515154A (ja) 回線網に関連する機構及び方法
US4751699A (en) Multiplexing and demultiplexing equipments for a synchronous digital link with variable modulation speed and rate
Armbruster et al. Broadband communication and its realization with broadband ISDN
JPH0626383B2 (ja) チャネル ユニットにおけるディジタル伝送回線の折り返しの方法および装置
JPH10327138A (ja) 基地無線局と少なくとも1つの移動端末との間でフレーム同期化信号の無線伝送を行う装置
CN1325578A (zh) 配置用于数据传输的通信链路的方法
WO2001054284A2 (fr) Procede de tassement de tout message concernant des sujets d'une tres grande variete a une dimension fixe et canal de communication destine au transfert du message tasse
JPS61156597A (ja) 時分割多重化ram
US5673258A (en) Method and apparatus for the enlargement of the reach of the transmission channel between functional groups of an ISDN-user interface
CN109873912A (zh) 基于软交换的语音控制方法
Russell Universal personal communications: Emergence of a paradigm shift in the communications industry
Kuo Computer Networks—The ALOHA System
Learn Networks: a review of their technology, architecture and implementation
JP3268947B2 (ja) 転送速度整合装置及び方法
US5485454A (en) System and method of communication between circuit mode communication installation core units
CN2411508Y (zh) 以太网数据接入同步通信网的接口设备
Gordon Providing multiple-channel communication using the experimental digital switch
AU744573B2 (en) Devices and methods relating to telecommunications equipment

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP