Abstract:
Method and apparatus for generating integer pixel values from floating point values using table lookup. The method includes the steps of (a) providing a floating-point representation of a pixel value; and (b) applying the floating-point representation as an index into a lookup table. The lookup table includes a memory device having a plurality of entries. Each of the entries is uniquely indexed by one value of a floating-point representation of a pixel value, and each of the entries stores a corresponding integer representation of the pixel value. A third step (c) outputs from the lookup table the integer representation of the pixel value that corresponds to the applied floating-point representation. It is shown that only a sub-set of the entire floating-point representation need be employed as a table index value, specifically the sign bit, the exponent, and a portion of the mantissa.

Description:
This is a continuation of copending application Ser. No. 07/914,978, filed on Jul. 15, 1992. 
    
    
     FIELD OF THE INVENTION 
     This invention relates generally to data processing systems having display apparatus and, in particular, to methods and apparatus for displaying graphical and other images. 
     BACKGROUND OF THE INVENTION 
     In many computer graphics applications it is either necessary or convenient to employ floating-point numbers during the process of computing pixel values, wherein a pixel is a picture element that is a smallest displayable unit of an image. That is, for some applications the additional precision inherent in a floating-point representation is desirable, or the convenience of the automatic scaling of a floating-point representation makes the programming and/or computation of pixel values more efficient. 
     One such application is known as ray-tracing, where many small effects (e.g. multiple reflections and multiple light sources) must be accumulated for each pixel. Another application where a floating-point pixel representation is advantageous is volume rendering, where each layer of a volume may make a contribution to a pixel value, and many such small contributions must be accumulated. 
     However, when displaying the resulting pixel values the floating-point values must, typically, be converted to one-byte values in that most display devices operate with one-byte pixel values. Typically, three such one-byte values are used for each pixel, one for each of the primary colors (red, green, and blue). 
     The process of converting the floating-point values to one-byte values includes a number of steps which, when taken together, are time consuming and often decrease the efficiency of the system. Typically, these steps include the following. 
     Scaling of pixel values: For example, the floating-point pixel values may be, by convention, in the range from 0.0 to 1.0; but the one-byte pixel values are, by definition, in the range from 0 to 255. As a result, multiplication of the floating-point pixel values by 255 is required. However, a floating-point multiplication can be a relatively time-consuming operation. Furthermore, the use of hardware multipliers increases the cost, complexity, and power consumption of the system. 
     Range limiting: In that the range of floating-point numbers is very large compared to the range of one-byte values, at times a floating-point pixel value is found to be outside of the range of byte values. For example, using the assumption of the preceding paragraph that the floating-point values are to be scaled by 255, a floating-point pixel value of, for example, 1.01 would be converted to an integer value of 257. However, 257 cannot be represented as a one-byte value, and must be represented instead by the maximum possible one-byte value, 255. Similarly, floating-point pixel values of less than zero must be represented by a byte pixel value of 0. Range limiting is typically accomplished by two comparisons (one comparison with the minimum value and one comparison with the maximum value) and with conditional branches. However, conditional branches are relatively time-consuming operations in modern data processors in that they interrupt the flow of processor pipelines. 
     Gamma correction: Most computer displays exhibit a non-linear relationship between pixel values and screen brightness, typically of the form 
     
         brightness=(pixel value).sup.gamma, 
    
     where &#34;gamma&#34; is a number that is characteristic of a particular display monitor. To compensate for this effect, it is desirable to use a pixel value computed according to the formula 
     
         pixel value=(desired brightness).sup.(1/gamma). 
    
     Generally the floating-point pixel value described above is taken to represent the desired brightness. However, the required exponentiation operation is a computationally expensive process. 
     A final pixel operation is the required conversion from the floating-point representation to an integer representation prior to display of the pixel. 
     Thus, for this example the operations required to convert a floating-point pixel value to a byte pixel value are as follows (expressed in the C programming language): 
     float in; 
     unsigned char out; 
     if (in&lt;0) out=0; /* Range Limiting */ 
     else if (in&gt;1.0) out=255; /* Range Limiting */ 
     else out=255.0 * pow(in, 1.0/gamma); /* Scaling and Gamma correction */ 
     It is noted that the conversion from floating-point to integer is implicit in the &#34;else out&#34; assignment. 
     In this example, even if the gamma correction is omitted, the resulting calculation still requires a considerable amount of processing time for each pixel. In that a typical display screen may display several hundreds of thousands or millions of pixels, each having a red, green, and blue constituent, it can be realized that a considerable amount of processing effort may be expended to generate but one displayable image frame. 
     It is thus an object of this invention to provide an efficient method for converting a floating-point pixel representation into a displayable integer pixel representation. 
     It is a further object of this invention to provide an efficient technique for performing at least one operation on a pixel that is expressed in a floating-point representation, and to provide as a result of the operation an integer representation of the pixel. 
     SUMMARY OF THE INVENTION 
     The foregoing and other problems are overcome and the objects of the invention are realized by a method of generating a value of a pixel, and by apparatus for accomplishing the method. The method includes the steps of (a) providing a floating-point representation of a pixel value; and (b) applying the floating-point representation as an index into a lookup table, the lookup table including a memory device having a plurality of entries. Each of the entries is uniquely indexed by one value of a floating-point representation of a pixel value, and each of the entries stores a corresponding integer representation of the pixel value. A third step (c) outputs from the lookup table the integer representation of the pixel value that corresponds to the applied floating-point representation. 
     The floating point representation of the pixel value may be a single-precision floating-point representation, a double-precision floating-point representation, or any suitable floating-point representation having an exponent field, a mantissa field, and, optionally, a sign bit. 
     The memory device has a plurality of address inputs. A first plurality of the address inputs are coupled to exponent bits of the floating-point representation of the pixel value and a second plurality of the address inputs are coupled to a sub-set of the mantissa bits of the floating-point representation of the pixel value. One of the plurality of address inputs may be coupled to the sign bit. In a preferred embodiment of the invention the lookup table is indexed by one sign bit, eight exponent bits, and seven mantissa bits, and the integer pixel value is expressed in eight bits. 
     The integer representation of the pixel value further represents at least one operation that is performed upon the corresponding floating-point representation of the pixel value, wherein the at least one operation is selected from a group of operations such as scaling, range limiting, and gamma correction. 
     An initial step of the method initializes the lookup table by storing, within each of the entries of the lookup table, an integer pixel value that is a function of a value of the associated floating-point representation. The step of storing includes a first step of performing at least one operation on the floating-point representation of the pixel value, the at least one operation being selected from the group of operations such as scaling, range limiting, and gamma correction. 
     It is shown that only a sub-set of the entire floating-point representation need be employed as a lookup table index value. In the presently preferred embodiment of the invention, only 16 bits of a 32-bit single-precision floating-point value are shown to be relevant to the result; specifically the sign bit, the exponent, and a portion of the mantissa. 
    
    
     BRIEF DESCRIPTION OF THE DRAWING 
     The above set forth and other features of the invention are made more apparent in the ensuing Detailed Description of the Invention when read in conjunction with the attached Drawing, wherein: 
     FIG. 1 is a block diagram of a data processing system that is constructed and operated in accordance with the invention; 
     FIG. 2 shows a floating-point pixel representation that is employed by the invention; 
     FIG. 3 illustrates a lookup table (LUT) that is addressed by the upper halfword of the floating-point pixel representation of FIG. 2; 
     FIG. 4 illustrates a further embodiment of the invention wherein the LUT is partitioned into three LUTs, one being assigned to each of the primary colors; and 
     FIG. 5 is a flowchart that illustrates a method of the invention. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     Referring first to FIG. 1, there is illustrated a data processing system 10, also referred to herein as a workstation, that is constructed and operated in accordance with the invention. System 10 includes a processor 12 that is bidirectionally coupled to a bus 14. The bus 14 includes address, data, and control signal lines and operates in a conventional manner. Also coupled to the bus 14 is a memory 16, a mass storage device 18, such as a disk drive, and a frame buffer (FB) 20 that stores at least one displayable frame of image pixels. An output of the frame buffer 20 provides red (R), green (G), and blue (B) signals to a display device 22. By example, three digital to analog (D/A) converters (not shown) may be provided for converting 8-bit pixel values output by the frame buffer 20 into corresponding R, G, B analog signals that are suitable for driving the display device 22. The display device 22 includes means for displaying a plurality of pixels in a conventional manner. 
     The memory 16 includes storage for a processor 12 operating program, including programs that implement the method of the invention that is described below. In this embodiment of the invention the memory 16 also includes a floating-point to integer conversion lookup table (LUT) 24. 
     In accordance with the invention, the system 10 is operated so as to perform one or more of the above described pixel operations; i.e. pixel scaling, range limiting, gamma correction, and/or floating-point to integer conversion, as well as other desired pixel value transformations, by an efficient table lookup technique. 
     As employed herein, a suitable floating-point representation is specified in ANSI/IEEE Standard 754, although the use of other floating-point representations are within the scope of the teaching of the invention. 
     During the operation of the system 10, the floating-point pixel representations may be obtained from the mass storage device 18 and/or through a communication link (CL) 26 from a remote image generation or processing system. The floating-point pixel representations may also be generated by the operation of the processor 12, or by another local processor if the system 10 is a multi-processor system, and stored within a region of the memory 16 that is separate from the LUT 24. By example only, the floating-point pixel value representations may represent the result of a ray tracing and/or a volume rendering operation that is performed upon a scene to be displayed. 
     One suitable basis for the table lookup technique of the invention is the well-known IEEE single-precision floating-point number representation that is widely used in data processing systems, such as workstations. The presently preferred IEEE single-precision floating-point representation is shown in FIG. 2. 
     In FIG. 2, each letter represents a bit. The &#34;S&#34; represents the sign bit, which indicates the sign (±) of the number. The &#34;E&#34;s represent the exponent of the number (eight bits), and the &#34;M&#34;s represent the mantissa (23 bits). In addition to the 23 mantissa bits shown in FIG. 2, the IEEE single-precision standard assumes a &#34;hidden&#34; extra high-order mantissa bit having a value of one. 
     As can be seen, the bits may be grouped together into two 16-bit &#34;halfwords&#34;, and demonstrate that the high-order 16 bits of a single-precision floating-point number contain eight bits of precision, including the hidden high-order mantissa bit. It can therefore be realized that employing only the high-order halfword of an IEEE single-precision floating-point number introduces a representation error on the order of only 2 -8 . For a typical pixel value conversion operation only eight bits of precision are available in the result (the one-byte pixel value), and thus the high-order 16-bits of the single-precision floating-point number provide sufficient precision to represent all 256 of the possible eight bit pixel values. 
     The high-order 16 bits of the single-precision floating-point number may assume only 2 16 , or 65,536 distinct values, and therefore a LUT 24 having 65,536 entries is sufficient to perform any desired conversion. Moreover, each LUT 24 entry requires only a single byte. As a result, the maximum LUT 24 size is only 65,536 bytes, which represents a relatively small amount of storage in a modern workstation. 
     FIG. 3 illustrates a discrete memory device implementation of the LUT 24 of FIG. 1, and shows the coupling of the upper halfword of the single-precision floating-point number to the LUT 24 address (A) inputs. A LUT 24 data out path (D OUT ) has a width of eight bits for providing the converted integer pixel value. It should be realized that, in some embodiments of the invention, the LUT 24 may be embodied in a memory device or devices, as in FIG. 3, that are separate from the memory devices that comprise the system memory 16. The memory device(s) may be system programmable, such as a static RAM, or may be preprogrammed, such as a ROM. 
     Furthermore, more than one LUT 24 may be provided. As seen in FIG. 4, three LUTs 24a, 24b, and 24c are employed, with each of the LUTs being associated with one of the RGB pixel values. This embodiment provides an advantage that the three conversions for a given pixel may proceed in a parallel, as opposed to a serial, manner. 
     In accordance with the teaching of the invention, the operations required for each conversion are reduced to: ##EQU1## 
     This C-language code fragment assumes that the MSB is stored first before the LSB. However, in some systems the LSB may be stored first before the MSB, and a corresponding modification is made to the code. The required modification can be readily made by one skilled in the art. 
     An examination of the machine operations underlying this technique, compared with the machine operations underlying the exemplary implementation of the conversion described above, shows clearly that the technique of the invention is significantly more efficient. 
     It should be noted that although the size of the LUT 24 is 65,536 bytes, many of the LUT 24 entries exist only to accommodate the relatively rare situations where pixel values are out of range. In general, the great majority of the pixel values are accommodated by a relatively small number of LUT 24 entries. For example, only 1024 of the bit patterns of the high-order sixteen bits of a single-precision IEEE floating-point value represent numbers in the range from 1/256 to 1; but these 1024 table entries have been found to account for more than 99.5% of the pixel values encountered in a typical display scene. In a workstation having a cache memory for storing most often accessed data, the result is that the most recently used LUT 24 entries will be encached, thereby providing a significant increase in the access speed of the most recently used values. 
     It should also be noted that for an application wherein the sign of the floating-point representation is known to be always either positive or negative, that the sign (S) bit is not required as an address (index) input to the LUT 24. Eliminating the sign bit reduces by one half the required size of the LUT. 
     As seen in Block A of the flowchart of FIG. 6, initialization of the LUT 24 need occur only once. Initialization is accomplished by treating in turn each entry of the LUT 24, generating the corresponding floating-point value, and storing in the LUT 24 entry the desired function of that pixel value. The following code fragment illustrates one suitable LUT 24 initialization technique: ##EQU2## 
     As before, this code assumes that the MSB is stored first. 
     It should be realized that the LUT 24 may perform another function besides converting a given single-precision floating-point pixel representation into an integer pixel representation. That is, other pixel operations, such as scaling, range checking, and gamma correction, are also accommodated by performing these operations during initialization, and storing the result into the corresponding LUT 24 entry. As a result, when a given floating-point pixel representation is later presented to the LUT 24, the resulting eight bit pixel value represents a scaled, range-checked, and gamma corrected integer pixel representation that is a function of the floating-point representation. 
     During the subsequent operation of the system 10 the Blocks B, C, and D are executed. For each pixel to be displayed (Block B) the floating-point representation is applied to the LUT 24 (Block C), and the resulting LUT 24 output is provided to the display device 22. 
     Based on the foregoing, it can be realized that one aspect of the invention employs a floating-point value as an address or index into a lookup table. Although the use of lookup tables for performing various operations is well known, the conventional usages of such tables employ fixed-point values or integers to index into the table. That is, an aspect of the invention is a realization that the bit pattern of a floating-point value may be used as an index into a lookup table. 
     A further aspect of the invention is a realization that, although floating-point values are generally 32-bits or more, there are a number of significant applications where only a sub-set of the entire floating-point representation need be employed as a table index value. In the presently preferred embodiment of the invention, only 16-bits of the 32-bit single-precision floating-point value are relevant to the result; specifically the sign bit, the exponent, and a portion of the mantissa. This is significant, in that a 32-bit quantity used as an index into a lookup table would require an impractically large lookup table. However, a lookup table based on a 16-bit index value is of reasonable size (65,536 entries) relative to modern memory technology. 
     Although described in the context of single-precision floating-point representations of pixels, it should be realized that a double-precision representation may also be employed, in conjunction with a suitable alteration being made to the size of the LUT. Furthermore, other than the ANSI/IEEE Standard 754 floating-point representation may be employed. That is, the teaching of the invention is applicable to any digital number representation scheme that employs an exponent field, a mantissa field, and, optionally, a sign bit. 
     It should also be realized that the teaching of the invention is applicable to conversions and operations on other than pixel data, and may be employed for other applications wherein it is desired to convert a floating-point representation to another representation, while also possibly performing one or more operations on the floating-point representation, such as scaling. 
     Thus, while the invention has been particularly shown and described with respect to a preferred embodiment thereof, it will be understood by those skilled in the art that changes in form and details may be made therein without departing from the scope and spirit of the invention.