Scribd
Upload
8 views16 pages

Dit 705 - DSP - 6

The document outlines a course on digital signal processing including topics like introduction to DSP, processing analog signals, discrete Fourier transform, digital filters, DSP architecture, fixed point and floating point number formats, and practical MATLAB applications. It discusses fixed point and floating point number representations, explaining that fixed point represents numbers using integers while floating point uses a mantissa and exponent. It provides an example of fixed point number representation and 2's complement arithmetic operations.

Uploaded by

fydatascience
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views16 pages

Dit 705 - DSP - 6

The document outlines a course on digital signal processing including topics like introduction to DSP, processing analog signals, discrete Fourier transform, digital filters, DSP architecture, fixed point and floating point number formats, and practical MATLAB applications. It discusses fixed point and floating point number representations, explaining that fixed point represents numbers using integers while floating point uses a mantissa and exponent. It provides an example of fixed point number representation and 2's complement arithmetic operations.

Uploaded by

fydatascience
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

DIGITAL SIGNAL PROCESSING

Course Code: DIT 705

Lecturer: ONU, Praise I.

Centre for Information and Telecommunication


Engineering

University of Port Harcourt


DIGITAL SIGNAL PROCESSING
OUTLINE
 INTRODUCTION TO DSP
 PROCESSING ANALOG SIGNALS
 ANALYTICAL TOOLS
 DISCRETE FOURIER TRANSFORM
 DIGITAL FILTERS
 DSP ARCHITECTURE
 FIXED POINT NUMBER FORMAT
 FLOATING POINT NUMBER FORMAT
 PRACTICAL MATLAB APPLICATION
FIXED-POINT AND FLOATING-POINT FORMATS
In order to process real-world data, we need to select an appropriate DS processor, as well as a
DSP algorithm(s) for a certain application. Whether a DS processor uses a fixed-point or floating-
point method depends on how the processor’s CPU performs arithmetic. A fixed-point DS
processor represents data in 2’s complement integer format and manipulates data using integer
arithmetic, while a floating-point processor represents numbers using a mantissa (fractional part)
and an exponent in addition to the integer format and operates data using floating-point
arithmetic.

There are two major approaches to store real numbers (i.e., numbers with fractional component)
in modern computing. These are:
1. Fixed Point representation: this has a fixed number of digits after the decimal point.
2. Floating Point representation: number allows for a varying number of digits after the decimal
point
FIXED-POINT NUMBER REPRESENTATION
This format is designed to represent and manipulate integers
(positive or negative whole numbers) in a minimum of 16-bits,
that is; 216 = 65,536 possible bits patterns. From the 16-bits, it
reserves 1-bit for the sign part, the 15-bit for the integer and 16-
bits for the fraction part.
In fixed-point representation, the negative sign (-) is represented
as (1) in binary while the positive sign (+) is represented as (0) in
binary.
There are three parts of a fixed-point number
representation: the sign field, integer field, and fractional
field.

2’s complementation representation is mostly used and


preferred in computer system because of it’s unambiguous
property and it’s easier for arithmetic operations.
Example 3:
Given
1. 2 x (– 1)
2. 2 x (– 2)
3. 2 x (– 3)
Operate each using its 2’s complement.
Solution
From the 2’s complement table;
Note: since it’s a 3-bits operation, the final answer must be a 3-bits binary value, that is; the extended sign bits has to be removed.
4. 2 x (– 1) = – 2
010
x 001
010
000
+ 000 .
00010
From Step 2: The 2’s complement of 00010 = 11101.
By removing the extended sign bits gives = 101
From Step 3: Adding binary logic 1; 101 = 110
From the table, 110 = – 2 which is within the system.
2. 2 x (– 2) = – 4 3. 2 x ( – 3) = – 6
010 010
x 011
x 110
010
000 010
010 +000 .
+010 . 00110
01100 From Step 2: The 2’s complement of 00110 =
The 2’s complement of 01100 = 10011. 11001.
By removing the extended sign bits gives
By removing the extended sign bits
= 001
gives = 011 From Step 3: Adding binary logic 1; 001 =
Adding binary logic 1; 011 = 100 010
From the table, 100 = – 4 which is From the table, 010 = 2 which is not – 6 and
within the system will result to an overflow as the multiplication
THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy