Memory Sizing for an 8 Bit Multiplier
High-speed digital systems often replace complex combinational logic with pre-computed lookup tables stored in Read-Only Memory. The system under analysis requires an unsigned 8-bit multiplier implemented entirely as a ROM lookup table.
The inputs are two 8-bit operands, A and B. The output is the full-precision product P. The ROM must contain every possible pre-calculated product for these two inputs.
Determine the required ROM dimensions and total memory capacity. Calculate the exact address width, data width, and total bit count required to store every possible product without overflow.
Constraints
- The inputs
AandBare unsigned 8-bit integers. - The output
Pmust capture the maximum possible product without truncation. - Memory capacity calculations must account for total bits, not just addressable words.
Topics
Solve this problem
Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.
This problem is part of Codiode Pro. The statement above is free to read.
The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.