Computer graphics processing and selective visual display system – Computer graphics processing – Adjusting level of detail
Reexamination Certificate
2000-09-06
2004-02-17
Luu, Matthew (Department: 2672)
Computer graphics processing and selective visual display system
Computer graphics processing
Adjusting level of detail
C345S581000, C345S582000, C345S586000
Reexamination Certificate
active
06693634
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a processing circuit, a method for the same, and an image processor, more particularly relates to a processing circuit, a method for the same, and an image processor improved a speed of the processing including a logarithm of 2 operations and a reduction of scale of the hardware.
2. Description of the Related Art
Computer graphics are often used in a variety of computer aided design (CAD) systems and amusement machines. Especially, along with the recent advances in image processing techniques, systems using three-dimensional computer graphics are becoming rapidly widespread.
In three-dimensional computer graphics, the color value of each pixel is calculated at the time of deciding the color of each corresponding pixel. Then, rendering is performed for writing the calculated value to an address of a display buffer (frame buffer) corresponding to the pixel.
One of the rendering methods is polygon rendering. In this method, a three-dimensional model is expressed as a composite of triangular unit graphics (polygons). By drawing the polygons as units, the colors of the pixels of the display screen are decided.
In the polygon rendering, processing is performed for interpolation inside a triangle by the coordinates (x, y, z), color data (R, G, B), homogeneous coordinates (s, t) of texture data indicating an image pattern for pasting, and the value of a homogeneous term g for vertexes of the triangle in a physical coordinate system.
Here, simply speaking, the homogeneous term g is like an enlargement and reduction rate. The coordinates in a UV coordinate system of an actual texture buffer, that is, the texture coordinate data (U, V), correspond to the (s/q, t/q)=(u, v) obtained by dividing the homogeneous coordinates (s, t) by the homogeneous term g multiplied by the texture sizes USIZE and VSIZE.
In a three-dimensional computer graphic system using such polygon rendering, when drawing, a texture mapping is performed to read texture data having the optimum reduction rate from the texture buffer storing a plurality of texture data corresponding to different reduction rates, pasting this read texture data to the surface of the 3D model in units of pixels, and thereby obtaining image data with a high reality.
At this time, the reduction rate of the texture data to be read is determined in for example pixel units.
Summarizing the problem to be solved by the invention, in the three dimensional computer graphic system as mentioned above, how the reduction rate of the texture data to be read from the texture buffer is determined for each pixel is important for achieving a higher quality of the display image and a reduction of the scale.
SUMMARY OF THE INVENTION
An object of the present invention is to provide a processing circuit which can be used in an image processor such as a three-dimensional computer graphic system and other hardware and can realize processing including logarithm of 2 operations by a small sized circuit configuration.
Another object of the present invention is to provide an image processor capable of displaying a high quality image with a small size hardware configuration.
Still another object of the present invention is to provide a processing method capable of performing processing at a high speed.
To achieve the first object, according to a first aspect of the present invention, there is provided a processing circuit for performing the operation shown in the following equation (1)
M=
log
2
q+
maxe (1)
using binary data g having an integer part and a decimal part and data maxe comprised by only an integer part, comprising a normalization circuit for normalizing the data g to generate an exponent ge and a mantissa gm, a data outputting means for receiving as its input the mantissa gm and outputting data &mgr; indicating “log
2
({1, qm})−qm” where {1, qm} indicates a bit coupling where “1” is the integer part and “qm” is the decimal part, and an adder circuit for adding data obtained by bit coupling of the data ge and the gm and data obtained by bit coupling of the data maxe and the data &mgr;.
That is , in the processing circuit of the first aspect of the present invention, the normalization circuit normalizes the data g to generate the exponent ge and the manitssa gm.
Next, it outputs the mantissa gm to the data outputting means. The data outputting means obtains the data &mgr; indicating “log
2
({1, qm})−qm” corresponding to the mantissa gm and outputs the data &mgr;.
Next, the adder circuit adds the data obtained by bit coupling of the data ge and gm and the data obtained by bit coupling of the data maxe and the data &mgr; to calculate data M.
The processing circuit of the first aspect of the present invention utilizes the fact that the data &mgr; is comprised by only the decimal part since log
2
({1, qm}) and the data gm are similar, bit couples the data maxe comprised by only the integer part and the data &mgr;, and thus realizes addition of the data maxe. For this reason, the addition using the adder circuit can be reduced, and a reduction of the size and the increase of the speed can be achieved.
In the processing circuit of the first aspect of the present invention, preferably the data outputting means has a correspondence table between the mantissa gm and the &mgr; data, acquires the data &mgr; corresponding to an input mantissa gm by using the correspondence table, and outputs the related obtained data &mgr;.
Further, in the processing circuit of the first aspect of the present invention, preferably the data outputting means has a program for receiving as input the mantissa gm and generating the &mgr; data and performs processing based on the related program to acquire the data &mgr; corresponding to an nput mantissa gm and output the related acquired data &mgr;.
To achieve the first object, according to a second aspect of the present invention, there is provided a processing circuit for calculating data LOD by performing the operation shown in the following equation (2).
LOD=Clamp (((log
12
1
/q
)+maxe)<<
L+K
) (2)
using binary data g having an integer part and a decimal part, data maxe comprised by only an integer part, and data L and K, comprising a normalization circuit for normalizing the data g to generate an exponent ge and a mantissa gm, a first shift circuit for shifting the data obtained by bit coupling of the data ge and the gm toward the most significant bit (MSB) by exactly a value indicated by the data L, a first inversion circuit for inverting the output of the first shift circuit, a data outputting means for receiving as its input the mantissa gm and outputting data &mgr; indicating “log
2
({1, qm})−qm” where {1, qm} indicates a bit coupling where “1” is the integer part and “qm” is the decimal part, a second shift circuit for shifting the data obtained by bit coupling of the data maxe and the data &mgr; toward the MSB by exactly the value indicated by the data L, a second inversion circuit for inverting the output of the second shift circuit, an adder circuit for adding the data obtained by bit coupling of the data K and the binary number “10”, an adder circuit for adding the output of the first shaft circuit and the output of the second shift circuit, and a clamp circuit for clamping the output of the adder circuit to a predetermined number of bits to generate the data LOD.
That is, in the processing circuit of the second aspect of the present invention, the normalization circuit normalizes the data g to generate the exponent ge and the mantissa gm.
Then, the data obtained by bit coupling of the data ge and gm is output to the first shaft circuit. The first shift circuit shifts the related data toward the MSB by exactly the value indicated by the data L.
Next, the first inversion circuit inverts the output of the first shift circuit.
Further, the data outputting means receives as input the mantissa gm and output
Chung Daniel J
Fulwider Patton Lee & Utecht LLP
Luu Matthew
LandOfFree
Reduction rate processing circuit and method with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Reduction rate processing circuit and method with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduction rate processing circuit and method with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3305942