Loading…
A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation
FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a...
Saved in:
| Published in: | IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2024-02, Vol.71 (2), p.832-836 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | cdi_FETCH-LOGICAL-c246t-8cda39c6f70385ffeedb5c6b88deabb1f931509f522091ec4b9edea918fa41c63 |
| container_end_page | 836 |
| container_issue | 2 |
| container_start_page | 832 |
| container_title | IEEE transactions on circuits and systems. II, Express briefs |
| container_volume | 71 |
| creator | Wang, Shouman Chen, Jiajia |
| description | FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a new input partial sum sharing scheme is proposed to reuse the hardware resources to further reduce the adder cost. Logic synthesis results in ASIC show that the proposed 16-point FFT architecture can save area and power cost by at least 19.1% and 19.0% respectively compared with the recently published designs. Similarly, the proposed 32-point FFT architecture can reduce both power and delay by at least 6.91% and 5.35%. |
| doi_str_mv | 10.1109/TCSII.2022.3188255 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_9815103</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9815103</ieee_id><sourcerecordid>2923124623</sourcerecordid><originalsourceid>FETCH-LOGICAL-c246t-8cda39c6f70385ffeedb5c6b88deabb1f931509f522091ec4b9edea918fa41c63</originalsourceid><addsrcrecordid>eNo9kM1OwzAQhC0EEqXwAnCxxDnFP3FiH6tAS6QCh5az5STrNlUbB8dV6duTUMRpZ7UzO9KH0D0lE0qJelplyzyfMMLYhFMpmRAXaESFkBFPFb0cdKyiNI3Ta3TTdVtCmCKcjdByit_hiPOmPQQ89-7Q1s0am6bCy43xg36DsHEVDg4_Q1evG7xwR5y5fbuD7zqc8Gy2wvmw7aEJJtSuuUVX1uw6uPubY_Q5e1llr9HiY55n00VUsjgJkSwrw1WZ2JRwKawFqApRJoWUFZiioFZxKoiygjGiKJRxoaC_KCqtiWmZ8DF6PP9tvfs6QBf01h1801dqphinfQvjvYudXaV3XefB6tbXe-NPmhI9wNO_8PQAT__B60MP51ANAP8BJamghPMfEqprRQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2923124623</pqid></control><display><type>article</type><title>A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation</title><source>IEEE Xplore (Online service)</source><creator>Wang, Shouman ; Chen, Jiajia</creator><creatorcontrib>Wang, Shouman ; Chen, Jiajia</creatorcontrib><description>FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a new input partial sum sharing scheme is proposed to reuse the hardware resources to further reduce the adder cost. Logic synthesis results in ASIC show that the proposed 16-point FFT architecture can save area and power cost by at least 19.1% and 19.0% respectively compared with the recently published designs. Similarly, the proposed 32-point FFT architecture can reduce both power and delay by at least 6.91% and 5.35%.</description><identifier>ISSN: 1549-7747</identifier><identifier>EISSN: 1558-3791</identifier><identifier>DOI: 10.1109/TCSII.2022.3188255</identifier><identifier>CODEN: ITCSFK</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Adders ; Algorithms ; Complexity ; Complexity theory ; Computer architecture ; Costs ; Digital signal processing ; Discrete Fourier transforms ; FFT ; IP networks ; Logic synthesis ; Merging ; partial sum sharing ; twiddle factors</subject><ispartof>IEEE transactions on circuits and systems. II, Express briefs, 2024-02, Vol.71 (2), p.832-836</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c246t-8cda39c6f70385ffeedb5c6b88deabb1f931509f522091ec4b9edea918fa41c63</cites><orcidid>0000-0002-1642-8007</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9815103$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Wang, Shouman</creatorcontrib><creatorcontrib>Chen, Jiajia</creatorcontrib><title>A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation</title><title>IEEE transactions on circuits and systems. II, Express briefs</title><addtitle>TCSII</addtitle><description>FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a new input partial sum sharing scheme is proposed to reuse the hardware resources to further reduce the adder cost. Logic synthesis results in ASIC show that the proposed 16-point FFT architecture can save area and power cost by at least 19.1% and 19.0% respectively compared with the recently published designs. Similarly, the proposed 32-point FFT architecture can reduce both power and delay by at least 6.91% and 5.35%.</description><subject>Adders</subject><subject>Algorithms</subject><subject>Complexity</subject><subject>Complexity theory</subject><subject>Computer architecture</subject><subject>Costs</subject><subject>Digital signal processing</subject><subject>Discrete Fourier transforms</subject><subject>FFT</subject><subject>IP networks</subject><subject>Logic synthesis</subject><subject>Merging</subject><subject>partial sum sharing</subject><subject>twiddle factors</subject><issn>1549-7747</issn><issn>1558-3791</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNo9kM1OwzAQhC0EEqXwAnCxxDnFP3FiH6tAS6QCh5az5STrNlUbB8dV6duTUMRpZ7UzO9KH0D0lE0qJelplyzyfMMLYhFMpmRAXaESFkBFPFb0cdKyiNI3Ta3TTdVtCmCKcjdByit_hiPOmPQQ89-7Q1s0am6bCy43xg36DsHEVDg4_Q1evG7xwR5y5fbuD7zqc8Gy2wvmw7aEJJtSuuUVX1uw6uPubY_Q5e1llr9HiY55n00VUsjgJkSwrw1WZ2JRwKawFqApRJoWUFZiioFZxKoiygjGiKJRxoaC_KCqtiWmZ8DF6PP9tvfs6QBf01h1801dqphinfQvjvYudXaV3XefB6tbXe-NPmhI9wNO_8PQAT__B60MP51ANAP8BJamghPMfEqprRQ</recordid><startdate>20240201</startdate><enddate>20240201</enddate><creator>Wang, Shouman</creator><creator>Chen, Jiajia</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-1642-8007</orcidid></search><sort><creationdate>20240201</creationdate><title>A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation</title><author>Wang, Shouman ; Chen, Jiajia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c246t-8cda39c6f70385ffeedb5c6b88deabb1f931509f522091ec4b9edea918fa41c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Adders</topic><topic>Algorithms</topic><topic>Complexity</topic><topic>Complexity theory</topic><topic>Computer architecture</topic><topic>Costs</topic><topic>Digital signal processing</topic><topic>Discrete Fourier transforms</topic><topic>FFT</topic><topic>IP networks</topic><topic>Logic synthesis</topic><topic>Merging</topic><topic>partial sum sharing</topic><topic>twiddle factors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Shouman</creatorcontrib><creatorcontrib>Chen, Jiajia</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Shouman</au><au>Chen, Jiajia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation</atitle><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle><stitle>TCSII</stitle><date>2024-02-01</date><risdate>2024</risdate><volume>71</volume><issue>2</issue><spage>832</spage><epage>836</epage><pages>832-836</pages><issn>1549-7747</issn><eissn>1558-3791</eissn><coden>ITCSFK</coden><abstract>FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a new input partial sum sharing scheme is proposed to reuse the hardware resources to further reduce the adder cost. Logic synthesis results in ASIC show that the proposed 16-point FFT architecture can save area and power cost by at least 19.1% and 19.0% respectively compared with the recently published designs. Similarly, the proposed 32-point FFT architecture can reduce both power and delay by at least 6.91% and 5.35%.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCSII.2022.3188255</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-1642-8007</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1549-7747 |
| ispartof | IEEE transactions on circuits and systems. II, Express briefs, 2024-02, Vol.71 (2), p.832-836 |
| issn | 1549-7747 1558-3791 |
| language | eng |
| recordid | cdi_ieee_primary_9815103 |
| source | IEEE Xplore (Online service) |
| subjects | Adders Algorithms Complexity Complexity theory Computer architecture Costs Digital signal processing Discrete Fourier transforms FFT IP networks Logic synthesis Merging partial sum sharing twiddle factors |
| title | A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A25%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20New%20Input%20Grouping%20and%20Sharing%20Method%20to%20Design%20Low%20Complexity%20FFT%20Implementation&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems.%20II,%20Express%20briefs&rft.au=Wang,%20Shouman&rft.date=2024-02-01&rft.volume=71&rft.issue=2&rft.spage=832&rft.epage=836&rft.pages=832-836&rft.issn=1549-7747&rft.eissn=1558-3791&rft.coden=ITCSFK&rft_id=info:doi/10.1109/TCSII.2022.3188255&rft_dat=%3Cproquest_ieee_%3E2923124623%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c246t-8cda39c6f70385ffeedb5c6b88deabb1f931509f522091ec4b9edea918fa41c63%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2923124623&rft_id=info:pmid/&rft_ieee_id=9815103&rfr_iscdi=true |