KR100608151B1 - Reducing method for the transmission amount forwarded to the receiver on a communications network and Communicating method comprising the reducing method - Google Patents

Abstract

According to the present invention, the amount of data received and received from the terminal in the communication between the terminal and the terminals on the ground via a wired or wireless communication network, or a mobile terminal via satellite in the sea and / or mountainous and remote areas. The present invention relates to a method for reducing data communication volume, which reduces a communication fee under a charge system in which a communication fee is charged according to a communication amount, and at a terminal storing data encoded according to a Pellitext code format, when reading a bit string of the data. A correspondence checking step of confirming whether a neotext code corresponding to the corresponding Felictext code is present; If the corresponding PELL text code does not correspond to the neo text code in the correspondence checking step, the PELL text code attaches the start recognition bit, the corresponding text code, and the end point recognition bit in sequence to the output bit stream. step; And a neo text code attaching step of converting the corresponding PELL text code into a corresponding Neo text code and attaching the PELL text code to the bit string outputted in the correspondence checking step. It is included.

Description

Reducing method for the transmission amount forwarded to the receiver on a communications network and Communicating method comprising the reducing method}

1 is a Pellitext code table of ASCII code,

Figure 2a is a neo-text code table for the English alphabet produced as an embodiment for implementing the method of reducing traffic according to the present invention,

Figure 2b is a neotext code table for the numbers produced as an embodiment for the implementation of the method of reducing traffic according to the present invention,

3A is a diagram showing a bit string converted from ASCII code to neotext code in the traffic reduction method according to the present invention;

3B is a diagram illustrating a bit string of a neotext code in the case of a special character when converting from an ASCII code to a neotext code in the method of reducing traffic according to the present invention;

4 is a diagram illustrating a state in which a header is included in a bit string converted into a neotext code in the method of reducing traffic according to the present invention.

5 is a flowchart showing a step of converting ASCII code to neotext code in the method of reducing traffic according to the present invention;

6 is a flowchart showing a transmission step in a data communication method according to the present invention;

7 is a flowchart showing a receiving step in a data communication method according to the present invention;

8 is a flowchart illustrating a process of converting a neo text code to an ASCII code in the data communication method according to the present invention.

According to the present invention, the amount of data received and received from the terminal in the communication between the terminal and the terminals on the ground via a wired or wireless communication network, or a mobile terminal via satellite in the sea and / or mountainous and remote areas. The present invention relates to a method for reducing data traffic volume, which reduces the cost and reduces the communication fee under the charge system in which the communication fee is charged according to the communication amount.

As is well known, data communication between a terminal located at a remote location and terminals is mutually converted into a pulse signal according to a digital signal (indicating whether one bit is ON or OFF) and an analog signal through an interface such as a modem or a multiplexer. • Demodulate and communicate via telephone lines or directly transmit digital signals without a separate interface. In addition, a wireless method of transmitting data on a radio wave without using a separate communication cable or a telephone line is also one of widely used data communication means.

However, the communication means described above are merely tools for transmitting a pulse signal, which is a signal system for computing and processing of the computer, when the computer for computing and processing data is used as a terminal in the communication system.

On the other hand, the pulse signal is a language on hardware necessary for a computer to calculate and process data as described above, and enables the data to be stored, calculated, and output by ON / OFF control of electric flow. In general, the pulse signal is understood as a binary number in a mathematical system.

As described above, the computer converts various data about language, picture, sound, etc. used by a human into a system capable of encoding hardware into a pulse signal, and converting the pulse signal into the above-described communication means. Through it can be transmitted to other terminals in the remote.

These pulse signals are processed as one byte by combining a plurality of bits into one byte with ON / OFF as one bit, and a plurality of bits constituting such a byte are individually turned ON / OFF to make various combinations (binary codes). For example, in the code for a text file, each case corresponds to one character, and as the number of bits constituting one byte increases, the number of cases increases, so that the number of characters that one byte can mean, that is, meaning The number of data can be increased.

In general, eight bits are regarded as one byte and correspond to one character (data) according to the case where each bit is turned on and off.

