JPS60141075A - Detection circuit of line synchronizing code of g3 facsimile signal - Google Patents

Detection circuit of line synchronizing code of g3 facsimile signal

Info

Publication number
JPS60141075A
JPS60141075A JP58247048A JP24704883A JPS60141075A JP S60141075 A JPS60141075 A JP S60141075A JP 58247048 A JP58247048 A JP 58247048A JP 24704883 A JP24704883 A JP 24704883A JP S60141075 A JPS60141075 A JP S60141075A
Authority
JP
Japan
Prior art keywords
code
bit
input
eol
output
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.)
Granted
Application number
JP58247048A
Other languages
Japanese (ja)
Other versions
JPH0352711B2 (en
Inventor
Toshihiko Motobayashi
稔彦 本林
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.)
NEC Corp
Original Assignee
NEC Corp
Nippon Electric Co 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 NEC Corp, Nippon Electric Co Ltd filed Critical NEC Corp
Priority to JP58247048A priority Critical patent/JPS60141075A/en
Publication of JPS60141075A publication Critical patent/JPS60141075A/en
Publication of JPH0352711B2 publication Critical patent/JPH0352711B2/ja
Granted legal-status Critical Current

Links

Landscapes

  • Facsimile Transmission Control (AREA)

Abstract

PURPOSE:To allow detection of EOL codes at a high speed with simple constitution and to offer flexibility with respect to code length of special codes by making it possible to detect EOL codes with a special format in a code strng by processing at every word without bit handling. CONSTITUTION:A sum of the number outputted by a register 4 and that of zero its which continue from the highest order of eight-bit data of an input to the lower order are outputted at an A side of a logical operation circuit 2. The number of zero bits which continue from the lower order to the higher order is outputted at a B side. A comparator 5 inputs the value of the logical operation circuit 2 at the A side, decides whether it is beyond 11, and when it is beyond 11, the comparator 5 outputs a detection signal of an EOL code. When fourth bit of the output signal at the B side is zero, a selector 3 is controlled, and the output value at the B side is inputted to an input of the registor 4. Then addition of new continuous zero bits is started. When fourth bit of the output signal at the B side is one, the output at the A side is set to an input of the registor 4 by a selector 3.

Description

