Template:LUT: Difference between revisions
mNo edit summary |
m examples |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
; '''Lookup table''' | ; '''Lookup table''' | ||
: In ''Logic World'', a '''Lookup table''' ('''LUT''') is a circuit that explicitly encodes all possible input cases | : In ''Logic World'', a '''Lookup table''' ('''LUT''') is a circuit that explicitly encodes all possible input cases and assigns a specific output to each case. | ||
: The output may be a single bit or a pattern of bits. | : The output may be a single bit or a pattern of bits. | ||
: | : Examples: | ||
:* read-only memory ([[ROM]]) (general example) | |||
:* storing characters for a screen (particular example) | |||
:* a hard-coded complex formula | |||
Latest revision as of 16:53, 10 September 2025
- Lookup table
- In Logic World, a Lookup table (LUT) is a circuit that explicitly encodes all possible input cases and assigns a specific output to each case.
- The output may be a single bit or a pattern of bits.
- Examples:
- read-only memory (ROM) (general example)
- storing characters for a screen (particular example)
- a hard-coded complex formula