Area-Efficient Pipelined FFT Processor for Zero-Padded Signals
This paper proposes an area-efficient fast Fourier transform (FFT) processor for zero-padded signals based on the radix-2<inline-formula> <math display="inline"> <semantics> <msup> <mrow></mrow> <mn>2</mn> </msup> </semantics> <...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-11-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/8/12/1397 |
id |
doaj-13f28f3164a74550a3aff78a14c1c2c2 |
---|---|
record_format |
Article |
spelling |
doaj-13f28f3164a74550a3aff78a14c1c2c22020-11-25T02:12:18ZengMDPI AGElectronics2079-92922019-11-01812139710.3390/electronics8121397electronics8121397Area-Efficient Pipelined FFT Processor for Zero-Padded SignalsYongchul Jung0Jaechan Cho1Seongjoo Lee2Yunho Jung3School of Electronics and Information Engineering, Korea Aerospace University, Goyang-si 10540, KoreaSchool of Electronics and Information Engineering, Korea Aerospace University, Goyang-si 10540, KoreaThe Department of Information and Communication Engineering, Sejong University, Seoul 143-747, KoreaSchool of Electronics and Information Engineering, Korea Aerospace University, Goyang-si 10540, KoreaThis paper proposes an area-efficient fast Fourier transform (FFT) processor for zero-padded signals based on the radix-2<inline-formula> <math display="inline"> <semantics> <msup> <mrow></mrow> <mn>2</mn> </msup> </semantics> </math> </inline-formula> and the radix-2<inline-formula> <math display="inline"> <semantics> <msup> <mrow></mrow> <mn>3</mn> </msup> </semantics> </math> </inline-formula> single-path delay feedback pipeline architectures. The delay elements for aligning the data in the pipeline stage are one of the most complex units and that of stage 1 is the biggest. By exploiting the fact that the input data sequence is zero-padded and that the twiddle factor multiplication in stage 1 is trivial, the proposed FFT processor can dramatically reduce the required number of delay elements. Moreover, the 256-point FFT processors were designed using hardware description language (HDL) and were synthesized to gate-level circuits using a standard cell library for 65 nm CMOS process. The proposed architecture results in a logic gate count of 40,396, which can be efficient and suitable for zero-padded FFT processors.https://www.mdpi.com/2079-9292/8/12/1397delay elementsfast fourier transform (fft)single-path delay feedback (sdf)zero-padded signal |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Yongchul Jung Jaechan Cho Seongjoo Lee Yunho Jung |
spellingShingle |
Yongchul Jung Jaechan Cho Seongjoo Lee Yunho Jung Area-Efficient Pipelined FFT Processor for Zero-Padded Signals Electronics delay elements fast fourier transform (fft) single-path delay feedback (sdf) zero-padded signal |
author_facet |
Yongchul Jung Jaechan Cho Seongjoo Lee Yunho Jung |
author_sort |
Yongchul Jung |
title |
Area-Efficient Pipelined FFT Processor for Zero-Padded Signals |
title_short |
Area-Efficient Pipelined FFT Processor for Zero-Padded Signals |
title_full |
Area-Efficient Pipelined FFT Processor for Zero-Padded Signals |
title_fullStr |
Area-Efficient Pipelined FFT Processor for Zero-Padded Signals |
title_full_unstemmed |
Area-Efficient Pipelined FFT Processor for Zero-Padded Signals |
title_sort |
area-efficient pipelined fft processor for zero-padded signals |
publisher |
MDPI AG |
series |
Electronics |
issn |
2079-9292 |
publishDate |
2019-11-01 |
description |
This paper proposes an area-efficient fast Fourier transform (FFT) processor for zero-padded signals based on the radix-2<inline-formula> <math display="inline"> <semantics> <msup> <mrow></mrow> <mn>2</mn> </msup> </semantics> </math> </inline-formula> and the radix-2<inline-formula> <math display="inline"> <semantics> <msup> <mrow></mrow> <mn>3</mn> </msup> </semantics> </math> </inline-formula> single-path delay feedback pipeline architectures. The delay elements for aligning the data in the pipeline stage are one of the most complex units and that of stage 1 is the biggest. By exploiting the fact that the input data sequence is zero-padded and that the twiddle factor multiplication in stage 1 is trivial, the proposed FFT processor can dramatically reduce the required number of delay elements. Moreover, the 256-point FFT processors were designed using hardware description language (HDL) and were synthesized to gate-level circuits using a standard cell library for 65 nm CMOS process. The proposed architecture results in a logic gate count of 40,396, which can be efficient and suitable for zero-padded FFT processors. |
topic |
delay elements fast fourier transform (fft) single-path delay feedback (sdf) zero-padded signal |
url |
https://www.mdpi.com/2079-9292/8/12/1397 |
work_keys_str_mv |
AT yongchuljung areaefficientpipelinedfftprocessorforzeropaddedsignals AT jaechancho areaefficientpipelinedfftprocessorforzeropaddedsignals AT seongjoolee areaefficientpipelinedfftprocessorforzeropaddedsignals AT yunhojung areaefficientpipelinedfftprocessorforzeropaddedsignals |
_version_ |
1724910038630268928 |