A Reconfigurable FPGA Architecture for DSP Transforms Subramanian Rama Vishnu Vijayaraghavan.

Slides:



Advertisements
Similar presentations
[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Advertisements

David Hansen and James Michelussi
Informatik 4 Lab 1. Laboratory Exercise Overview 1. Define size of 20 radius vectors 2. DCT transformation 3. Create Microsoft Excel spreadsheet 4. Create.
1 Reconfigurable Computing Lab UCLA FPGA Polyphase Filter Bank Study & Implementation Raghu Rao Matthieu Tisserand Mike Severa Prof. John Villasenor Image.
Masters Presentation at Griffith University Master of Computer and Information Engineering Magnus Nilsson
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Image Compression System Megan Fuller and Ezzeldin Hamed 1.
Wireless Computer Networking Melanie Hanson May 6, 2002.
Digital Signal Processing and Field Programmable Gate Arrays By: Peter Holko.
6/11/2015 Adaptive Hardware Design for Digital Signal Processing Advisor: Dr. Thomas L. Stewart By: Prabjot Kaur Alex Tan.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Why Systolic Architecture ? VLSI Signal Processing 台灣大學電機系 吳安宇.
Applications of Systolic Array FTR, IIR filtering, and 1-D convolution. 2-D convolution and correlation. Discrete Furier transform Interpolation 1-D and.
Chapter 15 Digital Signal Processing
IUCEE Workshop presentation-YVJoshi VLSI Signal Processing Y. V. Joshi SGGS Institute of Engineering and Technology, Nanded.
Reconfigurable Computing S. Reda, Brown University Reconfigurable Computing (EN2911X, Fall07) Lecture 16: Application-Driven Hardware Acceleration (1/4)
An Analog Wavelet Transform CMOS Imager Chip
1 The Mathematics of Signal Processing - an Innovative Approach Peter Driessen Faculty of Engineering University of Victoria.
Orthogonal Transforms
1 A survey on Reconfigurable Computing for Signal Processing Applications Anne Pratoomtong Spring2002.
Using Programmable Logic to Accelerate DSP Functions 1 Using Programmable Logic to Accelerate DSP Functions “An Overview“ Greg Goslin Digital Signal Processing.
1 DSP Implementation on FPGA Ahmed Elhossini ENGG*6090 : Reconfigurable Computing Systems Winter 2006.
FPGA Based Fuzzy Logic Controller for Semi- Active Suspensions Aws Abu-Khudhair.
Prepared by: Hind J. Zourob Heba M. Matter Supervisor: Dr. Hatem El-Aydi Faculty Of Engineering Communications & Control Engineering.
Real time DSP Professors: Eng. Julian Bruno Eng. Mariano Llamedo Soria.
Processor Architecture Needed to handle FFT algoarithm M. Smith.
Implementation of OFDM Transmitter based on the IEEE d Standard Presented by: Altamash Janjua, Umar Chohan Supervisors: Dr. Brian L. Evans and Mr.
Cosc 4242 Signals and Systems Introduction. Motivation Modeling, characterization, design and analysis of natural and man-made systems General approaches.
SYSTEM-ON-CHIP (SoC) AND USE OF VLSI CIRCUIT DESIGN TECHNOLOGY.
EE302 Lesson 19: Digital Communications Techniques 3.
CS654: Digital Image Analysis Lecture 15: Image Transforms with Real Basis Functions.
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
CS654: Digital Image Analysis Lecture 12: Separable Transforms.
VLSI & ECAD LAB Introduction.
DIGITAL WATERMARKING SRINIVAS KHARSADA PATNAIK [1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN Presented by SRINIVAS KHARSADA PATNAIK ROLL.
200/MAPLD 2004 Craven1 Super-Sized Multiplies: How Do FPGAs Fare in Extended Digit Multipliers? Stephen Craven Cameron Patterson Peter Athanas Configurable.
High Performance Scalable Base-4 Fast Fourier Transform Mapping Greg Nash Centar 2003 High Performance Embedded Computing Workshop
Radix-2 2 Based Low Power Reconfigurable FFT Processor Presented by Cheng-Chien Wu, Master Student of CSIE,CCU 1 Author: Gin-Der Wu and Yi-Ming Liu Department.
Fast Fourier Transform & Assignment 2
DSP Algorithms on FPGA Part II Digital image Processing
Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.
Advanced Signal Processing Systems and Applications Main research areas Applications Applications –biomedical, media, communications, security Algorithms.
ECEn 191 – New Student Seminar - Session 6 Digital Logic Digital Logic ECEn 191 New Student Seminar.
A VLSI Architecture for the 2-D Discrete Wavelet Transform Zhiyu Liu Xin Zhou May 2004.
Fourier and Wavelet Transformations Michael J. Watts
Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.
VLSI Design of 2-D Discrete Wavelet Transform for Area-Efficient and High- Speed Image Computing - End Presentation Presentor: Eyal Vakrat Instructor:
SIMD Implementation of Discrete Wavelet Transform Jake Adriaens Diana Palsetia.
An FFT for Wireless Protocols Dr. J. Greg Nash Centar ( HAWAI'I INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES Mobile.
EC1358 – DIGITAL SIGNAL PROCESSING
VLSI SP Course 2001 台大電機吳安宇 1 Why Systolic Architecture ? H. T. Kung Carnegie-Mellon University.
AN ENHANCED LOW POWER HIGH SPEED ADDER FOR ERROR TOLERANT APPLICATIONS BY K.RAJASHEKHAR, , VLSI Design.
Low Power Design for a 64 point FFT Processor
Array Multiplier Haibin Wang Qiong Wu. Outlines Background & Motivation Principles Implementation & Simulation Advantages & Disadvantages Conclusions.
1 VLSI Algorithm & Computing Structures Chapter 1. Introduction to DSP Systems Younglok Kim Dept. of Electrical Engineering Sogang University Spring 2007.
بسم الله الرحمن الرحيم Lecture (1) Introduction to DSP Dr. Iman Abuel Maaly University of Khartoum Department of Electrical and Electronic Engineering.
An Example of 1D Transform with Two Variables
Fourier and Wavelet Transformations
A New Approach to Pipeline FFT Processor
Discrete Cosine Transform (DCT)
Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM
Hybrid Architecture of DCT/DFT/Wavelet Transform (HWT)
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Multiplier-less Multiplication by Constants
4. DIGITAL IMAGE TRANSFORMS 4.1. Introduction
Applications of Frequency Domain Processing
1-D DISCRETE COSINE TRANSFORM DCT
A Parallel Fast Fourier Transform for Millimeter-wave Applications
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Applications of Frequency Domain Processing
Presentation transcript:

A Reconfigurable FPGA Architecture for DSP Transforms Subramanian Rama Vishnu Vijayaraghavan

OUTLINE Motivation Reconfigurable FPGA’s DSP Transforms, Breakdown & Applications Communication Graphs& Proposed Architecture Imaginary Radix Complex Multiplication Accomplished Work Conclusion

Motivation Dedicated VLSI Architectures for Orthogonal Transforms – FFT, DCT, Convolution, Correlation Dedicated VLSI Architectures for Non- Orthogonal Transforms – Gabor, Wavelet Not many Architectures for Both – Current Day Applications like Handhelds, Mobile Phones, etc. require such DSP capabilities

Need for Reconfigurable Architecture Multiple Orthogonal & Non-Orthogonal Transforms can be broken down to a basic set of Building blocks (DCT,DST, multipliers and Adders) Handheld devices don’t require much Multiprocessing – No need to waste hardware Increased Fault-Tolerance By Reconfiguration and Redundancy

AREA & POWER INCREASING PROMINENCE OF PORTABLE SYSTEMS Cell Phones Personal Digital Assistants Tablet PC’s Need for Low Power & Area Battery Technology not kept pace with Semiconductor Technology

DISCRETE FOURIER TRANSFORM APPLICATIONS:  Image Processing  Orthogonal Frequency Division Multiplexing Traditional DFT Breakdown of 2D DFT Breakdown of 1D DFT

Discrete Gabor Transform Gabor Transform and Coefficients Breakdown Applications Speech Processing / Voice Recognition Image Compression

Discrete Convolution Applications Image Manipulation Sound Processing

2-D Fourier Transform

Convolution Operation

Convolution Operation (Contd.) Computational complexity: 2 DCT, 2 DST,4 real multiplications and 2 real additions

Imaginary Radix Representation A imaginary number system, Donald Knuth, Communications of the ACM Concept: a + ib = A – Interleave both real and Imaginary parts # of multiplications get reduced to one Preserve Interleaving even during multiplication Requires slight modifications in multiplier design (one reason for migrating to FPGA)

Convolution Operation (using Complex Representation) Computational complexity: 2 DCT, 2 DST,1 complex multiplication (same as real multiplication methodology)

Convolution using Complex Representation - Communication Graph

Gabor Transform Communication Graph

Reconfiguration

Work so far Design & Synthesis of Basic Building Blocks DCT DST Parallel Array Multiplier Reconfiguration Unit Partial Integration Work to be done: Complete Integration Functional Correctness Check

CONCLUSION Need for multiple transforms on same chip Mobile devices, Handhelds Not much multiprocessing required Use of Reconfigurable FPGA’s Reduces AREA Increases Functionality Fault Tolerance