Explain fixed point representation, Computer Engineering

Assignment Help:

Q. Explain Fixed Point Representation?

The fixed-point numbers in binary has a sign bit. A positive number has a sign bit 0 whereas negative number has a sign bit 1. In fixed-point numbers we presume that position of binary point is at end that is after least significant bit. It means that all represented numbers will be integers. A negative number can be signified in one of the below ways:

  • Signed magnitude representation
  • Signed 1's complement representation
  • Signed 2's complement representation

(Assumption: size of register = 8 bits including sign bit)

Signed Magnitude Representation

2163_Explain Fixed Point Representation.png


Related Discussions:- Explain fixed point representation

Address fields and phone fields , Make a nested struct to store a person's ...

Make a nested struct to store a person's name, address, and phone numbers.  The struct should have 3 fields for the name, address, and phone. The address fields and phone fields wi

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

Which technique allows executing a program not in memory, A set of techniqu...

A set of techniques that allow executing a program which is not entirely in memory is called ? Ans. virtual memory which allows executing a program that is not entirely in me

Bi polar junction transistor, draw input and output charectoristics of BJT ...

draw input and output charectoristics of BJT and justify CE configuration provides large current amplification

What is memory interleaving, Q. What is Memory Interleaving? In this sc...

Q. What is Memory Interleaving? In this scheme main memory is splitted in 'n' equal-size modules and CPU has separate Memory Base register and Memory Address Register for every

Explain definition of fibonacci, Explain definition of fibonacci Where ...

Explain definition of fibonacci Where an input value gives a trivial result, it is returned directly, otherwise the function calls itself, passing a changed version of the inpu

What is software engineering, Software engineering is:- The application...

Software engineering is:- The application of a disciplined engineering move towards to the development of software systems. A body of information and knowledge in software d

Returns the information about tasks running, Returns the information about ...

Returns the information about tasks running int info = pvm_tasks( int where, int *ntask, struct pvmtaskinfo **taskp ) struct pvmtaskinfo {  int ti_tid; int ti_pt

Main features of TCP, The main features of TCP are: Reliability: TCP...

The main features of TCP are: Reliability: TCP makes sure that any data sent by a sender arrives at destination as it was sent. There can't be any data loss or change in the

Explain the term granularity, Granularity In 'Parallel computing', Gran...

Granularity In 'Parallel computing', Granularity can be defined as a qualitative assess of the ratio of computation to communication. 1) Coarse Granularity - relatively hug

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd