FPGA implementations of fast Fourier transforms for real-time signal and image processing

IS Uzun, A Amira, A Bouridane

    Research output: Contribution to journalArticle

    91 Citations (Scopus)

    Abstract

    Applications based on the fast Fourier transform (FFT), such as signal and image processing, require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. However, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, signal/image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a high level framework for the implementation of 1-D and 2-D FFTs for real-time applications. A wide range of FFT algorithms, including radix-2, radix-4, split-radix and fast Hartley transform (FHT) have been implemented under a common framework in order to enable the system designers to meet different system requirements. Results show that the parallel implementation of 2-D FFT achieves linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on 2-D FFT is presented as a solution for frequency-domain image filtering application.
    LanguageEnglish
    Pages283-296
    JournalIEE Proceedings - Vision Image and Signal Processing
    Volume152
    Issue number3
    DOIs
    Publication statusPublished - May 2005

    Fingerprint

    Fast Fourier transforms
    Field programmable gate arrays (FPGA)
    Signal processing
    Image processing
    Reconfigurable hardware
    Experiments

    Cite this

    Uzun, IS ; Amira, A ; Bouridane, A. / FPGA implementations of fast Fourier transforms for real-time signal and image processing. 2005 ; Vol. 152, No. 3. pp. 283-296.
    @article{9b150e74bb5d4a5586740b760bb004b6,
    title = "FPGA implementations of fast Fourier transforms for real-time signal and image processing",
    abstract = "Applications based on the fast Fourier transform (FFT), such as signal and image processing, require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. However, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, signal/image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a high level framework for the implementation of 1-D and 2-D FFTs for real-time applications. A wide range of FFT algorithms, including radix-2, radix-4, split-radix and fast Hartley transform (FHT) have been implemented under a common framework in order to enable the system designers to meet different system requirements. Results show that the parallel implementation of 2-D FFT achieves linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on 2-D FFT is presented as a solution for frequency-domain image filtering application.",
    author = "IS Uzun and A Amira and A Bouridane",
    year = "2005",
    month = "5",
    doi = "10.1019/ip-vis:20041114",
    language = "English",
    volume = "152",
    pages = "283--296",
    number = "3",

    }

    FPGA implementations of fast Fourier transforms for real-time signal and image processing. / Uzun, IS; Amira, A; Bouridane, A.

    Vol. 152, No. 3, 05.2005, p. 283-296.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - FPGA implementations of fast Fourier transforms for real-time signal and image processing

    AU - Uzun, IS

    AU - Amira, A

    AU - Bouridane, A

    PY - 2005/5

    Y1 - 2005/5

    N2 - Applications based on the fast Fourier transform (FFT), such as signal and image processing, require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. However, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, signal/image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a high level framework for the implementation of 1-D and 2-D FFTs for real-time applications. A wide range of FFT algorithms, including radix-2, radix-4, split-radix and fast Hartley transform (FHT) have been implemented under a common framework in order to enable the system designers to meet different system requirements. Results show that the parallel implementation of 2-D FFT achieves linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on 2-D FFT is presented as a solution for frequency-domain image filtering application.

    AB - Applications based on the fast Fourier transform (FFT), such as signal and image processing, require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. However, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, signal/image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a high level framework for the implementation of 1-D and 2-D FFTs for real-time applications. A wide range of FFT algorithms, including radix-2, radix-4, split-radix and fast Hartley transform (FHT) have been implemented under a common framework in order to enable the system designers to meet different system requirements. Results show that the parallel implementation of 2-D FFT achieves linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on 2-D FFT is presented as a solution for frequency-domain image filtering application.

    U2 - 10.1019/ip-vis:20041114

    DO - 10.1019/ip-vis:20041114

    M3 - Article

    VL - 152

    SP - 283

    EP - 296

    IS - 3

    ER -