← Back to Patent Explorer
US4901258A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of and apparatus for generating look-up table data

Assignee: Dainippon Screen Manufacturing Co Ltd
•
Filing: 1987-12-23
•
Granted: 1990-02-13
•
Expires: 2007-12-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Basic data obtained by thinning-out data to be written in a look-up table are previously operated by a computer and stored in a basic memory table. Coefficient data required for linearly interpolating the basic data are stored in a coefficient memory table. The basic data and the coefficient data are read in accordance with address designation by an address generator while being related with each other and subjected to interpolation operation by an interpolation computer element, and data thus obtained are sequentially written in the look-up table.

Inventors

  • 👤 Kazuya Akiyama

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 13:21
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: 20
Claim 1
Independent Claim 92 words
A method of generating look-up table data, comprising the steps of: previously operating on and storing basic data, obtained by thinning-out data to be written in a look-up table which is stored in a memory, at prescribed intervals; previously storing, in a coefficient memory table, coefficient data required for linearly interpolating said basic data; performing an interpolation operation in an interpolation computing element by reading said basic data and said coefficient data while relating the same with each other; and sequentially writing data obtained by said interpolation operation in said look-up table.
Claim 2
Independent Claim 92 words
A method of generating look-up table data, comprising the steps of: previously operating on and storing basic data, obtained by thinning-out data to be written in a look-up table which is stored in a memory, at prescribed intervals; previously storing, in a coefficient memory table, coefficient data required for linearly interpolating said basic data; performing an interpolation operation in an interpolation computing element by reading said basic data and said coefficient data while relating the same with each other; and sequentially writing data obtained by said interpolation operation in said look-up table.
Claim 3
Dependent Claim 213 words
A method of generating look-up table data in accordance with claim 1, wherein said look-up table has a multi-dimensional address space having a plurality of bit addresses per dimension, said basic data are stored in a basic memory table having said multi-dimensional address space with a plurality of bit addresses per dimension, a number of said basic data is 2 c +1 per dimension and is (2 c 1) b in total in b dimensions, where b is the number of dimensions in the address space, a is the number of bit addresses per dimension of said look-up table, and c is the number of bit addresses per dimension of said basic memory table, a, b and c being natural numbers, one set of said basic data are formed by 2 b of the basic data which mutually adjoin in each dimension, and said basic data are packed as 2 b ×(2 c ) b data with respect to (2 c ) b sets to be stored in said basic memory table under assignment of different addresses, and said one set of the basic data are interpolated to become (2 a-c ) b data in order to obtain (2 c ) b ×(2 a-c ) b =(2 a ) b data in total.
Claim 4
Dependent Claim 92 words
A method of generating look-up table data in accordance with claim 2, wherein one set of said coefficient data are formed by 2 b of the coefficient data which are required for calculation of a single interpolation data, and said coefficient data are packed as 2 b ×(2 a-c ) b data in (2 a-c ) b sets, (2 a-c ) b being equal to the number of interpolation data operated from a set of said basic data, said coefficient data stored in said coefficient memory table under assignment of different addresses.
Claim 5
Dependent Claim 89 words
A method of generating look-up table data in accordance with claim 3, wherein read addresses are designated so that each set of said basic data are read repeatedly by (2 a-c ) b times and different sets of said coefficient data are correspondingly read with respect to respective ones of said repeated sets respectively, and different write addresses are designated for every reading of a set of said basic and coefficient data, in reading of said basic and coefficient data and writing of obtained data in said look-up table.
Claim 6
Dependent Claim 9 words
A method in accordance with claim 4 wherein 1≦c<a.
Claim 7
Dependent Claim 9 words
A method in accordance with claim 2 wherein 1≦c<a.
Claim 8
Dependent Claim 9 words
A method in accordance with claim 3 wherein 1≦c<a.
Claim 9
Independent Claim 140 words
An apparatus for generating look-up table data, comprising: a computer for operating on basic data, obtained by thinning-out data to be written in a look-up table which is stored in a memory, at prescribed intervals; a basic memory table for storing said basic data in previously assigned addresses; a coefficient memory table for storing, in previously assigned addresses in a coefficient memory table, coefficient data required for linearly interpolating said basic data; an address generator for generating read addresses of said basic and coefficient memory tables and write addresses of said look-up table while correlating the same with each other; and an interpolation computing element for receiving said basic and coefficient data read along said read addresses to perform an interpolation operation, data obtained by said interpolation operation being written in said look-up table in accordance with said write addresses.
Claim 10
Independent Claim 140 words
An apparatus for generating look-up table data, comprising: a computer for operating on basic data, obtained by thinning-out data to be written in a look-up table which is stored in a memory, at prescribed intervals; a basic memory table for storing said basic data in previously assigned addresses; a coefficient memory table for storing, in previously assigned addresses in a coefficient memory table, coefficient data required for linearly interpolating said basic data; an address generator for generating read addresses of said basic and coefficient memory tables and write addresses of said look-up table while correlating the same with each other; and an interpolation computing element for receiving said basic and coefficient data read along said read addresses to perform an interpolation operation, data obtained by said interpolation operation being written in said look-up table in accordance with said write addresses.
Claim 11
Dependent Claim 212 words
An apparatus for generating look-up table data in accordance with claim 8, wherein said look-up table is a table having a multi-dimensional address space with a plurality of bit addresses per dimension, said basic memory table is a table having said multi-dimensional address space with a plurality of bit addresses per dimension, a number of said basic data is 2 c +1 per dimension and is (2 c +1) b in total b dimensions, where b is the number of dimensions in the address space, a is the number of bit addresses per dimension of said look-up table, and c is the number of bit addresses per dimension of said basic memory table, a, b and c being natural numbers, one set of said basic data are formed by 2 b of the basic data which mutually adjoin in each dimension, and said basic data are packed as 2 b ×(2 c ) b data with respect to (2 c ) b sets to be stored in said basic memory table under assignment of different addresses, and said one set of the basic data are interpolated to become (2 a-c ) b data in order to obtain (2 c ) b ×(2 a-c ) b =(2 a ) b data in total.
Claim 12
Dependent Claim 89 words
An apparatus for generating look-up table data in accordance with claim 9, wherein one set of said coefficient data are formed by 2 b of the coefficient data which are required for calculation of a single interpolation data, and said coefficient data are packed as 2 b ×(2 a-c ) b data with respect to (2 a-c ) b sets which are equal to in number interpolation data operated from a set of said basic data, to be stored in said coefficient memory table under assignment of different addresses.
Claim 13
Dependent Claim 99 words
An apparatus for generating look-up table data in accordance with claim 10, wherein designation of read addresses is performed so that a set of said basic data are read repeatedly by (2 a-c ) b times and different sets of said coefficient data 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, 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 14
Dependent Claim 39 words
An apparatus for generating look-up table data in accordance with claim 11, wherein said address generator is prepared by a binary counter of a prescribed digit number to perform required address designation by prescribed combination of respective digit outputs.
Claim 15
Dependent Claim 58 words
An apparatus for generating look-up table data in accordance with claim 12, wherein said interpolation computing element is prepared by a multiplier/accumulator, and a control signal is supplied by said binary counter so that a content of accumulation of the multiplier/accumulator is cleared for each designation of read addresses of a set of said basic and coefficient data.
Claim 16
Dependent Claim 9 words
An apparatus in accordance with claim 13 wherein 1≦c<a.
Claim 17
Dependent Claim 9 words
An apparatus in accordance with claim 9 wherein 1≦c<a.
Claim 18
Dependent Claim 9 words
An apparatus in accordance with claim 10 wherein 1≦c<a.
Claim 19
Dependent Claim 9 words
An apparatus in accordance with claim 11 wherein 1≦c<a.
Claim 20
Dependent Claim 9 words
An apparatus in accordance with claim 12 wherein 1≦c<a.

References Cited (Backward Citations)

JPS49657A Cited
US4231097A Cited
US4275413A Cited
US4462083A Cited
US4446529A Cited
US4534059A Cited
US4712141A Cited
US4725892A Cited
US4792847A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-02-12 1993-08-14 1994-02-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-02-12 1997-08-14 1998-02-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-02-12 2001-08-14 2002-02-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag