ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU A New Algorithm to Compute the Discrete Cosine Transform VLSI Signal Processing 台灣大學電機系.

Slides:



Advertisements
Similar presentations
Cost-Effective Pipeline FFT/IFFT VLSI Architecture for DVB-H System Present by: Yuan-Chu Yu Chin-Teng Lin and Yuan-Chu Yu Department of Electrical and.
Advertisements

Parallel Fast Fourier Transform Ryan Liu. Introduction The Discrete Fourier Transform could be applied in science and engineering. Examples: ◦ Voice recognition.
ELEC692 VLSI Signal Processing Architecture Lecture 9 VLSI Architecture for Discrete Cosine Transform.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Why Systolic Architecture ? VLSI Signal Processing 台灣大學電機系 吳安宇.
Case Study ARM Platform-based JPEG Codec HW/SW Co-design
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Multirate Processing of Digital Signals: Fundamentals VLSI Signal Processing 台灣大學電機系 吳安宇.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Adaptive Signal Processing -Equalization- Ben Advisor: Prof. An-Yeu Wu 2008/01/22.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Digital System Design Course Introduction Lecturer : 吳安宇 Date : 2004/02/20.
Image Compression With Discrete Cosine Transforms Initial Project Proposal – (9/21/99) David Oltmanns Delayne Vaughn John Hill.
EE 5359: MULTIMEDIA PROCESSING PROJECT PERFORMANCE ANALYSIS OF INTEGER DCT OF DIFFERENT BLOCK SIZES. Guided by Dr. K.R. Rao Presented by: Suvinda Mudigere.
1 Three-Party Authenticated Key Agreements and Its Applications- PCSs Roaming Protocol 李添福 (Tian-Fu Lee) 國立成功大學資訊工程博士 Cryptography/ Network security/ Wireless.
ABSTRACT Introduction NEW Recursive DFT/IDFT architecture Low computation cycle  1/2: Chebyshev polynomial  2/N: Folded architecture High speed  Register-splitting.
CS 6068 Parallel Computing Fall 2013 Lecture 10 – Nov 18 The Parallel FFT Prof. Fred Office Hours: MWF.
Introduction to Compressive Sensing
Department of Electrical Engineering Southern Taiwan University of Science and Technology Robot and Servo Drive Lab. 學生 : 蔡景棠 指導教授 : 王明賢 2015/10/13 A Driver.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Digital System Design Course Introduction Lecturer :吳安宇 Date : 2005/2/25.
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.
Communication and Signal Processing. Dr. Y.C. Jenq 2. Digital Signal Processing Y. C. Jenq, "A New Implementation Algorithm.
Adviser:高永安 Student:林柏廷
Directional DCT Presented by, -Shreyanka Subbarayappa, Sadaf Ahamed, Tejas Sathe, Priyadarshini Anjanappa K. R. RAO 1.
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.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-project Meeting Network-on-Chip Group 2007/3/07 TA: 林書彥 黃群翔.
Figure 1.a AVS China encoder [3] Video Bit stream.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Undergraduate Projects Speaker: Wes Adviser: Prof. An-Yeu Wu Date: 2015/09/22 Lab.
Paper Reading - A New Approach to Pipeline FFT Processor Presenter:Chia-Hsin Chen, Yen-Chi Lee Mentor:Chenjo Instructor:Andy Wu.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU CORDIC (Coordinate rotation digital computer) Ref: Y. H. Hu, “CORDIC based VLSI architecture.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-Graduate Project Case Study: Single-path Delay Feedback FFT Speaker: Yu-Min.
Lagrange and Water Filling algorithm Speaker : Kuan-Chou Lee Date : 2012/8/20.
Applications of Distributed Arithmetic to Digital Signal Processing:
Image Compression With Discrete Cosine Transforms Midterm Report – (11/02/99) David Oltmanns Delayne Vaughn John Hill.
Vamsi Krishna Vegunta University of Texas, Arlington
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU 2007/03/07 大學部專題報告 DSP Engine Design for Ultrasonic Digital Beamforming Presenter: Sniper.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Low-Power CMOS Design For Advanced VLSI Design and VLSI Signal Processing Courses
Speaker: Darcy Tsai Advisor: Prof. An-Yeu Wu Date: 2013/10/31
Page 1 國立交通大學電力電子晶片設計與 DSP 控制實驗室 Power Electronics IC Design & DSP Control Lab., NCTU, Taiwan 年 10 月 13 日 賴 逸 軒賴 逸.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU CORDIC (COordinate Rotation DIgital Computer) For Advanced VLSI and VLSI Signal Processing.
Homework II Fast Discrete Cosine Transform Jain-Yi Lu ( 呂健益 ) Visual Communications Laboratory Department of Communication Engineering National Central.
HW/SW Co-design Lecture 3: Lab 1 – Getting Started with the Tools Course material designed by Professor Yarsun Hsu, EE Dept, NTHU RA: Yi-Chiun Fang, EE.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Multirate Processing of Digital Signals (II): Short-Length FIR Filter VLSI Signal Processing.
SIMD Implementation of Discrete Wavelet Transform Jake Adriaens Diana Palsetia.
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Brief Overview of Residue Number System (RNS) VLSI Signal Processing 台灣大學電機系 吳安宇.
FFT VLSI Implementation
VLSI SP Course 2001 台大電機吳安宇 1 Why Systolic Architecture ? H. T. Kung Carnegie-Mellon University.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
NCTU, CS VLSI Information Processing Research Lab 研究生 : ABSTRACT Introduction NEW Recursive DFT/IDFT architecture Low computation cycle  1/2: Chebyshev.
Chapter 9. Computation of Discrete Fourier Transform 9.1 Introduction 9.2 Decimation-in-Time Factorization 9.3 Decimation-in-Frequency Factorization 9.4.
CORDIC (Coordinate rotation digital computer)
VIA Course Schedule Finish Final Project report by 1/25/2003
The content of lecture This lecture will cover: Fourier Transform
Discrete Fourier Transform (DFT)
CORDIC (Coordinate rotation digital computer)
Research Institute for Future Media Computing
通訊系統晶片研究室 指導教授:吳仁銘 清華大學電機系/通訊所 資電館625室
Digital Image Procesing Discrete Walsh Trasform (DWT) in Image Processing Discrete Hadamard Trasform (DHT) in Image Processing DR TANIA STATHAKI READER.
Brief Overview of Residue Number System (RNS)
Discrete Cosine Transform (DCT)
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.
2D DCT in ARM-based JPEG Processor
Fast Hierarchical Back Projection
12/5/2018.
Chapter 2 Discrete Fourier Transform (DFT)
1-D DISCRETE COSINE TRANSFORM DCT
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
The Report of Monographic Study
FFT VLSI Implementation
Discrete Fourier Transform
Speaker: Chris Chen Advisor: Prof. An-Yeu Wu Date: 2014/10/28
Presentation transcript:

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU A New Algorithm to Compute the Discrete Cosine Transform VLSI Signal Processing 台灣大學電機系 吳安宇 1. B. G. Lee “A new algorithm to compute the discrete cosine trnsform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp , Dec W. H. Chen, C. H. Smith, and S. C. Fralick, “A fast computational algorithm for the discrete cosine transform,” IEEE Trans. Commun., vol. COM-25, pp , Sept. 77

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT – Decomposing into even and odd indexes of n, we define

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Rearrange for Decimation in Time – Using the trigonometric identity to rearrange

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT Decomposed into N/2-Point IDCT

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT Architecture Take transpose form, we can obtain DCT architecture

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Sample : 8-Point IDCT

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Complexity Comparison

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Unified Parallel Lattice Structures for Time-Recursive Discrete Cosine/Sine/Hartley Transform VLSI Signal Processing 台灣大學電機系 吳安宇 1. K. J. R. Liu and C.T. Chiu “Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transform,” IEEE Trans. Signal Processing,vol. SP-41, pp , March 93.

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU DCT Definition

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time-Recursive DCT – DCT at time t – Decompose in and DCT at time (t+1) (See Fig. 1)

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU DST Definition

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time-Recursive DCT – DST at time t – Decompose in and DST at time (t+1) (See Fig. 1)

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Hardware Architecture

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time Recursive Relationship The relationship between the and the data sequence

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Overall Architecture

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Special Case for k=0 for the DCT and k=N for the DST

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU The parallel lattice structure for DCT and DST

ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Architecture Comparison Architectural Comparison LeeOur approach I/O Operation Architecture Communication Hardware cost Operating frequency PIPO Modular Global Large, O(Nlog 2 N) f s / N SIPO Modulare and Regular Local Small, O(N) f s f s : Input data rate 1. K. J. R. Liu and C.T. Chiu “Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transform,” IEEE Trans. Signal Processing, vol. SP-41, pp , March B. G. Lee “A new algorithm to compute the discrete cosine trnsform,”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp , Dec. 84