A converged hardware solution for FFT, DCT and Walsh transform

نویسندگان

  • Eric Tell
  • Olle Seger
  • Dake Liu
چکیده

We are interested in developing a programmable baseband processor for multiple radio standards, including the wireless LAN standards 802.11a and 802.11b. 802.11a is based on OFDM and uses a 64-point FFT. Demodulation of the complementary code keying (CCK) used in 802.11b includes the computation of a modified Walsh transform. Similarities have been found between the radix-4 FFT and the fast Walsh transform (FWT) and this has enabled the design of a converged FFT and FWT processor. With small modifications this processor can also be used for calculating the discrete cosine transform (DCT). A converged FFT/FWT/DCT processor was designed and synthesized in a 0.13 m process. Results indicate that the hardware can run at 385 MHz, which means a 64-point FFT/DCT is calculated in 140 ns and a FWT for 802.11b 11Mb/s CCK in 47 ns. The area including memory is 0.40 mm.

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

ثبت نام

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

منابع مشابه

Cooley-Tukey FFT like algorithms for the DCT

The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFTs of size k and m. In this paper we present a theorem that decomposes a polynomial transform into smaller polynomial transforms, and show that the FFT is obtained as a special case. Then we use this theorem to derive a new class of recursive algorithms for the discrete cosine transforms (...

متن کامل

BER Performance For OFDM Using Non-Conventional Transform and Non-Conventional Mapping Schemes

In this paper, the Bit Error Rate (BER), performance of conventional Discrete Fourier Transform (FFT) OFDM system is compared with Nonconventional Discrete Cosine Transform (DCT)OFDM system in AWGN and Rayleigh fading environment. Performance has been given with conventional mapping schemes like BPSK, QPSK and nonconventional mapping schemes like DQPSK and π/4 DQPSK. Simulation results show tha...

متن کامل

A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications

The discrete cosine transform (DCT) is the key step in many image and video coding standards. The 8-point DCT is an important special case, possessing several low-complexity approximations widely investigated. However, 16-point DCT transform has energy compaction advantages. In this sense, this paper presents a new 16-point DCT approximation with null multiplicative complexity. The proposed tra...

متن کامل

CORDIC based fast algorithm for power-of-two point DCT and its efficient VLSI implementation

—In this paper, we present a coordinate rotation digital computer (CORDIC) based fast algorithm for power-of-two point DCT, and develop its corresponding efficient VLSI implementation. The proposed algorithm has some distinguish advantages, such as regular Cooley-Tukey FFT-like data flow, identical post-scaling factor, and arithmetic-sequence rotation angles. By using the trigonometric formula,...

متن کامل

All phase biorthogonal transform and its application in JPEG-like image compression

Keywords: Biorthogonal transform Image compression JPEG algorithm All phase biorthogonal transform (APBT) Dual biorthogonal basis vectors Walsh transform (WT) Discrete cosine transform (DCT) Inverse discrete cosine transform (IDCT) Peak signal to noise ratio (PSNR) a b s t r a c t This paper proposes new concepts of the all phase biorthogonal transform (APBT) and the dual biorthogonal basis vec...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2003