A Design of Input-Decimation Technique for Recursive DFT/IDFT Algorithm

In this paper, an input-decimation technique for the recursive discrete Fourier transform (RDFT)/inverse DFT (RIDFT) algorithm is proposed for the high-speed broadband communication systems. It is worth noting that the input-decimation approach is presented to decrease the number of input sequences...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. I, Regular papers Vol. 66; no. 12; pp. 4713 - 4726
Main Authors Wu, Chih-Feng, Chen, Chun-Hung, Shiue, Muh-Tian
Format Journal Article
LanguageEnglish
Published New York IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1549-8328
1558-0806
DOI10.1109/TCSI.2019.2931794

Cover

Abstract In this paper, an input-decimation technique for the recursive discrete Fourier transform (RDFT)/inverse DFT (RIDFT) algorithm is proposed for the high-speed broadband communication systems. It is worth noting that the input-decimation approach is presented to decrease the number of input sequences for the recursive filter so that the computation cycle of RDFT/RIDFT can be shortened to meet the computing time requirement (3.6 μs) for the high-speed broadband communication systems. Therefore, the input-decimation RDFT/RIDFT algorithm is able to carry out at least 55.5% reduction of the total computation cycles compared with the considered algorithms. Furthermore, holding the advantages of input-decimation technique, the computational complexities of the real-multiplication and -addition are reduced to 41.3% and 22.2%, respectively. The area and the power consumption can be minimized by employing the cost-efficient constant multiplier with the refined signed-digit expression of twiddle factors. Finally, the physical implementation results show that the core area is 0.37×0.37 mm2 with 0.18 μm CMOS process. The power consumption is 5.16 mW with the supply voltage of 1.8 V and the operating clock of 40 MHz. The proposed design can achieve 258 million of computational efficiency per unit area (CEUA) and really outperform the previous works.
AbstractList In this paper, an input-decimation technique for the recursive discrete Fourier transform (RDFT)/inverse DFT (RIDFT) algorithm is proposed for the high-speed broadband communication systems. It is worth noting that the input-decimation approach is presented to decrease the number of input sequences for the recursive filter so that the computation cycle of RDFT/RIDFT can be shortened to meet the computing time requirement (3.6 μs) for the high-speed broadband communication systems. Therefore, the input-decimation RDFT/RIDFT algorithm is able to carry out at least 55.5% reduction of the total computation cycles compared with the considered algorithms. Furthermore, holding the advantages of input-decimation technique, the computational complexities of the real-multiplication and -addition are reduced to 41.3% and 22.2%, respectively. The area and the power consumption can be minimized by employing the cost-efficient constant multiplier with the refined signed-digit expression of twiddle factors. Finally, the physical implementation results show that the core area is 0.37×0.37 mm2 with 0.18 μm CMOS process. The power consumption is 5.16 mW with the supply voltage of 1.8 V and the operating clock of 40 MHz. The proposed design can achieve 258 million of computational efficiency per unit area (CEUA) and really outperform the previous works.
In this paper, an input-decimation technique for the recursive discrete Fourier transform (RDFT)/inverse DFT (RIDFT) algorithm is proposed for the high-speed broadband communication systems. It is worth noting that the input-decimation approach is presented to decrease the number of input sequences for the recursive filter so that the computation cycle of RDFT/RIDFT can be shortened to meet the computing time requirement ([Formula Omitted]) for the high-speed broadband communication systems. Therefore, the input-decimation RDFT/RIDFT algorithm is able to carry out at least 55.5% reduction of the total computation cycles compared with the considered algorithms. Furthermore, holding the advantages of input-decimation technique, the computational complexities of the real-multiplication and -addition are reduced to 41.3% and 22.2%, respectively. The area and the power consumption can be minimized by employing the cost-efficient constant multiplier with the refined signed-digit expression of twiddle factors. Finally, the physical implementation results show that the core area is [Formula Omitted] mm2 with [Formula Omitted] CMOS process. The power consumption is 5.16 mW with the supply voltage of 1.8 V and the operating clock of 40 MHz. The proposed design can achieve 258 million of computational efficiency per unit area (CEUA) and really outperform the previous works.
Author Wu, Chih-Feng
Shiue, Muh-Tian
Chen, Chun-Hung
Author_xml – sequence: 1
  givenname: Chih-Feng
  orcidid: 0000-0002-8393-5770
  surname: Wu
  fullname: Wu, Chih-Feng
  email: tfeng.wu@gmail.com
  organization: Department of Electronic Engineering, National Chin-Yi University of Technology, Taichung, Taiwan
– sequence: 2
  givenname: Chun-Hung
  surname: Chen
  fullname: Chen, Chun-Hung
  email: henrikchentw@gmail.com
  organization: Intelligo Technology Inc., Zhubei, Taiwan
– sequence: 3
  givenname: Muh-Tian
  orcidid: 0000-0002-5482-3796
  surname: Shiue
  fullname: Shiue, Muh-Tian
  email: mtshuie@ee.ncu.edu.tw
  organization: Department of Electrical Engineering, Biomedical and Communication System IC Laboratory, National Central University, Taoyuan, Taiwan
BookMark eNp9kDFPwzAQhS0EEm3hByCWSMxpfXYc22PV0hKpEhKEOUrNuXXVxsVJkPj3JLRiYGC5u-G9u3ffkFxWvkJC7oCOAaie5LPXbMwo6DHTHKROLsgAhFAxVTS97OdEx4ozdU2Gdb2jlGnKYUCW02iOtdtUkbdRVh3bJp6jcYeycb6KcjTbyn20GFkfohc0bajdJ0bzRT7JuhJN9xsfXLM93JArW-5rvD33EXlbPOazp3j1vMxm01VsulxNzNCkVEgDfL1O5HtpRSkBLGAiFJXAEiYxoVxIQJEi5yIRqTWltlhaMOuUj8jDae8x-C5X3RQ734aqO1kwzphUOmWiU8mTygRf1wFtYVzz81ITSrcvgBY9taKnVvTUijO1zgl_nMfQ0Qhf_3ruTx6HiL96pRhLKfBvWpJ4EA
CODEN ITCSCH
CitedBy_id crossref_primary_10_1109_TCSI_2020_2987537
Cites_doi 10.1109/IEEESTD.2009.5307322
10.1109/TCSII.2010.2050950
10.1109/VDAT.2011.5783585
10.1109/TCSII.2009.2035267
10.2307/2310304
10.1109/TCSI.2016.2615084
10.1109/IS3C.2016.66
10.1093/ietfec/e90-a.8.1644
10.3390/jlpea3020099
10.1109/TCSII.2015.2468918
10.1007/b117438
10.1109/TCSII.2015.2482238
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/TCSI.2019.2931794
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-0806
EndPage 4726
ExternalDocumentID 10_1109_TCSI_2019_2931794
8822601
Genre orig-research
GrantInformation_xml – fundername: Ministry of Science and Technology, Taiwan
  grantid: MOST 104-2218-E-346-001; MOST 106-2622-8-008-006-TA; MOST 106-2221-E-008-099-MY3; MOST 107-2622-8-008-005-TA
  funderid: 10.13039/501100004663
GroupedDBID 0R~
29I
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
H~9
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PZZ
RIA
RIE
RNS
VJK
AAYXX
CITATION
7SP
8FD
L7M
RIG
ID FETCH-LOGICAL-c293t-2ec6057c13bb47daf5a711f1e4580712427e403571e56e335456fca9feaf1cb63
IEDL.DBID RIE
ISSN 1549-8328
IngestDate Mon Jun 30 07:01:27 EDT 2025
Thu Apr 24 23:02:24 EDT 2025
Wed Oct 01 04:51:51 EDT 2025
Wed Aug 27 06:02:06 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-2ec6057c13bb47daf5a711f1e4580712427e403571e56e335456fca9feaf1cb63
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5482-3796
0000-0002-8393-5770
PQID 2322789625
PQPubID 85411
PageCount 14
ParticipantIDs crossref_citationtrail_10_1109_TCSI_2019_2931794
crossref_primary_10_1109_TCSI_2019_2931794
proquest_journals_2322789625
ieee_primary_8822601
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-12-01
PublicationDateYYYYMMDD 2019-12-01
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-12-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on circuits and systems. I, Regular papers
PublicationTitleAbbrev TCSI
PublicationYear 2019
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
liu (ref14) 2017; 64
ref11
ref10
lai (ref7) 2013
ref17
(ref1) 1989
ref8
ref9
ref3
ref5
van (ref2) 2004; 3
oppenheim (ref16) 1989
(ref4) 2003
lai (ref6) 2010; 57
References_xml – ident: ref12
  doi: 10.1109/IEEESTD.2009.5307322
– volume: 57
  start-page: 647
  year: 2010
  ident: ref6
  article-title: Low-computation-cycle, power-efficient, and reconfigurable design of recursive DFT for portable digital radio mondiale receiver
  publication-title: IEEE Trans Circuits Syst II Exp Briefs
  doi: 10.1109/TCSII.2010.2050950
– ident: ref15
  doi: 10.1109/VDAT.2011.5783585
– ident: ref5
  doi: 10.1109/TCSII.2009.2035267
– volume: 3
  start-page: 357
  year: 2004
  ident: ref2
  article-title: High-speed area-efficient recursive DFT/IDFT architectures
  publication-title: Proc IEEE Int Symp Circuits Syst (ISCAS)
– ident: ref11
  doi: 10.2307/2310304
– year: 1989
  ident: ref1
  publication-title: Recommendation Q 23 Multi-frequency Push-Bottom Signal Reception
– volume: 64
  start-page: 608
  year: 2017
  ident: ref14
  article-title: Dual-mode all-digital baseband receiver with a feed-forward and shared-memory architecture for dual-standard over 60 GHz NLOS channel
  publication-title: IEEE Trans Circuits Syst I Reg Papers
  doi: 10.1109/TCSI.2016.2615084
– year: 1989
  ident: ref16
  publication-title: Discrete-Time Signal Processing
– ident: ref13
  doi: 10.1109/IS3C.2016.66
– ident: ref3
  doi: 10.1093/ietfec/e90-a.8.1644
– ident: ref8
  doi: 10.3390/jlpea3020099
– ident: ref10
  doi: 10.1109/TCSII.2015.2468918
– year: 2003
  ident: ref4
  publication-title: ES 201 980 V2 2 1 Digital Radio Mondiale (DRM) System Specification
– ident: ref17
  doi: 10.1007/b117438
– start-page: 2601
  year: 2013
  ident: ref7
  article-title: High-performance RDFT design for applications of digital radio mondiale
  publication-title: Proc IEEE Int Symp Circuits Syst (ISCAS)
– ident: ref9
  doi: 10.1109/TCSII.2015.2482238
SSID ssj0029031
Score 2.2699594
Snippet In this paper, an input-decimation technique for the recursive discrete Fourier transform (RDFT)/inverse DFT (RIDFT) algorithm is proposed for the high-speed...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 4713
SubjectTerms Algorithms
Array signal processing
Broadband
CMOS
Communications systems
Computational efficiency
Computer architecture
Computing time
constant multiplier
Discrete Fourier transform (DFT)
Discrete Fourier transforms
Fourier transforms
High speed
IIR filters
input-decimation
Multiplication
OFDM
Power consumption
Receivers
recursive DFT (RDFT)
recursive inverse DFT (RIDFT)
Sequences
Signal processing algorithms
Title A Design of Input-Decimation Technique for Recursive DFT/IDFT Algorithm
URI https://ieeexplore.ieee.org/document/8822601
https://www.proquest.com/docview/2322789625
Volume 66
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-0806
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0029031
  issn: 1549-8328
  databaseCode: RIE
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEJ4AJz34QiOKZg-ejIXWPrZ7JCCCCR4UEm5NdztVIlKC7cVf705biK8YL00Pu81mZrbzze7MNwAXXLquHVnCCFUUG44rIiMkQgDtrdBDn2OcV72P7r3BxLmbutMKXG1qYRAxTz7DFr3md_lRojI6KmtrNEgMWFWoct8rarU2wZUw7YIb1RGGtlK_vMG0TNEedx-HlMQlWtq3kQF-8UF5U5Uff-LcvfR3YbReWJFV8tLKUtlS7984G_-78j3YKXEm6xSGsQ8VXBzA9if2wTrcdlgvz99gScyGi2WWGj1Us6KWkY3X5K5Mw1r2QMfylOnOev1xe6gfrDN_Slaz9Pn1ECb9m3F3YJR9FQylBZAa16h0EMOVZUvp8CiM3ZBbVmyh4_oacWinzdExbZdb6Hpo2wSyYhWKGMPYUtKzj6C2SBZ4DIzY8ogdSatWOTrYEihDIVEPdTjHa94Acy3pQJWk49T7Yh7kwYcpAlJOQMoJSuU04HIzZVkwbvw1uE7C3gws5dyA5lqdQbkn3wKNHansVwd8J7_POoUt-naRrNKEWrrK8ExDjlSe57b2AT2zz24
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLZ4HIADb8RgQA6cEN3aNVmW48QYK2wcoEjcqjZ1AQHbNNoLv5647SZeQlyqHhI1sp36c2J_BjiWkRBu7Cgr1HFicaFiKyRCAOOtsIktiUle9T64bvbu-OW9uJ-D01ktDCLmyWdYo9f8Lj8e6YyOyuoGDRID1jwsCs65KKq1ZuGVst2CHZUry9hpq7zDdGxV989uPUrjUjXj3cgEv3ihvK3Kj39x7mC6azCYLq3IK3muZWlU0-_fWBv_u_Z1WC2RJmsXprEBczjchJVP_INbcNFmnTyDg40S5g3HWWp1UD8V1YzMn9K7MgNs2Q0dzFOuO-t0_bpnHqz98jCaPKWPr9tw1z33z3pW2VnB0kYAqdVAbcIYqR03iriMw0SE0nESB7loGcxh3LZEbrtCOiia6LoEsxIdqgTDxNFR092BheFoiLvAiC-P-JGMcjU34ZbCKFQRmqFcSmzICthTSQe6pB2n7hcvQR5-2Cog5QSknKBUTgVOZlPGBefGX4O3SNizgaWcK1CdqjMod-VbYNAjFf6akG_v91lHsNTzB_2g711f7cMyfadIXanCQjrJ8MAAkDQ6zO3uA0jt0rs
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Design+of+Input-Decimation+Technique+for+Recursive+DFT%2FIDFT+Algorithm&rft.jtitle=IEEE+transactions+on+circuits+and+systems.+I%2C+Regular+papers&rft.au=Wu%2C+Chih-Feng&rft.au=Chen%2C+Chun-Hung&rft.au=Shiue%2C+Muh-Tian&rft.date=2019-12-01&rft.pub=IEEE&rft.issn=1549-8328&rft.volume=66&rft.issue=12&rft.spage=4713&rft.epage=4726&rft_id=info:doi/10.1109%2FTCSI.2019.2931794&rft.externalDocID=8822601
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1549-8328&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1549-8328&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1549-8328&client=summon