FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data

Jung Sub Kim, Chi Li Yu, Lanping Deng, Srinidhi Kestur, Vijaykrishnan Narayanan, Chaitali Chakrabarti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Applications based on Discrete Fourier Transforms (DFT) are extensively used in various areas of signal and digital image processing. Of particular interest is the two-dimensional (2D) DFT which is more computation- and bandwidth-intensive than the one-dimensional (1D) DFT. Traditionally, a 2D DFT is computed using Row-Column (RC) decomposition, where 1D DFTs are computed along the rows followed by 1D DFTs along the columns. Both application specific and reconfigurable hardware have been used for high-performance implementations of 2D DFT. However, architectures based on RC decomposition are not efficient for large input size data due to memory bandwidth constraints. In this paper, we propose an efficient architecture to implement the 2D DFT for large-sized input data based on a novel 2D decomposition algorithm. This architecture achieves very high throughput by exploiting the inherent parallelism due to the algorithm decomposition and by utilizing the row-wise burst access pattern of the external memory. A high throughput memory interface has been designed to enable maximum utilization of the memory bandwidth. In addition, an automatic system generator is provided for mapping this architecture onto a reconfigurable platform of Xilinx Virtex5 devices. For a 2K x 2K input size, the proposed architecture is 1.96x times faster than RC decomposition based implementation under the same memory constraints, and also outperforms other existing implementations.

Original languageEnglish (US)
Title of host publicationIEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
Pages121-126
Number of pages6
DOIs
StatePublished - 2009
Event2009 IEEE Workshop on Signal Processing Systems, SiPS 2009 - Tampere, Finland
Duration: Oct 7 2009Oct 9 2009

Other

Other2009 IEEE Workshop on Signal Processing Systems, SiPS 2009
CountryFinland
CityTampere
Period10/7/0910/9/09

Fingerprint

Discrete Fourier transform
Discrete Fourier transforms
Field Programmable Gate Array
Field programmable gate arrays (FPGA)
Decomposition
Decompose
Data storage equipment
Bandwidth
Decomposition Algorithm
High Throughput
Reconfigurable Hardware
External Memory
Digital Image Processing
Throughput
Burst
Reconfigurable hardware
Parallelism
Architecture
High Performance
Generator

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Applied Mathematics
  • Hardware and Architecture

Cite this

Kim, J. S., Yu, C. L., Deng, L., Kestur, S., Narayanan, V., & Chakrabarti, C. (2009). FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data. In IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation (pp. 121-126). [5336236] https://doi.org/10.1109/SIPS.2009.5336236

FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data. / Kim, Jung Sub; Yu, Chi Li; Deng, Lanping; Kestur, Srinidhi; Narayanan, Vijaykrishnan; Chakrabarti, Chaitali.

IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation. 2009. p. 121-126 5336236.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, JS, Yu, CL, Deng, L, Kestur, S, Narayanan, V & Chakrabarti, C 2009, FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data. in IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation., 5336236, pp. 121-126, 2009 IEEE Workshop on Signal Processing Systems, SiPS 2009, Tampere, Finland, 10/7/09. https://doi.org/10.1109/SIPS.2009.5336236
Kim JS, Yu CL, Deng L, Kestur S, Narayanan V, Chakrabarti C. FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data. In IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation. 2009. p. 121-126. 5336236 https://doi.org/10.1109/SIPS.2009.5336236
Kim, Jung Sub ; Yu, Chi Li ; Deng, Lanping ; Kestur, Srinidhi ; Narayanan, Vijaykrishnan ; Chakrabarti, Chaitali. / FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data. IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation. 2009. pp. 121-126
@inproceedings{bfc1f5b311524af7bc02bae89f301348,
title = "FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data",
abstract = "Applications based on Discrete Fourier Transforms (DFT) are extensively used in various areas of signal and digital image processing. Of particular interest is the two-dimensional (2D) DFT which is more computation- and bandwidth-intensive than the one-dimensional (1D) DFT. Traditionally, a 2D DFT is computed using Row-Column (RC) decomposition, where 1D DFTs are computed along the rows followed by 1D DFTs along the columns. Both application specific and reconfigurable hardware have been used for high-performance implementations of 2D DFT. However, architectures based on RC decomposition are not efficient for large input size data due to memory bandwidth constraints. In this paper, we propose an efficient architecture to implement the 2D DFT for large-sized input data based on a novel 2D decomposition algorithm. This architecture achieves very high throughput by exploiting the inherent parallelism due to the algorithm decomposition and by utilizing the row-wise burst access pattern of the external memory. A high throughput memory interface has been designed to enable maximum utilization of the memory bandwidth. In addition, an automatic system generator is provided for mapping this architecture onto a reconfigurable platform of Xilinx Virtex5 devices. For a 2K x 2K input size, the proposed architecture is 1.96x times faster than RC decomposition based implementation under the same memory constraints, and also outperforms other existing implementations.",
author = "Kim, {Jung Sub} and Yu, {Chi Li} and Lanping Deng and Srinidhi Kestur and Vijaykrishnan Narayanan and Chaitali Chakrabarti",
year = "2009",
doi = "10.1109/SIPS.2009.5336236",
language = "English (US)",
isbn = "9781424443352",
pages = "121--126",
booktitle = "IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation",

}

