- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Fixed-point is an elementary and simple method to define factorial numbers. The fixed-point numbers help a constant amount of bits. The “fixed-point” defines the decimal point of a number. There is no free symbol to name where the decimal point promote. But, in binary, bits can either be 0 or 1.

Fixed-point representation has a radix point known as decimal point. Fixed-point numbers having decimal points at the right end of the number are treated as integers because the fixed-point numbers having decimal points at the left end of the number are treated as fractions. In this method, the decimal point position is settled because the number saved in the memory is considered as an integer or as a fraction.

The binary numbers that are unsigned are continually considered as positive integers and are defined as 0s in the MSB. The binary numbers that are registered contrast for negative numbers and are defined as 1s in the MSB.

The magnitude of the signed binary numbers can be described using three methods are as follows −

In this method, the leftmost bit in the number is used for denoting the sign; 0 denotes a positive integer, and 1 denotes a negative integer. The remaining bits in the number provide the magnitude of the number.

**Example** − -2410 is defined as −

10011000

In this example, the leftmost bit 1 means negative, and the magnitude is 24.

The magnitude for both positive and negative values is equal, but they alter only with their signs.

The range of values for the sign and magnitude representation is from -127 to 127.

In this representation, a negative value is received by taking the 1’s complement of the equivalent positive number. It can add a signed 1’s complement method creates end carry during arithmetic operation that cannot be rejected.

The range of values for the signed 1’s complement representation is from -127 to 128.

**Example** − Consider 8-bit numbers for 1’s complement.

(29)_{10} = (00011101)_{2} = 0000111011’s complement for positive value

-(29)_{10} = -(00011101)_{2} = 111100010 1’s complement for negative value

In signed 2’s complement representation, the 2’s complement of a number is discovered by first creating the 1’s complement of that number, then incrementing the result by 1.

The range of values for the signed 2’s complement representation is from -128 to 127.

**Example** − Consider 8-bit numbers for 2’s complement.

(29)_{10}= (00011100)_{2} = (000011100)2’s1’s complement for positive value

-(29)_{10} = -(00011100)_{2} = (11110010)2’s1’s complement for negative value

- Related Questions & Answers
- What is Floating-Point Representation in Computer Architecture?
- What is Computer Network Architecture?
- What is Pipelining in Computer Architecture?
- What is Latches in Computer Architecture?
- What is Hector in Computer Architecture?
- What is Dispatch policy in Computer Architecture?
- What is Bus Transfer in Computer Architecture?
- What is Instruction Mapping in Computer Architecture?
- What is Vector Processing in Computer Architecture?
- What is Instruction Pipeline in Computer Architecture?
- What is RISC Pipeline in Computer Architecture?
- What is Binary Incrementer in Computer Architecture?
- What is Memory Transfer in Computer Architecture?
- What is Address Sequencing in Computer Architecture?
- What is Instruction Cycle in Computer Architecture?

Advertisements