C Programming: Bit Manipulation for Embedded Systems 🎯

Welcome to this comprehensive guide on C Bit Manipulation, tailored for embedded systems! In this tutorial, we'll dive deep into the fascinating world of bit manipulation, learning how to work with individual bits in a more efficient way for your embedded projects. 💡

What is Bit Manipulation?

Bit manipulation is the practice of directly accessing, setting, and modifying individual bits (0s and 1s) within a binary number. In C, bit manipulation is performed using bitwise operators. 📝

Important Bitwise Operators 💡

Bitwise AND (&): Produces a bit-by-bit logical AND of the two operands.
Bitwise OR (|): Produces a bit-by-bit logical OR of the two operands.
Bitwise XOR (^): Produces a bit-by-bit exclusive OR of the two operands.
Bitwise NOT (~): Inverts all the bits of the operand.
Left Shift (<<): Shifts the bits of the operand to the left by the specified number of positions.
Right Shift (>>): Shifts the bits of the operand to the right by the specified number of positions.

Practical Example 💡

Let's consider a practical example to better understand bit manipulation. Suppose we have an 8-bit binary number 01011011 and we want to perform various bitwise operations.

#include<stdio.h>

int main() {
    unsigned int num = 0b01011011;  // Using binary literal
    unsigned int mask;

    printf("Original number: %d (binary: %o)\n", num, num);

    // Bitwise AND
    mask = 0b00001111;  // Mask for last 4 bits
    num &= mask;
    printf("Bitwise AND: %d (binary: %o)\n", num, num);

    // Bitwise OR
    mask = 0b11110000;  // Mask for first 4 bits
    num |= mask;
    printf("Bitwise OR: %d (binary: %o)\n", num, num);

    return 0;
}

Quiz 📝

Advanced Bitwise Techniques 💡

Toggling a Bit: To toggle a specific bit, perform a bitwise XOR with 1 (^= 1).
Counting Set Bits: Use bitwise AND with a mask (1010) and then count the number of times the result equals the mask.
Swapping Two Numbers: Using a temporary variable and XOR.
Checking If a Number is Even or Odd: By performing bitwise AND with 1 and checking the result.

Practical Example 💡

Let's implement a function to count the number of set bits (1s) in an integer.

#include<stdio.h>

int countBits(unsigned int num) {
    int count = 0;

    while (num) {
        num &= (num - 1);
        count++;
    }

    return count;
}

int main() {
    unsigned int num = 0b11110101;
    printf("Number of set bits: %d\n", countBits(num));

    return 0;
}

Quiz 📝

Happy learning, and remember to practice, practice, practice! 🤖🚀