Transforms and Fast Algorithms for Signal Analysis and Representations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Birkhäuser Boston
2004
|
| Schriftenreihe: | Applied and Numerical Harmonic Analysis
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | . . . that is what learning is. You suddenly understand something you've un derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher ent problems still remain unsolved |
| Beschreibung: | 1 Online-Ressource (XIX, 422 p) |
| ISBN: | 9780817682200 9781461264996 |
| DOI: | 10.1007/978-0-8176-8220-0 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042419215 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9780817682200 |c Online |9 978-0-8176-8220-0 | ||
| 020 | |a 9781461264996 |c Print |9 978-1-4612-6499-6 | ||
| 024 | 7 | |a 10.1007/978-0-8176-8220-0 |2 doi | |
| 035 | |a (OCoLC)869864609 | ||
| 035 | |a (DE-599)BVBBV042419215 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 519 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Bi, Guoan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Transforms and Fast Algorithms for Signal Analysis and Representations |c by Guoan Bi, Yonghong Zeng |
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 2004 | |
| 300 | |a 1 Online-Ressource (XIX, 422 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied and Numerical Harmonic Analysis | |
| 500 | |a . . . that is what learning is. You suddenly understand something you've un derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher ent problems still remain unsolved | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Fourier analysis | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer engineering | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Fourier Analysis | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Signal, Image and Speech Processing | |
| 650 | 4 | |a Mathematik | |
| 700 | 1 | |a Zeng, Yonghong |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-8176-8220-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854632 | ||
Datensatz im Suchindex
| _version_ | 1804153089601568768 |
|---|---|
| any_adam_object | |
| author | Bi, Guoan |
| author_facet | Bi, Guoan |
| author_role | aut |
| author_sort | Bi, Guoan |
| author_variant | g b gb |
| building | Verbundindex |
| bvnumber | BV042419215 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)869864609 (DE-599)BVBBV042419215 |
| dewey-full | 519 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519 |
| dewey-search | 519 |
| dewey-sort | 3519 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-0-8176-8220-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03328nmm a2200505zc 4500</leader><controlfield tag="001">BV042419215</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817682200</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-8176-8220-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461264996</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-6499-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-8176-8220-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)869864609</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419215</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bi, Guoan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Transforms and Fast Algorithms for Signal Analysis and Representations</subfield><subfield code="c">by Guoan Bi, Yonghong Zeng</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 422 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Applied and Numerical Harmonic Analysis</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">. . . that is what learning is. You suddenly understand something you've un derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher ent problems still remain unsolved</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fourier analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fourier Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal, Image and Speech Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zeng, Yonghong</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-0-8176-8220-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854632</subfield></datafield></record></collection> |
| id | DE-604.BV042419215 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9780817682200 9781461264996 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854632 |
| oclc_num | 869864609 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIX, 422 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| series2 | Applied and Numerical Harmonic Analysis |
| spelling | Bi, Guoan Verfasser aut Transforms and Fast Algorithms for Signal Analysis and Representations by Guoan Bi, Yonghong Zeng Boston, MA Birkhäuser Boston 2004 1 Online-Ressource (XIX, 422 p) txt rdacontent c rdamedia cr rdacarrier Applied and Numerical Harmonic Analysis . . . that is what learning is. You suddenly understand something you've un derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher ent problems still remain unsolved Mathematics Computer software Fourier analysis Algorithms Computer engineering Applications of Mathematics Algorithm Analysis and Problem Complexity Fourier Analysis Electrical Engineering Signal, Image and Speech Processing Mathematik Zeng, Yonghong Sonstige oth https://doi.org/10.1007/978-0-8176-8220-0 Verlag Volltext |
| spellingShingle | Bi, Guoan Transforms and Fast Algorithms for Signal Analysis and Representations Mathematics Computer software Fourier analysis Algorithms Computer engineering Applications of Mathematics Algorithm Analysis and Problem Complexity Fourier Analysis Electrical Engineering Signal, Image and Speech Processing Mathematik |
| title | Transforms and Fast Algorithms for Signal Analysis and Representations |
| title_auth | Transforms and Fast Algorithms for Signal Analysis and Representations |
| title_exact_search | Transforms and Fast Algorithms for Signal Analysis and Representations |
| title_full | Transforms and Fast Algorithms for Signal Analysis and Representations by Guoan Bi, Yonghong Zeng |
| title_fullStr | Transforms and Fast Algorithms for Signal Analysis and Representations by Guoan Bi, Yonghong Zeng |
| title_full_unstemmed | Transforms and Fast Algorithms for Signal Analysis and Representations by Guoan Bi, Yonghong Zeng |
| title_short | Transforms and Fast Algorithms for Signal Analysis and Representations |
| title_sort | transforms and fast algorithms for signal analysis and representations |
| topic | Mathematics Computer software Fourier analysis Algorithms Computer engineering Applications of Mathematics Algorithm Analysis and Problem Complexity Fourier Analysis Electrical Engineering Signal, Image and Speech Processing Mathematik |
| topic_facet | Mathematics Computer software Fourier analysis Algorithms Computer engineering Applications of Mathematics Algorithm Analysis and Problem Complexity Fourier Analysis Electrical Engineering Signal, Image and Speech Processing Mathematik |
| url | https://doi.org/10.1007/978-0-8176-8220-0 |
| work_keys_str_mv | AT biguoan transformsandfastalgorithmsforsignalanalysisandrepresentations AT zengyonghong transformsandfastalgorithmsforsignalanalysisandrepresentations |