Shared CSD complex constant multiplier for parallel FFT processors

Tram Thi Bao Nguyen, Hanho Lee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper presents a shared canonical signed digit (CSD) complex constant multiplier for high-speed low-complexity parallel fast Fourier transform (FFT) processors. To reduce the number of twiddle factor (TF) multiplications, the mixed radix -24/23 FFT algorithm is adopted for FFT processor. The 512-point FFT processor using the proposed shared CSD complex constant multiplier has been designed and implemented using 90-nm CMOS technology. Synthesis results show that the proposed FFT processor achieve a higher throughput rate up to 3.2 GS/s at 400 MHz while requiring much less hardware complexity with respect to other FFT processors. The SQNR performance is 36dB with 12-bit word-length implementation.

Original languageEnglish
Title of host publicationISOCC 2015 - International SoC Design Conference
Subtitle of host publicationSoC for Internet of Everything (IoE)
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages27-28
Number of pages2
ISBN (Electronic)9781467393089
DOIs
StatePublished - 8 Feb 2016
Event12th International SoC Design Conference, ISOCC 2015 - Gyeongju, Korea, Republic of
Duration: 2 Nov 20155 Nov 2015

Publication series

NameISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)

Conference

Conference12th International SoC Design Conference, ISOCC 2015
Country/TerritoryKorea, Republic of
CityGyeongju
Period2/11/155/11/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Keywords

  • CSD
  • Fast Fourier transform (FFT)
  • complex constant multiplier
  • mixed radix

Fingerprint

Dive into the research topics of 'Shared CSD complex constant multiplier for parallel FFT processors'. Together they form a unique fingerprint.

Cite this