This scheme, namely, the code format for a text file, includes ASCII (American Standard Code for Information Interchange (see FIG. 1)), EPSC (EBCDIC), and extended binary-coded decimal interchange code (EBCDIC). The code form exemplified defines alphabets, numbers and various symbols with 26 uppercase and lowercase letters. In this case, the ASCII may correspond to a maximum of 128 characters and the epsidic may correspond to a maximum of 256 characters.

In addition, two-byte (16-bit) complete Hangul (KS) Hangul code and combined (KSSM) Hangul code, which is a code format for processing Hangul, are available. Code is commercially available.

However, as the size of the code format increases, there is an advantage in that the number of characters that can be accommodated in each byte is increased, whereas the amount of data to be processed once is increased even when processing the same characters.

This increase in data amount increases the amount of communication in the data communication between the terminal and the terminal, in particular, it is disadvantageous in terms of economics in the communication network of the billing system in which charges are made according to the amount of communication.

In fact, in the case of satellite communication, charging is performed according to the communication amount.

Accordingly, the present invention has been made to solve the above problems, in the data communication between the terminals located in the remote location, the method of reducing the traffic volume of data that can reduce the amount of communication while maintaining the same content of the data to be communicated and It is an object to provide a data communication method.

In order to achieve the above object, the present invention,

In a terminal that stores data encoded according to the Pellitext Code format,

A correspondence checking step of confirming whether a neotext code corresponding to the corresponding Felictext code is present when reading the bit string of the data;

If the corresponding PELL text code does not correspond to the neo text code in the correspondence checking step, the PELL text code attaches the start recognition bit, the corresponding text code, and the end point recognition bit in sequence to the output bit stream. step; And

A neo text code attaching step of converting the corresponding peli text code into a corresponding neo text code and attaching it to the bit string outputted when the corresponding peli text code corresponds to a neo text code in the correspondence checking step;

Traffic reduction method of the included data.

In order to achieve the above object, the present invention, in the communication amount reduction method,

The pellicle text code attaching step

After checking the continuity of the Felictext codes that do not correspond to the NeoText code in the bit string, if the two or more Felictext codes are continuous, the start recognition bit and the end recognition bit are attached to the start and end points of the corresponding Felictext codes, respectively. will be.

In order to achieve the above object, the present invention, in the communication amount reduction method,

The neotext code is

64 codes generated from a combination of 6 bits that define 26 uppercase letters, 26 lowercase letters, and 10 numbers, and the remaining two are defined by the start / end point recognition bits and one undefined special character. It is.

In order to achieve the above object, the present invention,

In a data communication method comprising a transmitting step of transmitting data from a calling terminal, a transmitting step of transferring the data via a wired / wireless communication network, and a receiving step of receiving the data to a receiving terminal.

The sending step,

In a terminal that stores data encoded according to the Pellitext Code format,

A correspondence checking step of confirming whether a neotext code corresponding to the corresponding Felictext code is present when reading the bit string of the data;

If the corresponding PELL text code does not correspond to the neo text code in the correspondence checking step, the PELL text code attaches the start recognition bit, the corresponding text code, and the end point recognition bit in sequence to the output bit stream. step; And

A neo text code attaching step of converting the corresponding peli text code into a corresponding neo text code and attaching it to the bit string outputted when the corresponding peli text code corresponds to a neo text code in the correspondence checking step;

Is a data communication method further included.

In order to achieve the above object, the present invention, in the data communication method,

A bit string compression step of compressing the bit string in an originating terminal; And

In a receiving terminal, a compressed bit string release step of releasing the compressed bit string;

Is more included.

In order to achieve the above object, the present invention, in the data communication method,

A header bit attaching step of attaching, at the calling terminal, a header bit string in which data for the number of bits is recorded, to a bit string converted from a Felictext code to a neotext code; And

A receiving state checking step of checking, at the receiving terminal, whether the number of bits written in the converted bit string and the number of bits in the received bit string are matched by reading the header bit string;

Is more included.

