Skip to main content

Why Do We Add 6 to AL in BCD Arithmetic?


Why Do We Add 6 to AL in BCD Arithmetic?

One of the most common questions when studying the Intel 8086 and BCD (Binary-Coded Decimal) arithmetic is:

Why do we add 06H to AL after certain additions?

The answer lies in the difference between binary numbers and BCD numbers.

BCD vs Binary Representation

A single BCD digit can represent only decimal values from 0 to 9.

System Range Binary Values
BCD Digit 0 – 9 0000 to 1001
4-bit Binary 0 – 15 0000 to 1111

Therefore, the following binary values are invalid BCD digits:

1010 = 10
1011 = 11
1100 = 12
1101 = 13
1110 = 14
1111 = 15
    

The Mathematical Reason

In BCD, after digit 9 comes decimal 10. However, in binary, the next value after 9 is still represented within the same nibble.

The correction value is obtained from:

16 - 10 = 6
    

Since a 4-bit nibble naturally rolls over at 16, adding 6 (06H) forces the binary result into a valid BCD format and generates the proper decimal carry.

BCD Correction Rule:
If a BCD digit becomes greater than 9, add 06H.

Example 1: 8 + 5

Step 1: Binary Addition

  1000   (8)
+ 0101   (5)
-------
  1101   (13)
    

The result 1101 equals decimal 13, which is not a valid single BCD digit.

Step 2: Add 06H

  1101
+ 0110
-------
1 0011
    

The carry becomes the tens digit and 0011 becomes the units digit.

0001 0011 = BCD 13
    
Result: Decimal 13 is correctly represented as BCD 0001 0011.

Example 2: 9 + 8

Binary Addition

  1001   (9)
+ 1000   (8)
-------
10001   (17)
    

Since the decimal value exceeds 9, a BCD correction is required.

After decimal adjustment, the result becomes:

0001 0111
    

Which represents:

17
    

How the DAA Instruction Uses This Rule

The Intel 8086 provides the DAA (Decimal Adjust after Addition) instruction to perform this correction automatically.

MOV AL,08H
ADD AL,05H
DAA
    
Step AL Value
After ADD 0DH
After DAA 13H

The DAA instruction detects that the lower nibble exceeds 9 and automatically adds 06H to produce a valid packed BCD result.

Visual Explanation

Binary Result 1101 + Add 0110 = Valid BCD 0001 0011

Key Takeaway

A 4-bit binary digit can represent values from 0 to 15, but a BCD digit can represent only 0 to 9. Whenever a BCD digit exceeds 9, adding 06H converts the invalid binary value into a valid BCD representation while generating the correct decimal carry.

Formula:

Correction = 16 - 10 = 6
        

This is the fundamental reason why the Intel 8086 DAA instruction adds 06H to AL during BCD adjustment.



Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. 📘 Overview 🧮 Encoding 🧩 Decoding 📚 Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator đŸ“ļ FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) đŸ“Ĩ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Sol...

Gaussian minimum shift keying (GMSK)

📘 Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK 📚 Simulation Results for GMSK 📚 Q & A and Summary 📚 Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: θ(t) = 2Ī€h ∫ 0 t m filtered (Ī„) dĪ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ī€)) ∫ₓ∞ e^(-t² / 2) dt The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...