Efficient algorithm for 2-D arithmetic Fourier transform

This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1997-08, Vol.45 (8), p.2136-2140
Main Authors: GE, X.-J, CHEN, N.-X, CHEN, Z.-D
Format: Article
Language:English
Subjects:
Acoustic noise
Applied sciences
Arithmetic
Exact sciences and technology
Fourier transforms
Information, signal and communications theory
Mathematical methods
Signal processing
Signal processing algorithms
Solid modeling
Spectral analysis
Speech processing
Telecommunications and information theory
Two dimensional displays
Very large scale integration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3
cites cdi_FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3
container_end_page 2140
container_issue 8
container_start_page 2136
container_title IEEE transactions on signal processing
container_volume 45
creator GE, X.-J
CHEN, N.-X
CHEN, Z.-D
description This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm.
doi_str_mv 10.1109/78.611235
format article
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_28264807</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>611235</ieee_id><sourcerecordid>28264807</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3</originalsourceid><addsrcrecordid>eNo9kL1PwzAQxS0EEqUwsDJlQEgMKXb8dRlRaQGpEgtIbJHjnMEoaYqdDvz3GBJ1und6v3vSPUIuGV0wRss7DQvFWMHlEZmxUrCcCq2Ok6aS5xL0-yk5i_GLUiZEqWYEVs5563E7ZKb96IMfPrvM9SEr8ofM_K84eJut-33wGLIhmG1MfndOTpxpI15Mc07e1qvX5VO-eXl8Xt5vcsupGvKSoTQSFLfC2aJUvJRNTU1SmtMaJLfomOTAhBS0aTjF2gl0ogFwrEbkc3Iz5u5C_73HOFSdjxbb1myx38eqgEIJoDqBtyNoQx9jQFftgu9M-KkYrf66qTRUYzeJvZ5CTbSmdekp6-PhoNAAikLCrkbMI-LBnTJ-AX8CalE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28264807</pqid></control><display><type>article</type><title>Efficient algorithm for 2-D arithmetic Fourier transform</title><source>IEEE Electronic Library (IEL) Journals</source><creator>GE, X.-J ; CHEN, N.-X ; CHEN, Z.-D</creator><creatorcontrib>GE, X.-J ; CHEN, N.-X ; CHEN, Z.-D</creatorcontrib><description>This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/78.611235</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Acoustic noise ; Applied sciences ; Arithmetic ; Exact sciences and technology ; Fourier transforms ; Information, signal and communications theory ; Mathematical methods ; Signal processing ; Signal processing algorithms ; Solid modeling ; Spectral analysis ; Speech processing ; Telecommunications and information theory ; Two dimensional displays ; Very large scale integration</subject><ispartof>IEEE transactions on signal processing, 1997-08, Vol.45 (8), p.2136-2140</ispartof><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3</citedby><cites>FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/611235$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,786,790,27957,27958,55147</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2788608$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>GE, X.-J</creatorcontrib><creatorcontrib>CHEN, N.-X</creatorcontrib><creatorcontrib>CHEN, Z.-D</creatorcontrib><title>Efficient algorithm for 2-D arithmetic Fourier transform</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm.</description><subject>Acoustic noise</subject><subject>Applied sciences</subject><subject>Arithmetic</subject><subject>Exact sciences and technology</subject><subject>Fourier transforms</subject><subject>Information, signal and communications theory</subject><subject>Mathematical methods</subject><subject>Signal processing</subject><subject>Signal processing algorithms</subject><subject>Solid modeling</subject><subject>Spectral analysis</subject><subject>Speech processing</subject><subject>Telecommunications and information theory</subject><subject>Two dimensional displays</subject><subject>Very large scale integration</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNo9kL1PwzAQxS0EEqUwsDJlQEgMKXb8dRlRaQGpEgtIbJHjnMEoaYqdDvz3GBJ1und6v3vSPUIuGV0wRss7DQvFWMHlEZmxUrCcCq2Ok6aS5xL0-yk5i_GLUiZEqWYEVs5563E7ZKb96IMfPrvM9SEr8ofM_K84eJut-33wGLIhmG1MfndOTpxpI15Mc07e1qvX5VO-eXl8Xt5vcsupGvKSoTQSFLfC2aJUvJRNTU1SmtMaJLfomOTAhBS0aTjF2gl0ogFwrEbkc3Iz5u5C_73HOFSdjxbb1myx38eqgEIJoDqBtyNoQx9jQFftgu9M-KkYrf66qTRUYzeJvZ5CTbSmdekp6-PhoNAAikLCrkbMI-LBnTJ-AX8CalE</recordid><startdate>19970801</startdate><enddate>19970801</enddate><creator>GE, X.-J</creator><creator>CHEN, N.-X</creator><creator>CHEN, Z.-D</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19970801</creationdate><title>Efficient algorithm for 2-D arithmetic Fourier transform</title><author>GE, X.-J ; CHEN, N.-X ; CHEN, Z.-D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Acoustic noise</topic><topic>Applied sciences</topic><topic>Arithmetic</topic><topic>Exact sciences and technology</topic><topic>Fourier transforms</topic><topic>Information, signal and communications theory</topic><topic>Mathematical methods</topic><topic>Signal processing</topic><topic>Signal processing algorithms</topic><topic>Solid modeling</topic><topic>Spectral analysis</topic><topic>Speech processing</topic><topic>Telecommunications and information theory</topic><topic>Two dimensional displays</topic><topic>Very large scale integration</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GE, X.-J</creatorcontrib><creatorcontrib>CHEN, N.-X</creatorcontrib><creatorcontrib>CHEN, Z.-D</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GE, X.-J</au><au>CHEN, N.-X</au><au>CHEN, Z.-D</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient algorithm for 2-D arithmetic Fourier transform</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>1997-08-01</date><risdate>1997</risdate><volume>45</volume><issue>8</issue><spage>2136</spage><epage>2140</epage><pages>2136-2140</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><notes>ObjectType-Article-2</notes><notes>SourceType-Scholarly Journals-1</notes><notes>ObjectType-Feature-1</notes><notes>content type line 23</notes><abstract>This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/78.611235</doi><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1053-587X
ispartof IEEE transactions on signal processing, 1997-08, Vol.45 (8), p.2136-2140
issn 1053-587X
1941-0476
language eng
recordid cdi_proquest_miscellaneous_28264807
source IEEE Electronic Library (IEL) Journals
subjects Acoustic noise
Applied sciences
Arithmetic
Exact sciences and technology
Fourier transforms
Information, signal and communications theory
Mathematical methods
Signal processing
Signal processing algorithms
Solid modeling
Spectral analysis
Speech processing
Telecommunications and information theory
Two dimensional displays
Very large scale integration
title Efficient algorithm for 2-D arithmetic Fourier transform
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T02%3A34%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20algorithm%20for%202-D%20arithmetic%20Fourier%20transform&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=GE,%20X.-J&rft.date=1997-08-01&rft.volume=45&rft.issue=8&rft.spage=2136&rft.epage=2140&rft.pages=2136-2140&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/78.611235&rft_dat=%3Cproquest_pasca%3E28264807%3C/proquest_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c306t-91e5a5863c4fc296395db0a296730b853cef153814540dd30ebf4ef4d88f1bee3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28264807&rft_id=info:pmid/&rft_ieee_id=611235&rfr_iscdi=true