In order to achieve the above object, the present invention, in the data communication method,

The receiving step

A time-end-point recognition bit reading step of reading the start-point recognition bit and the end-point recognition bit attached to the bit string when reading the bit string of the received data;

A pelictext code holding step of attaching a pelictext code located between the viewpoint recognition bit and the endpoint recognition bit to an output bit string;

A text code conversion step of recognizing a bit string of codes located outside the range of the time and end recognition bits in a neo text code format, converting the bit strings into corresponding Pellitext codes corresponding to the neo text codes, and appending them to the bit strings outputted;

Is more included.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

Figure 1 is a Pellitext code table of ASCII code, Figure 2a is a neotext code table for the alphabet produced as an embodiment for the implementation of the traffic reduction method according to the present invention, Figure 2b is a traffic reduction method according to the present invention Neo text code table for the numbers produced as examples for the implementation of the description will be described with reference.

As described above, a Pale-text code is an arbitrary character in which a plurality of bits having a pulse signal represented by ON / OFF in order to encode an analog signal into a digital signal are represented in a combination of various cases. Or special characters such as symbols and shapes.

In this case, the PELL text code is the most common format for a text file that reads, writes, and computes data about a sentence on a terminal (computer) or the Internet. A brief description has been given above.

Hereinafter, in the description of an embodiment for further embodying the technical idea of the present invention, the Pellitext code will be described as an ASCII code.

Of course, in the method of reducing the traffic volume of the data according to the present invention, the PELL text code is not limited to the ASCII (American Standard Code for Information Interchange) code, but all forms for driving the text file on the terminal and the Internet. Note that code formats can be applied.

ASCII code was developed by the American National Standards Institute, as shown in Figure 1, where each alphabet, number, and special character is represented by a 7-bit binary number (a string consisting of seven zeros or ones). In total, 128 characters are defined. Unix or DOS-based operating systems (except Windows NT) use ASCII to represent text files.

Meanwhile, when defining a neo-text code according to the present invention, the neo-text code is defined in such a manner as to define only a randomly selected character among the PELL text codes in a terminal (computer) operated by various kinds of PELL text codes. The number of bits produced and used rather than the corresponding Pellitext code can be reduced, and in case of undefined characters, the Pellitext code can be cited. For this purpose, the starting point of the Pellitext code cited in the bit string consisting of neotext codes It contains one or more "Reserved" codes, that is, the time and endpoint recognition bits, that will tell you the location of the key and the endpoint, or define the most common of the special characters.

In general, the randomly selected characters are preferably general characters (English, Korean) except for special characters.

The neotext code as an embodiment according to the present invention is represented by 6-bit binary numbers, as shown in Figs. 2A and 2B, and a total of 64 characters are defined. In this case, the characters defined in the neotext code are uppercase and lowercase letters of the alphabet and 10 kinds of numbers, and various special characters defined in the ASCII code are excluded. Therefore, 62 combinations of 64 cases that can be combined into 6 bits are defined to define upper and lower case letters and 10 numbers of the neotext code alphabet, and the remaining two combinations are "Reserved." These two combinations are applied as is to utilize special characters. That is, the neotext code can only make up to 64 combinations and thus cannot define special characters. Therefore, ASCII code defined as a special character in ASCII code format should be used as it is. The "reserved" bit combination serves to indicate the location of the ASCII code utilized by the start point and the end point, respectively.

In addition to the embodiment described above with respect to the neotext code, the neotext code as another embodiment can be modified as follows.

Neotext code is made up of 5 bits instead of 6 or 8 bits like ASCII code, instead of 6 bits or 5 bits (36 combinations can be reduced if the definition of numbers and uppercase letters is not defined). Characters are defined for each combination, and the conventional Pellitext code is cited in the bit string of neotext code to quote the character that cannot be defined in the combination. At least one "Reserved" code is required to indicate the start and end points. Of course, the neotext code according to the present invention can be mutually applied to 16-bit Unicode in addition to the ASCII code.

