Caculate 73 To 12 Bit 1s Complement

Calculatingthe 12‑bit 1’s Complement of the Decimal Number 73

The 12‑bit 1’s complement representation of a signed integer is a fundamental concept in digital systems, especially when dealing with signed binary arithmetic. This article explains how to calculate the 12‑bit 1’s complement of the decimal number 73 step by step, providing a clear rationale, a detailed procedure, and answers to common questions. By the end, you will be able to convert any positive decimal value into its 1’s complement form using a fixed‑width binary field, such as 12 bits.

Introduction

When computers store signed numbers, they often use complement representations to simplify arithmetic operations and to distinguish between positive and negative values. The 1’s complement method inverts every bit of the binary representation (0 becomes 1 and 1 becomes 0). For a positive number, the 1’s complement is identical to its ordinary binary form; for a negative number, it is obtained by inverting the bits of the corresponding positive value.

In this guide we focus on a specific example: calculating the 12‑bit 1’s complement of 73. Although 73 is a positive decimal number, understanding its 1’s complement representation is essential when we later need to represent its negative counterpart (‑73) or when we perform subtraction using complement arithmetic.

Step‑by‑Step Procedure

1. Convert the Decimal Number to Binary

The first step is to express 73 in base‑2. This involves repeated division by 2 and recording the remainders:

1. 73 ÷ 2 = 36 remainder 1
2. 36 ÷ 2 = 18 remainder 0
3. 18 ÷ 2 = 9 remainder 0
4. 9 ÷ 2 = 4 remainder 1
5. 4 ÷ 2 = 2 remainder 0
6. 2 ÷ 2 = 1 remainder 0
7. 1 ÷ 2 = 0 remainder 1 Reading the remainders from bottom to top yields the binary digits 1001001.

Note: The binary representation 1001001 contains only seven bits. Since we need a 12‑bit field, we must pad the left side with zeros to reach twelve positions.

2. Pad the Binary Number to 12 Bits

Adding leading zeros does not change the value but ensures a uniform width for all numbers in the same word size. The padded binary form of 73 is:

0000 1001 001```

For readability, we often group bits in nibbles (4‑bit groups):

0000 1001 0010 (12 bits total)

#### 3. Determine Whether Inversion Is Required  

In 1’s complement representation:

- **Positive numbers** are stored exactly as their binary equivalent.  
- **Negative numbers** are stored as the inverted bits of their absolute value.  

Since 73 is positive, its 1’s complement representation **remains the same** as the padded binary value. However, if we were asked to find the 1’s complement of **‑73**, we would invert every bit of the positive representation.

#### 4. (Optional) Invert the Bits for a Negative Value  

If the task were to obtain the 1’s complement of **‑73**, we would take the 12‑bit binary of 73 and flip each bit:

- Original 12‑bit binary: `0000 1001 0010`  
- Inverted bits: `1111 0110 1101`

Thus, the 1’s complement of ‑73 would be `1111 0110 1101`. This step is *not* required for the positive number itself, but it is crucial when dealing with negative values or when performing subtraction using complement addition.

### Scientific Explanation of 1’s Complement  The 1’s complement scheme derives its name from the mathematical concept of a *complement* that, when added to the original number, yields a power of the base (in binary, a power of 2). For an *n*-bit word, the complement of a number *x* is defined as:

1’s complement of x = (2^n – 1) – x

When *x* is positive, this operation effectively flips all bits. The result can be verified by adding the original binary number to its inverted version:

0000 1001 0010 (73)

• 1111 0110 1101 (inverted)

1 1111 1111 1111 (carry out, ignored in fixed‑width arithmetic)

The sum produces all 1’s, confirming that the inverted bits are indeed the 1’s complement.

### Frequently Asked Questions (FAQ)  

**Q1: Why do we need a fixed number of bits like 12?**  
A: Fixed‑width words simplify hardware design. Every register, ALU, and memory location operates on a predetermined number of bits, ensuring consistency across operations.

**Q2: Can the same method be used for other bit widths?**  
A: Absolutely. Whether you need an 8‑bit, 16‑bit, or 32‑bit representation, the steps remain identical: convert to binary, pad to the desired width, and optionally invert for negative values.

**Q3: What happens if the binary representation exceeds the allocated bits?**  
A: Overflow occurs. If a number requires more bits than the word size can hold, the most significant bits are discarded, leading to an incorrect result. Always verify that the value fits within the chosen width.

**Q4: How does 1’s complement differ from 2’s complement?**  A: In 1’s complement, negative zero (`111...111`) exists, whereas 2’s complement uses all zeros for zero. 2’s complement is more widely adopted because it eliminates the dual‑zero issue and provides a simpler addition rule.

**Q5: Is the 1’s complement of a positive number ever used in practice?**  
A: It is rarely used directly for storing positive values, but it becomes essential when performing subtraction via addition of the complement, or when converting between signed representations.

### Practical Example: Full Calculation  

Let’s walk through the entire process for **73** in a 12‑bit field: