JPS5961366A - Replacing system of error line - Google Patents

Abstract

PURPOSE:To process expanding in high speed and to output easily a preceding line again at error, by executing the expansion of image data and the output of result in parallel at the same time. CONSTITUTION:An expanding processing section 1 analyzes a compressing data, outputs an expanding data, an error detecting signal and a line revision signal and controls a memory rotating control section 2. A memory status 4 displays the ineffectiveness/effectiveness of the contents of a line memory 3. The expansion processing and the output of result are executed in parallel at the same time and if an error is generated in the expansion, the preceding line is outputted again without stopping the expansion.

Description

[Detailed Description of the Invention] [Background of the Invention] The recent spread of OA has been remarkable, and it seems to include not only conventional code data (character and numerical data) but also voice and image data processing. It has become. In general, audio data and image data essentially have a large amount of data B'j, and are subjected to rough processing when stored in a file or transmitted (as data itself). When the data is retrieved from the file and used, the compressed data must be decompressed and restored on the receiving side of the transmission.

The present invention is particularly directed to the constituent means of a processing device that decompresses the image data.

[Prior art to the invention]

Facsimile is one of the most well-known methods for handling image data. (This is the facsimile and my sister? 4-speed digital facsimile, Group
HL facsimile) This facsimile is C.
Based on the 1J1 international standard based on the CITT recommendations, redundant codes for error detection such as 0, 1H3J, 1H3J, 1H3J, 1L', + CRC, and Harrity, which transmit the compressed data, are convenient. Errors in the data are detected at the time of initialization. In the Katsatsuki system,
When using the pressure i:Ij data from the facsimile mentioned above, the expansion is redundant, so the error ft4-out1. The following methods can be used to deal with such cases:

(1) If an error is detected/ζ, each process is terminated at that point and data with only one mark is discarded.

(2) Error and 4 rd lie / to own line lEj
Ji': Yes.

(3) Change the 1f position on the previous line which is now a rainbow.

The unexploded 114J is calculated by the component force formula of the %B 3 term above [h〇In the conventional 4. Input,
When an error is detected, the previous line is stored 6XJ.
I took a method of not transferring the area that is currently being expanded to the area that is currently being expanded.However, in this ~1 case, it takes a lot of time to process I-No, and the expansion process stalls during that time. I was having fun.

[zuf; clear σ' purpose]

In the present invention, the image take is expanded by applying a compression process to reduce the amount of data.
I” smell 1, memory 1 for elongation results of at least 3 trees withering
・Step 1, step 1) Display the invalidity of the contents of the storage means. Means, Iriyumi:,:To put in the red (C-Select at least three memory means-No means, and only when one or one Yang line has been extended without error, the corresponding pipe is 1: The second storage means which is placed as a pair with the storage means generates and decompresses at least three ijL samurai yo-1' in order to output the data to the outside. , and disable the second memory means () before placing it in pair with the memory hand 1 only when there is no error in the next line to be output until output T1 (,). The purpose is to eliminate the above 812 drawback by re-outputting the previous line without stopping the J-history processing, which is described above.

[Example of 6-mei] 1) Actual (with illustrations) JI! 4fu will be explained.

FIG. 1 is a schematic block diagram of the first example of the present invention, and the portion surrounded by double lines includes 1. Ru. Expansion processing unit 1 r/i pressure spoon 1 data ke analysis f'l'! 1t-
Outputs i-data, error detection information, and line update signals,
Memory rotation system 4dl) XB 2 flfij
Al Sur.

Memory status 4 displays the contents of h-line memory 3, respectively.

21st unit 1 is memory rotation control...included in 1 capital 2 7
'1, memory selection 9. Therefore, No. 5 ηβ is generated. L)CLI.

DCLO has redundant memory and recovery.
:, 1 memory Z is the withdrawal number. DOL I
, 1. +0LON: rJ1 This is Ren Selection Shinji, who shows me the memo that will be applied. This I14: &'ll' is 1° assuming a case where there are three line memories.

