Binary decoder outputs calculator

This calculator applies the fundamental relationship m = 2^n, then maps those unique selections onto an inclusive system address range. Enter the number of input or address lines and, if needed, the first address assigned to the device. The result gives the decoder notation, output count, number of unique addresses, and both decimal and hexadecimal range endpoints, making it useful for logic exercises and practical memory or peripheral address planning.

From input lines to decoder outputs

An n-line binary input can represent 2^n distinct bit patterns because every line independently has two states. A decoder assigns one output to each pattern, so an ideal full decoder requires m = 2^n outputs. For example, three input lines represent 000 through 111 and therefore drive eight mutually selectable outputs; this is called a 3-to-8 decoder. Four lines create sixteen patterns and a 4-to-16 decoder. Enter the number of input lines, address lines, or select lines as input_lines. The calculator returns output_lines and unique_addresses with the same value, as well as conventional decoder notation. This calculation assumes a full binary decoder rather than a partial device that deliberately omits combinations. Enable pins do not normally increase the number of decoded combinations: they control whether the device participates, while the n select inputs determine which one of the 2^n outputs is chosen. Cascaded decoders can still be analyzed by counting the effective independent select bits presented to the complete arrangement.

Reading the uniquely selected address range

In an address-decoding system, every decoder output can select one register, memory location, peripheral, or subordinate block. Therefore an n-input decoder can uniquely select 2^n consecutive addresses when its output positions correspond to the low-order address combinations. The optional base_address identifies the first location assigned to that block. The last location is base_address + 2^n - 1 because both endpoints are included. A four-line decoder based at decimal 4096, for example, covers sixteen addresses: 4096 through 4111, or 0x1000 through 0x100F. The response deliberately labels the range as inclusive and shows decimal and hexadecimal endpoints to reduce off-by-one mistakes. A count of sixteen does not end at base plus sixteen; it ends at base plus fifteen. If no base is supplied, zero is used, giving the canonical range 0 through 2^n - 1. The calculation describes the range capacity; actual hardware must also decode any higher-order address bits needed to establish the chosen base and prevent mirrored addresses.

Applying the result to real hardware

Use the output count when selecting a decoder IC, drawing truth tables, or deciding how many chip-select signals a set of address lines can provide. Use the address range when documenting a memory map or checking whether adjacent allocations overlap. The base address should match the system's placement of the decoded block, and alignment to the block size is often convenient because it makes the high-order bits constant throughout the range. However, this calculator permits any nonnegative base so it can also model exercises and unusual mappings. It accepts between one and fifty-two input lines and keeps every result within JavaScript's exact integer range. A request is rejected if the ending address would exceed that range, preventing a plausible-looking rounded endpoint. Remember that the mathematical decoder result does not describe electrical polarity, propagation delay, fan-out, enable behavior, or whether outputs are active-high or active-low. Those properties come from the selected component's data sheet. It also does not reserve space in a real system; it provides exact values for design and review. Automated API use is charged at $0.002 per request.