On the other hand, the complete Hangul code defined in syllable units and composed of 16 bits (2 bytes) and the combined Hangul code defined in the initial, neutral, and final units (each composed of 5 bits) are also excluded from the special characters. Since each character can be defined by a combination of 12 to 12 bits, the number of bits of a code format produced in a manner that does not define special characters as in the above-mentioned neotext code can be greatly reduced even in a text file for Korean. Of course, in the case of undefined special characters, the "Reserved" code can be used to quote from the completed Pelitext code, the completed Hangul code or the combined Hangul code.

One embodiment of the neotext code in the method for reducing the traffic volume of data according to the present invention encodes the uppercase and lowercase letters and numbers of the alphabet into 64 combinations of 6 bits each, and defines them in ASCII code, Unicode or Appsidic code. Corresponds with the code for uppercase and lowercase letters and numbers of the alphabet, and converts them, while special characters not defined in neotext code are defined as special characters in ASCII code, Unicode or Appsidic code. In order to quote as is, two "Reserved" codes are included, namely start and end bits.

By the way, the "Reserved" code does not necessarily need to be two in order to quote from the Pelitext code a special character not defined in the neotext code. That is, by attaching each of the "Reserved" codes to the start and end points of the bit string to which the special character code is attached, when the corresponding "Reserved" code is read, it is recognized as a start point of the special character bit string, and once again When reading, the code conversion program can be designed to be recognized as a stop point of a special character bit string.

On the other hand, two "Reserved" codes are generated in the six-bit neotext code according to the embodiment of the present invention. According to the above contents, one of them is used as a time / end recognition bit, and the other is frequently used among special characters. Just define the character.

Commonly used special characters can include periods ("."), Commas (","), and spaces (skipping), and the remaining "Reserved" codes can be defined as spaces (skipping). have. Therefore, the time and end recognition bits do not necessarily need to be two.

3A illustrates a bit string converted from ASCII code to neotext code in the traffic reduction method according to the present invention, and FIG. 3B illustrates special characters when converting from ASCII code to neotext code in the traffic reduction method according to the present invention. FIG. 5 is a diagram illustrating a bit string of a neotext code, and FIG. 5 is a flowchart illustrating a conversion process of an ASCII code to a neotext code in the data communication method according to the present invention.

In a terminal that stores data encoded according to the Pellitext Code format,

(1) a Felictext code reading step (S11) for calculating the byte of the data encoded according to the Felictext code format and reading the Felictext code for each byte;

As shown in Fig. 3A, the data amount of an English word " interesting " encoded according to the ASCII code format is 88 bits (77 bits except for "0", which is the first bit of the higher code value).

The byte of the 88-bit data encoded in this way is calculated (11 bytes), and an error is checked. In general, in this case, the size of the corresponding alphabet is checked to check and split bytes for each character to be converted into a neotext code format.

(2) a mapping status checking step (S12) of identifying the text text mapped with the text text mapped to the neo text code and the text text unmapped (S12);

In the method of reducing the traffic volume of the data according to the present invention, the correspondence relationship between the Felitext code and the Neotext code, that is, the mapping relationship for each character, is checked. As described above, the neotext code does not accept all characters defined in the ASCII code, which is a Felictext code, so that the code defining the special characters not included in the neotext code and the general characters contained in the neotext code are identified. Should be.

In general, since the PELL text code is continuously connected with various bit strings combined by "1" and "0", in the PELL text code reading step S11, the computer calculates each byte while reading the bit string sequentially. In this case, the bit string combination constituting the divided byte is checked to determine whether the ASCII code is mapped to the neotext code.

(3) a viewpoint recognition bit attaching step (S13) of attaching a viewpoint recognition bit to the output bit string if the Pellitext code is not mapped with the neotext code in the mapping checking step;

When the bit string of the corresponding byte is an ASCII code that is not mapped with the neotext code in the mapping whether the mapping is confirmed (S12), as shown in FIG. 3B, a view recognition bit is attached to the start point of the corresponding bit string. . This is necessary for recognizing that 7 or 8 bit ASCII code bit strings are inserted into a 6 bit neotext code. The code conversion program applied for implementing the method for reducing the traffic amount of data according to the present invention recognizes that an ASCII code bit string of 7 or 8 bits is inserted through the viewpoint recognition bit while reading the bit string.