In the system clear state (d″0 (1″), if there is no error side 1l8, it is ANl) Kate 24 is μ”
(Since the line is updated, the EOL code (output i4-bow) in the compression data is given.
The counter 21 increments every time t/L
- The first cycle of the counter 21 of the previous cycle is loaded into the register 22. When the output 1) of the counter 21 becomes '11'(', the line is updated 11-;
The NAND gate 23 creates a bar (0) and the counter 211iBA manually loads ((11).Therefore, there is no error.
1 → o1 and 3 states are repeated, and when a -1° error detection signal is generated, the AND gate 24 becomes [ζ'i
f of UZ'+, even if the line update signal comes, counter 2
Step J1b of 1 is performed) 1. First, the value C of the register 22 becomes equal to the value of the counter 2I.

to λ3[',=,i is the memory selection circuit in the rotation system f1・11 section 2.
111 data (Din) is selected by Demarna Flexa 25 by IXJ, 0, 1 (-61:h, iL, 1) in line memories 31 to 33 of CL11. According to IIC, line memos 1/31 to 33 of the line memo 1/31 to 33 are referred to and processed by the multiplexer 26. Furthermore, DOLo, 1 causes the multiplexer 27 to select 1'J', 7'L. Any line memory／・＼
It is output as output data.

Note that the same DCLo, 1 is input to the demultiplexer 25 and the multi-7lexer 26, but the line memory selected i' is shifted by one. This 1. The selection mode of the multiplexer 26, 27 and the multiplexer 25,
11. 'l' I = + Table 1 Example 7J, -
No.

Table 1.0t↓ Memories that are not yet self-effective Figure 4 shows the state Iπ display memories 41 to 430 circuits of each line memory 31 to 33, and each state display memory Pi J
- It is composed of K-type FF, and one line can be expanded without error when IP: 'J and line history, tli it: issue appear.
D.C.Lo.

1 is decoded by the decoder 44 and Jl;
is set to the I1 valid state, and when the output of the previous line is completed without detecting any error in the next line to be output, the decoder 45 decodes and specifies the line (1) OLO,l that has been output. ) is reset to an invalid state. If there is only one error, it is pulled and held in an immobile state.

[Efficacy of invention;]

As described above, according to the present invention, the decompression process and the output of the result can be performed simultaneously in parallel using a single circuit, so that high-speed decompression processing is possible, and errors can be easily detected. The 1+ output of the previous line becomes T+JNhi.

[Brief explanation of drawings]

FIG. 1 is an analysis, schematic block diagram, and second embodiment of the first six embodiments of the present invention.
Figure titit memory i% selection instruction time Ill block diagram, 3rd
The figure is a block diagram of the memory u selection circuit, and FIG. 4 is a block l\1 of the memory status display circuit. In FIG. 1, ■ is an expansion processing unit, 2V↓memory low chitoi dowa, 1 part, 3 is a line memory, and 4c is a line memory status display memory. "-1 Representative Patent Attorney Matsuoka Hitoshi 4 Part 1 Noka 12

Claims (1)

[Claims] In a processing device that decompresses image data that has been compressed to reduce the amount of data, at least three extensions 1<, i, and a storage means for storing data, and each 6 There are 100,000,000 means of matching, a second 5 self-memory means that shows the unselfishness, a means of detecting 1 L Schiller included in the data during decompression processing, and a means of detecting the 1L Schiller included in the data during decompression processing. Yoshikumeta 21)
means for selecting at least three storage means for the product, and the second description 1. (one means means to set it to the valid side, 1J stage to return the three storage means in order to output the expanded lees to the outside M+5, and an error in the line to output to υ at output end 11. The second grade bl corresponding to 7'-J for the storage means only when there is no
4) Error line replacement, which takes on the responsibility of disabling the decompression means and resetting the decompression means, and stopping the decompression process when an error occurs in the decompression process; 4) re-outputting the previous line; method.