Algorithms for Discrete Fourier Transform and Convolution:
This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and...
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
Springer New York
1997
|
| Ausgabe: | Second Edition |
| Schriftenreihe: | Signal Processing and Digital Filtering
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1007/978-1-4757-2767-8 https://doi.org/10.1007/978-1-4757-2767-8 |
| Zusammenfassung: | This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task |
| Umfang: | 1 Online-Ressource (XII, 268 p) |
| ISBN: | 9781475727678 |
| DOI: | 10.1007/978-1-4757-2767-8 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV045187187 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180912s1997 xx o|||| 00||| eng d | ||
| 020 | |a 9781475727678 |9 978-1-4757-2767-8 | ||
| 024 | 7 | |a 10.1007/978-1-4757-2767-8 |2 doi | |
| 035 | |a (ZDB-2-ENG)978-1-4757-2767-8 | ||
| 035 | |a (OCoLC)1184503408 | ||
| 035 | |a (DE-599)BVBBV045187187 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 621.382 |2 23 | |
| 100 | 1 | |a Tolimieri, Richard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for Discrete Fourier Transform and Convolution |c by Richard Tolimieri, Chao Lu, Myoung An |
| 250 | |a Second Edition | ||
| 264 | 1 | |a New York, NY |b Springer New York |c 1997 | |
| 300 | |a 1 Online-Ressource (XII, 268 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Signal Processing and Digital Filtering | |
| 520 | |a This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task | ||
| 650 | 4 | |a Engineering | |
| 650 | 4 | |a Signal, Image and Speech Processing | |
| 650 | 4 | |a Engineering, general | |
| 650 | 4 | |a Functional Analysis | |
| 650 | 4 | |a Engineering | |
| 650 | 4 | |a Functional analysis | |
| 650 | 0 | 7 | |a Tensorprodukt |0 (DE-588)4059478-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Digitale Signalverarbeitung |0 (DE-588)4113314-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskrete Fourier-Transformation |0 (DE-588)4150175-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fourier-Transformation |0 (DE-588)4018014-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Faltung |g Mathematik |0 (DE-588)4141470-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143389-0 |a Aufgabensammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Digitale Signalverarbeitung |0 (DE-588)4113314-6 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Tensorprodukt |0 (DE-588)4059478-6 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Fourier-Transformation |0 (DE-588)4018014-1 |D s |
| 689 | 1 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 689 | 2 | 0 | |a Faltung |g Mathematik |0 (DE-588)4141470-6 |D s |
| 689 | 2 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | |8 4\p |5 DE-604 | |
| 689 | 3 | 0 | |a Faltung |g Mathematik |0 (DE-588)4141470-6 |D s |
| 689 | 3 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 3 | |8 5\p |5 DE-604 | |
| 689 | 4 | 0 | |a Diskrete Fourier-Transformation |0 (DE-588)4150175-5 |D s |
| 689 | 4 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 4 | |8 6\p |5 DE-604 | |
| 700 | 1 | |a Lu, Chao |4 aut | |
| 700 | 1 | |a An, Myoung |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441931153 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-2767-8 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-ENG | ||
| 940 | 1 | |q ZDB-2-ENG_Archiv | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030576365 | |
| 966 | e | |u https://doi.org/10.1007/978-1-4757-2767-8 |l DE-634 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1818984514302509056 |
|---|---|
| any_adam_object | |
| author | Tolimieri, Richard Lu, Chao An, Myoung |
| author_facet | Tolimieri, Richard Lu, Chao An, Myoung |
| author_role | aut aut aut |
| author_sort | Tolimieri, Richard |
| author_variant | r t rt c l cl m a ma |
| building | Verbundindex |
| bvnumber | BV045187187 |
| collection | ZDB-2-ENG |
| ctrlnum | (ZDB-2-ENG)978-1-4757-2767-8 (OCoLC)1184503408 (DE-599)BVBBV045187187 |
| dewey-full | 621.382 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.382 |
| dewey-search | 621.382 |
| dewey-sort | 3621.382 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| doi_str_mv | 10.1007/978-1-4757-2767-8 |
| edition | Second Edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04947nam a2200841zc 4500</leader><controlfield tag="001">BV045187187</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1997 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475727678</subfield><subfield code="9">978-1-4757-2767-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-2767-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-1-4757-2767-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184503408</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045187187</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-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.382</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tolimieri, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for Discrete Fourier Transform and Convolution</subfield><subfield code="c">by Richard Tolimieri, Chao Lu, Myoung An</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second Edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 268 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">Signal Processing and Digital Filtering</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">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">Engineering, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional analysis</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Tensorprodukt</subfield><subfield code="0">(DE-588)4059478-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Digitale Signalverarbeitung</subfield><subfield code="0">(DE-588)4113314-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Fourier-Transformation</subfield><subfield code="0">(DE-588)4150175-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fourier-Transformation</subfield><subfield code="0">(DE-588)4018014-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Faltung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4141470-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143389-0</subfield><subfield code="a">Aufgabensammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Digitale Signalverarbeitung</subfield><subfield code="0">(DE-588)4113314-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Tensorprodukt</subfield><subfield code="0">(DE-588)4059478-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Fourier-Transformation</subfield><subfield code="0">(DE-588)4018014-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Faltung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4141470-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Faltung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4141470-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Diskrete Fourier-Transformation</subfield><subfield code="0">(DE-588)4150175-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lu, Chao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">An, Myoung</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781441931153</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-2767-8</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030576365</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-2767-8</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content |
| genre_facet | Aufgabensammlung |
| id | DE-604.BV045187187 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T18:20:13Z |
| institution | BVB |
| isbn | 9781475727678 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030576365 |
| oclc_num | 1184503408 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XII, 268 p) |
| psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer New York |
| record_format | marc |
| series2 | Signal Processing and Digital Filtering |
| spelling | Tolimieri, Richard Verfasser aut Algorithms for Discrete Fourier Transform and Convolution by Richard Tolimieri, Chao Lu, Myoung An Second Edition New York, NY Springer New York 1997 1 Online-Ressource (XII, 268 p) txt rdacontent c rdamedia cr rdacarrier Signal Processing and Digital Filtering This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task Engineering Signal, Image and Speech Processing Engineering, general Functional Analysis Functional analysis Tensorprodukt (DE-588)4059478-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Digitale Signalverarbeitung (DE-588)4113314-6 gnd rswk-swf Diskrete Fourier-Transformation (DE-588)4150175-5 gnd rswk-swf Fourier-Transformation (DE-588)4018014-1 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Faltung Mathematik (DE-588)4141470-6 gnd rswk-swf 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content Digitale Signalverarbeitung (DE-588)4113314-6 s Algorithmus (DE-588)4001183-5 s Tensorprodukt (DE-588)4059478-6 s 2\p DE-604 Fourier-Transformation (DE-588)4018014-1 s Datenverarbeitung (DE-588)4011152-0 s 3\p DE-604 Faltung Mathematik (DE-588)4141470-6 s 4\p DE-604 5\p DE-604 Diskrete Fourier-Transformation (DE-588)4150175-5 s 6\p DE-604 Lu, Chao aut An, Myoung aut Erscheint auch als Druck-Ausgabe 9781441931153 https://doi.org/10.1007/978-1-4757-2767-8 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Tolimieri, Richard Lu, Chao An, Myoung Algorithms for Discrete Fourier Transform and Convolution Engineering Signal, Image and Speech Processing Engineering, general Functional Analysis Functional analysis Tensorprodukt (DE-588)4059478-6 gnd Algorithmus (DE-588)4001183-5 gnd Digitale Signalverarbeitung (DE-588)4113314-6 gnd Diskrete Fourier-Transformation (DE-588)4150175-5 gnd Fourier-Transformation (DE-588)4018014-1 gnd Datenverarbeitung (DE-588)4011152-0 gnd Faltung Mathematik (DE-588)4141470-6 gnd |
| subject_GND | (DE-588)4059478-6 (DE-588)4001183-5 (DE-588)4113314-6 (DE-588)4150175-5 (DE-588)4018014-1 (DE-588)4011152-0 (DE-588)4141470-6 (DE-588)4143389-0 |
| title | Algorithms for Discrete Fourier Transform and Convolution |
| title_auth | Algorithms for Discrete Fourier Transform and Convolution |
| title_exact_search | Algorithms for Discrete Fourier Transform and Convolution |
| title_full | Algorithms for Discrete Fourier Transform and Convolution by Richard Tolimieri, Chao Lu, Myoung An |
| title_fullStr | Algorithms for Discrete Fourier Transform and Convolution by Richard Tolimieri, Chao Lu, Myoung An |
| title_full_unstemmed | Algorithms for Discrete Fourier Transform and Convolution by Richard Tolimieri, Chao Lu, Myoung An |
| title_short | Algorithms for Discrete Fourier Transform and Convolution |
| title_sort | algorithms for discrete fourier transform and convolution |
| topic | Engineering Signal, Image and Speech Processing Engineering, general Functional Analysis Functional analysis Tensorprodukt (DE-588)4059478-6 gnd Algorithmus (DE-588)4001183-5 gnd Digitale Signalverarbeitung (DE-588)4113314-6 gnd Diskrete Fourier-Transformation (DE-588)4150175-5 gnd Fourier-Transformation (DE-588)4018014-1 gnd Datenverarbeitung (DE-588)4011152-0 gnd Faltung Mathematik (DE-588)4141470-6 gnd |
| topic_facet | Engineering Signal, Image and Speech Processing Engineering, general Functional Analysis Functional analysis Tensorprodukt Algorithmus Digitale Signalverarbeitung Diskrete Fourier-Transformation Fourier-Transformation Datenverarbeitung Faltung Mathematik Aufgabensammlung |
| url | https://doi.org/10.1007/978-1-4757-2767-8 |
| work_keys_str_mv | AT tolimieririchard algorithmsfordiscretefouriertransformandconvolution AT luchao algorithmsfordiscretefouriertransformandconvolution AT anmyoung algorithmsfordiscretefouriertransformandconvolution |