JPS6083451A - Synchronous data buffering system - Google Patents

Synchronous data buffering system

Info

Publication number
JPS6083451A
JPS6083451A JP58191605A JP19160583A JPS6083451A JP S6083451 A JPS6083451 A JP S6083451A JP 58191605 A JP58191605 A JP 58191605A JP 19160583 A JP19160583 A JP 19160583A JP S6083451 A JPS6083451 A JP S6083451A
Authority
JP
Japan
Prior art keywords
message
buffer
data
control program
check
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
JP58191605A
Other languages
Japanese (ja)
Inventor
Yoshiki Yamazaki
義樹 山崎
Saburo Kamei
亀井 三郎
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 JP58191605A priority Critical patent/JPS6083451A/en
Publication of JPS6083451A publication Critical patent/JPS6083451A/en
Pending legal-status Critical Current

Links

Landscapes

  • Communication Control (AREA)

Abstract

PURPOSE:To simplify a control program and an interface by storing a synchronizing signal which is predetermined in parallel when the head and tail of a message and discriminating the head and tail of the message from the synchronizing signal. CONSTITUTION:Start-stop synchronous data when sent through a communication circuit is converted into a parallel signal, and a parity check on it is made to send only a normal message to the message buffer 9'' of a buffer 9'. When a check circuit 8' makes the parity check, codes indicating the head and tail of a message are detected. When a message is read out by a control program, a synchronizing signal is also read out simultaneously to check on whether it is present or not, thereby discriminating the head and tail of the message.

Description

【発明の詳細な説明】 +a+ 発明の技術分野 本発明は通信回線からの調歩同期式受信データをチェッ
ク回路によりチェックレ正常なデータのみを制御プログ
ラムに渡す為のデータバッファに格納するデータバッフ
ァリング方式に係り、簡単な制御プログラム及び簡単な
ノ・−ドウエアインタフェイスで実現出来る同期式デー
タバッファリング方式に関する。
[Detailed Description of the Invention] +a+ Technical Field of the Invention The present invention provides a data buffering method in which a check circuit checks asynchronous reception data from a communication line and stores only normal data in a data buffer for passing to a control program. The present invention relates to a synchronous data buffering method that can be realized with a simple control program and a simple hardware interface.

(b) 技術の背景 通信回線からの調歩同期式データは時々集中して送られ
てくることがある。この場合チェック回路によりチェッ
クし正常なデータを直接制御プログラムに渡すとすると
、次のデータが該チェック回路に入力する迄に先のデー
タを全部制御プログラムに渡す必要がある。これでは制
御プログラムのアクセス負荷が増大する。この為数クレ
ーム分のデータを格納するデータバッファを持ちデータ
バッファに格納されたデータを制御プログラムに渡すデ
ータバッファリング方式が用いられている。
(b) Background of the Technology Asynchronous data from a communication line is sometimes sent in a concentrated manner. In this case, if the check circuit checks the data and passes normal data directly to the control program, it is necessary to pass all previous data to the control program before the next data is input to the check circuit. This increases the access load on the control program. For this reason, a data buffering method is used which has a data buffer that stores data for several claims and passes the data stored in the data buffer to a control program.

(C) 従来技術と問題点 第1図は調歩同期式受信データの構成図、第2図は従来
例のデータバッフプリング方式のブロック図、第3図は
第2図のバッファに格納されたデータの構成図である。
(C) Prior art and problems Figure 1 is a block diagram of the asynchronous reception data, Figure 2 is a block diagram of the conventional data buffer pulling method, and Figure 3 is the data stored in the buffer in Figure 2. FIG.

図中1.2.3はメツセージ、4,5.6はチェック符
号、Fは先頭を示す符号、F′は終了を示す符号、7は
直並列変換回路(以下S/P変換回路と称す)、8はチ
ェック回路、9はバッファ、10〜12は先頭を示す符
号領域、13〜15は各メツセージのバイト数を示す符
号領域、1′〜3′はメツセージ領域を示す。
In the figure, 1.2.3 are messages, 4 and 5.6 are check codes, F is a code indicating the beginning, F' is a code indicating the end, and 7 is a serial-to-parallel conversion circuit (hereinafter referred to as S/P conversion circuit). , 8 is a check circuit, 9 is a buffer, 10 to 12 are code areas indicating the beginning, 13 to 15 are code areas indicating the number of bytes of each message, and 1' to 3' are message areas.