TY - GEN

T1 - FPGA architecture for 2D discrete fourier transform based on 2D decomposition for large-sized data

AU - Kim, Jung Sub

AU - Yu, Chi Li

AU - Deng, Lanping

AU - Kestur, Srinidhi

AU - Narayanan, Vijaykrishnan

AU - Chakrabarti, Chaitali

PY - 2009

Y1 - 2009

N2 - Applications based on Discrete Fourier Transforms (DFT) are extensively used in various areas of signal and digital image processing. Of particular interest is the two-dimensional (2D) DFT which is more computation- and bandwidth-intensive than the one-dimensional (1D) DFT. Traditionally, a 2D DFT is computed using Row-Column (RC) decomposition, where 1D DFTs are computed along the rows followed by 1D DFTs along the columns. Both application specific and reconfigurable hardware have been used for high-performance implementations of 2D DFT. However, architectures based on RC decomposition are not efficient for large input size data due to memory bandwidth constraints. In this paper, we propose an efficient architecture to implement the 2D DFT for large-sized input data based on a novel 2D decomposition algorithm. This architecture achieves very high throughput by exploiting the inherent parallelism due to the algorithm decomposition and by utilizing the row-wise burst access pattern of the external memory. A high throughput memory interface has been designed to enable maximum utilization of the memory bandwidth. In addition, an automatic system generator is provided for mapping this architecture onto a reconfigurable platform of Xilinx Virtex5 devices. For a 2K x 2K input size, the proposed architecture is 1.96x times faster than RC decomposition based implementation under the same memory constraints, and also outperforms other existing implementations.

AB - Applications based on Discrete Fourier Transforms (DFT) are extensively used in various areas of signal and digital image processing. Of particular interest is the two-dimensional (2D) DFT which is more computation- and bandwidth-intensive than the one-dimensional (1D) DFT. Traditionally, a 2D DFT is computed using Row-Column (RC) decomposition, where 1D DFTs are computed along the rows followed by 1D DFTs along the columns. Both application specific and reconfigurable hardware have been used for high-performance implementations of 2D DFT. However, architectures based on RC decomposition are not efficient for large input size data due to memory bandwidth constraints. In this paper, we propose an efficient architecture to implement the 2D DFT for large-sized input data based on a novel 2D decomposition algorithm. This architecture achieves very high throughput by exploiting the inherent parallelism due to the algorithm decomposition and by utilizing the row-wise burst access pattern of the external memory. A high throughput memory interface has been designed to enable maximum utilization of the memory bandwidth. In addition, an automatic system generator is provided for mapping this architecture onto a reconfigurable platform of Xilinx Virtex5 devices. For a 2K x 2K input size, the proposed architecture is 1.96x times faster than RC decomposition based implementation under the same memory constraints, and also outperforms other existing implementations.

UR - http://www.scopus.com/inward/record.url?scp=74549119496&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74549119496&partnerID=8YFLogxK

U2 - 10.1109/SIPS.2009.5336236

DO - 10.1109/SIPS.2009.5336236

M3 - Conference contribution

AN - SCOPUS:74549119496

SN - 9781424443352

SP - 121

EP - 126

BT - IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation

ER -