(4) a Felicity text code holding step (S14) of appending the Felictext code to the bit string to be converted and output in succession to the viewpoint recognition bits (S14);

An ASCII code which is not mapped to a neotext code according to the present invention is connected after the view recognition bit. Therefore, even when the ASCII code format bit string is converted to the neotext code format bit string, the ASCII codes that are not mapped to each other are still attached to the bit string to be converted and output. The code conversion program may read a bit string combined with an ASCII code and a neotext code through each of the viewpoint recognition bits and the following endpoint recognition bits according to each code type.

3b, it can be seen that one of the special characters "+" is converted from an ASCII code to a neotext code. In this case, the ASCII code is defined at the start and end points while maintaining the shape and size of the ASCII code. You can see that the start point recognition bit and the end point recognition bit are attached.

(4) an expression bit attaching step (S16) which is an end point for attaching an endpoint recognition bit to the end of the bit string of the Pellitext code;

As shown in FIG. 3B, an end point recognition bit is attached to a stop point of a bit string defining "+" to recognize that the bit string of the code in which the ASCII code and the neotext code are not mapped to each other is finished. .

At this time, the bit string as the end-point recognition bit shown in Figure 3b is shown as the remaining one of the two "Reserved" code generated in the neo-text code according to the present invention except one defined by the time-point recognition bit, the present invention is limited thereto. Instead, the bit string defined by the viewpoint recognition bits may be used as the endpoint recognition bits. For this purpose, the logic of the code conversion program may be configured to properly recognize and operate the viewpoint recognition bits and the endpoint recognition bits having the same bit sequence. It has been described earlier.

(5) a neotext code searching step (S17) for searching for the neotext code when the Pellitext code is mapped with the neotext code in the mapping checking step;

When it is confirmed that the ASCII code is mapped with the neotext code in the mapping check step (S12), the corresponding neotext code is searched for in the neotext code table.

As shown in FIG. 3A, 11 alphabet lowercase letters constituting " interesting " are encoded in ASCII code format in a terminal (computer), and a code conversion program for implementing a method for reducing data traffic amount according to the present invention. Searches for a neotext code matching the ASCII code constituting " interesting " in the neotext code table.

(6) a neotext code conversion step (S18) of converting the Pellitext code mapped to the neotext code into a neotext code retrieved in the neotext code search step and appending to the output bit string;

The ASCII text is converted into the neotext code searched in the neotext code search step (S17), and the neotext code is attached to the newly created bit string.

As a result, the word "interesting" has a capacity of 88 bits when encoded in ASCII code, and 66 bits when encoded in neotext code. Therefore, the size of the text file can be reduced by up to 25%.

In addition, Neotext codes that can define only lowercase letters except for uppercase letters and numbers can be 5 bits. Therefore, when converting "interesting" to 5-bit neotext codes, the number can be reduced to 55 bits. The text file can be reduced by up to 38%.

In the above-mentioned method for reducing traffic of data, the following steps may be further included.

The end point recognition bit attaching step (S16) is performed at the end of the bit string of the last Pellitext code among the successive Pellitext codes after checking whether the Pellitext codes that are not mapped with the neotext code are checked. S15)

When ASCII codes that are not mapped to neotext codes are contiguous in the bit stream, the steps are included to collectively recognize the start point and the end point of the bit stream of the ASCII codes. Therefore, when the ASCII text unmapped to the ASCII code unmapped in the PELL text code reading step S11, the view recognition bit and the end point recognition bit are attached only to the start point and the end point of the consecutive ASCII code. . This reduces the length of the bit string, ie the amount of converted data, as a combination of neotext code and ASCII code, rather than attaching the start and end bits separately to each neotext code and unmapped ASCII code. Can be.