第1図て示す如き調歩同期式データが通信回線より送ら
れてくるとS/P変換回路7により並列信号に変換され
、チェック回路8によりメツセージ1,2.3とチェッ
ク符号4,5.6により例えばパリティチェックを行な
い正常なデータのみをバッファ9に送り、バッファ9で
は数フレーム分のメツセージ例えば第1図のメツセージ
112゜3を格納する。しかし格納する場合各メ、セー
ジ1.2.3を識別出来るよう格納する必要がある。
When asynchronous data as shown in FIG. 1 is sent from the communication line, it is converted into parallel signals by the S/P conversion circuit 7, and the check circuit 8 sends messages 1, 2.3 and check codes 4, 5.6. For example, a parity check is performed and only normal data is sent to the buffer 9, and the buffer 9 stores several frames worth of messages, such as the message 112.3 in FIG. However, when storing it, it is necessary to store it so that each message 1.2.3 can be identified.

この為第3図に示す如く、先頭を示す符号領域10゜1
1.12には、先頭を示す符号を、バイト数を示す符号
領域13〜15には、各メツセージ領域1′〜3′に格
納されるメツセージ1〜30バイト数を示す符号を、格
納している。これ等の先頭を示す符号及びバイト@ヲ示
す符号はチェック回路8により作成される。この先頭を
示す符号は、メツセージはどのような符号構成になるか
判らないので、メツセージとしてはあり得ない符号(1
W成(例えば数バイト全て“1″の符号構成)のものを
用いることになる。この為チェック回路8は先頭全示す
符号及びバイト数を示す符号を作成せねばならず回路規
模は大きくなり又制御プログラムはこれ等を判別する必
要が生じ、制御プログラムとハードウェアインクフェイ
ス共複雑になる欠点がある。
For this reason, as shown in Figure 3, the code area 10°1 indicating the beginning
1.12 stores a code indicating the beginning, and code areas 13 to 15 indicating the number of bytes store codes indicating the number of bytes of messages 1 to 30 stored in each message area 1' to 3'. There is. These codes indicating the beginning and the code indicating byte @ are created by the check circuit 8. The code indicating the beginning of the message is an impossible code (1
A W configuration (for example, a code configuration in which several bytes are all "1") is used. For this reason, the check circuit 8 has to create a code that indicates the entire beginning and a code that indicates the number of bytes, which increases the circuit scale and requires the control program to distinguish between these, making both the control program and the hardware interface complex. There is a drawback.

(dl 発明の目的 本発明の目的は上記の欠点に鑑み、簡単な1llf制御
プログラム及び簡単なハードウェアインタフェイスで実
現出来る同期式データバッファリング方式の提供にある
(dl) OBJECT OF THE INVENTION In view of the above-mentioned drawbacks, an object of the present invention is to provide a synchronous data buffering system that can be implemented using a simple 1llf control program and a simple hardware interface.

(e+ 発明の構成 本発明は上記の目的全達成するために、制御プログラム
に渡すメツセージのみをバッファに格納すると共に、チ
ェック回路にて調歩同期式受信データの先頭・終了符号
が検出されることに着目し、該メツセージの先頭・終了
格納時に並列に予め定めである同期信号を格納し、この
同期信号により該メツセージの先頭・終了を判別出来る
よ、うにしたこと全特徴とする。
(e+ Structure of the Invention In order to achieve all of the above objects, the present invention stores only the messages to be passed to the control program in a buffer, and also detects the start and end codes of asynchronous reception data in a check circuit. The main feature is that a predetermined synchronization signal is stored in parallel when the beginning and end of the message are stored, and the beginning and end of the message can be determined by this synchronization signal.

(f) 発明の効果 以下本発明の実施例につき図に従って陵、明する。(f) Effect of the invention Embodiments of the present invention will be explained below with reference to the drawings.

第4図は本発明の、拠施例の同期式データバッファリン
グ方式のブロック図、第5図は第4図のバッファに格納
されたデータの構成図である。
FIG. 4 is a block diagram of a synchronous data buffering system according to an embodiment of the present invention, and FIG. 5 is a configuration diagram of data stored in the buffer of FIG. 4.

図中第2図と同一機能のものは同一記号で示す。Components in the figure that have the same functions as those in FIG. 2 are indicated by the same symbols.

8′はチェック回路、9′はバッファ、9″は先入先出
のメツセージ用バッファ、9″′は先入先出の同期信号
用バッファ、1“ 2//、3“はメツセージ領域、1
6.17.1’8は先頭を示す同期信号領域、19.2
0゜21は終了分水す同期信号領域を示す。
8' is a check circuit, 9' is a buffer, 9'' is a first-in, first-out message buffer, 9'' is a first-in, first-out synchronization signal buffer, 1''2//, 3'' is a message area, 1
6.17.1'8 is a synchronization signal area indicating the beginning, 19.2
0°21 indicates the synchronization signal area for ending the signal.

第1図に示す如き調歩同期式データが通信回線より送ら
れてくると、S/P変換回路7により、並列信号に変換
きれ、チェック回路8′により、・メツセーフ1.2.
3とチェック符号4,5.6により、例えばパリティチ
ェック全行ない正常なメツセージのみをバッファ9′の
メツセージ用バッファ9“送る。チェック回路8′によ
りパリティチェックを行なう場合は、第1図の先頭及び
終了を示す符号F、F”e検出して行なう。この符号F
、 F’検出により第1図のメツセージ1.2.3の先
pr′L−終了が判るのでメツセージ1.2.3の先頭
及び終了のメツセージをメツセージ用バッファ9″に転
送すると同時に予め定めである例えば1ビツトのルベル
の同期信号を同時r4同期信号用バッファ9″′に転送
する。これ等が転送された状態を第5図に示している。
When asynchronous data as shown in FIG. 1 is sent from the communication line, the S/P conversion circuit 7 converts it into a parallel signal, and the check circuit 8' determines whether the data is ・Metssafe 1.2.
3 and check codes 4, 5, and 6, for example, all parity checks are performed and only normal messages are sent to the message buffer 9' in the buffer 9'.When parity check is performed by the check circuit 8', the top and This is done by detecting the signs F and F''e indicating the end. This code F
, By detecting F', the end of message 1.2.3 in FIG. For example, a 1-bit rubel synchronization signal is transferred to the simultaneous r4 synchronization signal buffer 9''. FIG. 5 shows the state in which these are transferred.

即ちメツセージ用バッファ9“のメツセージ格納領域1
”、2“、3”にはメツセージ1,2゜3が格納され、
メツセージ1.2.3の先頭及び終了メツセージと並列
に同期信号用バッファ91″の先頭を示す同期信号領域
16,17.18及び終了を示す同期信号領域19,2
0.21には”1”が格納される。そこで制御プログラ
ムにてメツセージ?読出す場合は、同期信号も同時に読
出しその有無音調べることによりメツセージの先頭及び
終了点を検出する方法でもよく、メツセージ読出しに同
期して読出された同期信号を、ノ・−ドウエア的に制御
プログラムへの割り込み信号としで用いてもよい。この
ようにすると、チェック回路8′は従来に比し簡単な回
路となり又制御プログラムも簡単となる。
That is, the message storage area 1 of the message buffer 9''
", 2", 3" stores messages 1, 2゜3,
Synchronization signal areas 16, 17, 18 indicating the beginning of the synchronization signal buffer 91'' and synchronization signal areas 19, 2 indicating the end in parallel with the start and end messages of message 1.2.3.
“1” is stored in 0.21. Is there a message in the control program? When reading out the message, the start and end points of the message may be detected by reading out the synchronization signal at the same time and checking for the presence or absence of the synchronization signal. It may also be used as an interrupt signal. In this way, the check circuit 8' becomes a simpler circuit than the conventional one, and the control program also becomes simpler.

(g) 発明の効果 以上詳細に説明せる如く本発明によれば簡単な制御プロ
グラム及び簡単なノ飄−ドウェアインタフェイスでデー
タバッファリング方式が実現出来る効果がある。
(g) Effects of the Invention As explained in detail above, the present invention has the advantage that a data buffering system can be realized with a simple control program and a simple software interface.

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

第1図は調歩同期式受信データの構成図、第2図は従来
例のデータバッファリング方式のブロック図、第3図は
第2図のバッファに格納されたデータの構成図、第4図
は本発明の実施例の同期式データバッファリング方式の
ブロック図、第5図は嬉4図のバッファに格納されたデ
ータの構成図でおる。 図中1〜3はメツセージ、4〜6はチェック符号、Fけ
先頭を示す符号、F′は終了を示す符号、7は直並列変
換回路、8.8’はチェック回路、9゜9′はバッファ
、10〜12は先頭を示す符号領域、13〜工5は各メ
ツセージのバイト数を示す符号領域、1′〜3′11″
〜3”はメツセージ領域、16〜18は先頭を示す同期
信号領域、19〜2・1は終了を示す同期信号領域、9
“は先入先出のメツセージ用バッファ、9#は先入先出
の同期信号用バッファを示す。
Fig. 1 is a block diagram of asynchronous reception data, Fig. 2 is a block diagram of a conventional data buffering method, Fig. 3 is a block diagram of data stored in the buffer of Fig. 2, and Fig. 4 is a block diagram of a conventional data buffering method. FIG. 5 is a block diagram of a synchronous data buffering system according to an embodiment of the present invention, and is a configuration diagram of data stored in the buffer of FIG. 4. In the figure, 1 to 3 are messages, 4 to 6 are check codes, a code indicating the start of F's, F' is a code indicating the end, 7 is a serial/parallel conversion circuit, 8.8' is a check circuit, and 9°9' is a Buffer, 10 to 12 are code areas indicating the beginning, 13 to 5 are code areas indicating the number of bytes of each message, 1' to 3'11''
~3'' is a message area, 16 to 18 are synchronization signal areas indicating the beginning, 19 to 2.1 are synchronization signal areas indicating the end, 9
"" indicates a first-in, first-out message buffer, and 9# indicates a first-in, first-out synchronization signal buffer.

Claims (1)

【特許請求の範囲】[Claims] 通信回線からの911歩同期成受信データをチェック回
路によりチェックし正常なデータのみを制御プログジム
に渡す為のデータバッファに格納するデータバッファリ
ング方式において、該制御プログラムに渡すメツセージ
のみ全バッファに格納すると共に、該チェック回路によ
り、該制御プログラムにて該メツセージを読み出しアク
セスする場合該メツセージの先頭・終了点と同時刻にア
クセスされるメツセージ用同期信号を作成し、該バッフ
ァに格納するようにしたことを特徴とする同期式データ
バッファリング方式。
In the data buffering method, in which the 911 step synchronization received data from the communication line is checked by a check circuit and only normal data is stored in the data buffer for passing to the control program, only messages to be passed to the control program are stored in all buffers. In addition, the check circuit creates a message synchronization signal that is accessed at the same time as the start and end points of the message when the control program reads and accesses the message, and stores it in the buffer. A synchronous data buffering method featuring
JP58191605A 1983-10-13 1983-10-13 Synchronous data buffering system Pending JPS6083451A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58191605A JPS6083451A (en) 1983-10-13 1983-10-13 Synchronous data buffering system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58191605A JPS6083451A (en) 1983-10-13 1983-10-13 Synchronous data buffering system

Publications (1)

Publication Number Publication Date
JPS6083451A true JPS6083451A (en) 1985-05-11

Family

ID=16277415

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58191605A Pending JPS6083451A (en) 1983-10-13 1983-10-13 Synchronous data buffering system

Country Status (1)

Country Link
JP (1) JPS6083451A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007143603A (en) * 2005-11-24 2007-06-14 Nihon Technica Co Ltd Seat reclining device
JP2007167305A (en) * 2005-12-21 2007-07-05 Nihon Technica Co Ltd Seat reclining device having fitting structure between locking mechanism and casing, and its load adjusting structure of seat back
JP2007202867A (en) * 2006-02-02 2007-08-16 Nihon Technica Co Ltd Seat reclining device provided with load adjusting structure of seat back
JP2007312935A (en) * 2006-05-24 2007-12-06 Nihon Technica Co Ltd Seat reclining device provided with load adjusting structure of seat back

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007143603A (en) * 2005-11-24 2007-06-14 Nihon Technica Co Ltd Seat reclining device
JP2007167305A (en) * 2005-12-21 2007-07-05 Nihon Technica Co Ltd Seat reclining device having fitting structure between locking mechanism and casing, and its load adjusting structure of seat back
JP2007202867A (en) * 2006-02-02 2007-08-16 Nihon Technica Co Ltd Seat reclining device provided with load adjusting structure of seat back
JP2007312935A (en) * 2006-05-24 2007-12-06 Nihon Technica Co Ltd Seat reclining device provided with load adjusting structure of seat back

Similar Documents

Publication Publication Date Title
JPH0561667B2 (en)
JPS6083451A (en) Synchronous data buffering system
US5228129A (en) Synchronous communication interface for reducing the effect of data processor latency
US5305111A (en) Run length encoding method and system
US6868091B1 (en) Apparatus and method for depacketizing and aligning packetized input data
KR100194634B1 (en) Error detection and automatic recovery of read-write pointers on a first-in first-out
WO1996007254A1 (en) Receiver
JPS62141875A (en) Preventing system for propagation of decoding error
JPS6325737B2 (en)
JP2759984B2 (en) Signal transfer device
KR100200048B1 (en) System and method for automatically separating and processing mpeg-2 transmission stream and mpeg-1 system stream
JP2511697B2 (en) Data receiver
JP3355053B2 (en) Cyclic data transmission method for distributed processing system
JPS63228855A (en) Communication controller
JP2576526B2 (en) I / O signal monitoring circuit
JPS58111477A (en) Main scanning shrinking system
JPH0432922A (en) Interface control circuit
JPH0525216B2 (en)
JPH01248847A (en) Unfair node detecting circuit for token system network
JPH04127736A (en) Phase information transfer system
JPH08249257A (en) Serial data receiver
JPS6116356A (en) Signal information scanning system
JPH0744569B2 (en) Serial data receiving circuit
JPS6188632A (en) Data transmission control system
JPS6129242A (en) Communication control equipment