Gradation converting circuit employing lookup table

Abstract: A gradation converting circuit comprises: LUTs for converting an input data represented by an integer of m bits to an output value including a decimal part represented by n bits larger than m bits, the output value represented by n bits brought near to a basic data which is a prescribed gradation converted output; a comparator for comparing the decimal part represented by (n - m) bits with a variable data represented by (n - m) bits; and an adder adding 1 to the integer value represented by m bits out of n bit output data based on the result of comparison in the comparator. When an input data of m bits is inputted to the gradation converting circuit, an m bit output data is provided, the expected value of the output data being in coincidence with a prescribed basic data.

Description: The present invention relates to a gradation converting circuit comprising a lookup table, which lookup table stores corrected gradation data. Description of prior art A gradation converting method employing a lookup table is already disclosed in the European patent application EP-A- 0 163 903, which has, however, the disadvantage that only images can be obtained with sufficient shading gradation, if the number of gradation of the output value is at least equal to the number of gradation of the basic data. This leads to an inability of the method to reproduce delicate differences in gradation, especially in a tone jump in reproduced images. Further, in the UK patent application GB 2 167 918 A, an apparatus for producing halftone dot film of graded density distribution is described. The technique disclosed here, however, obtains corrected image data by adding a signal to change the gradation to an original data in order to change gradation of the image by steps (continuously). This fails to teach anything about the constituting elements of a gradation converting circuit comprising a lookup table. This reference has the same drawbacks as will be discussed in the following with regard to the state of the art as incorporated by the circuit of Fig. 3B. Another document to be named is the French patent publication FR-A 2 514 531, in which a method for correcting gradation of an image signal for gradation conversion by using a lookup table is disclosed. As in the above mentioned document, only a lookup table is disclosed, but not the characterizing components of a gradation converting circuit in which the number of bits of pixel signals shall not be increased. Finally, the UK patent application GB 2 152 324 A has to be named, in which an image processing device is disclosed where an image signal processing apparatus converts an image signal to a multi value. In this reference, one dither pattern is selectively pending on the image quality of a dither memory storing a plurality of dither patterns and an image signal is output by comparing the selecting dither pattern to the input signal. As above, this document teaches not how to prevent the number of bits from increasing. Fig. 1 depicts the relation between density range of an original and the density range of a printed matter. Color films, which occupy most of color originals, have a density range of 2.4 to 3.5. However, the density range in printed reproductions of originals is about 1.8 to 2.0. Therefore, the density range of printed matter must be compressed with respect of the original thereof. In Fig. 1, the line A is a density curve of a case where the entire range is simply compressed. In this case, the printed matter is faint in general. Therefore, the highlight to intermediate density range including important objects should not be so much compressed as the shadow portion. The example of that case is shown by the curve B. The reproduction of an image wherein the degree of compression is changed partially is referred to as tone correction, and a circuit for carrying out the tone correction is called a gradation converting circuit. A gradation converting circuit (also referred to as a gradation circuit, density range correction circuit) as described above is indispensable to scanners, a common image input apparatuses or to an image processing apparatuses. Generally, the gradation converting circuit provides an output data y = f (x) using a function f having a desired conversion characteristics in association with an input data x. The gradation converting circuit comprises both analog gradation converting circuits and digital gradation converting circuits. The input data x and the output data y are related to density (or reflectance, transmittance, brightness and so on). An analog circuit is disadvantageous in that arbitrary functional characteristics cannot be obtained, and in that the circuit becomes unstable due to resistance fluctuations caused by temperature variations. A digital circuit can supply output data from a memory to produce an arbitrary function in response to input data applied to the address lines of the memory, producing a so-called lookup table (LUT). When a LUT is used, the speed of processing of the gradation conversion is determined by the access time of the memory, allowing the speed to be increased while maintaining stability, eliminating the problems of the analog circuit. The aforesaid memory may be an RAM (random access memory) or an ROM (read only memory). In case of an RAM, the functional characteristics that is the output produced by the RAM can be easily changed, e.g. by programming the contents of the RAM. However, in a digital gradation converting circuit which employs a lookup table, is susceptible of producing quantization errors. This is not a problem in an analog circuit. More specifically, in the above described and similar gradation converting circuits, the non-linear characteristics of the gradation curve is formed by means of the lookup table, so that errors in quantization are generated in the output data. In order to briefly explain the above described problem, a simple example will be described with reference to Fig. 2 in which each of the input and output data are respectively constituted of 4 bits. In the field of photolithography and the like requiring high precision, the lookup table is usually formed with 8 bits. The larger the number of bits, the smoother becomes the gradation curve. Referring to Fig. 2, the input/output converting characteristic of the basic data of the outputs to the inputs x is represented by a smooth curve A. However, the actual characteristic has a 1 bit uncertainty producing the stepwise varying output denoted by the line B, as a result of the digital nature of the circuit. For example, for x = 6, the curve A in Fig. 1 yield an output of 9.75. However, in digital system, the actual value will be y = 10, the basic data being rounded off. Obtaining such a stepwise line B is disadvantageous in tone reproduction applications. In Fig. 2, when the input data x changes from 0 to 1, the output data y rapidly changes from 0 to 3. When x changes from 1 to 2, y changes from 3 to 5. Consequently, in the displayed image and undesired phenomenon called tone jump or false contour line is generated in which the gradation changes abruptly. In contrast to the foregoing, when x changes from 8 to 9, y remains at 12. Similarly, y is not changed when x changes from 11 to 12. At these portions of the curve, delicate differences of gradation cannot be reproduced. In order to solve the problem, the number of bits of the data x and y should be increased to minimize errors. However, if the number of bits is increased, the circuit becomes complicated and the cost thereof is increased. Therefore, increasing the bit number is impractical. Therefore, in order to reduce the errors in quantization, a method has been proposed in which random numbers (noise) are mixed with the data to minimize the influence of errors in quantization as shown in Figs. 3A and 3B. In Fig. 3A, a random number, outputted at random from a random number generating circuit 21, is added to the input data x by an adder 22. The added data designates an address in the lookup table LUT, and an output data y is outputted in correspondence with the designated address. In Fig. 3B, an address for the lookup table LUT is designated by an input data x and a random number data outputted at random from the random number generating circuit 21 is added to the data outputted from the lookup table LUT by the adder 22, with the result of the addition outputted as the output data y. In the above described methods, noise numbers are directly mixed with the signals. Therefore, as the random numbers of larger bits are added to reduce the tone jump or false contour line, excessive noise is introduced, and the image quality suffers. SUMMARY OF THE INVENTION Therefore, one object of the present invention is to provide a digital gradation converting circuit by which the tone jump is reduced without increasing the number of bits of pixel signals. The above described objects of the present invention can be attained by the features of invention as described in the main claim. Since the gradation converting circuit comprises these components, when there are a number of output data provided for the same input data, the gradation of the collection of these output data will be intermediate gradation when viewed macroscopically, which cannot be represented by a prescribed number of bits. Consequently, a digital type gradation converting circuit can be provided in which tone jumps can be reduced without increasing the number of bits of pixel signals. According to a preferred embodiment of the present invention, the output value preparing means comprises a LUT for outputting the output value in correspondence with the input data; the basic data is represented by a sum of a prescribed integer value and a prescribed decimal value; the output value of the LUT is represented by a third plurality of bits larger than the first plurality of bits; the output value represented by the third plurality of bits is brought near to the basic data, and it comprises the first prescribed integer value represented by the first plurality of bits, and a decimal value represented by a fourth plurality of bits which is represented by a difference between the first plurality of bits and the third plurality of bits. Since the gradation converting circuit comprises the above described components, a value approximate to the expected value is provided by an arbitrary plurality of bits. Therefore, a gradation converting circuit can be provided in which portions of a highly precise intermediate gradation can be formed even if a prescribed number of output bits is small, by appropriately selecting the bit number. According to another preferred embodiment of the present invention, the output value adjusting means comprises variable data generating means for generating a variable data represented by the fourth plurality of bits, and comparing means for comparing the variable data with a decimal value represented by the fourth plurality of bits to output the result of comparison; and the output value selecting means comprises adding means responsive to the result of comparison for adding the prescribed second integer value to the prescribed first integer value. Since the gradation converting circuit employing an LUT comprises the above described components, a random number generating circuit or the like is not used for forming the portion of intermediate gradation. Therefore, a digital type gradation converting circuit can be provided in which there is no influence caused by the merger of noise. According to a more preferred embodiment of the present invention, a plurality of LUTs are prepared; the output value in respective LUTs comprises a first value and a second value represented by the second plurality of bits; the output value preparing means comprises a plurality of LUTs; and the output value adjusting means comprises basic data approximation means for bringing, when one LUT is selected from the plurality of LUTs, the expected value of the output values outputted from the selected LUT near to the basic data. Since the gradation converting circuit comprises the above described components, a gradation converting circuit can be provided in which portions of intermediate gradation can be easily formed without preparing a complicated circuit. According to a more preferred embodiment of the present invention, the output value selecting means comprises random number generating means for generating random numbers, and the output value selecting means selects a single LUT out of the plurality of LUTs based on the random number. Since the gradation converting circuit comprises the above described component, output data can be obtained at random. Therefore, a gradation converting circuit can be provided in which appropriate intermediate gradation portions can be formed. These objects and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a graph showing a relationship between an original density and a print reproduction density, as an example of gradation conversion; Fig. 2 is a graph showing a relation between a gradation curve which is the base for forming a lookup table and the digitized data thereof; Figs. 3A and 3B are block diagrams showing conventional methods for minimizing quantization errors; Figs. 4A and 4B illustrate effects of the present invention; Fig. 5 is a block diagram of a gradation converting circuit employing an LUT in accordance with a first embodiment of the present invention; Fig. 6 is a schematic block diagram of a color scanner to which the gradation converting circuit of the present invention is applied. DESCRIPTION OF THE PREFERRED EMBODIMENTS 1. First Embodiment (1) Principle of the First Embodiment First, the principle of the first embodiment of the present invention will be described. In the first embodiment, in association with an input data represented by an integer value, the bit number of an output data is made larger than that of the input data in an LUT for reading a prescribed basic data, the decimal part of the output data approximate to the basic data is represented by the increased bit number, and the expected value of the output data is brought near to the basic data by statistical processing. A detailed description follows. An input data to the lookup table LUT is represented by x, the data which is made to be close to the basic data represented by a larger number of bits outputted from the lookup table is represented by Y, and a variable data outputted from variable data generating means 10 is represented by R. As noted, the number of bits of the data Y outputted from the lookup table is larger than that of the input data x. Now, the number of bits of the input data x is m and the number of bits of the output data Y from the lookup table is n (n > m). The data Y can be divided into a higher order m bit data Y U corresponding to the integer part of the input data x and a lower order (n - m) bit data Y L corresponding to the decimal part thereof. The number of bits of the variable data R is (n - m) which is the same as that of the lower order bit data Y L . Therefore, the data Y outputted from the lookup table can be represented by Y = Y U · 2 n-m + Y L In consideration of the decimal point, it can be represented by Y = Y U + Y L 2 n-m The comparing means 11 compares the lower order bit data Y L with the variable data R and outputs a single bit signal having a value "1" when Y L > R, and a value of "0" when Y L ≦ R. This output "S" of the comparing means 11 is supplied to the adding means 12. The adder means 12 adds the 1 bit wide signal of "1" or "0" from the comparing means 11 to the higher order bit data Y U of the data Y outputted from the lookup table. More specifically, when Y L > R, the final output data Y will be the higher order bit data Y U with "1" added to the least significant bit (LSB) thereof. When Y L ≦ R, there is no such addition and the higher order bit data Y U directly becomes the final output data Y. Since the number of bits of the lower order bit data Y L and of the variable data R is (n - m), the probability P₁ of Y L > R will be P₁ = Y L /2 n-m The probability P₂ of Y L ≦ R will be P₂ = (1 - Y L /2 n-m ) Therefore, the average value (= expected value) y of the output data y which is the result of addition, will be y = (Y U + 1) Y L 2 n-m + Y U (1 - Y L 2 n-m ) = Y U + Y L 2 n-m as is evident from the equations (1) and (4), y = Y , that is, the average value (= expected value) of the output data y coincides with the basic data. It shows that the statistical characteristics of the function of the gradation converting circuit in accordance with the present invention coincides with the functional characteristics of the lookup table whose precision is made higher by increasing the number of bits. In other words, the precision of the statistical characteristics can be improved by increasing the number of bits of the lookup table, of variable data generating means and of the comparing means, without increasing the number of bits of the input and output x and y. A still more detailed description is given below. For the purpose of providing comparisons, the conventional method shown in Fig. 3B will be described first. In the prior art, the number of bits of the output data y is m when the bit number of the input data x is m. The basic data y obj corresponding to the output data y will be represented by y obj = (a m-1 ·2 m-1 + a m-2 ·2 m-2 + ... + a₁·2¹ + a₀·2⁰) + (a₋₁·2⁻¹ + a₋₂·2⁻² + ... + a -i ·2 -i ... ) where the coefficient of each digit a m-1 , a m-2 , ..., a₁, a₀, a₋₁, a₋₂, ..., a₋₁ ... is "0" or "1". For example, the output data y of m bits will be y = a m-1 ·2 m-1 + ... + a₁·2¹ + a₀·2⁰ + 1 when a₋₁ = "1". Or, it will be y = a m-1 ·2 m-1 + ... + a₁·2¹ + a₀·2⁰ when a₋₁ = "0". (This operation corresponds to the rounding off operation, that is, counting fractions over 1/2 as one, and disregarding the rest.) The error Δ₁ of the output data y in association with the basic data y obj when a₋₁ = "1" will be no more than 0.5 (the order of this is 2⁻¹), and in general, an error has the order of 2⁻¹. The method of the present invention is as follows. The basic data y obj represented by n bits, which is the output bit number of the lookup table, will be, in accordance with the equation (5), y obj = y obj x 2 n-m = (a m-1 ·2 n-1 + ... + a -(n-m-1) ·2¹ + a -(n-m) ·2⁰ + (a -(n-m+1) ·2⁻¹ + ... + a -(n-m+i) ·2 -i + ... ) The output data Y from the lookup table corresponding to the basic data y obj will be y = a m-1 ·2 n-1 + ... + a -(n-m-1) ·2¹ + a -(n-m) ·2⁰ or the above value plus "1". The operation is the rounding off operation, and 1 is added (+1) when a -(n-m+1) is "1". The higher order m bit data Y U of the output data Y will be Y U = (a m-1 ·2 n-1 + ... + a₁·2 n-m+1 + a₀·2 n-m ) ÷ 2 n-m = a m-1 ·2 m-1 + ... + a₁·2¹ + a₀·2⁰) which is the same as the output data y (not rounded off) of m bit. The lower order (n - m) bit data Y L of the output data Y will be Y L = a₋₁·2 n-m-1 + ... + a -(n-m-1) ·2¹ + a -(n-m) ·2⁰ Since the bit number of the variable data R is (n - m), the provability P₁ that Y L > R will be, from the equation (11), P₁ = Y L /2 n-m = a₋₁·2⁻¹ + ... + a -(n-m) ·2 -(n-m) The average value (= expected value) y is represented by y = (Y U + 1) x P₁ + Y U x (1 - P₁) = Y U + P₁ and therefore, from the equations (10) and (12), y = (a m-1 ·2 m-1 + ... + a₁·2¹ + a₀·2⁰) + (a₋₁·2⁻¹ + ... + a -(n-m) ·2 -(n-m) ... ) The error Δ₂ of the average value (= expected value) y in association with the basic data y obj will be, from the equations (5) and (13), Δ₂ = y - y obj = -(a -(n-m+1) ·2 -(n-m+1) + a -(n-m+2) ·2 -(n-m+2) + a -(n-m+3) ·2 -(n-m+3) + ... ) The order of the error Δ₂ is no more than 2⁻² even in the case (n - m) is "1", and the order is no more than 2⁻³ in general. Namely, according to the present invention, the order of the error of the average value (= expected value) y in association with the basic data is no more than 2⁻³ in general when (n - m) is more than "2". In the prior art, the order of the error is generally 2⁻¹. Therefore, the order of the error can be made small by at least 1 order (when n - m = 1), and the average value (= expected value) y can be brought nearer to the basic data y obj compared with the prior art. The order of the error can be made smaller (for example, the order of the error will be 2⁻⁵ when n - m = 4) by increasing the bit number n of the output data Y from the lookup table, whereby the average value (= expected value) y of the output data y substantially coincides with the basic data. The advantages brought about when the average value y of the output data y is made substantially equal to the basic data will be described. Fig. 4A illustrates the effect of the invention, showing the actual gradation output data when the basic data is 9.5, and the output data is represented by 9 or 10. In the figure, the x axis represents the number of pixels while y axis represents the density of pixels. The basic data is represented by a solid line and the actual output data is represented by the dotted line. The average value (expected value) of the actual output data (dotted line) coincides with the basic data. Therefore, the gradation of the figure represented by the dotted gradation line substantially coincides with the gradation represented by the solid line of the basic data, when viewed macroscopically. Fig. 4B is similar to Fig. 4A, showing the actual gradation output data when the basic data is 9.25 and output data is represented by 9 or 10. (2) Actual Operation of the First Embodiment One embodiment of the present invention will be described in detail with reference to the figures. Fig. 5 is a block diagram of a gradation converting circuit employing a lookup table in accordance with a first embodiment of the present invention, and Fig. 6 is a schematic block diagram of a color scanner in which the gradation converting circuit is employed. Referring to Fig. 6, the color scanner including the gradation converting circuit 7 of the present invention comprises a photoelectric converting element 1 which optically reads the density of an original on a pixel by pixel basis to convert the same into a current. An I/V converting circuit 2 converts the current into voltage and supplies it to a voltage amplifier 3. Three sets of these circuits are provided for three primary colors of light, that is, R, G and B (red, green, blue). Filters of R, G and B are provided directly in front of each of the photoelectric converting elements 1. The color scanner further comprises color calculation circuit (analog type) 4 for converting the R, G and B signals inputted from the three voltage amplifiers 3 to Y, M, C and K (yellow, magenta, cyan, black) signals which are the colors used for printing; an A/D converting circuit 5; magnification rate converting circuit 6; the gradation converting circuit 7 in accordance with the embodiment of the present invention; a dot generator 8 for forming dots; and an exposure head 9. The A/D converting circuit 5 and the magnification rate converting circuit 6 may be arranged before the color calculation circuit 4 and, in that case, a digital type color calculation circuit 4 is employed. The gradation converting circuit 7 is structured as shown in Fig. 5. Referring to Fig. 5, a lookup table LUT to which m bit digital data x of an image is inputted, outputs a data Y of n bits (n > m), that is the number of bits n is larger than that of the number of bits m of the input data x. In this lookup table LUT, data in accordance with a desired input/output converting characteristics are stored. Since the number of bits n of the output data Y is larger than the number m of the prior art, the lookup table LUT has smaller errors in quantization. However, the number of bits of the final output data y to be outputted to the dot generator 8 is predetermined. The number of bits of the final output data y is determined to be m which is the same as the number of bits of the input data x as in the prior art. The output data Y from the lookup table LUT cannot be directly outputted since the number of bits n of the output data Y is larger than that of the final output data y. Therefore, the n bit output data Y is divided into a higher order m bit data Y U corresponding to an integer part and a lower order (n - m) bit data Y L corresponding to a decimal part. The number of bits of a variable data R which is outputted from variable data generating means 10 is (n - m), which is the same as that of the lower order (n - m) bit data Y L . The variable data R changes time sequentially with a uniform probability distribution. The variable data generating means 10 updates the variable data R to be outputted at every input of the clock corresponding to the pixel signal of 1 pixel. A random number generating circuit, a quasi random number generating circuit, or a pattern generating circuit storing a prescribed pattern and cyclically reading the same may be employed as the variable data generating means 10. A comparing means 11 is provided for comparing the lower order (n - m) bit data Y L and the variable data R. When the lower order bit data Y L is larger than the variable data R (Y L > R), a 1 bit signal S of "1" is outputted. When the lower order bit data Y L is the same as, or smaller than the variable data R (Y L ≦ R), a 1 bit signal S of "0" is outputted. The result "0" or "1" of the comparison is transmitted to the adding means, where the 1 bit signal S is added to the LSB (least significant bit) of the higher order m bit data Y U , with the result of addition outputted to the dot generator 8 as the final output data y. The number of bits of the output data y from the adder means 12 is m, which is the same as that of the higher order bit data Y U . If it should be (m + 1) bits due to the overflow resulting from the addition, the carry is prohibited, whereby the m-bit data is outputted. The specific examples of the numerical value conversion is shown in the following table. The table shows the input/output characteristics of the present invention in association with the converting characteristics shown in Fig. 2 in order to provide a comparison to the input/output characteristics of the prior art. The number of bits of the input data x is 4 bits, the number of bits of the final output data y is 4 bits and the number of bits of the output data Y from the lookup table LUT is 6 bits. The value of the output data is the basic data rounded off in the input/output converting characteristics. The input/output converting characteristics of the prior art shown in Fig. 2 is as shown in lines 1, 2 and 3. For example, when x =6, the basic data is 9.75, and thus y = 10 by rounding off. The error Δ₁ of the output data y in association with the basic data is Δ₁ = 0.25. Errors Δ₁ for respective input x are shown in the line 12 of the table. The basic data converted from 4 bits to 6 bits is shown in the line 4 ○ of the table. The basic data of 6 bits is provided by multiplying the basic data of 4 bits by 2⁶ ÷ 2⁴ = 4. For example, when x = 6, the basic data will be 9.75 x 4 = 39.0. In the line 5 ○, the value of the output data Y from the lookup table LUT is shown, which is obtained by rounding off the value in the line 4 ○. In the line 6 ○, the values of the line 5 ○ sare represented by 6 bit binary number. In the line 7 ○, the higher order 4 bit data Y U of the 6 bit data of the line 6 ○ is shown and in the line 8 ○, the lower order 2 bit data Y L of the 6 bit data of the line 6 ○ is shown. The corresponding decimal representation is shown in the brackets of the lines 7 ○ and 8 ○. For example, when x = 6, the output data Y is [100111] = (39), Y U = [1001] = (9) and Y L = [11] = (3). In the line 9 ○, the probability P₁ that the lower order bit data Y L becomes larger than the variable data R (Y L > R) is shown. The variable data R comprises 2 bits and outputs [00], [01], [10] and [11] with the same probability. (a) to (d) in the line shows the distribution of the final output data y based on the probability P₁ of the line 9 ○. For example, when x = 6, the probability P₁ = 3/4, so that the probability that the 1 bit signal S = 1 is added to the higher order bit data Y U = 9 in the adding means 12 is 3/4, whereby the distribution becomes "9, 10, 10, 10". In the line , the average value (= expected value) y = ((a) + (b) + (c) + (d))/4 of (a) ∼ (d) in the line is shown. When x = 6, the value becomes 9.75. In the line , the error Δ₂ of the average value (= expected value) y in association with the basic data of the line 2 ○ is shown. When x = 6, the error ₂ = 0.00, which means that the average value (= expected value) y of the final output data y precisely coincides with the basic data. The error Δ₂ is less than 0.10 irrespective of the value of the input data x, which is smaller than that of the prior art. Namely, a value nearer to the basic data can be provided. Since the maximum error Δ₂ = 0.10 is decimal representation, it has the crder of 2⁻⁴ in the binary representation. This is apparent from the following relation, that is, 2⁻⁴ = 0.0625 < 0.10 < 0.125 = 2⁻³ If the present invention should be applied to image processing apparatus employing a scanner and the like in the process of reproduction, it is preferred that the input is 8 bits, Y is 12 bits, Y U and y are 8 bits, respectively and Y L is 4 bits. As is apparent from the foregoing, the statistical characteristics of the lookup table LUT in accordance with the embodiment of the present invention becomes a smooth basic characteristics such as shown by the curve A in Fig. 2. On the other hand, in the prior art shown in Fig. 3B, the statistical characteristics of the lookup table is such as shown by the line B. The statistical characteristics means the average values y of the output data y which are random numbers, in association with a certain input data x. The number of bits of the input data x and the number of bits of the final output data y is the same in the above embodiment, it is not limited to this and the number of bits of the final output data y may be smaller than that of the input data x. This is advantageous when the number of bits of the output data y must be made small. While a binary system is employed in this embodiment, the technical concept of the present invention is not limited to a binary system. It may be applied to a ternary system and so on. In such case, the higher order bits and the lower order bits may be set as higher order figures and lower order figures. The lookup table LUT may be formed in an ROM or an RAM, or it may be structured by an LSI together with the variable data generating means 10, comparing means 11 and the addition means 12.