【発明の詳細な説明】 イ、7+Y−業上の利用分野 本発明は、Cci’i”i’勧告、T・4に合致した(
(Q〕丁クりミリF14雉畳(モチ7)、イト・、2、
フマン符号、モディファイド・リード負号)における2
イン同期符号(EOL符号;I噌Cnd Of的に標準
化されている符号化方式、即ち、モティファイドハフマ
ン符号化、モデフアイト・リード符号化(MH符号化方
式、M几符号化力式)において、主走査線単位の区切シ
に用いられるライン同期符号(EOL符号、符号として
′000000000001” が割り当てられている
)を検出するには、シリアルデータをシフトレジスタ等
でビットシフトを行い、ビット単位に固定バタンと照合
することによシ検出している。
[Detailed Description of the Invention] A. 7+Y- Industrial Application Field The present invention complies with Cci'i"i' Recommendation, T.4 (
(Q) Minkuri millimeter F14 pheasant tatami (mochi 7), ito・, 2,
2 in Human code, modified lead negative sign)
In the in-synchronization code (EOL code), which are standardized encoding methods such as modified Huffman coding, modified lead coding (MH coding method, M-coding power method), the main To detect the line synchronization code (EOL code, '000000000001' is assigned as the code) used to separate each scanning line, bit-shift the serial data using a shift register, etc., and set a fixed pattern bit by bit. It is detected by comparing it with

また、これらの処理をマイクロプロセッサ等によって実
現する場合、マイクロプロセッサで処理し得るように−
たんライン同期符号とは無関係に受信符号をパラレルデ
ータに変換し1、パラレルデータを1ビツトずつシフト
し上記方法と同様にして検出していた。
In addition, when these processes are implemented using a microprocessor, etc., it is necessary to
The received code is converted into parallel data regardless of the line synchronization code, and the parallel data is shifted one bit at a time and detected in the same manner as described above.

従来の方法によると、パラレルデータがnビットである
とn回のピントシフト処理を1行う必要があり、■タイ
ミングクロックで1シフトを行うとすると非常に処理時
間がかかることになる。また、検t1.Iすべ@特殊な
符号の省号長によって、シフトレジスタ、コンパレータ
等の段数を増やす必要がち9、特殊な符号の符号長の変
更に対して7レキシビリテイに欠りる。
According to the conventional method, if the parallel data is n bits, it is necessary to perform one focus shift process n times, and if one shift is performed using the timing clock (1), the processing time will be extremely long. Also, test t1. Due to the code length of a special code, it is often necessary to increase the number of stages of shift registers, comparators, etc.9, and there is a lack of flexibility to change the code length of a special code.

ハ1発明の目的 本発明の目的は、符号列中の連続した101またはII
Iで構成されている特殊なライン同期杓号を簡易な構成
で高速に検出でき、おっ、特殊ガ勾号の杓号長に対して
フレキシビリティをもった回路を提供することにある。
C1 Object of the invention The object of the invention is to
It is an object of the present invention to provide a circuit that can detect a special line synchronization signal consisting of I at high speed with a simple configuration and has flexibility for the length of the special line synchronization signal.

二 発明の構成 本発明は、nビットのパラレルレジスタと、そのパラレ
ル出力と次段回路から出力される前データまでにおいて
連続している101ビツトの数の価とを入力して現デー
タまでの連続しているIO“ビットの数と、現データで
新しく検出開始される連続している101 ビットの数
とを出力する論理回路上、連続1−た“()゛ ヒツト
の数がライン同期杓号の条件を満足しでいるかを判断す
る比較回路とからなる。
2. Structure of the Invention The present invention provides an n-bit parallel register, and inputs the value of a 101-bit number that is continuous between the parallel output thereof and the previous data output from the next stage circuit, and stores the continuous data up to the current data. On the logic circuit that outputs the number of IO bits currently being detected and the number of consecutive 101 bits newly detected in the current data, the number of consecutive 1-() hits is the line synchronization signal. and a comparison circuit that determines whether the following conditions are satisfied.

ホ、実施例 本発明を実施例について説明する。E, Example The present invention will be described with reference to examples.

第1図は、パラレルデータを8ビットとし、G3ファク
シミリ符号中のEOL符号を検出するだめの回路ブロッ
ク図である。図において、1と4はそれぞれ8ビツト、
4ビツトのレジスタで、初期値はゼロであシ、同一のク
ロックでデータをラッチする。2は、レジスタ1と4の
出力を入力としたメモリ、PLA等でnl、成された論
理回路で、陥l理回路2のA仙1出力には、入力の8ビ
ツトテータの一番高位から低位に向かって連続している
@0“ビットの数(8以−「)と、レジスタ4の出力し
ている数との和を出力する。和が16以上となる鳩舎は
15を出力する。論理回路2のB a+1+出力には、
入力の8ビツトデータの一番低位から高位に向かって連
続しでいる0ビツトの数を出力する。8ビットの入カデ
〜りに少なくとも1つの”1”が入っている場合、E 
OL符号が最終ビットであるか否かを調べる/ζめに、
B側出力の4ビツト目の“0“を用いてコンパレータ5
をイネ−フルにする。
FIG. 1 is a circuit block diagram for detecting an EOL code in a G3 facsimile code using 8-bit parallel data. In the figure, 1 and 4 are each 8 bits,
It is a 4-bit register with an initial value of zero, and data is latched using the same clock. 2 is a logic circuit made up of memory, PLA, etc. that inputs the outputs of registers 1 and 4. Outputs the sum of the number of consecutive @0" bits (8 or more) and the number output from register 4. A pigeonhole where the sum is 16 or more outputs 15. Logic The B a+1+ output of circuit 2 has
Outputs the number of consecutive 0 bits from the lowest to the highest in the input 8-bit data. If there is at least one “1” in the 8-bit input data, E
Check whether the OL code is the final bit/ζ
Comparator 5 uses the 4th bit “0” of the B side output.
Make it effective.

このときコンパレータ5は論理回路2のA側出力のイ1
^を入力し2.11以上であるか比較し、11以上であ
れはE OL符号の検出信号を出力する。
At this time, the comparator 5 outputs the A side output of the logic circuit 2.
^ is input and compared to see if it is 2.11 or more, and if it is 11 or more, an EOL code detection signal is output.

寸だ、B伸出力信号の4ビツト目がlO“、すなわち、
データの中に少くとも一つの111が入っ1いる場合セ
レクタ3を制御し、レジスタ4の入力にB側出力の飴を
入力することにより、新しい連続した“01ビツトの数
の加りを開始する。Bπljl出力信号の4ビツト目が
51#、すなわち、入力8ビツトのデータが全部10”
の場合は、セレクタ3により、入側出力をレジスタ4の
入力とする。
The 4th bit of the B decompression output signal is lO", that is,
If there is at least one 111 in the data and there is a 1, control selector 3 and input the B side output candy to the input of register 4 to start adding a new number of consecutive "01 bits." The 4th bit of the Bπljl output signal is 51#, that is, the input 8-bit data is all 10".
In this case, the input side output is input to the register 4 by the selector 3.

へ1発明の効果 本発明によると、符号列中の特殊な様式のEC)Llq
−Qの検出が、ビットハンドリングすることなく、ワー
ド単位のりL理で可鮨であわ、シ・フトレジスタ葡用い
ないので、シフトクロックを必要とせず、処理速度も速
くなる。丑だ符号長に幻するフレキシビリティも従来技
術よシも大きくなる効果も併わせ持っている。
According to the present invention, a special format of EC)Llq in a code string
-Q detection can be performed by word-by-word processing without bit handling, and since a shift register is not used, a shift clock is not required and the processing speed is increased. It has the advantage of greater flexibility than the conventional technology, as well as the flexibility of the code length.

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