The above-described method for reducing data traffic amount is included in a communication method comprising a transmitting step, a transmitting step and a receiving step of a data based on a wired / wireless communication network connecting a calling terminal, a receiving terminal, and the water-receiving terminal with a wired or wireless connection. It is possible to reduce the amount of data communication through the communication base.

6 is a flowchart illustrating a transmission step in a data communication method according to the present invention, and FIG. 7 is a flowchart illustrating a reception step in a data communication method according to the present invention.

As described above, when the ASCII code is converted into a neotext code, the size of the text file can be reduced by up to 38% depending on the format of the applied neotext code. Therefore, the amount of data received and received through the wired / wireless communication network is reduced accordingly.

In addition, in data communication using a wired or wireless communication network (S23, S31), it is possible to further reduce the amount of data reduced by the method of reducing the communication amount of data according to the present invention through the compression process (S22).

Compression is, as is well known, to reduce the size of data in order to save storage space or reduce data transfer time. In data communication, depending on various factors, compression may be performed only on the data content or the entire transmission unit including header information.

Content compression can be done by removing all extra blank characters, by inserting them as one continuous character instead of a string of consecutive characters, and replacing them with fewer strings of bits that appear frequently. This kind of compression can reduce text files to about 50% of their original size. Compression is done by programs that use formulas or algorithms to determine how to compress and decompress data.

When sending and receiving information over the Internet, large text files may be sent alone one by one, but may also be combined into a compressed file such as zip or gzip and sent as a single compressed file. WinZip is a popular compression program that can compress multiple files into a single Windows environment.

Of course, in the method of receiving data at the receiving terminal, when the source terminal undergoes a compression step, the compressed corresponding data should be released (S32).

4 is a diagram illustrating a state in which a header is included in a bit string converted to a neotext code in the data communication method according to the present invention.

In the data communication method of the data according to the present invention, since data communication is performed through various communication steps such as conversion from a Pellitext code to a neotext code, compression, and packetization, a bit transmission is performed between an originating bit sequence and a reception bit sequence. Errors or omissions may occur. In particular, when the data is transmitted from the calling terminal after being converted from the Pellitext code to the neotext code, the header bit string may be further included because it is necessary to confirm whether the reception of the converted bit string is normally performed.

The header bit string receives data about the number of bits formed by combining ASCII code and neotext code converted from ASCII code, and is attached to the best point of bit string in the code conversion process before the corresponding data is transmitted through wire / wireless communication network. In addition, the receiving terminal receiving the corresponding data through the transmission process may read the header bit string (S33) to check whether there is an error in the received data.

8 is a flowchart illustrating a step of converting a neo text code to an ASCII code in the data communication method according to the present invention.

(1) a neotext code reading step of calculating a byte of the received neotext code bit string and reading a neotext code for each byte (S41);

As a process similar to the case of the Pellitext code reading step S11, the bits of the bit string received through the wired / wireless communication network are calculated to confirm the total number of bits, the presence or absence of the view recognition bit, the end point recognition bit, and the like. .

(2) a start / end point recognition bit reading step (S42) for reading the start point recognition bit and the end point recognition bit;

Through the neotext code reading step (S41), it is confirmed whether the start point recognition bit and the end point recognition bit exist, and the size of the ASCII code bit string positioned between the start point recognition bit and the end point recognition bit.

(3) a pellicle text code holding step (S43) for attaching pellicle text codes located between the viewpoint recognition bits and the end point recognition bits to bit streams to be converted and output;

The ASCII code identified through the time- and end-point recognition bit reading step S42 is attached to a newly created bit string without a separate conversion process. The pellicle text code holding step S43 is continuously executed until the end point recognition bit is read, and when the end point recognition bit is read, the corresponding step ends.

(4) a PELL text code search step (S45) for searching the PELL text code mapped to the neo text code identified in the neo text code reading step;

If it is confirmed that the neotext code is mapped with the ASCII code, the ASCII code mapped with the neotext code is searched.

(5) a felicity text code converting step (S46) of converting the neotext code into a pelictext code searched in the pelictext code searching step and attaching the neotext code to a bit string outputted;