Claims: Gradation converting circuit comprising a lookup table (LUT) which LUT stores corrected gradation data, characterized in that said LUT converts m-bit input data (X) to n-bit output data (Y) including m higher order bits and (n-m) lower order bits, a variable data generator means (10) is provided which generates variable (n-m)-bit data (R), a comparator means (11) is provided comparing the (n-m) lower bits of the output data (Y L ) of the LUT with the (n-m)-bit variable data (R), and an adding means (12) is provided adding a prescribed integer value to the m-bit output data (Y U ) of the LUT based on the result of comparison in the comparator means (11). Gradation converting circuit according to claim 1, characterized in that said adding means (12) adds said prescribed integer value (S) when the decimal value (Y L ) is larger than said variable data (R). Gradation converting circuit according to claim 1 or 2, characterized in that said added prescribed integer value equals "1". Gradation converting circuit according to claim 1, characterized in that said lookup table (LUT) is contained in a RAM.

Inventors: ARAGAKI MASAMI DAINIPPON SCREE, HIROSAWA MAKOTO DAINIPPON SCRE, ARAGAKI, MASAMI DAINIPPON SCREEN MFG.CO.,LTD., HIROSAWA, MAKOTO DAINIPPON SCREEN MFG.CO.,LTD.
Applicants: DAINIPPON SCREEN MFG, DAINIPPON SCREEN MFG. CO., LTD.
Application year: 1988
Main classification: H04N1
IPC codes: H04N1