Fixed-pointed FFT model

Slides:



Advertisements
Similar presentations
Microcomputer Systems 1
Advertisements

Integer & Fixed Point Addition and Multiplication CENG 329 Lab Notes By F. Serdar TAŞEL.
Fixed Point Numbers The binary integer arithmetic you are used to is known by the more general term of Fixed Point arithmetic. Fixed Point means that we.
1 Final project Speaker: Team 5 電機三 黃柏森 趙敏安 Mentor : 陳圓覺 Adviser: Prof. An-Yeu Wu Date: 2007/1/22.
Registers and Ranges. Register – Compared to a Calculator If there are only 9 digits available on display how long can the number displayed be? ANS: 9.
© 2003 Xilinx, Inc. All Rights Reserved Looking Under the Hood.
CENG536 Computer Engineering Department Çankaya University.
Floating Point Numbers
High Precision Calculation of the Digamma Function Mohammad I Rafiq School of Computer Science, Carnegie Mellon University Research Advisor : Dr. Victor.
2-1 Computer Organization Part Fixed Point Numbers Using only two digits of precision for signed base 10 numbers, the range (interval between lowest.
DSP Systems Implementation Course Seminar Tehran University Electrical And Computer Engineering Department Spring 2004.
Floating Point Numbers
Computer ArchitectureFall 2008 © August 25, CS 447 – Computer Architecture Lecture 3 Computer Arithmetic (1)
Computer Arithmetic Integers: signed / unsigned (can overflow) Fixed point (can overflow) Floating point (can overflow, underflow) (Boolean / Character)
Lecture 8 Floating point format
Math – Getting Information from the Graph of a Function 1.
Simple Data Type Representation and conversion of numbers
Binary Real Numbers. Introduction Computers must be able to represent real numbers (numbers w/ fractions) Two different ways:  Fixed-point  Floating-point.
Number Systems II Prepared by Dr P Marais (Modified by D Burford)
Under-Graduate Project Mid-Term Paper Reading Presentation Adviser: Prof. An-Yeu Wu Mentor: 詹承洲 第二組 溫仁揚 溫昌懌.
Computer Arithmetic Programming in C++ Computer Science Dept Va Tech August, 2000 © Barnette ND, McQuain WD, Keenan MA 1 Independent Representation.
HW/SW PARTITIONING OF FLOATING POINT SOFTWARE APPLICATIONS TO FIXED - POINTED COPROCESSOR CIRCUITS - Nalini Kumar Gaurav Chitroda Komal Kasat.
The Teacher CP4 Binary and all that… CP4 Revision.
1 C.H. Ho © Rapid Prototyping of FPGA based Floating Point DSP Systems C.H. Ho Department of Computer Science and Engineering The Chinese University of.
Number System. Number Systems Important Number systems – Decimal – Binary – Hexadecimal.
The Teacher CP4 Binary and all that… CP4 Revision.
Introduction to structured VLSI Projects 4 and 5 Rakesh Gangarajaiah
Design of a High-Throughput Low-Power IS95 Viterbi Decoder Xun Liu Marios C. Papaefthymiou Advanced Computer Architecture Laboratory Electrical Engineering.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Undergraduate Projects Speaker: Wes Adviser: Prof. An-Yeu Wu Date: 2015/09/22 Lab.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-Graduate Project Case Study: Single-path Delay Feedback FFT Speaker: Yu-Min.
IEEE Arithmetic UC Berkeley Fall 2004, E77 Copyright 2005, Andy Packard. This work is licensed under the Creative.
The Instruction Set Architecture. Hardware – Software boundary Java Program C Program Ada Program Compiler Instruction Set Architecture Microcode Hardware.
Speaker: Darcy Tsai Advisor: Prof. An-Yeu Wu Date: 2013/10/31
IT11004: Data Representation and Organization Floating Point Representation.
Under-Graduate Project Adviser: Prof. An-Yeu Wu Mentor: 詹承洲 第二組 溫仁揚 溫昌懌.
1. TMS320C6X DSP Programming with Simulink – TI C6000 DSP Target i) TI C6000 DSP target enables simulink blocks to model or program signal processing algorithm.
An FFT for Wireless Protocols Dr. J. Greg Nash Centar ( HAWAI'I INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES Mobile.
1 Paper reading A New Approach to FFT Processor Speaker: 吳紋浩 第六組 洪聖揚 吳紋浩 Adviser: Prof. Andy Wu Mentor: 陳圓覺.
Chapter 2 Errors in Numerical Methods and Their Impacts.
Dr.Faisal Alzyoud 2/20/2018 Binary Arithmetic.
Final Project Report 64 points FFT
Introduction To Computer Science
Greedy Algorithm.
Outline Introduction Floating Point Arithmetic Adder Multiplier.
Lecture2.
Lecture 10: Floating Point, Digital Design
Data Representation and Arithmetic Algorithms
Jeopardy Operations with Integers With Decimals Fractions Solving Word
A New Approach to Pipeline FFT Processor
Data Types.
1.6) Storing Integer:.
On-line arithmetic for detection in digital communication receivers
Data Representation and Arithmetic Algorithms
Numbers representations
C Model Sim (Fixed-Point) -A New Approach to Pipeline FFT Processor
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
UNIVERSITY OF MASSACHUSETTS Dept
Speaker: Yumin Adviser: Prof. An-Yeu Wu Date: 2013/10/24
95-1 Under-Graduate Project Fixed-point Analysis
UNIVERSITY OF MASSACHUSETTS Dept
95-1 Under-Graduate Project Paper Reading Presentation
Shift registers and Floating Point Numbers
Fixed-point Analysis of Digital Filters
IT11004: Data Representation and Organization
Speaker: Chris Chen Advisor: Prof. An-Yeu Wu Date: 2014/10/28
On-line arithmetic for detection in digital communication receivers
1.6) Storing Integer: 1.7) storing fraction:
Chapter 1 Introduction.
Presentation transcript:

