A second improved digit-reversal permutation algorithm for fast transforms

A second improved digit-reversal permutation algorithm for fast transforms

Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform algorithms, a fourth theorem is given, indicating an alternate order of generating the index pairs for swapping, and a second permutation algorithm results. This algorithm uses...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on acoustics, speech, and signal processing speech, and signal processing, 1989-08, Vol.37 (8), p.1288-1291
1. Verfasser: Evans, D.M.W.
Format: Artikel
Sprache:eng
Schlagworte:
Acoustic signal processing
Genetic mutations
Signal processing algorithms
Speech processing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1291
container_issue 8
container_start_page 1288
container_title IEEE transactions on acoustics, speech, and signal processing
container_volume 37
creator Evans, D.M.W.
description Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform algorithms, a fourth theorem is given, indicating an alternate order of generating the index pairs for swapping, and a second permutation algorithm results. This algorithm uses the same principles as the first and differs principally in that in its innermost loop, one of the pair of indexes is usually generated by an integer increment (i:=i+n). This will result in slightly faster execution on most computers.< >
doi_str_mv 10.1109/29.31278
format Article
fullrecord <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_31278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>31278</ieee_id><sourcerecordid>10_1109_29_31278</sourcerecordid><originalsourceid>FETCH-LOGICAL-c243t-9b302a07ba6894833bf6622a98145a8e247df9d4aadff26ff58e00e1cfb054153</originalsourceid><addsrcrecordid>eNo9j0tLxDAUhbNQcBwFt-6ydNMxzzZZDoNPBtzoutw2N2OknZQkDvjvHa24OhzOx4GPkCvOVpwzeyvsSnLRmBOyYMzWldTcnJHznD8Y48posSDPa5qxj3tHwzileEBHXdiFUiU8YMow0AnT-FmghLinMOxiCuV9pD4m6iEXWhLs87GN-YKcehgyXv7lkrzd371uHqvty8PTZr2teqFkqWwnmQDWdFAbq4yUna9rIcAarjQYFKpx3joF4LwXtffaIGPIe98xrbiWS3Iz__Yp5pzQt1MKI6SvlrP2x7sVtv31PqLXMxoQ8R-bt292wFWN</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A second improved digit-reversal permutation algorithm for fast transforms</title><source>IEEE Electronic Library (IEL)</source><creator>Evans, D.M.W.</creator><creatorcontrib>Evans, D.M.W.</creatorcontrib><description>Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform algorithms, a fourth theorem is given, indicating an alternate order of generating the index pairs for swapping, and a second permutation algorithm results. This algorithm uses the same principles as the first and differs principally in that in its innermost loop, one of the pair of indexes is usually generated by an integer increment (i:=i+n). This will result in slightly faster execution on most computers.&lt; &gt;</description><identifier>ISSN: 0096-3518</identifier><identifier>DOI: 10.1109/29.31278</identifier><identifier>CODEN: IETABA</identifier><language>eng</language><publisher>IEEE</publisher><subject>Acoustic signal processing ; Genetic mutations ; Signal processing algorithms ; Speech processing</subject><ispartof>IEEE transactions on acoustics, speech, and signal processing, 1989-08, Vol.37 (8), p.1288-1291</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c243t-9b302a07ba6894833bf6622a98145a8e247df9d4aadff26ff58e00e1cfb054153</citedby><cites>FETCH-LOGICAL-c243t-9b302a07ba6894833bf6622a98145a8e247df9d4aadff26ff58e00e1cfb054153</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/31278$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/31278$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Evans, D.M.W.</creatorcontrib><title>A second improved digit-reversal permutation algorithm for fast transforms</title><title>IEEE transactions on acoustics, speech, and signal processing</title><addtitle>T-ASSP</addtitle><description>Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform algorithms, a fourth theorem is given, indicating an alternate order of generating the index pairs for swapping, and a second permutation algorithm results. This algorithm uses the same principles as the first and differs principally in that in its innermost loop, one of the pair of indexes is usually generated by an integer increment (i:=i+n). This will result in slightly faster execution on most computers.&lt; &gt;</description><subject>Acoustic signal processing</subject><subject>Genetic mutations</subject><subject>Signal processing algorithms</subject><subject>Speech processing</subject><issn>0096-3518</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNo9j0tLxDAUhbNQcBwFt-6ydNMxzzZZDoNPBtzoutw2N2OknZQkDvjvHa24OhzOx4GPkCvOVpwzeyvsSnLRmBOyYMzWldTcnJHznD8Y48posSDPa5qxj3tHwzileEBHXdiFUiU8YMow0AnT-FmghLinMOxiCuV9pD4m6iEXWhLs87GN-YKcehgyXv7lkrzd371uHqvty8PTZr2teqFkqWwnmQDWdFAbq4yUna9rIcAarjQYFKpx3joF4LwXtffaIGPIe98xrbiWS3Iz__Yp5pzQt1MKI6SvlrP2x7sVtv31PqLXMxoQ8R-bt292wFWN</recordid><startdate>19890801</startdate><enddate>19890801</enddate><creator>Evans, D.M.W.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19890801</creationdate><title>A second improved digit-reversal permutation algorithm for fast transforms</title><author>Evans, D.M.W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c243t-9b302a07ba6894833bf6622a98145a8e247df9d4aadff26ff58e00e1cfb054153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Acoustic signal processing</topic><topic>Genetic mutations</topic><topic>Signal processing algorithms</topic><topic>Speech processing</topic><toplevel>online_resources</toplevel><creatorcontrib>Evans, D.M.W.</creatorcontrib><collection>CrossRef</collection><jtitle>IEEE transactions on acoustics, speech, and signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Evans, D.M.W.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A second improved digit-reversal permutation algorithm for fast transforms</atitle><jtitle>IEEE transactions on acoustics, speech, and signal processing</jtitle><stitle>T-ASSP</stitle><date>1989-08-01</date><risdate>1989</risdate><volume>37</volume><issue>8</issue><spage>1288</spage><epage>1291</epage><pages>1288-1291</pages><issn>0096-3518</issn><coden>IETABA</coden><abstract>Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform algorithms, a fourth theorem is given, indicating an alternate order of generating the index pairs for swapping, and a second permutation algorithm results. This algorithm uses the same principles as the first and differs principally in that in its innermost loop, one of the pair of indexes is usually generated by an integer increment (i:=i+n). This will result in slightly faster execution on most computers.&lt; &gt;</abstract><pub>IEEE</pub><doi>10.1109/29.31278</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0096-3518
ispartof IEEE transactions on acoustics, speech, and signal processing, 1989-08, Vol.37 (8), p.1288-1291
issn 0096-3518
language eng
recordid cdi_ieee_primary_31278
source IEEE Electronic Library (IEL)
subjects Acoustic signal processing
Genetic mutations
Signal processing algorithms
Speech processing
title A second improved digit-reversal permutation algorithm for fast transforms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T16%3A25%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20second%20improved%20digit-reversal%20permutation%20algorithm%20for%20fast%20transforms&rft.jtitle=IEEE%20transactions%20on%20acoustics,%20speech,%20and%20signal%20processing&rft.au=Evans,%20D.M.W.&rft.date=1989-08-01&rft.volume=37&rft.issue=8&rft.spage=1288&rft.epage=1291&rft.pages=1288-1291&rft.issn=0096-3518&rft.coden=IETABA&rft_id=info:doi/10.1109/29.31278&rft_dat=%3Ccrossref_RIE%3E10_1109_29_31278%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=31278&rfr_iscdi=true