Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Lookup table
Known as:
Table lookup
, Look-up table
, Lookup
Expand
In computer science, a lookup table is an array that replaces runtime computation with a simpler array indexing operation. The savings in terms of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithmic efficiency
Block cipher
Bump mapping
Cache (computing)
Expand
Broader (1)
Computer performance
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Control of Permanent Magnet Synchronous Generator for large wind turbines
C. Busca
,
Ana-Irina Stan
,
T. Stanciu
,
D. Stroe
IEEE International Symposium on Industrial…
2010
Corpus ID: 21393869
Direct Torque Control (DTC) and Field Oriented Control (FOC) are the most dominant control strategies used in generators for wind…
Expand
Highly Cited
2007
Highly Cited
2007
Quaternary Look-Up Tables Using Voltage-Mode CMOS Logic Design
Ricardo Cunha
,
H. Boudinov
,
L. Carro
IEEE International Symposium on Multiple-Valued…
2007
Corpus ID: 19384281
Data processing optimization is one of the main concerns for developing of multiple-valued logic. An advantage could be achieved…
Expand
Highly Cited
2005
Highly Cited
2005
Hardware-efficient distributed arithmetic architecture for high-order digital filters
H. Yoo
,
David V. Anderson
Proceedings. (ICASSP '05). IEEE International…
2005
Corpus ID: 3250083
The paper presents a new memory-efficient distributed arithmetic (DA) architecture for high-order FIR filters. The proposed…
Expand
Highly Cited
2003
Highly Cited
2003
Towards Semantic Web Information Extraction
Borislav Popov
,
A. Kiryakov
,
D. Manov
,
A. Kirilov
,
Damyan Ognyanoff
,
Miroslav Goranov
2003
Corpus ID: 18426229
The approach towards Semantic Web Information Extraction (IE) presented here is implemented in KIM – a platform for semantic…
Expand
Highly Cited
1999
Highly Cited
1999
Design of low-power ROM-less direct digital frequency synthesizer using nonlinear digital-to-analog converter
S. Mortezapour
,
Edward K. F. Lee
IEEE J. Solid State Circuits
1999
Corpus ID: 62563544
A design technique that uses nonlinear digital-to-analog converter (DAC) for implementing low-power direct digital frequency…
Expand
Highly Cited
1997
Highly Cited
1997
Probability-based collision alerting logic for closely-spaced parallel approach
B. Carpenter
,
J. Kuchar
1997
Corpus ID: 3483612
A prototype airborne collision alerting logic was developed for aircraft on approach to closely-spaced parallel runways. A novel…
Expand
Highly Cited
1991
Highly Cited
1991
An adaptive RAM-DFE for storage channels
K. Fisher
,
J. Cioffi
,
W. Abbott
,
P. Bednarz
,
C. M. Melas
IEEE Transactions on Communications
1991
Corpus ID: 31587866
A modification of the decision feedback equalizer (DFE), RAM-DFE, is presented and analyzed for use in channels with trailing…
Expand
Highly Cited
1983
Highly Cited
1983
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
E. Fiume
,
A. Fournier
,
L. Rudolph
International Conference on Computer Graphics and…
1983
Corpus ID: 14310429
Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel…
Expand
Highly Cited
1981
Highly Cited
1981
Computer Architectures for Pictorial Information Systems
P. Danielsson
,
S. Levialdi
Computer
1981
Corpus ID: 14554894
In the international search for the optimal image processing computer architecture, image parallelism is the key to cost…
Expand
Highly Cited
1977
Highly Cited
1977
A high-speed low-cost recursive digital filter using residue number arithmetic
M. Soderstrand
Proceedings of the IEEE
1977
Corpus ID: 33920842
Use of table look-up multiplication by fractional coefficients allows implementation of high-speed, low-cost recursive digital…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE