EP0272655A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and apparatus for generating look-up table data
Assignee: Dainippon Screen Manufacturing Co Ltd
•
Filing: 1987-12-18
•
Granted: —
•
Expires: 2007-12-18
Abstract
Abstract Basic data elements obtained by thinning-out data to be written in a look-up table (1) are calculated by a computer (7) and stored in a basic memory table (9). Coefficient data elements required for linearly interpolating the basic data elements are stored in a coefficient memory table (11). The basic data elements and correlated the coefficient data elements are read in accordance with address designation by an address generator (10) and subjected to interpolation operation by an interpolation computing element (8), and the data thus obtained are sequentially written in the look-up table (1).
Inventors
- 👤 Kazuya C/O Dainippon Screen Mfg. Co. Ltd Akiyama
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-23 15:57
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/02; G09G5/06; G06; G06F; G06F1/00; G06F1/02; G06F1/03; G06F1/035; G06F1/0356; H; H04; H04N; H04N1/00; H04N1/46; H04N1/56; H04N1/60; H04N1/6016; H04N1/6019; G06F3/00; G06F3/14; G09G5/36; G09G5/39; G09G5/393
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
81 words
A method of generating look-up table data, comprising the steps of: calculating and storing basic data elements selected at prescribed intervals from data to be written in a look-up table; storing coefficient data elements required for linearly interpolating said basic data; performing an interpolation operation in an interpolation computing element by reading said basic data elements and correlated coefficient data elements and deriving said interpolated look-up data elements; and sequentially writing data obtained by said interpolation operation in said look-up table.
Claim 2
Independent Claim
81 words
A method of generating look-up table data, comprising the steps of: calculating and storing basic data elements selected at prescribed intervals from data to be written in a look-up table; storing coefficient data elements required for linearly interpolating said basic data; performing an interpolation operation in an interpolation computing element by reading said basic data elements and correlated coefficient data elements and deriving said interpolated look-up data elements; and sequentially writing data obtained by said interpolation operation in said look-up table.
Claim 3
Dependent Claim
167 words
A method according to claim 1, wherein said look-up table has a b-dimensional address space with a-bit addresses per dimension, said basic data elements are stored in a basic memory table having a b-dimensional address space with c-bit addresses per dimension, the number of said basic data elements is 2 c + 1 per dimension and is (2 c + 1) b in total in b dimensions, a set of said basic data elements are formed by 2 b of the basic data which mutually adjoin in each dimension, and said basic data elements are packed as 2 b x (2 c ) b data with respect to (2 c ) b sets for storage in said basic memory table under assignment of different addresses, and each set of basic data elements is interpolated to become (2 a-c ) b data interpolated elements in order to obtain (2 c ) b x (2 a-c ) b = (2 a ) b look-up table data elements in total.
Claim 4
Dependent Claim
91 words
A method according to claim 2, wherein a set of said coefficient data elemnts is formed by 2 b of the coefficient data elemnts which are required for calculation of a single interpolated data elemnt, and said coefficient data elements are packed as 2 b x (2 a-c ) b data elements with respect to (2 a-c ) b sets which are equal in number to the interpolated data elements derived from a set of said basic data elements for storage in said coefficient memory table under assignment of different addresses.
Claim 5
Dependent Claim
85 words
A method according to claim 3, wherein read addresses are designated so that each set of said basic data elements is read respeatedly (2 a-c ) b times and different sets of said coefficient data elements are correspondingly read for respective ones of said repeated sets and different write addresses are designated for every reading of a set of said basic and coefficient data elements, in reading of said basic and coefficient data elements and writing of the obtained data elements in said look-up table.
Claim 6
Independent Claim
132 words
An apparatus for generating look-up table data, comprising: a computer for calculating basic data elements selected at prescribed intervals from data to be written in a look-up table; a basic memory table for storing said basic data elements at previously assigned addresses; a coefficient memory table for storing coefficient data elements required for linearly interpolating said basic data at previously assigned addresses; an address generator for generating read addresses for said basic and coefficient memory tables and correlated write addresses of said look-up table and an interpolation computing element for receiving said basic and coefficient data elements read at said read addresses to perform an interpolation operation to derive interpolated look-up table data elements, data obtained by said interpolation operation being written in said look-up table in accordance with said write addresses.
Claim 7
Independent Claim
132 words
An apparatus for generating look-up table data, comprising: a computer for calculating basic data elements selected at prescribed intervals from data to be written in a look-up table; a basic memory table for storing said basic data elements at previously assigned addresses; a coefficient memory table for storing coefficient data elements required for linearly interpolating said basic data at previously assigned addresses; an address generator for generating read addresses for said basic and coefficient memory tables and correlated write addresses of said look-up table and an interpolation computing element for receiving said basic and coefficient data elements read at said read addresses to perform an interpolation operation to derive interpolated look-up table data elements, data obtained by said interpolation operation being written in said look-up table in accordance with said write addresses.
Claim 8
Dependent Claim
164 words
An apparatus according to claim 5, wherein said look-up table is a table having a b-dimensional address space with a-bit addresses per dimension, said basic memory table is a table having a b-dimensional address space with c-bit addresses per dimension, the number of said basic data elements is 2 c + 1 per dimension and is (2 c + 1) b in total in b dimensions, a set of said basic data is formed by 2 b of the basic data elements which mutually adjoin in each dimension, said basic data are packed as 2 b x (2 c ) b data with respect to (2 c ) b sets for storage in said basic memory table under assignment of different addresses, and each set of basic data elements is interpolated to become (2 a-c ) b interpolated data elements in order to obtain (2 c ) b x (2 a-c ) b = (2 a ) b look-up table data elements in total.
Claim 9
Dependent Claim
90 words
An apparatus according to claim 6, wherein a set of said coefficient data elements is formed by 2 b of the coefficient data elements which are required for calculation of a single interpolated data element, and said coefficient data elements are packed as 2 b x (2 a-c ) b data with respect to (2 a-c ) b sets which are equal in number to the interpolated data elements derived from a set of said basic data elements, for storage in said coefficient memory table under assignment of different addresses.
Claim 10
Dependent Claim
96 words
An apparatus according to claim 7, wherein the designation of read addresses is performed so that a set of said basic data elements is read repeatedly (2 a-c ) b times and different sets of said coefficient data elements are correspondingly read for respective ones of said repeated sets, and designation of different write addresses is performed for every designation of read addresses of a set of said basic and coefficient data elements, in generation of read addresses of said basic and coefficient memory tables and write addresses of said look-up table by said address generator.
Claim 11
Dependent Claim
35 words
An apparatus according to claim 8, wherein said address generator comprises a binary counter having a prescribed number of digits and arranged to perform the required address designation by prescribed combination of its digit outputs.
Claim 12
Dependent Claim
50 words
An apparatus according to claim 9, wherein said interpolation computing element comprises a multiplier/accumulator, and a control signal is supplied by said binary counter so that the accumulated content of the multiplier/accumulator is cleared for each designation of read addresses of a set of said basic and coefficient data elements.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.