Encoding and decoding devices

Abstract: Encoding and decoding devices which are capable of increasing the encoding and decoding speed. In arithmetic encoding (prediction encoding), there is a possibility of encoding with high efficiency which is very close to the entropy of the information source, but the encoding and decoding time is generally longer than that in another encoding systems such as an MMR encoding system. For example, in a standard facsimile equipment, about 1.3 sec is required for encoding the picture information in an A4-size copy. In prediction encoding, a memory for storing the past reference symbols and the predicted values therefor is necessary for prediction. Since the memory capacity is generally large, a large-capacity RAM is used. The encoding time is therefore greatly dependent on the access speed of the RAM. In the present invention, a high-speed register for storing the predicted value for a special symbol pattern is provided separately from the RAM so that the predicted value of the special symbol pattern is read from this register, thereby enabling high-speed encoding.

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to encoding and decoding devices and, more particularly, to encoding and decoding devices which are used for a facsimile equipment so as to encode and decode picture information and the like. Description of the Related Art In encoding a Markov source such as picture information, a technique of predicting a symbol which has not been encoded on the basis of the value of an encoded symbol has recently been adopted. This is a technique of predicting the symbols which are the objects of the current encoding from the values of reference symbols which have already been encoded in the output symbol list of an information source, classifying the prediction error signals into several groups according to percentages of accurate prediction which correspond to the values of the reference symbols, and appropriately encoding the prediction error signals in the respective groups. Hereinunder, the generation of the prediction error signals will be referred to as "prediction conversion", the classification of the prediction error signals into several groups will be referred to as "integration", and the identification data of the group, namely, the index which indicates the percentage of accurate prediction will be referred to as "degree". The prediction error signals which are to be encoded will be referred to as "prediction error symbols". The values of the plurality of reference symbols will be referred to as "reference symbol pattern". As a method of prediction conversion and the selection of degree, an adaptive processing technique which copes with a local chance of the statistic nature of an information source is disclosed (Japanese Patent Application JP-A-2 305 225). As to the technique of encoding the prediction error symbols, a subtraction type arithmetic encoding method is disclosed in, for example, "An Overview of the Basic Principle of the Q-coder Adaptive-Binary Arithmetic Coder" (IBM Journal of Research and Development, Vol. 32, No. 6, Nov. 1988) and Japanese Patent Laid-Open No. JP-A-2-202267. This method is a kind of number line representation encoding method, in which a symbol list is mapped between 0.0 and 1.0 on a number line and the coordinates are encoded as sign words. The subtraction type arithmetic encoding method is characterized by the fact that when the number line is divided in accordance with the produced symbols so as to use the coordinates of the divisions as the sign words, the division of the number line is executed only by addition and subtraction. An example of a conventional process of prediction conversion, integration and encoding will be explained with reference to Fig. 25. In order to make the explanation easy to understand, it is here assumed that the information source is binary picture signals, that the reference symbols are the twelve pixels in the neighborhood of the encoding pixel in Fig. 26, Vol.32, and that the number of integrations (i.e, the number of groups) is sixteen. In other words, it is assumed that twelve pixels have already been encoded and a thirteenth pixel is ncw being encoded. In Fig. 25, reference symbols are selected and retrieved frcm the list of information source symbols 101 by a reference symbol generator 1. In this example, the encoded twelve information source symbols are output as a reference symbol pattern 102. A degree and predicted value memory 2 outputs the predicted value 104 and the degree 103 of the symbol which is the object of the current encoding operation (this symbol will be referred to as "the symbol being encoded" hereinunder) in accordance with the reference symbol pattern 102. A prediction converter 3 generates a prediction error symbol 105 on the basis of the value of the symbol being encoded and the predicted value 104. A region width table 4 converts the degree 103 into a region width signal 106 which determines the range allowed to the arithmetic code. An arithmetic coder 5 encodes the prediction error symbol 105 in accordance with the region width signal 106 and outputs a sign bit list 107. A degree and predicted value controller 6 controls the reading and updating operations of the degree and predicted value memory 2 on the basis of the prediction error symbol 105. Since the number of reference symbols is twelve, the degree and predicted value memory 2 requires 2 12 degree and predicted value table entries, as shown in Fig. 27. Since the number of groups for integration is 16, the degree takes a value of 1 to 16 in order to identify the group. It is here assumed that the higher the degree is, the higher is the percentage of accurate prediction. The operation of the conventional process shown in Fig. 25 will now be explained. When the information symbol 101 (picture signal) is produced from the information source (not shown), the reference symbol generator 1 stores the list of the symbol 101 and selects the signals of the latest twelve encoded pixels and outputs them as the reference symbol pattern 102, as shown in Fig. 26. The degree and predicted value memory 2 outputs the predicted value 104 and the degree 103 of the symbol being encoded from the table shown in Fig. 27 on the basis of the reference symbol pattern 102. The information on the degree 103 is converted into the region width signal 106 by the region width table 4 shown in Fig. 28. The prediction converter 3 obtains the exclusive OR of the symbol being encoded 101 in the information source symbol list and the predicted value 104, and generates the prediction error symbol 105. The prediction error symbol 105 is an MPS (More Probable Symbol) when the prediction is accurate, and an LPS (Less Probable Symbol) when the prediction is wrong. In this example, since the symbol being encoded is a binary picture signal and the MPS is set at "0" and the LPS at "1", an EX-OR gate is used for the prediction converter 3, so that "0" (MPS) is output when the prediction is accurate, and "1" (LPS) is output when the prediction is wrong. The arithmetic coder 5 maps the prediction error symbol 105 on the numerical line on the basis of the region width signal 106, thereby executing encoding. If an i-th symbol is represented by a i in the prediction error symbol list, and the mapping range (allotted region) of the LPS is represented by S (assigned fixed value by each order), the mapping range (effective region) A i of the symbol list and the coordinate C j of the lower bound thereof at the i-th point are updated as follows if the MPS region is taken below the mapping range (effective region) A i : When the symbol a i is an MPS, A i = A i-1 - S C i = C i-1 When the symbol a i is an LPS, A i = S C i = C i-1 + (A i-1 - S). When the effective region A i is not more than 1/2, A i is multiplied by an m-th power of 2 in order to enhance the accuracy. At this time, the overflow portion (the portion over the decimal point) of the coordinate C j is output as a sign bit list. The process of multiplying the effective region A i by an m-th power of 2 will hereinunder be referred to as "normalization". The normalization is represented as follows: Updated A i = A i * 2 m (1/2 < updated A i ≦ 1) Updated C i = C i * 2 m In arithmetic encoding, it is known that encoding is realized with high efficiency which is very close to the entropy of the information source by setting the mapping range (allotted region) S at the occurence probability (= prediction error probability) of the LPS. Arithmetic encoding is therefore enabled with high efficiency by the above-described processing if the S value is set in advance so as to be suitable for the percentage of accurate prediction, which corresponds to the degree. Fig. 28 shows an example of the correspondence of a degree to a region width. Each value in the table is obtained by multiplying the value in the above-described formula by 2 16 . The adaptive processing of prediction and integration will now be explained. The degree and predicted value controller 6 counts the number of consecutive MPS's and LPS's in the list of the prediction error symbols 105. It can be considered that if k MPS's have been detected, the prediction is more accurate, and that when l LPS's have been detected, the prediction has a strong possibility of being wrong. Therefore, the contents of the degree and predicted value memory 2 are updated in the following steps in the respective cases. The values k and l are set in the degree and predicted value controller 6 in advance in accordance with each degree. When l LPS's have been detected, it means that the prediction in the reference symbol pattern 102 is wrong. In this case, the degree and predicted value memory 2 subtracts 1 from the degree which corresponds to the reference symbol pattern 102 at that time. This operation is executed in order to adapt the degree and predicted value to the information source of the symbol which is the object of the current encoding operation by reducing the degree, which indicates the percentage of accurate prediction. When the degree is the lowest value and further subtraction is impossible, the predicted value is inverted. By this operation, the predicted value having an excessively low percentage of accurate prediction is updated. When k MPS's have been detected, it means that the prediction in the reference symbol pattern is accurate. In this case, the degree and predicted value memory 2 adds 1 to the degree which corresponds to the reference symbol pattern 102 at that time. This operation is executed in order to adapt the degree and predicted value to the information source of the symbol which is the object of the current encoding operation by increasing the degree, which indicates the percentage of accurate prediction. When the degree is the highest value, no addition is executed. According to this operation, it is possible to narrow the region width and suppress the amount of output from the arithmetic coder 5 by increasing the degree when the prediction is very accurate. In this way, the degree and the predicted value controller 6 updates the contents of the degree and predicted value memory 2 in accordance with the statistic nature of the information source, and the arithmetic encoding with a high encoding efficiency is realized. In this conventional device, a general-purpose RAM is essential in the degree and predicted value memory 2 because a large capacity (2 12 × 5 bits, in this example) is required. In arithmetic encoding based on a Markov model, the generation of the reference symbol pattern 102, the retrieval of the degree and predicted value memory 2 and the calculation of the region on the number line are executed for each symbol, as is clear from the above explanation. For example, in a standard facsimile equipment, since picture information is encoded at a resolution of 8 horizontal pixels/mm and 7.7 vertical lines/mm, about 1.3 seconds is required for encoding the picture information in an A4-size copy. That is, the processing speed of the conventional device based on a Markov model is much lower than that of an encoding or decoding device based on another coding system such as an MMR encoding system. SUMMARY OF THE INVENTION Accordingly, it is an object of the present invention to eliminate the above-described problems in the related art and to provide encoding and decoding devices equipped with a degree and predicted value memory which is capable of accessing predetermined specific reference symbol patterns at a high speed, thereby enabling a significant increase in processing speed. It is another object of the present invention to eliminate the above-described problems in the related art and provide encoding and decoding devices which are capable of retrieving the degree and predicted value table for a symbol which is to be the object of the next encoding operation in parallel with the calculation of the region on the number line for the symbol as the object of the current encoding operation, thereby further enabling a significant increase in processing speed. It is still another object of the present invention to eliminate the above-described problems in the related art and provide encoding and decoding device which are capable of batch processing of the calculation of the region on the number line when consecutive reference symbol patterns are specified, thereby significantly increasing the processing speed. To achieve this aim, there is provided an encoding device and a decoding device as defined in claims 1 and 10, respectively. The dependent claims relate to embodiments. The above and other objects, features and advantages of the present invention will become clear from the following description of the preferred embodiments thereof, taken in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram of the structure of an embodiment of an encoding device according to a first aspect of the present invention; Fig. 2 is a block diagram of the internal structure of an arithmetic coder in the encoding device shown in Fig. 1; Fig. 3 is a timing chart of an example of the operation of the encoding device shown in Fig. 1; Fig. 4 is a timing chart of another example of the operation of the encoding device shown in Fig. 1; Fig. 5 is a block diagram of the structure of an embodiment of a decoding device according to a second aspect of the present invention; Fig. 6 is a block diagram of the internal structure of an arithmetic decoder in the decoding device shown in Fig. 5; Fig. 7 is a timing chart of an example of the operation of the decoding device shown in Fig. 5; Fig. 8 is a timing chart of another example of the operation of the decoding device shown in Fig. 5; Fig. 9 is a block diagram of the structure of an embodiment of an encoding device according to a third aspect of the present invention; Fig. 10 is a block diagram of the internal structure of an arithmetic coder in the encoding device shown in Fig. 9; Fig. 11 is a timing chart of an example of the operation of the encoding device shown in Fig. 9; Fig. 12 is a block diagram of the structure of another embodiment of an encoding device according to the third aspect of the present invention; Fig. 13 is a block diagram of the structure of an embodiment of a decoding device according to a fourth aspect of the present invention; Fig. 14 is a block diagram of the internal structure of an arithmetic decoder in the decoding device shown in Fig. 13; Fig. 15 is a timing chart of an example of the operation of the decoding device shown in Fig. 13; Fig. 16 is a block diagram of the structure of another embodiment of a decoding device according to the fourth aspect of the present invention; Fig. 17 is a block diagram of the structure of an embodiment of an encoding device according to a fifth aspect of the present invention; Fig. 18 is a block diagram of the internal structure of an arithmetic coder in the encoding device shown in Fig. 17; Fig. 19 is a timing chart of an example of the operation of the encoding device shown in Fig. 17; Fig. 20 is a timing chart of another example of the operation of the encoding device shown in Fig. 17; Fig. 21 is a block diagram of the structure of an embodiment of a decoding device according to a sixth aspect of the present invention; Fig. 22 is a block diagram of the internal structure of an arithmetic decoder in the decoding device shown in Fig. 21; Fig. 23 is a timing chart of an example of the operation of the decoding device shown in Fig. 21; Fig. 24 is a timing chart of another example of the operation of the decoding device shown in Fig. 21; Fig. 25 is a block diagram of a conventional encoding device; Fig. 26 shows the positions of the reference symbols which are used for encoding by the encoding device shown in Fig. 25; Fig. 27 shows the contents of a degree and predicted value table in the encoding device shown in Fig. 25; and Fig. 28 shows the contents of a region width table in the encoding device shown in Fig. 25. DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiment 1 Fig. 1 shows an embodiment of an encoding device according to a first aspect of the present invention. The characteristic of the encoding device shown in Fig. 1 as compared with the conventional encoding device shown in Fig. 25 is that the former is provided with a detector 7 for detecting whether or not all the twelve pixels of the reference symbol pattern 102 shown in Fig. 26 are "0" (white pixels), a specific degree and predicted value register 8 for storing the degree and the predicted value when all the twelve pixels are "0", and a selector 9 for switching between the outputs of the degree and predicted value memory 2 and the outputs of the register 8, and the updating signal to the degree and predicted value memory 2 and the updating signal to the specific degree and predicted value register 8. Fig. 2 is a block diagram of the internal structure of the arithmetic coder 5. In Fig. 2, the effective region A i on the number line is stored in an A-register 5a and an MPS region width 117 is calculated by a subtracter 5b. A coordinate 118 of the lower bound is stored in a C-register 5c. The C-register value 119 in the case of an LPS is calculated by an adder 5d. A sign register 5e temporarily stores a carry output 120, which is an overflow (shift-out) signal of the C-register 5c, and executes a carrying operation at the time of updating the C-register 5c. When the contents of the sign bits stored in the sign register 5e are eight consecutive "1"s, the sign register 5e inserts "0" from below the last bit so that the influence of the subsequent carrying operations is limited to the inserted "0" or later bits (this processing will be referred to as "bit stuff processing" hereinunder). A timing controller 5f controls the operation of the arithmetic coder 5. The operation of this embodiment will now be explained. Figs. 3 and 4 are timing charts of examples of the operation of this embodiment. In order to make the explanation easy to understand, the case in which all the pixels of the reference symbol pattern 102 are "0" and the case in which not all the pixels of the reference symbol pattern 102 are "0" will be explained separately. In the case in which not all the pixels of the reference symbol pattern 102 are "0", as shown in Fig. 3, when a symbol being encoded is input to the encoding device as the information source symbol 101, the reference symbol pattern 102 of the twelve pixels which have already been processed by the reference symbol generator 1, as shown in Fig. 26, is output, and the detector 7 detects that not all the pixels are "0". The selector 9 receives the detection signal 111 from the detector 7 and outputs the predicted value 113 in the reference symbol pattern, which is read out of the degree and predicted value memory 2, to the prediction converter 3 and the degree 112 of the predicted value 113 to the region width table 4, respectively. In this embodiment, the access time of the degree and predicted value memory 2 is 200 nsec, which corresponds to two periods of a system clock of 10 MHz. The degree signal 112 is converted to the region width signal 106 shown in Fig. 28 by the region width table 4. The exclusive OR of a predicted value signal 113 and the current information source symbol 101 is calculated by the prediction converter 3, which is an EX-OR gate, and the prediction error symbol 105 is output. Thereafter, the effective region A i and the coordinate C i of the lower bound thereof are calculated and the degree and the predicted value of the degree and predicted value memory 2 are updated as follows. (1) When there is neither normalization nor update of the degree and the predicted value (when the symbol being encoded is #1 in Fig. 3), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period. (2) When there is normalization but there is no update of the degree and the predicted value (when the symbol being encoded is #2 in Fig. 3), the calculations of the effective region A i and the coordinate C i of the lower bound except normalization are executed in one system clock period and the normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). (3) When there is no normalization but there is update of the degree and the predicted value (when the symbol being encoded is #3 in Fig. 3), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period and thereafter the contents of the degree and predicted value memory 2 are updated in two system clock periods. (4) When there are both normalization and update of the degree and the predicted value (when the symbol being encoded is #4 in Fig. 3), after the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization are executed in one system clock period, normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). The update of the degree and the predicted value is executed in parallel with the normalization. The processing of the next symbol being encoded is executed after both the normalization and the update of the contents of the degree and predicted value memory 2 are finished. The calculations of the effective region A i and the coordinate C i of the lower boundary including the judgement of the prediction error signal (LPS or MPS) are controlled by the timing controller 5f of the arithmetic coder 5 on the basis of the prediction error symbol 105 and an MSB signal 116 output from the A-register 5a. The update of the contents of the degree and predicted value memory 2 is controlled by the degree and predicted value controller 6. In the sign register 5e, the carrying operation is executed in parallel with the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization. At the time of normalization, the carry output of the eighth and subsequent bits is output as a sign bit list 107 in accordance with the shifting operation of the internal register. When all the eight bits of the internal register are "1", a bit stuff signal 122 is supplied to the timing controller 5f. The timing controller 5f suspends a normalization shift clock 121 and shifts 1 bit (an LSB shift-in signal "0" is output) in the internal register in one system clock period. The operation in the case in which all the pixels of the reference symbol pattern 102 are "0" is shown in Fig. 4. In this case, the outputs of the degree and predicted value register 8 are selected by the selector 9 as the degree signal 112 in place of the outputs of the degree and predicted value memory 2. This processing is characteristic of this embodiment. Since it is only a delay (not more than 10 nsec) in the selector 9 that must be taken into consideration in this processing, a special cycle for reading the degree and the predicted value is obviated. In addition, one system clock cycle is enough for the update of the degree and the predicted value. In the above, the case in which all the pixels of the reference symbol pattern 102 are "0" and the case in which not all the pixels in the reference symbol pattern 102 are "0" are explained separately from each other, but both cases are included in the actual encoding of a picture signal. Therefore, the operation timing for the encoding device of this embodiment is a combination of the timings for the respective cases shown in Figs. 3 and 4. As is clear from the above explanation, the encoding processing time T is expressed by the following formula: T = 200 * Na + 100 * (Na + Nb) + 100 * Nc + 100 * a (nsec) wherein Na represents the number of symbols when not all the pixels in the reference symbol pattern is "0", Nb the number of symbols when all the pixels in the reference symbol pattern is "0", Nc the number of sign bits, and a the number of clocks required to be added when the updating processing is not finished by the end of the normalization processing, or the number of clocks required for the update of the degree and the predicted value when there is no normalization processing. The encoding processing time required for encoding the picture information in an A4-size copy in a standard facsimile equipment at a resolution of 8 horizontal pixels/mm and 7.7 vertical lines/mm will now be calculated. If it is assumed that the ratio of the case in which all the pixels of the reference symbol pattern is "0" is 2/3 and the compression ratio is 30, Na = 1728 * 2376 * (1/3) Nb = 1728 * 2376 * (2/3) Nc = 1728 * 2376 * (1/30). The encoding processing time T is about 0.7 sec. In this case, since the number of symbols required to update the degrees and the predicted values is between about 1/50 and 1/200 of all the symbols, the influence of a is negligible. In contrast, in a conventional encoding device, Na = 1728 * 2376 Nb = O Nc = 1728 * 2376 * (1/30). The encoding processing time T is about 1.25 sec. It will be understood that the encoding processing speed is greatly increased in the present invention. Embodiment 2 Fig. 5 is a block diagram of an embodiment of a decoding device according to a second aspect of the present invention. This embodiment is a decoding device for decoding a sign bit list encoded by the encoding device according to the first aspect of the present invention. In Fig. 5, an arithmetic decoder 10 reproduces the prediction error symbol 105 from the sign bit list 107 on the basis of the region width signal 106. A prediction inverter 11 reproduces the information source symbol 101 by the exclusive-OR operation of the prediction error symbol 105 and the predicted value 113. The other portions are the same as in the embodiment shown in Fig. 1. Fig. 6 is a block diagram of the internal structure of the arithmetic decoder. An A-register 10a stores the effective region A i on the number line. A subtracter 10b calculates the MPS region width 117 and a C-register 10c stores the coordinate of the lower bound thereof. A subtracter 10d calculates the C-register value 119 in the case of an LPS. A sign register 10e temporarily stores the sign bit list 107 and supplies the first zone bit signal of the 9-bit internal register to the C-register 10c in accordance with the normalization shift clock 121. When the 8 bits stored in the sign register 10e are eight consecutive "1"s, the sign register 10e inputs 1 bit from the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register, thereby eliminating the bit stuff signal inserted by the arithmetic coder 5 shown in Fig. 1. The operation of the arithmetic decoder 10 is controlled by a timing controller 10f. The operation of this embodiment will now be explained. An arithmetic code is decoded by the following operation. In the following, it is assumed that the relative coordinate, which is the content of the C-register 10c is C i and the region width of the LPS at the point of the i-th prediction error symbol a i is S. If C 1-1 < (A i-1 - S), a i is an MPS, and so A i and C i are updated as follows: A i = A i-1 - S C i = C i-1 . If C i - 1 ≧ (A i-1 - S), a i is an LPS, and A i and C i are updated as follows: A i = S C i = C i-1 + (A i-1 - S). When the effective region A i is not more than 1/2, A i is multiplied by an m-th power of 2 as a normalization operation in order to enhance the accuracy. At this time, a carry input signal 123 output from the sign register 10e is input to the C-register 10c from the last bit of C i . By this operation, A i and C i are updated as follows: Updated A i = A i * 2 m (1/2 < updated A i ≦ 1) Updated C i = C i * 2 m Figs. 7 and 8 are timing charts of examples of the operation of this embodiment. Fig. 7 shows a timing chart in the case in which all the pixels of the reference symbol pattern 102 are "0", and Fig. 9 a timing chart in the case in which not all the pixels of the reference symbol pattern 102 are "0". The generation of the reference symbol pattern 102 and the update of the degree and the predicted value are the same as in the embodiment shown in Fig. 1. In producing the prediction error symbol a i and calculating the effective region A i and the relative coordinate C i , C i-1 and (A i-1 - S) are first compared by the timing controller 10f so as to determine whether the symbol a i is an MPS or an LPS. On the basis of the result of the comparison, A i and C i are calculated and the results are stored in the A-register 10a and the C-register 10c, respectively. This series of processing is carried out in one system clock period. When the effective region A i is less than 1/2 as a result of the calculation, the normalizaticn processing is carried out in m clocks (when the normalization requires a multiplier of 2 m ), as described above. At this time, when the 8 bits stored in the sign register 10e are eight consecutive "1"s, the normalization shift clock 121 is suspended and the sign register 10e inputs 1 bit from the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register. The decoding processing time T is expressed by the following formula in the same way as the encoding processing time: T = 200 * Na + 100 * (Na + Nb) + 100 * Nc + 100 * a (nsec) Thus, a great increase in processing speed is also realized by this embodiment in comparison with a conventional decoding device. Although a special register is provided for the purpose of increasing the processing speed only in the case in which all the pixels of the reference symbol pattern 102 are "0" in this embodiment, a plurality of special registers may be further provided including a special register for the case in which all the pixels of the reference symbol pattern 102 are "1". Embodiment 3.1 Fig. 9 shows an embodiment of an encoding device according to a third aspect of the present invention. A characteristic of the encoding device shown in Fig. 9 as compared with the conventional encoding device shown in Fig. 25 is that the detector 7 monitors the reference symbol pattern 102 output from the reference symbol generator 1 and judges whether or not the reference symbol pattern for the symbol being encoded is coincident with the reference symbol pattern for the symbol which was the object of the preceding encoding operation. Another characteristic is that a degree and predicted value temporary register 8 for temporarily storing the degree 103 and the predicted value 104 output from the degree and predicted value memory 2 is provided. The degree and predicted value temporary register 8 also temporarily stores, if necessary, an updating signal 108 output from the degree and predicted value controller 6. The output signal of the degree and predicted value temporary register 8 is input to the region width table 4 and the prediction converter 3. Fig. 10 is a block diagram of the internal structure of the arithmetic coder 5. In Fig. 10, the A-register 5a stores the effective region A i on the number line, and the subtracter 5b calculates the MPS region width 117. The C-register 5c stores the coordinate 115 of the lower bound. The adder 5d calculates the C-register value 119 in the case of an LPS. The sign register 5e temporarily stores the carry output 120, which is an overflow (shift-out) signal of the C-register 5c, and executes a carrying operation at the time of updating the C-register 5c. When the contents of the sign bits stored in the sign register 5e are eight consecutive "1"s, the sign register 5e inserts "0" from below the last bit so that the influence of the subsequent carrying operation is limited to the inserted "0" or subsequent bits (this processing will be referred to as "bit stuff processing" hereinunder in the same way as in Embodiment 1). The timing controller 5f controls the operation of the arithmetic coder 5. The operation of this embodiment will now be explained. Fig. 11 is a timing chart of an example of the operation of this embodiment. When a symbol being encoded is input to the encoding device as the information source symbol 101, the reference symbol pattern 102 of the twelve pixels which have already been processed by the reference symbol generator 1, as shown in Fig. 26, is output. The degree and the predicted value in the reference symbol pattern are read out of the degree and predicted value memory 2 and stored in the degree and predicted value temporary register 8. The processing from the generation of the reference symbol pattern to the storage of the degree and the predicted value in the degree and predicted value temporary register 8 is carried out in 100 nsec, which corresponds to one period of a 10 MHz system clock. The degree signal 112 output from the degree and predicted value temporary register 8 is converted into the region width signal 106 shown in Fig. 28 by the region width table 4. The exclusive OR of the predicted value signal 113 output from the degree and predicted value temporary register 8 and the current information source symbol 101 is obtained by the prediction converter 3, which is an EX-OR gate, so that the prediction error symbol 105 is generated. Thereafter, the effective region A i and the coordinate C i of the lower bound are calculated and the degree and the predicted value are updated as follows. (1) When there is neither normalization nor update of the degree and the predicted value (when the symbol being encoded is #1 in Fig. 11), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period. (2) When there is normalization but there is no update of the degree and the predicted value (when the symbol being encoded is #2 in Fig. 11), the calculations of the effective region A i and the coordinate C i of the lower bound except normalization are executed in one system clock period and the normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). (3) When there is no normalization but there is update of the degree and the predicted value (when the symbol being encoded is #3 in Fig. 11), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period and thereafter the contents of the degree and predicted value memory 2 are updated in two system clock periods. (4) When there are both normalization and update of the degree and the predicted value (when the symbol being encoded is #4 in Fig. 11), after the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization executed in one system clock period, normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). The update of the degree and the predicted value is executed in parallel with the normalization. The processing of the next symbol being encoded is executed after both the normalization and the update of the contents of the degree and predicted value memory 2 are finished. The calculations of the effective region A i and the coordinate C i of the lower boundary including the judgement of the prediction error signal (LPS or MPS) are controlled by the timing controller 5f of the arithmetic coder 5 on the basis of the prediction error symbol 105 and the MSB signal 116 output from the A-register 5a. The update of the contents of the degree and predicted value memory 2 is controlled by the degree and predicted value controller 6. In the sign register 5e, the carrying operation is executed in parallel with the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization. At the time of normalization, the carry output of the eighth and subsequent bits is output as a sign bit list 107 in accordance with the shifting operation of the internal register. When all the 8 bits of the internal register are "1", a bit stuff signal 122 is supplied to the timing controller 5f. The timing controller 5f suspends a normalization shift clock 121 and shifts 1 bit (an LSB shift-in signal "0" is output) in the internal register in one system clock period. The operation of reading the degree and the predicted value from the degree and predicted value memory 2, and the calculations of the effective region A i and the coordinate C i of the lower bound are conventionally processed serially because there is a possibility of updating the degree and the predicted value thereafter. In contrast, in the present invention, since parallel processing of the calculations of the effective region A i and the coordinate C i of the lower bound for the symbol being encoded and the operation of reading the degree and the predicted value from the degree and predicted value memory 2 for the symbol which is the object of the next encoding operation is possible, a great increase in processing speed is achieved in comparison with a conventional encoding device. More specifically, the degree and predicted value temporary register 8 is newly provided in this embodiment. When the degree signal and the predicted value signal of the symbol being encoded are output from the degree and predicted value temporary register 8, the degree and the predicted value of the symbol which is the object of the next encoding operation are read out of the degree and predicted value memory 2 in one system clock period. The subsequent processing is executed as follows. (1) When there is neither normalization nor update of the degree and the predicted value (when the symbol being encoded is #1 in Fig. 11), after the calculations of the effective region A i and the coordinate C i of the lower boundary, the calculations of the region and the coordinate of the symbol which is the object of the next encoding operation are executed. (2) When there is normalization but there is no update of the degree and the predicted value (when the symbol being encoded is #2 in Fig. 11), after the end of normalization, the calculations of the effective region A i and the coordinate C i of the lower boundary of the symbol which is the object of the next encoding operation are executed. (3) When there is no normalization but there is update of the degree and the predicted value (when the symbol being encoded is #3 in Fig. 11), the contents of the degree and predicted value memory 2 are updated on the basis of an updating reference symbol pattern 190 for the symbol being encoded and the updating signal 108 output from the degree and predicted value controller 6. The updating reference symbol pattern 190 is generated by delaying the reference symbol pattern 102 by one symbol and is output from the detector 7. When the reference symbol pattern 102 (signal for the symbol which is the object of the next encoding operation) is coincident with the updating reference symbol pattern 190 for the symbol being encoded, the contents of the degree and predicted value temporary register 8 are updated on the basis of the detection signal 111. The update of the content is processed in one system clock period, and thereafter the calculations of the region and the coordinate of the symbol which is the object of the next encoding operation are executed. (4) When there are both normalization and update of the degree and the predicted value (when the symbol being encoded is #4 in Fig. 11), the degree and the predicted value are updated in the same way as in the case (3), Thereafter and, after the end of normalization, the calculations of the region and the coordinate except normalization are executed. As is clear from the above explanation, the encoding processing time T is expressed by the following formula: T = 100 + 100 * Na + 100 * Nc + 100 * a (nsec) wherein Na represents the number of symbols, Nc the number of sign bits, and a the number of clocks required for the update of the degree and the predicted value in the case (3). The encoding processing time required for encoding the picture information in an A4-size copy in a standard facsimile equipment at a resolution of 8 horizontal pixels/mm and 7.7 vertical lines/mm will now be calculated. If it is assumed that the compression ratio is 30, Na = 1728 * 2376 Nc = 1728 * 2376 * (1/30). The encoding processing time T is about 0.4 sec. In this case, since the number of symbols required to update the degrees and the predicted values is between about 1/50 and 1/200 of all the symbols, and the case (3) is limited to the case in which the result of prediction is an MPS and there is no normalization, the influence of a is negligible. In contrast, in a conventional encoding device, T = (100 + 100) * Na + 100 * Nc + 100 * a (nsec) When the encoding processing time T is calculated under the same conditions, T is about 0.8 sec. It will be understood that the encoding processing speed is greatly increased in the present invention. Embodiment 3.2 Fig. 12 shows another embodiment of an encoding device according to a third aspect of the present invention. A characteristic of this embodiment is that an updating degree and predicted value register 20 is provided. Another characteristic is that a selector 21 for choosing between the outputs of the degree and predicted value temporary register 8 for storing the signal read out of the degree and predicted value memory 2 and the outputs of the updating degree and predicted value register 20 is provided. In this embodiment, the degree and predicted value temporary register 8 stores only the signal read out of the degree and predicted value memory 2, and the updating degree and predicted value register 20 stores the degree and the predicted value after adaptive processing (the updated values when they are updated, and the output values of the selector 21 when they are not updated). If the detector 7 detects that the reference symbol pattern for the symbol being encoded is coincident with the reference symbol pattern for the symbol which was the object of the preceding encoding operation, the output of the updating degree and predicted value register 20 is selected by the selector 21 in accordance with the detection signal 111. On the other hand, when the reference symbol pattern for the symbol being encoded is different from the reference symbol pattern for the symbol which was the object of the preceding encoding operation, the output of the degree and predicted value temporary register 8 is selected, and the region width is calculated and the prediction is converted on the basis of this output. The other processing is the same as in the embodiment shown in Fig. 9. However, the detection signal 111 from the detector 7 is delayed by one symbol in comparison with the embodiment shown in Fig. 9. Embodiment 4.1 Fig. 13 is a block diagram of an embodiment of a decoding device according to a fourth aspect of the present invention. In Fig. 13, an arithmetic decoder 30 reproduces the prediction error symbol 105 from the sign bit list 107 on the basis of the region width signal 106. A prediction inverter 12, which is an EX-OR gate, reproduces the information source symbol 101 by the exclusive-OR operation of the prediction error symbol 105 and the predicted value 113. The degree and predicted value memory 2 inputs the reference symbol pattern of the eleven pixels other than the reference pixel A shown in Fig. 26, and outputs two pairs of degree and predicted value signals 103a, 104a and 103b, 104b for the pixel A in the state of "1" and the pixel A in the state of "0", respectively. The degree and predicted value temporary register 8 receives and stores two pairs of degrees and predicted values. A selector 13 selects either pair of degree and predicted value in accordance with the preceding information symbol 101 reproduced by the prediction inverter 12. When the selector 13 receives the updating signal 108 from the degree and predicted value controller 6, the selector 13 outputs either a first updating signal 108a or a second updating signal 108b for updating the signals 103a, 104a, or the signals 103b, 104b in the degree and predicted value memory 2 and the signals 112a, 113a or 112b, 113b in the degree and predicted value temporary register 8 in accordance with the reproduced information symbol 101, namely, depending upon whether the reference pixel A in Fig. 26 is "1" or "0". The other portions are the same as in the embodiment shown in Fig. 1. Fig. 14 is a block diagram of the internal structure of an arithmetic decoder 30. An A-register 30a stores the effective region A i on the number line. A subtracter 30b calculates the MPS region width 117 and a C-register 30c stores the coordinate of the lower bound thereof. A subtracter 30d calculates the C-register value 119 in the case of an LPS. A sign register 30e temporarily stores the sign bit list 107 and supplies the first zone bit signal of the 9-bit internal register to the C-register 30c in accordance with the normalization shift clock 121. When the 8 bits stored in the sign register 30e are eight consecutive "1"s, the sign register 30e inputs 1 bit from the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register, thereby eliminating the bit stuff signal inserted by the arithmetic coder 5 shown in Fig. 12. The operation of the arithmetic decoder 30 is controlled by a timing controller 30f. The operation of this embodiment will now be explained. An arithmetic code is decoded by the following operation. In the following, it is assumed that the relative coordinate, which is the content of the C-register 10c is C i and the region width of the LPS at the point of the i-th prediction error symbol a i is S. If C 1-1 < (A i-1 - S), a i is an MPS, and so A i and C i are updated as follows: A i = A i-1 - S C i = C i-1 . If C 1-1 ≧ (A i-1 - S), a i is an LPS, and A i and C i are updated as follows: A i = S C i = C i-1 + (A i-1 - S). When the effective region A i is not more than 1/2, A i is multiplied to an m-th power of 2 as a normalization operation in order to enhance the accuracy. At this time, the carry input signal 123 output from the sign register 10e is input to the C-register 30c from the last bit. By this operation, A i and C i are updated as follows: Updated A i = A i * 2 m (1/2 < updated A i ≦ 1) Updated C i = C i * 2 m Fig. 15 is a timing chart of an example of the operation of this embodiment. Two pairs of degree and predicted value signals 103a, 103b and 104a, 104b for the pixel A in the state of "1" and the pixel A in the state of "0", respectively, are read out of the degree and predicted value memory 2 on the basis of the reference symbol pattern of the eleven pixels other than the reference pixel A shown in Fig. 26, and are stored in the degree and predicted value temporary register 8. These processings are executed in one system clock period. Thereafter, either pair of degree and predicted value is selected in accordance with the value of A, which is the preceding information symbol 101 reproduced by the selector 13, and the information symbol for the symbol being decoded is produced and the degree of the predicted value are updated. In producing the prediction error symbol a i and calculating the effective region A i and the relative coordinate C i , C i-1 and (A i-1 - S) are first compared by the timing controller 30f so as to determine whether the symbol a i is an MPS or an LPS. On the basis of the result of the comparison, A i and C i are calculated as described above and the results are stored in the A-register 30a and the C-register 30c, respectively. This series of processing is carried out in one system clock period. When the effective region A i is less than 1/2 as a result of the calculation, the normalization processing is carried out in m clocks (when the normalization requires a multiplier of 2 m ), as described above. At this time, when the 8 bits stored in the sign register 30e are eight consecutive "1"s, the normalization shift clock 121 is suspended and the sign register 30e inputs 1 bit from the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register. If the update of the degree and the predicted value is necessary, the updating signal 108 is output from the degree and predicted value controller 6, and the first updating signal 108a or the second updating signal 108b which corresponds to the reference pixel A in the state of "1" or the reference pixel in the state of "0" is generated on the basis of the value of the preceding information source symbol reproduced by the selector 13, thereby updating the contents of the degree and predicted value memory 2. If the preceding reference symbol pattern 102 read out of the degree and predicted value memory is coincident with the updating reference symbol pattern 190, the contents of the degree and predicted value temporary register 8 are simultaneously updated. The updating processing is executed in one system clock period after the values are stored in the A-register 30a and the C-register 30c. The decoding processing time T is expressed by the following formula in the same way as the encoding processing time: T = 100 + 100 * Na + 100 * Nc + 100 * a (nsec) Thus, a great increase in the processing speed is also realized by this embodiment in comparison with a conventional decoding device. Embodiment 4.2 Fig. 16 shows another embodiment of a decoding device according to a fourth aspect of the present invention. This embodiment is different from the embodiment shown in Fig. 13 in that the updating degree and predicted value register 20 is provided separately from the degree and predicted value temporary register 8 for storing the signal read out of the degree and predicted value memory 2 and the selector 21 is added in the same way as the encoding device shown in Fig. 12. In the same way as in the embodiment shown in Fig. 12, the detection output 111 of the detector 7 is delayed by one symbol in comparison with the embodiment shown in Fig. 13. As described above, a method of controlling the update of the degree and the predicted value by counting the number of LPSs and MPSs is used in Embodiments 3 and 4, but a method of controlling the update only when normalization is executed, as disclosed in the IBM journal of research and development described above, may also be adopted, Embodiment 5 Fig. 17 shows an embodiment of an encoding device according to a fifth aspect of the present invention. A characteristic of the encoding device shown in Fig. 17 as compared with the conventional encoding device shown in Fig. 25 is that the former is provided with the detector 7 for monitoring the reference symbol patterns 102 so as to judge whether or not all the twelve pixels of the reference symbol patterns (in Fig. 26) both for the eight consecutive symbols which were the objects of the preceding encoding operations and for the symbol being encoded are "0" (white pixels). The encoding device of this embodiment is also provided with the specific degree and predicted value register 8 for storing the degree and the predicted value when all the twelve pixels (the reference symbol pattern 102) are "0". The encoding device is further provided with a first AND circuit 40 for obtaining the AND of the detection output 111 of the detector 7, an all-"0"-state degree signal 130, which indicates that the degree output from the specific degree and predicted value register 8 when all the twelve reference pixels are "0" is the maximum degree, namely, 16, and an all-"0"-state predicted value signal 131, which indicates that the predicted value when all the twelve reference pixels are "0" is "0". Fig. 18 is a block diagram of the internal structure of the arithmetic coder 5. In Fig. 18, the A-register 5a stores the effective region A i on the number line, and the subtracter 5b calculates the MPS region width 117. The C-register 5c stores the coordinate 115 of the lower bound. The adder 5d calculates the C-register value 119 in the case of an LPS. The sign register 5e temporarily stores the carry output 120, which is an overflow (shift-out) signal of the C-register 5c, and executes a carrying operation at the time of updating the C-register 5c. When the contents of the sign bits stored in the sign register 5e are eight consecutive "1"s, the sign register 5e inserts "0" from below the last bit so that the influence of the subsequent carrying operations is limited to the inserted "0" or subsequent bits (this processing will be referred to as "bit stuff processing" hereinunder in the same way as in Embodiment 1). The timing controller 5f controls the operation of the arithmetic coder 5. A region detector 5g detects that the A-register output exceeds 0 X 1000 + 0 X 008. A second AND circuit 5h calculates the AND of the output of the region detector 5g and a switching signal 140 output from the first AND circuit 40. A switch 5i multiplies the region width signal 106 by 8 when the output of the second AND circuit 5h is "1". This embodiment is different from a conventional device in that the elements 5g to 5i are added. The operation of this embodiment will now be explained. Figs. 19 and 20 are timing charts of examples of the operation of this embodiment. In order to make the explanation easy to understand, the case in which not all the reference symbol patterns 102 for the eight consecutive pixels which were the objects of the preceding encoding operations are "0" (this state will be called [all-"0" state] hereinunder) and the case in which all the reference symbol patterns 102 for the eight consecutive pixels which were the objects of the preceding encoding operation are "0" will be explained separately. In the all-"0" state, when a symbol being encoded is input to the encoding device as the information source symbol 101, the reference symbol patterns 102 each having the values of the 12 pixels which have already been processed by the reference symbol generator 1, as shown in Fig. 26, are output and the detector 7 detects that not all the reference symbol patterns for the eight consecutive symbols are "0". Therefore, "0" is output as the detection signal 111. Simultaneously with this, the degree and predicted value memory 2 outputs the degree signal 103 and the prediction value signal 104 in the reference symbol pattern for the symbol being encoded. In this embodiment, the reading operation of the degree and predicted value memory 2 is executed in 100 nsec, which corresponds to one period of a 10 MHz system clock. The degree signal 112 is converted to the region width signal 106 shown in Fig. 28 by the region width table 4. The prediction error symbol 105 is generated by the exclusive OR operation of the predicted value signal 104 and the current information source symbol 101 in the prediction converter 3, which is an EX-OR gate. Thereafter, the effective region A i and the coordinate C i of the lower bound thereof are calculated and the degree and the predicted value are updated as follows. (1) When there is neither normalization nor update of the degree and the predicted value (when the symbol being encoded is #1 in Fig. 19), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period. (2) When there is normalization but there is no update of the degree and the predicted value (when the symbol being encoded is #2 in Fig. 19), the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization are executed in one system clock period and the normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). (3) When there is no normalization but there is update of the degree and the predicted value (when the symbol being encoded is #3 in Fig. 19), the calculations of the effective region A i and the coordinate C i of the lower boundary are executed in one system clock period and thereafter the contents of the degree and predicted value memory 2 are updated in two system clock periods. (4) When there are both normalization and update of the degree and the predicted value (when the symbol being encoded is #4 in Fig. 19), after the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization are executed in one system clock period, normalization is executed in m clocks (when the normalization requires a multiplier of 2 m ). The update of the degree and the predicted value is executed in parallel with the normalization. The processing of the next symbol being encoded is executed after both the normalization and the update of the contents of the degree and predicted value memory 2 are finished. When the degree and the predicted value are updated in the all-"0" state, the contents of the degree and predicted value register 8 are also updated together with the contents of the degree and predicted value memory 2. The calculations of the effective region A i and the coordinate C i of the lower boundary including the judgement of the prediction error signal (LPS or MPS) are controlled by the timing controller 5f of the arithmetic coder 5 on the basis of the prediction error symbol 105 and the MSB signal 116 output from the A-register 5a. The update of the contents of the degree and predicted value memory 2 is controlled by the degree and predicted value controller 6. In the sign register 5e, the carrying operation is executed in parallel with the calculations of the effective region A i and the coordinate C i of the lower boundary except normalization. At the time of normalization, the carry output of the eighth and subsequent bits is output as a sign bit list 107 in accordance with the shifting operation of the internal register. When all the 8 bits of the internal register are "1", the bit stuff signal 122 is supplied to the timing controller 5f. The timing controller 5f suspends a normalization shift clock 121 and shifts 1 bit (an LSB shift-in signal "0" is output) into the internal register in one system clock period. In the case in which all the reference symbol patterns 102 for the eight consecutive symbols are "0", the first and second AND circuits 40 and 5h judge whether or not the arithmetic operation is executed as batch processing. The output 151 of the second AND circuit 5h is "1" when all the corresponding symbols being encoded are "0" (the detection signal 111 is "1"), the degree in the all-"0" state is 16 (the all-"0"-state degree signal 130 is "1"), and the predicted value in this state is "0" (the all-"0"-state predicted value signal 131 is "1"). If the output signal 151 of the second AND circuit 5h is "0", the above-described processing is executed in accordance with the timing chart shown in Fig. 19. When batch processing is executed, the region width signal 106 is multiplied by 8, and "0 X 0008" is supplied to the subtracter 5b as a subtraction input 152 for arithmetic operation. Since the preceding A-register output 116 exceeds 0 X 1008, the result of the arithmetic operation exceeds 0 X 1000, thereby obviating normalization processing. Since there is no update of the degree and the predicted value, the process proceeds to the encoding of the symbol which is the object of the next encoding operation, namely, the ninth pixel. This region operation requires only one system clock cycle in accordance with the timing chart shown in Fig. 20. In the above, the case in which all the consecutive reference symbol patterns 102 are "0" and the case in which not all the consecutive reference symbol patterns 102 are "0" are explained separately from each other, but both cases are included in the actual encoding of a picture signal. Therefore, the operation timing for the encoding device of this embodiment is a combination of the timings for the respective cases shown in Figs. 19 and 20. As is clear from the above explanation, the encoding processing time T is expressed by the following formula: T = 100(Na/8 + Nb) + 100 * (Na/8 + Nb) + 100 * Nc + 100 * a (nsec) wherein Na represents the number of symbols being encoded when batch processing is possible, (when all the reference symbol patterns for eight consecutive pixels being encoded are "0", the corresponding eight symbols being encoded are "0", the degree in the all-"0" state is 16, the predicted value in the all-"0" state is "0", and the effective region A i exceeds 0 X 1000 + 0 X 008), Nb the number of symbols in the other cases, Nc the number of sign bits, and a represents the number of clocks required for the update of the degree and the predicted value in the case (3). The encoding processing time required for encoding the picture information in an A4-size copy in a standard facsimile equipment at a resolution of 8 horizontal pixels/mm and 7.7 vertical lines/mm will now be calculated. If it is assumed that the ratio of the case which allows batch processing is 2/3 and the compression ratio is 30, Na = 1728 * 2376 * (2/3) Nb = 1728 * 2376 * (1/3) Nc = 1728 * 2376 * (1/30). The encoding processing time T is about 0.35 sec. In this case, since the symbols required to update the degrees and the predicted values is between about 1/50 and 1/200 of all the symbols, the influence of a is negligible. In contrast, in a conventional encoding device, Na = O Nb = 1728 * 2376 Nc = 1728 * 2376 * (1/30). The encoding processing time T is about 0.83 sec. It will be understood that the encoding processing speed is greatly increased in the present invention. Embodiment 6 Fig. 21 is a block diagram of an embodiment of a decoding device according to a sixth aspect of the present invention. This embodiment is a decoding device for decoding a sign bit list encoded by the encoding device provided in the fifth aspect of the present invention. In Fig. 21, the arithmetic decoder 10 reproduces the prediction error symbol 105 from the sign bit list 107 on the basis of the region width signal 106. The prediction inverter 11 reproduces the information source symbol 101 by the exclusive-OR operation of the prediction error symbol 105 and the predicted value 104. An information symbol switch (selector) 60 receives a batch processing judging signal 161 from the arithmetic decoder 10. In the case of ordinary processing, the information symbol switch 60 outputs the output of the prediction inverter 11 as it is, while in the case of batch processing, it outputs eight consecutive "0"s. The other portions are the same as in the embodiment shown in Fig. 17. Fig. 22 is a block diagram of the internal structure of the arithmetic decoder. The A-register 10a stores the effective region A i on the number line. The subtracter 10b calculates an MPS region width 117 and the C-register 10c stores the coordinate of the lower bound thereof. The subtracter 10d calculates the C-register value 119 in the case of an LPS. The sign register 10e temporarily stores the sign bit list 107 and supplies the first zone bit signal of the 9-bit internal register to the C-register 10c in accordance with a normalization shift clock 121. When the 8 bits stored in the sign register 10e are eight consecutive "1"s, the sign register 10e inputs 1 bit frcm the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register, thereby eliminating the bit stuff signal inserted by the arithmetic coder 5 shown in Fig. 17. The operation of the arithmetic decoder 10 is controlled by the timing controller 10f. A region detector 10g detects that the output of the A-register 10a exceeds 0 X 1000 + 0 X 008. A second AND circuit 10h calculates the AND of the output of the region detector 10g and the switching signal 140 output frcm the first AND circuit 40. A switch 10i multiplies the region width signal 106 by 8 when the output of the second AND circuit 10h is "1". The operation of this embodiment will now be explained. An arithmetic code is decoded by the following operation. In the following, it is assumed that the relative coordinate, which is the content of the C-register 10c is C i and the region width of the LPS at the point of the i-th prediction error symbol a i is S. If C 1-1 < (A i-1 - S), a i is an MPS, and so A i and C i are updated as follows: A i = A i-1 - S C i = C i-1 . If C 1 _ 1 ≧ (A i-1 - S), a i is an LPS, and A i and C i are updated as follows: A i = S C i = C i-1 + (A i-1 - S). When the effective region A i is not more than 1/2, A i is multiplied by an m-th power of 2 as normalization operation in order to enhance the accuracy. At this time, a carry input signal 170 output from the sign register 10e is input to the C-register 10c from the last digit bit. By this operation, A i and C i are updated as follows: Updated A i = A i * 2 m (1/2 updated A i ≦ 1) Updated C i = C i * 2 m Figs. 23 and 24 are timing charts of examples of the operation of this embodiment. Fig. 23 shows a timing for ordinary processing as that shown in Fig. 19, and Fig. 24 shows a timing for batch processing. The generation of the reference symbol pattern 102 and the update of the degree and the predicted value are the same as in the embodiment shown in Fig. 5. Ordinary processing will first be explained. In producing the prediction error symbol a i and calculating the effective region A i and the relative coordinate C i , C i-1 and (A i-1 - S) are first compared by the timing controller 10f so as to determine whether the symbol a i is an MPS or an LPS. On the basis of the result of the comparison, A i and C i are calculated and the results are stored in the A-register 10a and the C-register 10c, respectively. This series of processing is carried out in one system clock period. When the effective region A i is less than 1/2 as a result of the calculation, the normalization processing is carried out in m clocks (when the normalization requires a multiplier of 2 m ) as described above. At this time, when the 8 bits stored in the sign register 10e are eight consecutive "1"s, the normalization shift clock 121 is suspended and the sign register 10e inputs 1 bit from the sign bit list 107 so as to execute addition at the last bit of the internal 9-bit register. Batch processing will now be explained. Batch processing is executed when all the reference symbol patterns for eight consecutive pixels being decoded except a pixel which has not been reproduced are "0" (the detection signal 111 is "1"), the degree in the all-"0" state is 16 (the all-"0"-state degree signal 130 is "1"), the predicted value in this state is "0" (the all-"0"-state predicted value signal 131 is "1"), and the effective region A i exceeds 0 X 1000 + 0 X 008 (the output 192 of the region width detector 10g is "1"). In this case, the switch 10i uses "0 X 1000 " as a region width subtraction signal 172 in the same way as in Fig. 18, and arithmetic operation of the eight consecutive symbols being decoded is executed. This processing is carried out in one system clock period as in Fig. 19. As the information source symbols 101 which are reproduced, eight consecutive "0"s are output from the information symbol switch 60 irrespective of the output of the prediction inverter 11. The decoding processing time T is expressed by the following formula in the same way as the encoding processing time: T = 100(Na/8 + Nb) + 100 * (Na/8 + Nb) + 100 * Nc + 100 * a (nsec) T = 200 * Na + 100 * (Na + Nb) + 100 * Nc + 100 * a (nsec) Thus, a great increase in processing speed is also realized by this embodiment in comparison with a conventional decoding device. Although a special register is provided for the purpose of increasing the processing speed only in the case in which all the pixels of the reference symbol pattern 102 are "0" in this embodiment, a plurality of special registers may be further provided including a special register for the case in which all the pixels of the reference symbol pattern 102 are "1". In addition, batch processing is executed only when the degree is the maximum, namely, 16 in this embodiment, but similar batch processing may be executed when the degree is another value. For example, when the degree is 15, the criterion for judging the region width by the region detector 10g may be set at 0 X 1000 + 0 X 010 (that is, the region detector 10g judges whether or not the effective region A i exceeds 0 X 1000 + 0 X 010). In this embodiment, the degree and the predicted value in a specific symbol pattern are also read out of the degree and predicted value memory 2, but it is also preferable to provide a selector for switching the degree and the predicted value so that when all the pixels of the reference pattern are "0", neither reading nor updating of the degree and the predicted value is executed, as in Embodiment 1. Furthermore, although a method of updating the degree and the predicted value on the basis of the numbers of LPSs and MPSs is used in this embodiment, a method of updating them according to whether the symbol at the point of time when normalization is necessary is an MPS or an LPS, as disclosed in the IBM journal of research and development described above, may also be adopted, As described above, the encoding and decoding devices provided in the first and second aspects, respectively, of the present invention comprise a degree and predicted value memory for storing the predicted value and the degree of a symbol being encoded or decoded in correspondence with the reference symbol pattern therefor, a detector for detecting that the reference symbol pattern is a specific pattern, a specific degree and predicted value register for storing the predicted value and the degree of the specific pattern, and a selector for selecting either the degree and predicted value memory or the specific degree and predicted value register. Since these devices use not the degree and predicted value memory but the specific degree and predicted value register having a higher access speed as a degree and predicted value table, the encoding and decoding speed is greatly increased. The encoding and decoding devices provided in the third and fourth aspects, respectively, of the present invention comprise a degree and predicted value temporary register for storing the predicted value and the degree of the symbol being encoded or decoded which are read out of the degree and predicted value memory, and, if necessary, storing the updated predicted value and degree of the symbol which was the object of the preceding encoding or decoding operation, and a detector for judging whether or not the value of reference symbol for the symbol being encoded is coincident with the reference symbols for the symbol which was the object of the preceding encoding operation. Since the retrieval of the degree and predicted value table for the symbol which is the object of the next encoding or decoding operation is carried out in parallel with the calculations of the region on the number line for the symbol being the symbol being encoded or decoded, the encoding and decoding speed is greatly increased. The encoding and decoding devices provided in the fifth and sixth aspects, respectively, of the present invention comprise a degree and predicted value memory for sorting the predicted value and the degree of a symbol being encoded or decoded in correspondence with a reference symbol pattern, and a detector for detecting that a specific reference pattern is consecutive. Since batch processing of a plurality of symbols being encoded or decoded is executed when the specific reference symbol pattern is consecutive, the encoding and decoding speed is greatly increased.

Claims: An encoding device for encoding symbols in an output symbol stream which is output from an information source by predicting a value for each symbol to be encoded from values of a plurality of reference symbols which have already been encoded in an output symbol stream of the information source and are arranged at predetermined positions in said output symbol stream resulting in a predicted value according to a predicted value table, and by encoding a prediction error signal which indicates a difference between said predicted value and an actual value of the symbol to be encoded, said encoding device comprising (a) a degree and predicted value memory (2) for storing the value of said symbol being encoded which is predicted from the values of said plurality of reference symbols, and a degree value which is used for classifying the prediction error signals into several groups according to the percentage of accurate predictions which correspond to the values of the reference symbols and, hence, which is an indicator of said percentage of accurate predictions, and for outputting the degree and predicted value of the symbol being encoded; (b) a prediction converter (3) for outputting the prediction error signal which indicates the difference between the predicted value and the actual value of the symbol being encoded; and (c) an arithmetic encoder (5) for encoding said prediction error signal and outputting a code bit stream by mapping the prediction error signal onto a numerical value on the basis of a region width signal derived from said degree and defining the numerical range allowed to said code; characterized in that (d) a specific pattern detector (7) is provided for comparing the values of said plurality of reference symbols with a specific pattern or one of a number of such specific patterns of symbols; (e) at least one specific degree and predicted value register (8) is provided for storing and outputting a specific degree and predicted value; (f) the predicted value and degree are output from the specific degree and predicted value register (8) depending on the result of said comparison; and (g) the prediction converter (3) outputs the prediction error signal which indicates the difference between the predicted value and the actual value of the symbol being encoded, and the arithmethic coder (5) encodes said prediction error signal and outputs the code bit stream by mapping the prediction error signal onto a numerical value on the basis of the output predicted value and on the basis of the region width signal derived from the output degree. An encoding device according to claim 1, characterized in that the specific pattern detector (7) detects whether the values of said plurality of reference symbols coincide with a predetermined specific pattern or one of a number of such specific patterns. An encoding device according to claim 1 or 2, characterized in that the specific degree and predicted value register (8) and/or the degree and predicted value memory are reloadable; and a degree and predicted value controller (6) is provided for detecting whether or not said actual value of the symbol being encoded is coincident with said predicted value, and updating in said degree and predicted value memory (2) and/or in said degree and predicted value register (8) said predicted value and said degree which correspond to the values of said plurality of reference symbols in accordance with the result of said detection. An encoding device according to one of claims 1 to 3, characterized in that a selector (9) is provided for choosing between the content of said degree and predicted value memory (2) and the content of said specific degree and predicted value register (8) to be output in accordance with the detection signal output from said detector, such that when a specific pattern is not detected, the selector (9) chooses a content of the degree and predicted value memory (2) to be output and when a specific pattern is detected, the selector (9) chooses an content of the specific degree and predicted value register (8) to be output. An encoding device according to claim 3, characterized in that the degree and predicted value memory (2) outputs said predicted value and said degree of said symbol being encoded to the degree and predicted value register (8); the degree and predicted value register (8) is reloadable and stores said predicted value and said degree of said symbol being encoded which are output by said degree and predicted value memory (2); and the detector detects whether or not the values of said plurality of reference symbols for said symbol being encoded are coincident with the values of said plurality of reference symbols for said symbol which has been encoded in the preceding encoding operation and outputs a detection output signal; and the contents of said degree and predicted value register (8) is output if the detection output signal corresponds to non-coincidence or updated, be-fore being output, with said predicted value and said degree of said symbol which has been encoded in the preceding encoding operation if the detection output signal corresponds to coincidence, said predicted value and said degree being updated by said degree and predicted value controller (6). An encoding device according to claim 3 characterized in that the degree and predicted value memory (2) outputs said predicted value and said degree of said symbol being encoded to the degree and predicted value register (8), which is reloadable; the degree and predicted value register (8) stores said predicted value and said degree of said symbol being encoded which are output by said degree and predicted value memory (2); and the detector detects whether or not the values of said plurality of reference symbols for said symbol being encoded are coincident with the values of said plurality of reference symbols for said symbol which has been encoded in the preceding encoding operation and outputs a detection output signal; the contents of said degree and predicted value register (8) is output if the detection output signal corresponds to non-coincidence; and an updating degree and predicted value register (20) is provided which stores the updated degree and predicted value corresponding to the symbol which has been encoded in the preceding operation and outputs the updated degree and predicted value if the detection output signal corresponds to coincidence. An encoding device according to claim 6 characterized in that a selector (21) is provided for choosing between the content of said degree and predicted value register (8) and the content of said updating degree and predicted value register (20) to be output in accordance with the detection signal output from said detector, such that when the detection signal corresponds to coincidence the selector (21) chooses the content of the updating degree and predicted value register (8) to be output and when the detection signal corresponds to non-coincidence, the selector (21) chooses the content of the degree and predicted value register (8) to be output. An encoding device according to one of claims 1 to 3 characterized in that the detector (7) detects whether all the reference symbols patterns for a plurality of consecutive symbols previously encoded and the reference symbol pattern of the symbol being encoded are coincident with the specific pattern and outputs a detection signal (111); and the specific degree and predicted value register (8) stores the degree and predicted value register corresponding to the specific pattern and output a degree signal and a predicted value signal if the detection signal (111) indicates coincidence. An encoding device according to claim 8 characterized in that the specific pattern comprises only "O"-state symbols; the specific degree and predicted value register (8) outputs an all-"0"-state-degree signal (130) as degree signal and an all-"0"-state-predicted value signal (131) as predicted value signal; and an "And"-circuit ist provided for obtaining the "AND" of the detection signal (111), the all-"0"-state-degree signal (130) and the all-"0"-state predicted value signal (131) and outputting a signal (140) to the arithmetic coder (5) to initiate batch processing of the prediction error signals according to the result of the "AND"-operation. A decoding device for decoding a code bit stream obtained by encoding symbols in an output symbol stream which is output from an information source by predicting a value for each symbol to be encoded from values of a plurality of reference symbols which have already been decoded in an output symbol stream of the information source and are arranged at predetermined positions in said output symbol stream resulting in a predicted value according to a predicted value table, and by encoding a prediction error signal and an actual value of the symbol to be encoded, said decoding device comprising: (a) a degree and predicted value memory (2) for storing and outputting the value of said symbol being decoded which is predicted from the values of said plurality of reference symbols and a degree value which is used for classifying the prediction error signals into several groups according to the percentage of accurate predictions which correspond to the values of the reference symbols and, hence, which is an indicator of said percentage of accurate predictions; (b) an arithmetic decoder (10) for decoding a code bit stream on the basis of a region width signal derived from the degree and defining the numerical range allowed to said code and for outputting the prediction error signal; and (c) a prediction inverter (11) for converting the prediction error signal output from the arithmetic decoder (10) into the output symbol list which is output from the information source on the basis of the information on the predicted value; characterized in that (d) a detector (7) is provided for comparing the values of said plurality of reference symbols for said symbol being decoded with a specific pattern or one of a number of such specific patterns of symbols; (e) a specific degree and predicted value register (8) is provided for storing and outputting a specific predicted value and degree; (f) the predicted value and degree are output from the specific degree and predicted value register (8) depending on the result of said comparison; and (g) the arithmetic decoder (10) decodes the code bit stream on the basis of said region width signal derived from the output degree and outputs the prediction error signal and the prediction inverter (11) converts the prediction error signal into the output symbol stream on the basis of the output predicted value. A decoding device according to claim 10 characterized in that the specific pattern detector (7) detects whether the values of said plurality of reference symbols coincide with a predetermined specific pattern or one of a number of such specific patterns. A decoding device according to one of claims 10 or 11 characterized in that the specific degree and predicted value register (8) and/or the degree and predicted value memory (2) are reloadable and a degree and predicted value controller (6) is provided for detecting whether or not said actual value of the symbol being decoded is coincident with said predicted value, and updating in said degree and predicted value memory (2) and/or in said specific degree and predicted value register (8) said predicted value and said degree which correspond to the values of said plurality of reference symbols in accordance with the result of said detection. A decoding device according to one of claims 10 to 12, characterized in that a selector (9) is provided for choosing between the content of said degree and predicted value memory (2) and the content of said special degree and predicted value register (8) to be output in accordance with the detection signal output from said detector, such that when a specific pattern is not detected, the selector (9) chooses a content of the degree and predicted value memory (2) to be output and when a specific pattern is detected, the selector (9) chooses a content of the specific degree and predicted value register (8) to be output. A decoding device according to claim 12, characterized in that the degree and predicted value memory (2) outputs said predicted value and said degree of said symbol being decoded to the degree and predicted value register (8); the degree and predicted value register (8) is reloadable and stores said predicted value and said degree of said symbol being decoded which are output by said degree and predicted value memory (2); the detector detects whether or not the values of said plurality of reference symbols for said symbol being encoded are coincident with the values of said plurality of reference symbols for said symbol which has been decoded in the preceding encoding operation and outputs a detection output signal; and the contents of said degree and predicted value register (8) is output if the detection output signal corresponds to non-coincidence or updated, before being output, with said predicted value and said degree of said symbol which has been decoded in the preceding decoding operation if the detection output signal corresponds to coincidence, said predicted value and said degree being updated by said degree and predicted value controller (6). A decoding device according to claim 12 characterized in that the degree and predicted value memory (2) outputs said predicted value and said degree of said symbol being decoded to the degree and predicted value register (8), which is reloadable; the degree and predicted value register (8) is reloadable and stores said predicted value and said degree of said symbol being decoded which are output by said degree and predicted value memory (2); and the detector detects whether or not the values of said plurality of reference symbols for said symbol being decoded are coincident with the values of said plurality of reference symbols for said symbol which has been decoded in the preceding decoding operation and outputs a detection output signal; the contents of said degree and predicted value register (8) is output if the detection output signal corresponds to non-coincidence; and an updating degree and predicted value register (20) is provided which stores the updated degree and predicted value corresponding to the symbol which has been decoded in the preceding operation and outputs the updated degree and predicted value if the detection output signal corresponds to coincidence. A decoding device according to claim 15 characterized in that a selector (21) is provided for choosing between the content of said degree and predicted value register (8) and the content of said updating degree and predicted value register (20) to be output in accordance with the detection signal output from said detector, such that when the detection signal corresponds to coincidence the selector (21) chooses the content of the updating degree and predicted value register (8) to be output and when the detection signal corresponds to non-coincidence, the selector (21) chooses the content of the degree and predicted value register (8) to be output. A decoding device according to one of claims 10 to 12 characterized in that the detector (7) detects whether all the reference symbols patterns for a plurality of consecutive symbols previously decoded and the reference symbol pattern of the symbol being decoded are coincident with the specific pattern and outputs a detection signal (111); and the specific degree and predicted value register (8) stores the degree and predicted value register corresponding to the specific pattern and outputs a degree signal and a predicted value signal if the detection signal (111) indicates coincidence. A decoding device according to claim 17 characterized in that the specific pattern comprises only "0"-state symbols; the specific degree and predicted value register (8) outputs an all-"0"-state-degree signal (130) as degree signal and an all-"0"-state-predicted value signal (131) as predicted value signal; and an "And"-circuit ist provided for obtaining the "AND" of the detection signal (111), the all-"0"-state-degree signal (130) and the all-"0"-state predicted value signal (131) and outputting a signal (140) to the arithmetic coder (5) to initiate batch processing of the prediction error signals according to the result of the "AND"-operation.

Inventors: KAWAHATA YUKIYASU, KIMURA TOMOHIRO, MATSUMOTO MAKOTO, ONO FUMITAKA, SEMASA TAKAYOSHI, KAWAHATA, YUKIYASU, KIMURA, TOMOHIRO, MATSUMOTO, MAKOTO, ONO, FUMITAKA, SEMASA, TAKAYOSHI, Kawahata, Yukiyasu, c/o Mitsubishi Denki K.K., Kimura, Tomohiro, c/o Mitsubishi Denki K.K., Matsumoto, Makoto, c/o Mitsubishi Denki K.K., Ono, Fumitaka, c/o Mitsubishi Denki K.K., SEMASA, TAKAYOSHI, C/O MITSUBISHI DENKI K.K.
Applicants: MITSUBISHI ELECTRIC CORP, MITSUBISHI DENKI KABUSHIKI KAISHA
Application year: 1992
Main classification: H04N1
IPC codes: G06T9, H04N1, H03M7