95-1 Under-Graduate Project Fixed-point Analysis

Slides:



Advertisements
Similar presentations
FINITE WORD LENGTH EFFECTS
Advertisements

1 Final project Speaker: Team 5 電機三 黃柏森 趙敏安 Mentor : 陳圓覺 Adviser: Prof. An-Yeu Wu Date: 2007/1/22.
LSU 06/04/2007Electronics 71 Analog to Digital Converters Electronics Unit – Lecture 7 Representing a continuously varying physical quantity by a sequence.
© 2003 Xilinx, Inc. All Rights Reserved Looking Under the Hood.
DFT Filter Banks Steven Liddell Prof. Justin Jonas.
Introduction SYSC5603 (ELG6163) Digital Signal Processing Microprocessors, Software and Applications Miodrag Bolic.
An Energy-Efficient Reconfigurable Multiprocessor IC for DSP Applications Multiple programmable VLIW processors arranged in a ring topology –Balances its.
Mark Allie comp.dsp Signal to Noise and Numeric Range issues for Direct Form I & II IIR Filters on Modern Analog Devices and TI Digital Signal Processors.
Binary Real Numbers. Introduction Computers must be able to represent real numbers (numbers w/ fractions) Two different ways:  Fixed-point  Floating-point.
Graduate Category: Engineering and Technology Degree Level: Ph.D. Abstract ID# 122 On-Chip Spectral Analysis for Built-In Testing and Digital Calibration.
By Grégory Brillant Background calibration techniques for multistage pipelined ADCs with digital redundancy.
1HSSPG Georgia Tech High Speed Image Acquisition System for Focal-Plane-Arrays Doctoral Dissertation Presentation by Youngjoong Joo School of Electrical.
Floating-point to fixed-point code conversion with variable trade-off between computational complexity and accuracy loss Alexandru Bârleanu, Vadim Băitoiu.
COMMUNICATION SYSTEM EEEB453 Chapter 5 (Part IV) DIGITAL TRANSMISSION.
Zetex Switching Audio Amplifiers
Fast Memory Addressing Scheme for Radix-4 FFT Implementation Presented by Cheng-Chien Wu, Master Student of CSIE,CCU 1 Author: Xin Xiao, Erdal Oruklu and.
Complexity of Algorithms
J. Greg Nash ICNC 2014 High-Throughput Programmable Systolic Array FFT Architecture and FPGA Implementations J. Greg.
Recursive Average The recursive average is a very efficient way to obtain a time-weighted average by low-pass filtering the signal. y[n] = (1-a)y[n-1]
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-Graduate Project Improving Timing, Area, and Power Speaker: 黃乃珊 Adviser: Prof.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-Graduate Project Case Study: Single-path Delay Feedback FFT Speaker: Yu-Min.
1 Quantization Error Analysis Author: Anil Pothireddy 12/10/ /10/2002.
Automatic Evaluation of the Accuracy of Fixed-point Algorithms Daniel MENARD 1, Olivier SENTIEYS 1,2 1 LASTI, University of Rennes 1 Lannion, FRANCE 2.
CSCI1600: Embedded and Real Time Software Lecture 14: Input/Output II Steven Reiss, Fall 2015.
Speaker: Darcy Tsai Advisor: Prof. An-Yeu Wu Date: 2013/10/31
Project Proposal Audio Compression Variants
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Under-Graduate Project Adviser: Prof. An-Yeu Wu Mentor: 詹承洲 第二組 溫仁揚 溫昌懌.
A New Class of High Performance FFTs Dr. J. Greg Nash Centar ( High Performance Embedded Computing (HPEC) Workshop.
Chapter 6 Discrete-Time System. 2/90  Operation of discrete time system 1. Discrete time system where and are multiplier D is delay element Fig. 6-1.
EC1358 – DIGITAL SIGNAL PROCESSING
Real time DSP Professors: Eng. Julian Bruno Eng. Mariano Llamedo Soria.
Real-time Digital Signal Processing Digital Filters.
1 Paper reading A New Approach to FFT Processor Speaker: 吳紋浩 第六組 洪聖揚 吳紋浩 Adviser: Prof. Andy Wu Mentor: 陳圓覺.
MECH 373 Instrumentation and Measurements
SE40 Meeting on Pseudolites JRC test results
Final Project Report 64 points FFT
Parallel Beam Back Projection: Implementation
The Johns Hopkins University
Lattice Struture.
Dynamic Specifications
Fixed-pointed FFT model
High speed 12 bits Pipelined ADC proposal for the Ecal
Supervised Learning Based Model for Predicting Variability-Induced Timing Errors Xun Jiao, Abbas Rahimi, Balakrishnan Narayanaswamy, Hamed Fatemi, Jose.
Basics of Converter Technology
102-1 Under-Graduate Project Techniques in VLSI design
Building a Fuzzy Expert System
Analog to Digital Converters Electronics Unit – Lecture 7
Oversampling A/D Conversion
Centar ( Global Signal Processing Expo
Lesson 3: op amp fundamentals and open loop applications
A New Approach to Pipeline FFT Processor
101-1 Under-Graduate Project Techniques in VLSI design
Chapter 6 Discrete-Time System
Submission Title: FPP-SUN Bad Urban GFSK vs OFDM
Finite Wordlength Effects
Arithmetic Sequences:
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Conceptual Representation of A/D Conversion
Data Wordlength Reduction for Low-Power Signal Processing Software
C Model Sim (Fixed-Point) -A New Approach to Pipeline FFT Processor
Description and Analysis of MULTIPLIERS using LAVA
Visit for more Learning Resources
Speaker: Yumin Adviser: Prof. An-Yeu Wu Date: 2013/10/24
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
95-1 Under-Graduate Project Paper Reading Presentation
Introduction SYSC5603 (ELG6163) Digital Signal Processing Microprocessors, Software and Applications Miodrag Bolic.
Fixed-point Analysis of Digital Filters
Introduction SYSC5603 (ELG6163) Digital Signal Processing Microprocessors, Software and Applications Miodrag Bolic.
Speaker: Chris Chen Advisor: Prof. An-Yeu Wu Date: 2014/10/28
Presentation transcript:

95-1 Under-Graduate Project Fixed-point Analysis Speaker: 陳柏偉 許名宏 Advise: Prof. An-Yeu Wu Mentor: 陳彥良 Date: 2006/12/13 2019/5/2

Outline Major Idea of Quantization Upper Bounds Analysis Wordlength Simulation Design Guideline Efficient Hardware Design RTL of 64-Points Single-Path Delay Feedback FFT Conclusion Future work Reference 2019/5/2

Major Idea of Quantization Suppose we fixed fractional part to N bits. Input = data we want to fix. output = fixed Input. Output = 0; if input >= 2^(N-1) input = input-2^(N-1); output = output+2^(N-1); N = N-1; else 2019/5/2

Analysis Before Simulation SQNR : Signal-to-Quantization-Noise-Ratio. 2019/5/2

Wordlength Range II=3 IF=7~10 OI=9 OF=7~10 W=6~13 integer fractional input II=3 IF=7~10 output OI=9 OF=7~10 twiddle W=6~13 Input part :10~14. Output part : 16~20. Twiddle factor : 6~13. Adder (BFI,BFII) : a bit more than its input. Multiplier : the same as output . 2019/5/2

Finding Upper Bounds (1/2) Input power : Noise power : For ideal output and twiddle factor, 2019/5/2

Finding Upper Bounds (2/2) Twiddle factor : We can also get 2019/5/2

We expect SQNR to raise 6dB when one more bit was added. Upper Bound Result IF(W=100,OF=100) W(IF=100,OF=100) OF(IF=100,W=100) 7 53.6274 40.7102 63.3292 8 60.2816 48.5294 68.5003 9 65.7065 55.3693 74.6894 10 72.14 61.0832 80.2157 11 77.9648 68.1456 86.617 We expect SQNR to raise 6dB when one more bit was added. 2019/5/2

Wordlength Simulation(1/3) Fixed number of bits in fractional part of input data : 10 Twiddle factor : 6~13 Fractional part of output data : 7~11 SQNR (dB) Output fractional bits Twiddle factor bits 2019/5/2

Wordlength Simulation(2/3) SQNR (dB) Fixed number of bits in twiddle factor : 11 Fractional part of input data : 7~11 Fractional part of output data : 7~11 input fractional bits Output fractional bits 2019/5/2

Wordlength Simulation(3/3) Fixed number of bits in fractional part of output data : 10 Twiddle factor : 6~13 Fractional part of input data : 7~11 SQNR (dB) Twiddle factor bits input fractional bits 2019/5/2

Hardware Cost V.S. Accuracy(1/2) Fix W= 11 & OF=8 or 9 , plot relations between IF bits & SQNR. Starts to saturate Starts to saturate 2019/5/2

Hardware Cost V.S. Accuracy(2/2) Fix OF= 8 & IF=7 or 8 , plot relations between W bits & SQNR. . Starts to saturate Starts to saturate 2019/5/2

Design Guideline Concluding from the former simulations ,we can discover: When W is 2 bits higher than IF, then SQNR arise little when adding bits to W; when IF is 1~2 bit(s) higher than OF, then SQNR arise little when adding bits to IF. 2019/5/2

Efficient Hardware Design We want to use least resources to achieve acceptable performance. While trading off between accuracy and speed (resources), we found under IF=> 8 bits, W=>10 bits, OF=>7 bits, SQNR ~ 54 dB we can receive what we want (SQNR>50dB). 2019/5/2

RTL of 64-Points Single-Path Delay Feedback FFT input output 2019/5/2

Confirming Results 2019/5/2

Conclusion SQNR arise 6dB when one more bit is added. Knowing whether it’s worth adding one more bit to improve accuracy without actual simulation. An efficient design which meets the condition SQNR > 50dB would be IF=> 8 bits, W=>10 bits, OF=>7 bits. 2019/5/2

Future work Flexible bits (64, 128, and 256-points) RTL design improvement : timing & area Memory reduction of twiddle factor 2019/5/2

Reference [1] Discrete-time signal process 2nd edition A.V. Oppenheim R.W Schafer. Prentice Hall ,February 15, 1999. [2]D. Menard, R. Rocher, P. Scalart and O. Sentieys. “Automatic SQNR Determination in Non-Linear and Non-Recursive Fixed-Point System.”http://www.eurasip.org/content/Eusipco/2004/defevent/papers/cr1392.pdf Matlab: http://webclass.ncu.edu.tw/~junwu/index.html http://www.cs.nthu.edu.tw/~jang/mlbook/ SQNR: http://www.answers.com/topic/sqnr http://www.csie.mcu.edu.tw/~wangch/video/video6.ppt http://www.engineer.tamuk.edu/SPark/chap6.pdf 2019/5/2