Fixed-pointed FFT model Speaker & Reporter:洪聖揚 Adviser:Prof. An-Weu Wu Date:2006/12/11

Outline Floating point simulation Fixed point model with truncation SQNR with input, output and twiddle factor Optimize the choice of bits Conclusion

Simulation Use MATLAB compile BFI、BFII as module For loop as counter Input: (1)data input (2)Out of BFI (3)Register Output: (1)Output of BFI (2)Output of BFII (3)Output as Register input Register N/2 N/4 BF I BF II Function: BFI BFII Control by for loop s t Out of BFII Data input Out of BFI

Result Use fft function in MATLAB for verification

Outline Fixed point model with truncation Floating point simulation SQNR with input, output and twiddle factor Optimize the choice of bits Conclusion

Methodology of truncation Separate total bits into two parts : integer part and fraction part Inverse the digits to the decimation ;construct the truncated data Use the truncated data during the calculation

Code for Truncation Truncate data of abs(real(x)) and abs(imag(x)) Recovery the fraction data Recovery the signed data

Truncation Requirements Dynamic range for input data:[-4 4] Number of bits for input data:10~14 Number of bits for output data:16~20 Number of bits for twiddle factor: Designer-defined SQNR>=50dB

Definition of input and output Defined as Input Defined as Output of previous stage

Outline Floating point simulation Fixed point model with truncation SQNR with input, output and twiddle factor Optimize the choice of bits Conclusion

Intuition of integer part The input integer part should increasing 1 bit through the adder The integer part of twiddle factors can be reduced to 1 bits Input integer bits reduced to 3 bits ,as the final output integer bits reduced to 9 bits

More Integer, Less precision Output integer and total bit of input fixed, add input integer Input integer and total output bit fixed, add output integer Fixed integer output and total bit of input Fixed integer input and total bit of output

Intuition of fraction part There is much room for fraction bits decision Just compare output bit and twiddle factor to optimize the minimum bits. The fraction part dominates the precision of output

Tuning twiddle factoer… Fixed twiddle factor total:13 bit and 14 bit Use 1 bit to store integer data At total bits=12 At total bits=14

Saturation in twiddle factor Fixed twiddle factor total:13 bit and 14 bit Use 1bit to store integer part At total bits=14 At total bits=13

The Effect of input and output fraction total input bits:12bits,total output bits:18bits Integer fixed at 3 bit in input,9 bit in output ,1 bit in twiddle Twiddle factor fraction:8~16 bit At output total bits=18 At input total bits=12

After simulation analysis When twiddle factor increasing, SQNR is more higher, but saturation at total bit=16 When output fraction bit increasing - bits of twiddle is small, not obviously change in SQNR - bits of twiddle is large, SQNR is more higher

Outline Floating point simulation Fixed point model with truncation SQNR with input, output and twiddle factor Optimize the choice of bits Conclusion

Optimize the Choice of bits Requirement SQNR over than 50dB Better reducing bits of output than twiddle Choose fraction bits of output and input be equal or more Fixed twiddle factor at maximum to choose output minimum, then reduce twiddle factor.

Find possible region of input & output First, fixed twiddle factor at total bit=13 At total bits=13 Over than 50dB Possible output min

Find possible twiddle factor Second, fixed output and input at possible minimum region, find out the twiddle factor minimum. Ex. Fixed output at 8 fraction twiddle min Input min At fraction output=8

Choose of Optimal bits Result: Best Solution! Input Output Twiddle SQNR 10 16 48.3921 11 50.2602 17 51.4667 54.6418 18 51.8127 55.1741 12 51.8890 55.3209 Best Solution!

Conclusion and future Conclusion: 1.Finished floating and fixed point FFT model 2.Analyzed and optimize the bits for truncate input, output, and twiddle factor In future: --RTL code before 12/27 --synthesis as soon as possible…