The corresponding neotext code is converted into an ASCII code searched through the Felictext code search step (S45) and attached to the bit string. Therefore, the bit string formed by the combination of the neotext code and the ASCII code received by the receiving terminal is converted into a bit string composed only of the ASCII code.

On the other hand, the wired and wireless communication network includes not only wired and wireless Internet, but also satellite communication.

According to the present invention as described above, the method of reducing the traffic volume of the data is the whole process between the encoding process of the data in the terminal and the driving process of the communication interface operated to send the encoded data to another terminal As a result, the communication process made through the method of reducing the traffic volume of the data does not deviate from the existing wired / wireless communication protocol. It can be applied as it is without the need to modify for, while reducing the communication amount of the data containing the same information, it is possible to economically use a communication network, such as satellite communication, the communication fee is charged according to the communication amount.

Claims (7)

In a terminal that stores data encoded according to the Pellitext Code format, A correspondence checking step of confirming whether a neotext code corresponding to the corresponding Felictext code is present when reading the bit string of the data; If the corresponding PELL text code does not correspond to the neo text code in the correspondence checking step, the PELL text code attaches the start recognition bit, the corresponding text code, and the end point recognition bit in sequence to the output bit stream. step; And A neo text code attaching step of converting the corresponding peli text code into a corresponding neo text code and attaching it to the bit string outputted when the corresponding peli text code corresponds to a neo text code in the correspondence checking step; Traffic reduction method of the data, characterized in that it comprises a. The method of claim 1, wherein the step of attaching the Felicity text code After checking the continuity of the Felictext codes that do not correspond to the NeoText code in the bit string, if the two or more Felictext codes are contiguous, the start recognition bit and the end point recognition bit are respectively added to the start point and the end point of successive Felictext codes. A method of reducing data traffic, characterized in that it is attached only once. The method of claim 1 or 2, wherein the neotext code is 64 codes generated from a combination of 6 bits that define 26 uppercase letters, 26 lowercase letters, and 10 numbers, and the remaining two are defined by the start / end point recognition bits and one undefined special character. A method for reducing traffic volume of data, characterized in that. In a data communication method comprising a transmitting step of transmitting data from a calling terminal, a transmitting step of transferring the data via a wired / wireless communication network, and a receiving step of receiving the data to a receiving terminal. The sending step, In a terminal that stores data encoded according to the Pellitext Code format, A correspondence checking step of confirming whether a neotext code corresponding to the corresponding Felictext code is present when reading the bit string of the data; If the corresponding PELL text code does not correspond to the neo text code in the correspondence checking step, the PELL text code attaches the start recognition bit, the corresponding text code, and the end point recognition bit in sequence to the output bit stream. step; And A neo text code attaching step of converting the corresponding peli text code into a corresponding neo text code and attaching it to the bit string outputted when the corresponding peli text code corresponds to a neo text code in the correspondence checking step; Data communication method further comprises. The method of claim 4, wherein A bit string compression step of compressing the bit string in an originating terminal; And In a receiving terminal, a compressed bit string release step of releasing the compressed bit string; Data communication method further comprises. The method of claim 4, wherein A header bit attaching step of attaching, at the calling terminal, a header bit string in which data for the number of bits is recorded, to a bit string converted from a Felictext code to a neotext code; And A receiving state checking step of checking, at the receiving terminal, whether the number of bits written in the converted bit string and the number of bits in the received bit string are matched by reading the header bit string; Data communication method further comprises. The method of claim 4, wherein the receiving step A time-end-point recognition bit reading step of reading the start-point recognition bit and the end-point recognition bit attached to the bit string when reading the bit string of the received data; A pelictext code holding step of attaching a pelictext code located between the viewpoint recognition bit and the endpoint recognition bit to an output bit string; A text code conversion step of recognizing a bit string of codes located outside the range of the time and end recognition bits in a neo text code format, converting the bit strings into corresponding Pellitext codes corresponding to the neo text codes, and appending them to the bit strings outputted; Data communication method further comprises.

Images