JPS6072486A - System for forming facsimile transmission code - Google Patents

System for forming facsimile transmission code

Info

Publication number
JPS6072486A
JPS6072486A JP18161283A JP18161283A JPS6072486A JP S6072486 A JPS6072486 A JP S6072486A JP 18161283 A JP18161283 A JP 18161283A JP 18161283 A JP18161283 A JP 18161283A JP S6072486 A JPS6072486 A JP S6072486A
Authority
JP
Japan
Prior art keywords
data
bit
polarity
consecutive
counter
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
Application number
JP18161283A
Other languages
Japanese (ja)
Inventor
Takao Oda
小田 隆男
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
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
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP18161283A priority Critical patent/JPS6072486A/en
Publication of JPS6072486A publication Critical patent/JPS6072486A/en
Pending legal-status Critical Current

Links

Landscapes

  • Storing Facsimile Image Data (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

PURPOSE:To use a table ROM for coding and decoding a two-dimension code by providing a fixed memory table separating and storing data into a number of polarity consecutive from the head, remaining bit number excluding coded data of the polarity and the remaining data excluding the polarity data respectively. CONSTITUTION:A data other than ''0'' from a data buffer 3, a data bit number other than ''0'' from a bit counter 4 and a consecutive ''0'' number of the head from a ''0'' number counter 5 in the transmission data are inputted to a ''0'' insertion circuit 6, from which the data is transmitted as a transmission data of 8-bit white run length. On the other hand, an input reception data is stored once in a reception buffer 8 and when the head consecutive ''0'' number is detected by a ''0'' number detection counter 9, the first 8-bit area in 16 bits in a table ROM2 is searched based on 8-bit including the remaining data to output the restored data. The table ROM is used in common by storing separately the data in the fixed memory table and using the data for coding and decoding in this way.

Description

【発明の詳細な説明】 (1)発明の技術分野 本発明はファクシミリで用いられる2次元符号の符号化
、復号化における固定メモリテーブルを共通に使用しメ
モリ容量の削減を図ったファクシミリ伝送符号の作成方
式に関するものである。
Detailed Description of the Invention (1) Technical Field of the Invention The present invention relates to a facsimile transmission code which uses a fixed memory table in common for encoding and decoding two-dimensional codes used in facsimile, thereby reducing memory capacity. This is related to the creation method.

(2)従来技術と問題点 従来、ファクシミリ通信方式の国際規格として、00j
TT勧告によるG3形式(デジタル)が適用されるが、
その圧縮、伸張のだめの符号、復号方式としては、−次
元のMH(モディファイドハフマン)方式と2次元のM
R(モディファイドリード)方式が用いられる。このう
ちのMR方式は2ラインに亘る画信号の相対関係を下記
の9種の符号で表わす。これらのビット長は各種で最長
7ビツト長である。
(2) Conventional technology and problems Conventionally, 00j was used as an international standard for facsimile communication systems.
G3 format (digital) according to TT recommendation is applied, but
The compression and decompression codes and decoding methods are -dimensional MH (Modified Huffman) method and two-dimensional M
The R (modified read) method is used. Among these, the MR method expresses the relative relationship between image signals over two lines using the following nine types of codes. These bit lengths are up to 7 bits long for each type.

■o;上下同符号(”1”) VR(1) 、 VL(1) : 右(左)側1ビット
目符号変化〃(2)、〃(2);#2ビット目 〃//
(3)、//(3): # 3ビツト目 〃P(パス)
 ; 4ビット以上変化なしH(水平コード); ラン
レングス表示の場合このMR方式で送信データの符号化
、受信データの復号化を行なうために固定メモリテーブ
ルを有し、上記9種のMR符号の外ランレングスデータ
が格納される。ジンレングスデータはMH(モディファ
イドハフマン)方式で規定されるターミネ−トコードが
白黒64×2個、メークアップコード白黒40×2個が
それぞれそのビット数とともに2バイト領域に格納され
、たとえば512バイトのテーブルROMが用いられる
。さらに送信データの符号化回路と受信データの復号化
回路はそれぞれ独立した回路方式を有するため、同じ内
容のテーブルROMを符号用と復号用に別々に設けてい
た。本発明者はLSI化する場合の利点から符号用と復
号用のテーブルROMを共通にしてメモリ容量を半減す
ることを考えたものである。
■o; Same sign above and below (“1”) VR (1), VL (1): Sign change for the 1st bit on the right (left) side〃(2),〃(2); #2nd bit〃//
(3), //(3): # 3rd bit 〃P (pass)
; No change of 4 bits or more H (horizontal code); In the case of run-length display, this MR method has a fixed memory table to encode the transmitted data and decode the received data. Outside run length data is stored. The gin length data is defined by the MH (Modified Huffman) method, where termination codes (64 x 2 black and white) and makeup codes (40 x 2 (black and white)) are stored in a 2-byte area along with their bit numbers, for example, in a 512-byte table. ROM is used. Furthermore, since the transmission data encoding circuit and the reception data decoding circuit have independent circuit systems, separate table ROMs with the same contents are provided for encoding and decoding. The inventor of the present invention considered the idea of using a common table ROM for encoding and decoding to reduce the memory capacity by half in order to take advantage of the LSI implementation.

(3)発明の目的 本発明の目的はファクシミリで用いられる2次元符号の
符号化と復号化用のテーブルROMを共通にしたファク
シミリ伝送符号の作成方式を提供することである。
(3) Purpose of the Invention The purpose of the present invention is to provide a facsimile transmission code creation method that uses a common table ROM for encoding and decoding two-dimensional codes used in facsimile.

(4)発明の構成 前記目的を達成するため、本発明のファクシミリ伝送符
号の作成方式は画像信号の符号化データを、先頭から連
続する一つの極性の数と、該極性の符号化データを除い
た残シのビット数と、該極性データを除いた残余データ
に分解して各々格納する固定メモリテーブルを具え、該
テーブルから読出される各ビット数を示すデータと、残
余データとによシファクシミリ伝送符号を作成すること
を特徴とするものである。
(4) Structure of the Invention In order to achieve the above-mentioned object, the facsimile transmission code creation method of the present invention extracts the encoded data of an image signal by excluding the number of one consecutive polarity from the beginning and the encoded data of the polarity. The facsimile machine has a fixed memory table that decomposes and stores the number of remaining bits and the remaining data excluding the polarity data, and stores the data indicating the number of bits read from the table and the remaining data. This method is characterized by creating a transmission code.

(5)発明の実施絢 第1図は本発明の実施例の構成説明図である。(5) Implementation of the invention FIG. 1 is an explanatory diagram of the configuration of an embodiment of the present invention.

同図において、テーブルROM2には前述のように、M
R符号9種と208個のシンレングス信号が格納されて
いる。
In the figure, the table ROM2 has M
Nine types of R codes and 208 syn-length signals are stored.

これらの信号は、たとえばM2図に「白ランレングス4
0」の符号”ooi oi oal”の8ビツトデータ
■に始し、16ビツト領域の最初の8ビツト領域に、白
ランレングスデータ■の先頭の連続する0”を除いた残
シのデータ■6ビツトを上位に入れその下位2ビツトを
0”で埋める。次の8ビツト領域のうちの4ビツトは白
ジンレングス・データ■の先頭の連続”0”の数■を、
次の4ビツトは連続”□IIよ、いえ。。f−11tD
Yツ、。1よ□、1.0第1.おいて、白ランレングス
データ■をカウンタ1によpカウントし、カウント数を
アドレスとしてテーブルROM 2に入れ、第2図■、
■、■よ構成る16ビツトデータを順次アクセスする。
These signals are shown as "white run length 4" in the M2 diagram, for example.
Starting from the 8-bit data ■ with the code "ooi oi oal" of "0", the remaining data ■6 excluding the consecutive 0'' at the beginning of the white run length data ■ is placed in the first 8-bit area of the 16-bit area. Put the bit in the upper position and fill the lower two bits with 0''. The next 4 bits in the 8-bit area represent the number of consecutive 0's at the beginning of the white length data.
The next 4 bits are continuous "□II, no. f-11tD
Ytsu,. 1 yo □, 1.0 1st. Then, the white run length data (■) is counted by the counter 1, and the counted number is stored in the table ROM 2 as an address.
The 16-bit data consisting of ① and ② is accessed sequentially.

そして、連続″0″以外のデータ■を@0”以外のデー
タバッファ3に格納し、そのデータビット数■を0”以
外のビットカウンタ4に入れてカウントし、先頭の連続
0°′数■を“0″数カウンタ5に入れてカウントする
Then, store the data ■ other than consecutive "0" in the data buffer 3 other than @0, put the number of data bits ■ into the bit counter 4 other than 0", count it, and count the number of continuous 0°' at the beginning ■ is entered into the "0" number counter 5 and counted.

□ 送信データは、この0”以外のデータバッファ3か
らのデータと、″On以外のビットカウンタ4からの該
データピッ1.ト数と、0”数カウンタ5からの先頭の
連続0″数とを”0”挿゛入回路6に入力し、0”以外
の残・シデータ6ビットを抽出した上先頭に連続″0°
゛ビットを付与して8ビツトの白2ンレングスの送信デ
ータとして送出する。
□ The transmission data is the data from the data buffer 3 other than 0'' and the data from the bit counter 4 other than ``On''. The number of zeros and the leading consecutive 0° number from the 0" number counter 5 are input to the "0" insertion circuit 6, and the remaining 6 bits of data other than 0" are extracted.
bit is added and sent as 8-bit white 2-length transmission data.

一方、入力受信データを受信バッファ8に一旦保持し、
0”微検出カウンタ9によシ先頭の連続10”数を検出
しん所で、残シのデータを含む8ビツトを基にして、:
テーブルROM 2内の16ビツト中の最初の8ビット
:領域をサーチし、最初の6ビツトが一致した時、第2
図の例で言う□と、「白ジンレングス40」のところに
きたとき″〇−以外のデータバッファ3の内容と一致し
、この時:0”微検出カウンタ9の4ビツトと″0″数
カウン、り5の4ビツトとを一致検出回路7で一致をと
シ、また午の時の”0″以外のビットカウンタ4の力、
ラント竺4ビットを一致検出回路7に入れて受信しくツ
ファ8からの0”以外のデータの6ビツトを有効にし、
このデータと”0”以外のデータづツズア3の内容との
一致検出を行ない復元データを出・力する。1このよう
に固定メモリテーブルにデータを分解格納し、符号化と
復号化に対し使い分けることによシ共用することができ
る。 −、。
On the other hand, the input reception data is temporarily held in the reception buffer 8,
At the point where the 0" fine detection counter 9 detects the first consecutive 10" number, based on the 8 bits containing the remaining data:
First 8 bits out of 16 bits in table ROM 2: When the area is searched and the first 6 bits match, the second
In the example shown in the figure, when □ reaches the "white gin length 40", it matches the contents of the data buffer 3 other than "〇-", and at this time: 4 bits of the 0" slight detection counter 9 and the number "0" Match the 4 bits of the counter 5 with the match detection circuit 7, and also check the power of the bit counter 4 other than "0" at the time of the day.
Put the 4 bits of the runt line into the coincidence detection circuit 7 and enable the 6 bits of data other than 0'' from the buffer 8.
A match is detected between this data and the contents of the restorer 3 containing data other than "0", and restored data is output. 1. In this way, data can be stored in fixed memory tables in a shared manner by being used for encoding and decoding. -,.

Jl[# Ll j 51C177/&−fl!J二8
に3゜において、符号化データを先頭から、連続す号“
0”の数と、0”を除い桝残シのビット、数と、”0”
を除いた残シのデータとに分解して格・納する固定メ%
9f−7”kを具え・301定メ二リオー7°″を共用
して所要のデータを符号回路と、1復号回路に供給しう
るようにしたものである。
Jl [# Ll j 51C177/&-fl! J28
At 3°, the encoded data is read from the beginning with successive symbols “
The number of 0'', the remaining bits excluding 0, the number, and 0.
Fixed memory that is separated and stored in the remaining data after excluding
9f-7''k and 301 constant mediori 7°'' can be shared to supply required data to the encoder circuit and the decoder circuit.

このように、符号化と復号化に1つのテーブルR゛OM
を共用することができ、メモリ量を半減することが可能
とな、9、LSI化等の場合に有利となる。
In this way, one table R゛OM is used for encoding and decoding.
9. This is advantageous in the case of LSI implementation, etc., since it is possible to share the memory and reduce the amount of memory by half.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の実施例の構成説明図、第2図は実施例
の要部の機能説明図であシ、図中、1はカウンタ、2は
テーブルROM、3は0”以外のデータバッファ、4は
°°0′以外のビットカウンタ、5は”0″数カランタ
、6は0”挿入回路、7は一致検出回路、8は受信バッ
ファ、9は”0°′数検出カウンタを示す。 特許出願人富士通株式会社 復代理人 弁理士 1)坂 善 重
Fig. 1 is a configuration explanatory diagram of an embodiment of the present invention, and Fig. 2 is a functional explanatory diagram of main parts of the embodiment. In the figure, 1 is a counter, 2 is a table ROM, and 3 is data other than 0". buffer, 4 is a bit counter other than °°0', 5 is a "0" number counter, 6 is a 0" insertion circuit, 7 is a match detection circuit, 8 is a reception buffer, 9 is a "0°" number detection counter Patent applicant Fujitsu Ltd. Sub-agent Patent attorney 1) Yoshishige Saka

Claims (1)

【特許請求の範囲】[Claims] 画像信号の符号化データを、先頭から連続する一つの極
性の数と、該極性の符号化データを除いた残シのビット
数と、該極性データを除いた残余データに分解して各々
格納する固定メそリテーブルを具え、該テーブルから読
出される各ビット数を示すデータと、残余データとによ
シファクシミリ伝送符号を作成することを特徴とするフ
ァクシミリ伝送符号の作成方式。
Decomposes the encoded data of the image signal into the number of consecutive polarities from the beginning, the number of remaining bits after excluding the encoded data of the polarity, and the residual data after excluding the polarity data, and stores each of them. 1. A method for creating a facsimile transmission code, comprising a fixed memory table, and creating a facsimile transmission code using data indicating the number of bits read from the table and residual data.
JP18161283A 1983-09-29 1983-09-29 System for forming facsimile transmission code Pending JPS6072486A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP18161283A JPS6072486A (en) 1983-09-29 1983-09-29 System for forming facsimile transmission code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP18161283A JPS6072486A (en) 1983-09-29 1983-09-29 System for forming facsimile transmission code

Publications (1)

Publication Number Publication Date
JPS6072486A true JPS6072486A (en) 1985-04-24

Family

ID=16103844

Family Applications (1)

Application Number Title Priority Date Filing Date
JP18161283A Pending JPS6072486A (en) 1983-09-29 1983-09-29 System for forming facsimile transmission code

Country Status (1)

Country Link
JP (1) JPS6072486A (en)

Similar Documents

Publication Publication Date Title
JP2711665B2 (en) Bitrate reduction method and apparatus
JPH04199981A (en) Prompt processing type one-dimensional coder
EP0149893B1 (en) Apparatus for coding and decoding data
JPH0821863B2 (en) Data processing method
JPS6220748B2 (en)
JPS6072486A (en) System for forming facsimile transmission code
JPH04298164A (en) Data compression/release circuit for facsimile apparatus
JPH01302917A (en) Data compression system
JPS54119829A (en) Redundant bit additional system in facsimile coding
JPS592485A (en) Picture reader
JP2556047B2 (en) Image information coding device
JPH02218224A (en) Data transferring method
JPS59219071A (en) Picture coding transmission system
JPH04258084A (en) Code rule converter
JPH03136575A (en) Facsimile coder
JPH06101793B2 (en) Data encoder
JP2000101440A (en) Encoded transmission method and encoded transmission device
JPS62164317A (en) Coding system
JPS5936779B2 (en) Character pattern data transmission method
JPS5652962A (en) Picture information communication system
JPH0432586B2 (en)
JPS58145274A (en) Modified hoffmann encoding and decoding system
JPS5579564A (en) Facsimile signal decoder
JPH0420308B2 (en)
JPH08307701A (en) Runlength encoding and decoding method