Design of a DSP for Improving FFT Computing with the Vectorized Mechanisms

نویسندگان

  • Te-Shin Yang
  • Jih-Ching Chiu
چکیده

In order to improve the performance for real-time application, current digital signal processors use VLIW architectures to increase the degree of instruction level parallelism (ILP). There exist two factors making the ILP barriers; one is the hardware resource limitation for all parallel instructions. Another is the dependence relations between instructions. For coping these hazards, in this paper, we designs a VLIW architecture processing core, called DVBT-DSP, molded by the FFT algorithm and use the software pipelining mechanism to schedule the loop to achieve the highest ILP degree in executing the FFT butterfly algorithms. Furthermore, in order to provide the smooth data stream for pipeline operations, the vectorized modulo addressing mode is designed to collect the regular but discrete data to a continuous vector. The simulation results show that the DVBT_DSP has double performance of the C6200 for the FFT processing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vectorized Code Scheduling Method for the FFT Algorithm in VLIW Architecture

The high degree ILP techniques are frequently used in the DSP design particularly the VLIW techniques in the present day. The paper presents a method that eliminates the vector change effect for the vectorized FFT code scheduling. This method involves two instruction groups: Circular Queue Index Register (CQI) setting instructions and Conditional Load instructions. These can achieve the goals o...

متن کامل

Ultra-Low-Energy DSP Processor Design for Many-Core Parallel Applications

Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...

متن کامل

Short Vector SIMD Code Generation for DSP Algorithms

Short vector SIMD instructions on recent general purpose microprocessors, such as SSE on Pentium III and 4, offer a high potential speed-up but require a very high level of programming expertise. We present a compiler that generates vectorized code for digital signal processing algorithms such as the fast Fourier transform (FFT). The input to our compiler is a mathematical description of the al...

متن کامل

Design and Implementation of Pipelined Floating Point Fast Fourier Transform Processor

There are several methodologies and techniques that already offer hardware and software solutions for computing Fast Fourier Transform (FFT), which have advantages for specific applications. These solutions are developed for running in several platforms, such as GPU, DSP, FPGA and ASIC and they are usually described in C/C++ language or HDL. Implementation intended for reconfigurable logic is u...

متن کامل

High Speed Reconfigurable FFT Design by Vedic Mathematics

technology that is omnipresent in almost every engineering discipline. Faster additions and multiplications are of extreme importance in DSP for convolution, discrete Fourier transform, digital filters, etc. The core computing process is always a multiplication routine; therefore, DSP engineers are constantly looking for new algorithms and hardware to implement them. Vedic mathematics is the na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005