第1図は、本発明の一実施例の回路ブロック図である。 1 ・・8ビーツトレジスタ、2 ・論理1!:!l路
、3・・ セレクタ、4・・・・・4ビツトレジスタ、
5コンパレータ。 代理人 弁理士 内 原 晋
FIG. 1 is a circuit block diagram of an embodiment of the present invention. 1 ・8 beat registers, 2 ・Logic 1! :! l path, 3... selector, 4... 4 bit register,
5 comparators. Agent Patent Attorney Susumu Uchihara

Claims (1)

【特許請求の範囲】[Claims] ライン同期符号(BOL符号)を含むG3ファクシミリ
イ菖号をnビット並列信号として受信し、現受(%nn
ビット並列信号面前の受信nビット並列信号までに連続
する101の数と現受信nビット並列(M号の最初に表
われたJltでに連続する10“の数とを検出し、前記
EOL符号を検出することを特徴とする03〕丁クシミ
リ伯号のライン同期符号検出回路。
A G3 facsimile code including a line synchronization code (BOL code) is received as an n-bit parallel signal, and the current reception (%nn
The number of consecutive 101's up to the received n-bit parallel signal before the bit parallel signal side and the number of consecutive 10's at the current received n-bit parallel signal (Jlt appearing at the beginning of the M number) are detected, and the EOL code is detected. 03] A line synchronization code detection circuit of Dokushimiri Hakugo.
JP58247048A 1983-12-28 1983-12-28 Detection circuit of line synchronizing code of g3 facsimile signal Granted JPS60141075A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58247048A JPS60141075A (en) 1983-12-28 1983-12-28 Detection circuit of line synchronizing code of g3 facsimile signal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58247048A JPS60141075A (en) 1983-12-28 1983-12-28 Detection circuit of line synchronizing code of g3 facsimile signal

Publications (2)

Publication Number Publication Date
JPS60141075A true JPS60141075A (en) 1985-07-26
JPH0352711B2 JPH0352711B2 (en) 1991-08-12

Family

ID=17157634

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58247048A Granted JPS60141075A (en) 1983-12-28 1983-12-28 Detection circuit of line synchronizing code of g3 facsimile signal

Country Status (1)

Country Link
JP (1) JPS60141075A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN121143594A (en) * 2025-09-04 2025-12-16 苏州顺芯半导体有限公司 Synchronization word detection circuit, detection method and chip based on Soundwire protocol

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN121143594A (en) * 2025-09-04 2025-12-16 苏州顺芯半导体有限公司 Synchronization word detection circuit, detection method and chip based on Soundwire protocol

Also Published As

Publication number Publication date
JPH0352711B2 (en) 1991-08-12

Similar Documents

Publication Publication Date Title
US5287193A (en) Parallel processing architecture of run-length codes
EP0145396A2 (en) Codeword decoding
JPS60140982A (en) Method and device for detecting digital code word
JPS60141075A (en) Detection circuit of line synchronizing code of g3 facsimile signal
KR100466455B1 (en) Code converter, variable length code decoder and method of decoding variable length code
JPH11243342A (en) Variable length code decoding device
US6943706B2 (en) Process and devices for transmitting digital signals over buses and computer program product therefore
JPH06252874A (en) Word synchronization detection circuit
JPH1098458A (en) Sync word detection circuit
JPH03272224A (en) Information signal processing method
JPS5964969A (en) Coded signal decoding device
JPH0242275B2 (en)
KR970002963B1 (en) Code Detection Circuit in Digital Signal Transmission System
JP2641442B2 (en) Decryption device
JP3231263B2 (en) Code converter, variable-length code decoding device and decoding method
JPS61173582A (en) Change point detecting circuit
JP2002221953A (en) Image display device
JPS5925416A (en) Waiting circuit
JPS63227179A (en) Variation picture element address detecting device
JPS62199173A (en) Modified huffman code decoding circuit
JPH0834545B2 (en) Image data coding device
JPS59119971A (en) Decoding system
JPS6118266A (en) Modified huffman coding and decoding device
JPS63204944A (en) Optical information transmission equipment
JPH0260373A (en) Encoding circuit for facsimile equipment