look-up table - meaning and definition. What is look-up table
Diclib.com
ChatGPT AI Dictionary
Enter a word or phrase in any language 👆
Language:

Translation and analysis of words by ChatGPT artificial intelligence

On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:

  • how the word is used
  • frequency of use
  • it is used more often in oral or written speech
  • word translation options
  • usage examples (several phrases with translation)
  • etymology

What (who) is look-up table - definition

ARRAY DATA STRUCTURE THAT REPLACES RUNTIME COMPUTATION WITH A SIMPLER ARRAY INDEXING OPERATION
Look-up table; Look up table; Look-up; Lookup; VLOOKUP; Table (computing); Table lookup; XLOOKUP
  • Part of a 20th-century table of [[common logarithm]]s in the reference book [[Abramowitz and Stegun]].
  • right
  • Red (A), Green (B), Blue (C) 16-bit lookup table file sample. (Lines 14 to 65524 not shown)

Lookup table         
In computer science, a lookup table (LUT) is an array that replaces runtime computation with a simpler array indexing operation. The process is termed as "direct addressing" and LUTs differ from hash tables in a way that, to retrieve a value v with key k, a hash table would store the value v in the slot h(k) where h is a hash function i.
lookup         
¦ noun [usu. as modifier] systematic electronic information retrieval.
colour look-up table         
  • An adaptive color palette expanding from 2 colors to 256 colors, demonstrating how the image changes (click to see animation).
IN COMPUTER GRAPHICS, A FINITE SET OF COLORS
Colour look-up table; Color lookup table; CLUT; Palette entry; Palette cell; Color table; Palette element; Colour Look Up Table; Color look-up table; Palette color; Color Look Up Table; PAL file; Color register; .pal

Wikipedia

Lookup table

In computer science, a lookup table (LUT) is an array that replaces runtime computation with a simpler array indexing operation. The savings in processing time can be significant, because retrieving a value from memory is often faster than carrying out an "expensive" computation or input/output operation. The tables may be precalculated and stored in static program storage, calculated (or "pre-fetched") as part of a program's initialization phase (memoization), or even stored in hardware in application-specific platforms. Lookup tables are also used extensively to validate input values by matching against a list of valid (or invalid) items in an array and, in some programming languages, may include pointer functions (or offsets to labels) to process the matching input. FPGAs also make extensive use of reconfigurable, hardware-implemented, lookup tables to provide programmable hardware functionality.