JPS5933960A - Transmitting system of code information - Google Patents
Transmitting system of code informationInfo
- Publication number
- JPS5933960A JPS5933960A JP14263682A JP14263682A JPS5933960A JP S5933960 A JPS5933960 A JP S5933960A JP 14263682 A JP14263682 A JP 14263682A JP 14263682 A JP14263682 A JP 14263682A JP S5933960 A JPS5933960 A JP S5933960A
- Authority
- JP
- Japan
- Prior art keywords
- information
- code
- code information
- adjacent
- transmission
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
【発明の詳細な説明】
本発明は文字コード等のコード情報を伝送する伝送方式
に関する。DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a transmission method for transmitting code information such as character codes.
］ンビコータ等のデータ処理装置で（は、文字や６葉の
代わりにこれらの情報を表現丈る記号どして」−ト情報
を使用リ−ることが多い。特に最近では−」ンピーＬ−
夕の酋及に伴って、電話回線やローカルネッｌ−ワーク
等の通信媒体を介しＣコード情報の伝送が活発に行われ
−Ｃいる。」−ド情報を用いた伝送方式は文字等をビデ
オ信号として直接伝送覆るのに比べて高速化が可能であ
るが、］ンピユータ名゛の信号処理がますまＵ 、Ｆ＋
：１速化されるにつれて、史に高速化した伝送方式か貧
ｑ１されている。] In data processing devices such as ``printer'', these information is often expressed using long symbols instead of letters or letters.Especially recently, ``printer''
As the evening progresses, C code information is actively transmitted through communication media such as telephone lines and local networks. Transmission methods that use code information can be faster than direct transmission of characters, etc. as video signals, but the signal processing of
:As speeds have been increased, transmission methods that have become faster than ever have become poorer.
本発明はこのような点に鑑み、−゛１−ド１１゛１報を
１縮して効率良く伝送する−１−ｌ〜情報伝送万代を提
供りることをその目的とりる。In view of these points, it is an object of the present invention to provide a system for transmitting -1-l to information that efficiently transmits information by reducing the information from -1-1 to 1-1.
本発明では１．二］−ド情報をこれを構成ける要素に分
割し、このｆ、’″Ｊで順次差分をとっ（−これを順次
シリアルに伝ｊスする。差分をとれば−どれだ（プ伝送
する情報部か減少づるので、前記した目的を達成りるこ
とかできる。In the present invention, 1. 2] - Divide the code information into the elements that can constitute it, and sequentially take the difference between f and Since the number of parts decreases, the above-mentioned purpose can be achieved.
以下実施例につき本発明の詳細な説明りる。The present invention will be described in detail with reference to Examples below.
第１図は二Ｊンピュータから端末機器ベニ１−ド情報を
送出するための］−ド情報処理部の原即的４Ｍ成を表わ
したものである。文字用ツク部１１は、送信情報１２を
二］−トメモリ１３に供給ゴる。＝１−トメモリ１３は
送信情報１２をアスキー（ＡＳＣＩＩ）コードに変換覆
る。今、送信情報１２が例えばアルファベットの“Ｆ
Ｕ Ｊビｃあったどづる。−１−トメモリ１３は！ｉ２
図に示１ような＝ｊ−ド変換情報を記憶しＣいる。アス
ギー］−ドＣ゛は、数字やノフルノ１ベツ１〜の各′１
文字をすれ・それ２文字゛（表わし、史にこれが１６進
仏にＪ、る表記であることを示ｑ ｔｉｔ ＝ ” ＋
−＋ パをイ（」加づ−る。FIG. 1 shows a basic 4M configuration of a 1-card information processing section for transmitting terminal device 1-card information from a 2J computer. The character link section 11 supplies the transmission information 12 to the second memory 13. =1 - The memory 13 converts the transmission information 12 into ASCII code. Now, the transmission information 12 is, for example, the alphabet “F”.
U J bi c atadozuru. -1-Toto memory 13 is! i2
=j-do conversion information as shown in the figure 1 is stored. Asgi] - C゛ is a number or each '1 of Nofuruno 1 Betsu 1 ~
Cross out the letters and write those two letters ゛ (representation) to show history that this is the notation of hexadecimal French, J, etc. q tit = ” +
-+ Add pa to i(''.
）スイに情報” Ｆ Ｕ Ｊ ｌ ”をアスキー−１−
ドで表わりど、” ／ｌ （５Ｈ１５５Ｈ、４Ａｌ−１
，４９＋１”のように４つの要素り日ら成るコード情報
どなる。)Swift information “F U J l” in ASCII-1-
It is expressed as "/l (5H155H, 4Al-1
, 49+1" is code information consisting of four elements.
変換後の二：１−ド情報１４は」−ドバッファ１５５に
蓄えられる。演算回路１６は、−１−ドパツノＰ１５に
蓄えられたコード情報１４から隣接りる要素を２つずつ
順次指定し、これを隣接−１−ド情報１７として人力す
る。隣接コード情報１７のうら、先行りる要素のアスキ
ーコートを’Ｘ’＋ Ｘ ２１−１”どし、これに続く
要素のぞれを“”ＹＩＹ２）ド′とする。演算回路１６
は次式の演算を行い、これを演算結果情報１８どして出
ノｊする。The converted 2:1-code information 14 is stored in the 1-code buffer 155. The arithmetic circuit 16 sequentially specifies two adjacent elements from the code information 14 stored in the -1-domain P15, and manually inputs these as the adjacent -1-code information 17. In the adjacent code information 17, the ASCII code of the preceding element is 'X' +
calculates the following equation and outputs it as the calculation result information 18.
７ ＋ Ｚ７ Ｈ−Ｙ＋ Ｙ２ Ｈ−Ｘ＋ Ｘ２ Ｈ今
、Ｎ回目（Ｎ（よ任意の整数）の演算結果情報１８を（
／１／２）ＮＣ゛表わり゛とりると、コード列” ４６
１−１ 、ξ５５ ｆ−１，４，Ａ Ｈ１４９１−ビの
各演算結果情報は次のＪ、うになる。7 + Z7 H-Y+ Y2 H-X+ X2 H Now, the Nth (N (any integer) operation result information 18
/1/2) If you take the NC expression, you will see a code string” 46
1-1, ξ55 f-1, 4, A H1491-B, each calculation result information becomes the following J.
＜ ７ ＋ ７７）Ｉ＋−１−■’Ｉ （５１−ｌ
（Ｚ ＋ ；！ ２） ２１−１ ＝ ５５１−１
− ／ｌ ０ｌ−ｌ（１０進θ、 −７−８５−７
０”＝ １ ５ ）−（→の ）−１」
（Ｚ＋７２ ） う １（−４△ｌ−１−５５Ｎ＝（
−）’ａＢＨ
＜ Ｚ ＋ ７２ ） ＋ １−１−４９ ｔ
−１−４Ａ Ｉ−〇〇ＩＨ
２値化回路１９は演算結果情報１８を（れぞれ２値化し
送信（ｉｊ号２１とりる。０）をＯｌ〈二）を１Ｃ゛表
わけは、送イ１）信号２１はそれぞれ次のように表わさ
れる。< 7 + 77) I+-1-■'I (51-l
(Z + ;! 2) 21-1 = 551-1
- /l 0l-l (decimal θ, -7-85-7
0"=1 5)-(→'s)-1" (Z+72) U1(-4△l-1-55N=(
-)'aBH < Z + 72 ) + 1-1-49 t
-1-4A I-〇〇IH The binarization circuit 19 converts the calculation result information 18 (binarizes and transmits (takes ij number 21. 0), Ol<2) and 1C. b1) The signals 21 are expressed as follows.
（＋）４６＋−１＝Ｏｌ ０１００１０１１０（ｉ−）
ＯＦＨ＝（ＮＦＨ＝Ｏ’、 １１１１ ’、 ０１１０
ｅＯＢｌ−１＝ＯＢＩ−１＝１ １０１１ ０１１０θ
０１Ｈ＝ｅｌＨ＝１１０００１１０１１０りなわちこの
例の場合には、送信情報” ｆ： Ｕ Ｊ ｌ ”のイ
１効情報ピッｌ−数は全部で３６ビツ１〜どなる。(+)46+-1=Ol 010010110(i-)
OFH=(NFH=O', 1111', 0110
eOBl-1=OBI-1=1 1011 0110θ
01H=elH=11000110110, that is, in the case of this example, the effective information pin number of the transmission information "f: U J l" is 36 bits in total.
圧縮前のアスキーコードでは、ｃ４＋ ６）の識別ピッ
１〜が不要であるが、送信情報１文字に灼づる有効情報
じ′ットが１２ヒツｊ〜必要なので、仝休としＣ４８ピ
ツ１へ必要−Ｃ・ある。ライｆわち有効情報ビットを１
２ビット削減し、２５％の１１稲を図ることができる。In the ASCII code before compression, the identification bits 1~ of C4+6) are not necessary, but since 12 bits of valid information are needed for each character of transmission information, it is necessary to take a break and add them to C48 bits 1. -C. Yes. life f, that is, the effective information bit is 1
By reducing 2 bits, it is possible to achieve 25% of 11 rice.
実際のデータ伝送では、文字間の境界を小づじット等り
く右動情報ヒッ１〜に付加される。従つ（いずれの場合
でも送信に必要なじツ１〜数が増加−４るが、本発明に
よっ−ｃ７＋１なりの汁縮を図ることが（・さることは
疑いない。In actual data transmission, the boundaries between characters are added to the right-hand motion information, such as small dots. Accordingly, (in either case, the number required for transmission increases by -4), but there is no doubt that the present invention can reduce the number by -c7+1.
以上の実施例ではアスキーコートの圧縮について説明し
たが、ＪＩＳコード等の他の」−ドにｂ本発明を適用す
ることができる。In the above embodiments, compression of ASCII code has been described, but the present invention can be applied to other codes such as JIS code.
このように本発明によれば簡単なコード変換で効率の高
いデータ伝送が可能となる。しがにのような二１−ド変
換（，１コンビコータのソノ！〜ウェアで容易に実現Ｊ
ることができる。As described above, according to the present invention, highly efficient data transmission is possible with simple code conversion. 21-code conversion (1 Combi coater sono! ~ Easily achieved with hardware)
can be done.
第１図は本発明の一実施例を説明するための：ｊ−ト情
報処理部のブ１：Ｊツク図、第２図は−」−トメモリ内
の二（−ド変換情報の対応関係を；Ｊ＼η図ひある。
１４・・・・・・」−１〜情報
１５・・・・・・−１−トハ゛ンフ１７１６・・・・・
・３Ｑ粋回路
１Ｂ・・・・・・演９＞結果情報
２１ ・・・ ・・・ 送 イ乙 イＪ１ ４出 羅
１ 人
冨」Ｕ口ックス株式会社
代 埋 人
弁理士 山 内 梅 雄FIG. 1 is a block diagram of a block information processing unit for explaining an embodiment of the present invention, and FIG. ;J\η diagram is shown. 14...''-1~Information 15...-1-Thump 1716...
・3Q Iki Circuit 1B...Act 9>Result information 21...... Sending Iot IJ1 4th Out Luo 1 Hitotomi'' Umeo Yamauchi, Patent Attorney, Ukuchiku Co., Ltd.
Claims (1)
割し、隣接する要素間の差分を順次演粋して、この演幹
結果を変換後の情報としくシリアルに伝送づることを特
徴とするコード情報伝送１ノ式。A code characterized in that the load information is divided into C elements, which are the minimum and intermediate elements that constitute this, and the differences between adjacent elements are sequentially extracted, and this stem result is serially transmitted as the converted information. Information transmission type 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP14263682A JPS5933960A (en) | 1982-08-19 | 1982-08-19 | Transmitting system of code information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP14263682A JPS5933960A (en) | 1982-08-19 | 1982-08-19 | Transmitting system of code information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPS5933960A true JPS5933960A (en) | 1984-02-24 |
Family
ID=15319954
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP14263682A Pending JPS5933960A (en) | 1982-08-19 | 1982-08-19 | Transmitting system of code information |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS5933960A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0383123A (en) * | 1989-08-28 | 1991-04-09 | Sumitomo Metal Ind Ltd | Method for compressing measured data |
| JPH06222905A (en) * | 1992-10-20 | 1994-08-12 | Sony Tektronix Corp | Data compressing method |
-
1982
- 1982-08-19 JP JP14263682A patent/JPS5933960A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0383123A (en) * | 1989-08-28 | 1991-04-09 | Sumitomo Metal Ind Ltd | Method for compressing measured data |
| JPH06222905A (en) * | 1992-10-20 | 1994-08-12 | Sony Tektronix Corp | Data compressing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102249267B1 (en) | Method and device for encoding and decoding binary data | |
| JPH05300027A (en) | Reversible variable length coding system | |
| CN108418683B (en) | Carrier-free text steganography method based on Chinese character structural features | |
| JP7364583B2 (en) | Computer-implemented method and system for arithmetic encoding of serialized arithmetic circuits | |
| US9806741B1 (en) | Character conversion | |
| US7302106B2 (en) | System and method for ink or handwriting compression | |
| CN110865970A (en) | Compression flow pattern matching engine and pattern matching method based on FPGA platform | |
| EP1700224B1 (en) | Receiver corporation | |
| Storer et al. | A parallel architecture for high-speed data compression | |
| CN1937582A (en) | Method for preprocessing data to be compressed and compressed data transmission method | |
| JPS5933960A (en) | Transmitting system of code information | |
| JP5384210B2 (en) | Data transmission device, data reception device, and data transmission system | |
| KR20230050256A (en) | Data encoding method, encoder, and data decoding method | |
| US20010022664A1 (en) | Image processing device | |
| CN101292221B (en) | Encoding for serial link based on signal transition characteristic | |
| CN210042064U (en) | Application system for lossless identification of video data | |
| JP4446102B2 (en) | Data compression / decompression system, data compression device, data decompression device, and program | |
| US7324022B2 (en) | Data encoding apparatus, data decoding apparatus and data encoding/decoding system | |
| CN111064560B (en) | Data encryption transmission method and device, terminal and data encryption transmission system | |
| JPS58184646A (en) | Message communication system | |
| Kabir et al. | Effects of unequal bit costs on classical huffman codes | |
| CN101001215A (en) | Method exchanging information by Chinese character by shipborner automatic recognition system | |
| Bhosale et al. | Data compression algorithm for wireless sensor network | |
| JPS63209228A (en) | Data compressing method | |
| Abate Tefera et al. | Compressed Amharic Text: A Prediction by Partial Match Context-Modeling Algorithm |