Efficient computation of the running discrete Haar transform
This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).
Gespeichert in:
Veröffentlicht in: | IEEE transactions on power delivery 2006-01, Vol.21 (1), p.504-505 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 505 |
---|---|
container_issue | 1 |
container_start_page | 504 |
container_title | IEEE transactions on power delivery |
container_volume | 21 |
creator | Macias, J.A.R. Exposito, A.G. |
description | This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)). |
doi_str_mv | 10.1109/TPWRD.2005.859289 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_17389997</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1564239</ieee_id><sourcerecordid>896176403</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-1f026ce31cc30ba5973142a7f281fb4224b2756d34bf00a1a7a52b50ccf504cd3</originalsourceid><addsrcrecordid>eNp9kMtKAzEUhoMoWKsPIG4GQV1NPblNEnAjtV6goEjFZcikiU6ZS01mFr69U6dQcOHqLM73n8uH0CmGCcagrhcv7693EwLAJ5IrItUeGmFFRcoIyH00Ail5KpUQh-goxhUAMFAwQjcz7wtbuLpNbFOtu9a0RVMnjU_aT5eErq6L-iNZFtEG17rk0ZiQtMHU0TehOkYH3pTRnWzrGL3dzxbTx3T-_PA0vZ2nlkreptgDyayj2FoKueFKUMyIEZ5I7HNGCMuJ4NmSstwDGGyE4STnYK3nwOySjtHVMHcdmq_OxVZX_UGuLE3tmi5qqTIsMga0Jy__JYkEUIpswPM_4KrpQt1_oWWWUcl4xnoID5ANTYzBeb0ORWXCt8agN9r1r3a90a4H7X3mYjvYRGtK37uyRdwFBZVK9QbG6GzgCufcrt2vJVTRH-f1ii8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>866384564</pqid></control><display><type>article</type><title>Efficient computation of the running discrete Haar transform</title><source>IEEE Electronic Library (IEL)</source><creator>Macias, J.A.R. ; Exposito, A.G.</creator><creatorcontrib>Macias, J.A.R. ; Exposito, A.G.</creatorcontrib><description>This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).</description><identifier>ISSN: 0885-8977</identifier><identifier>EISSN: 1937-4208</identifier><identifier>DOI: 10.1109/TPWRD.2005.859289</identifier><identifier>CODEN: ITPDE5</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Artificial intelligence ; Complexity ; Computation ; Computational complexity ; Computational efficiency ; Computer science; control theory; systems ; Discrete Fourier transforms ; Discrete transforms ; Discrete wavelet transforms ; Disturbances. Regulation. Protection ; Electrical engineering. Electrical power engineering ; Electrical power engineering ; Exact sciences and technology ; Frequency domain analysis ; Monitoring ; Pattern recognition. Digital image processing. Computational geometry ; Power networks and lines ; Power quality ; Power system faults ; Power system protection ; Running ; Signal processing algorithms ; Transforms ; Wavelet transforms</subject><ispartof>IEEE transactions on power delivery, 2006-01, Vol.21 (1), p.504-505</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-1f026ce31cc30ba5973142a7f281fb4224b2756d34bf00a1a7a52b50ccf504cd3</citedby><cites>FETCH-LOGICAL-c385t-1f026ce31cc30ba5973142a7f281fb4224b2756d34bf00a1a7a52b50ccf504cd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1564239$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,4024,27923,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1564239$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17389997$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Macias, J.A.R.</creatorcontrib><creatorcontrib>Exposito, A.G.</creatorcontrib><title>Efficient computation of the running discrete Haar transform</title><title>IEEE transactions on power delivery</title><addtitle>TPWRD</addtitle><description>This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Complexity</subject><subject>Computation</subject><subject>Computational complexity</subject><subject>Computational efficiency</subject><subject>Computer science; control theory; systems</subject><subject>Discrete Fourier transforms</subject><subject>Discrete transforms</subject><subject>Discrete wavelet transforms</subject><subject>Disturbances. Regulation. Protection</subject><subject>Electrical engineering. Electrical power engineering</subject><subject>Electrical power engineering</subject><subject>Exact sciences and technology</subject><subject>Frequency domain analysis</subject><subject>Monitoring</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Power networks and lines</subject><subject>Power quality</subject><subject>Power system faults</subject><subject>Power system protection</subject><subject>Running</subject><subject>Signal processing algorithms</subject><subject>Transforms</subject><subject>Wavelet transforms</subject><issn>0885-8977</issn><issn>1937-4208</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kMtKAzEUhoMoWKsPIG4GQV1NPblNEnAjtV6goEjFZcikiU6ZS01mFr69U6dQcOHqLM73n8uH0CmGCcagrhcv7693EwLAJ5IrItUeGmFFRcoIyH00Ail5KpUQh-goxhUAMFAwQjcz7wtbuLpNbFOtu9a0RVMnjU_aT5eErq6L-iNZFtEG17rk0ZiQtMHU0TehOkYH3pTRnWzrGL3dzxbTx3T-_PA0vZ2nlkreptgDyayj2FoKueFKUMyIEZ5I7HNGCMuJ4NmSstwDGGyE4STnYK3nwOySjtHVMHcdmq_OxVZX_UGuLE3tmi5qqTIsMga0Jy__JYkEUIpswPM_4KrpQt1_oWWWUcl4xnoID5ANTYzBeb0ORWXCt8agN9r1r3a90a4H7X3mYjvYRGtK37uyRdwFBZVK9QbG6GzgCufcrt2vJVTRH-f1ii8</recordid><startdate>200601</startdate><enddate>200601</enddate><creator>Macias, J.A.R.</creator><creator>Exposito, A.G.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope><scope>L7M</scope><scope>F28</scope></search><sort><creationdate>200601</creationdate><title>Efficient computation of the running discrete Haar transform</title><author>Macias, J.A.R. ; Exposito, A.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-1f026ce31cc30ba5973142a7f281fb4224b2756d34bf00a1a7a52b50ccf504cd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Complexity</topic><topic>Computation</topic><topic>Computational complexity</topic><topic>Computational efficiency</topic><topic>Computer science; control theory; systems</topic><topic>Discrete Fourier transforms</topic><topic>Discrete transforms</topic><topic>Discrete wavelet transforms</topic><topic>Disturbances. Regulation. Protection</topic><topic>Electrical engineering. Electrical power engineering</topic><topic>Electrical power engineering</topic><topic>Exact sciences and technology</topic><topic>Frequency domain analysis</topic><topic>Monitoring</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Power networks and lines</topic><topic>Power quality</topic><topic>Power system faults</topic><topic>Power system protection</topic><topic>Running</topic><topic>Signal processing algorithms</topic><topic>Transforms</topic><topic>Wavelet transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Macias, J.A.R.</creatorcontrib><creatorcontrib>Exposito, A.G.</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><jtitle>IEEE transactions on power delivery</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Macias, J.A.R.</au><au>Exposito, A.G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient computation of the running discrete Haar transform</atitle><jtitle>IEEE transactions on power delivery</jtitle><stitle>TPWRD</stitle><date>2006-01</date><risdate>2006</risdate><volume>21</volume><issue>1</issue><spage>504</spage><epage>505</epage><pages>504-505</pages><issn>0885-8977</issn><eissn>1937-4208</eissn><coden>ITPDE5</coden><abstract>This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TPWRD.2005.859289</doi><tpages>2</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0885-8977 |
ispartof | IEEE transactions on power delivery, 2006-01, Vol.21 (1), p.504-505 |
issn | 0885-8977 1937-4208 |
language | eng |
recordid | cdi_pascalfrancis_primary_17389997 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Applied sciences Artificial intelligence Complexity Computation Computational complexity Computational efficiency Computer science control theory systems Discrete Fourier transforms Discrete transforms Discrete wavelet transforms Disturbances. Regulation. Protection Electrical engineering. Electrical power engineering Electrical power engineering Exact sciences and technology Frequency domain analysis Monitoring Pattern recognition. Digital image processing. Computational geometry Power networks and lines Power quality Power system faults Power system protection Running Signal processing algorithms Transforms Wavelet transforms |
title | Efficient computation of the running discrete Haar transform |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A30%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20computation%20of%20the%20running%20discrete%20Haar%20transform&rft.jtitle=IEEE%20transactions%20on%20power%20delivery&rft.au=Macias,%20J.A.R.&rft.date=2006-01&rft.volume=21&rft.issue=1&rft.spage=504&rft.epage=505&rft.pages=504-505&rft.issn=0885-8977&rft.eissn=1937-4208&rft.coden=ITPDE5&rft_id=info:doi/10.1109/TPWRD.2005.859289&rft_dat=%3Cproquest_RIE%3E896176403%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=866384564&rft_id=info:pmid/&rft_ieee_id=1564239&rfr_iscdi=true |