Let's Program the Transistors
Addition and subtraction of 2’s complement signed binary numbers are important learning concepts, as digital computers use 2’s complement representation. 2’s complement arithmetic follows all the basic rules of binary arithmetic. However, a few tricks need to be learned so that we can get the correct result in its 2’s complement form. This article discusses…
Read More “Addition of 2’s Complement Signed Binary Numbers” »
Binary arithmetic is essential in all digital computers and in many other types of digital systems. Now, since we know about different number systems and signed numbers, this is the right time to learn about binary arithmetic and the associated rules. First, we would learn about the basic rules of binary arithmetic, and solve some…
Using unsigned magnitude form, we can only represent the positive numbers. Whereas, using signed magnitude form, we can represent both positive as well as negative numbers. In this article, we will highlight a few differences between the signed and unsigned magnitude forms of representing binary numbers. Unsigned Magnitude Signed Magnitude What can be represented…
Read More “Unsigned Magnitude vs Signed Magnitude Representation” »
Now that we have learned about signed number binary representation, let’s discuss how to find out the decimal value of a signed binary number if the format of the representation is known. Sign-Magnitude Form: Example: An 8-bit binary number represented in sign-magnitude form is 10010101. Find the decimal value of the number. Answer: The given…
Read More “How to Calculate the Decimal Value of Signed Binary Numbers” »
Positive integers, including zero, can be represented as unsigned numbers. However, digital systems, such as the computer, must be able to handle both positive and negative numbers. To represent negative integers, we need a notation for negative values. In ordinary arithmetic, a negative number is indicated by a minus sign and a positive number by…
In a recent article, we have seen how to convert a binary number to its corresponding octal as well as hexadecimal number. However, in that article, we have considered the conversions for only the whole numbers. In this article, we will do the conversions for the binary fractional numbers. Following is the technique for such…
Read More “Binary to Octal and Binary to Hexadecimal Conversion for Fractional Number” »
Post-silicon debug (or post-silicon validation) is one of the important phase of the system design cycle. This is performed to capture the escaped design bugs from the pre-silicon verification phase. The major challenge associated with the post-silicon debug is the very limited observability and controllability inside the chip during the debug. Therefore, a few supporting…
Observability and Controllability are the terms that are frequently used for system validation. To validate a design, you must zero down all the existing functional bugs. Now, how to remove a bug from your design? For this, you need to know the reason and the location of the bug (or fault). This means you should…
In a recent article, we have seen how to convert any number system from decimal. However, there, we have only considered the whole numbers. In this article, we considered the decimal to binary conversion for the fractional number. Technique Example 6.2510 = ?2 Here, the whole number part = 6 The fractional part = 0.25…
Read More “Decimal to Binary Conversion for Fractional Number” »
In an earlier post, we have seen that how to convert any number system to decimal number system. However, that article presents the conversions only for the whole numbers. In this article, we will consider the fractional number system conversion. The following technique is used to convert any binary fractional number to its equivalent decimal…
Read More “Binary to Decimal Conversion for Fractional Number” »