Verfügbarkeit: DFT FFT and convolution algorithms

DFT FFT and convolution algorithms: theory and implementation

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Burrus, C. S. (VerfasserIn)
Format:	Buch
Sprache:	Undetermined
Veröffentlicht:	New York <<[u.a.]>> Wiley 1985
Schriftenreihe:	Topics in digital signal processing A Wiley Interscience publication
Schlagworte:	Faltung > Mathematik Nachrichtentechnik Faltungsgleichung Digitale Signalverarbeitung Fourier-Transformation Signalprozessor 320 Diskrete Fourier-Transformation Schneller Faltungsalgorithmus
Beschreibung:	XIII, 232 S. graph. Darst. 26 cm

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV024640818
003	DE-604
005	20090910
007	t
008	090924s1985 d\|\|\| \|\|\|\| 00\|\|\| und d
035			\|a (OCoLC)246929083
035			\|a (DE-599)BVBBV024640818
040			\|a DE-604 \|b ger \|e rakwb
041			\|a und
049			\|a DE-83
100	1		\|a Burrus, C. S. \|e Verfasser \|4 aut
245	1	0	\|a DFT FFT and convolution algorithms \|b theory and implementation \|c C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts
264		1	\|a New York <<[u.a.]>> \|b Wiley \|c 1985
300			\|a XIII, 232 S. \|b graph. Darst. \|c 26 cm
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Topics in digital signal processing
490	0		\|a A Wiley Interscience publication
650	0	7	\|a Faltung \|g Mathematik \|0 (DE-588)4141470-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Nachrichtentechnik \|0 (DE-588)4041066-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Faltungsgleichung \|0 (DE-588)4368138-4 \|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 Fourier-Transformation \|0 (DE-588)4018014-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Signalprozessor 320 \|0 (DE-588)4296604-8 \|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 Schneller Faltungsalgorithmus \|0 (DE-588)4179867-3 \|2 gnd \|9 rswk-swf
689	0	0	\|a Nachrichtentechnik \|0 (DE-588)4041066-3 \|D s
689	0	1	\|a Schneller Faltungsalgorithmus \|0 (DE-588)4179867-3 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Nachrichtentechnik \|0 (DE-588)4041066-3 \|D s
689	1	1	\|a Fourier-Transformation \|0 (DE-588)4018014-1 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Diskrete Fourier-Transformation \|0 (DE-588)4150175-5 \|D s
689	2	1	\|a Schneller Faltungsalgorithmus \|0 (DE-588)4179867-3 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Digitale Signalverarbeitung \|0 (DE-588)4113314-6 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Signalprozessor 320 \|0 (DE-588)4296604-8 \|D s
689	4		\|8 5\p \|5 DE-604
689	5	0	\|a Faltungsgleichung \|0 (DE-588)4368138-4 \|D s
689	5		\|8 6\p \|5 DE-604
689	6	0	\|a Faltung \|g Mathematik \|0 (DE-588)4141470-6 \|D s
689	6		\|8 7\p \|5 DE-604
700	1		\|a Parks, Thomas W. \|e Sonstige \|4 oth
999			\|a oai:aleph.bib-bvb.de:BVB01-018052734
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
883	1		\|8 7\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Datensatz im Suchindex

_version_	1804140055560716288
any_adam_object
author	Burrus, C. S.
author_facet	Burrus, C. S.
author_role	aut
author_sort	Burrus, C. S.
author_variant	c s b cs csb
building	Verbundindex
bvnumber	BV024640818
ctrlnum	(OCoLC)246929083 (DE-599)BVBBV024640818
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02911nam a2200661 c 4500</leader><controlfield tag="001">BV024640818</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1985 d\|\|\| \|\|\|\| 00\|\|\| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246929083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024640818</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Burrus, C. S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">DFT FFT and convolution algorithms</subfield><subfield code="b">theory and implementation</subfield><subfield code="c">C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York <<[u.a.]>></subfield><subfield code="b">Wiley</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 232 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">26 cm</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Topics in digital signal processing</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">A Wiley Interscience publication</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="650" ind1="0" ind2="7"><subfield code="a">Nachrichtentechnik</subfield><subfield code="0">(DE-588)4041066-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Faltungsgleichung</subfield><subfield code="0">(DE-588)4368138-4</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">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">Signalprozessor 320</subfield><subfield code="0">(DE-588)4296604-8</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">Schneller Faltungsalgorithmus</subfield><subfield code="0">(DE-588)4179867-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nachrichtentechnik</subfield><subfield code="0">(DE-588)4041066-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Schneller Faltungsalgorithmus</subfield><subfield code="0">(DE-588)4179867-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Nachrichtentechnik</subfield><subfield code="0">(DE-588)4041066-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><subfield code="a">Schneller Faltungsalgorithmus</subfield><subfield code="0">(DE-588)4179867-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Signalprozessor 320</subfield><subfield code="0">(DE-588)4296604-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Faltungsgleichung</subfield><subfield code="0">(DE-588)4368138-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" 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="6" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Parks, Thomas W.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018052734</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="883" ind1="1" ind2=" "><subfield code="8">7\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></record></collection>
id	DE-604.BV024640818
illustrated	Illustrated
indexdate	2024-07-09T21:53:54Z
institution	BVB
language	Undetermined
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-018052734
oclc_num	246929083
open_access_boolean
owner	DE-83
owner_facet	DE-83
physical	XIII, 232 S. graph. Darst. 26 cm
publishDate	1985
publishDateSearch	1985
publishDateSort	1985
publisher	Wiley
record_format	marc
series2	Topics in digital signal processing A Wiley Interscience publication
spelling	Burrus, C. S. Verfasser aut DFT FFT and convolution algorithms theory and implementation C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts New York <<[u.a.]>> Wiley 1985 XIII, 232 S. graph. Darst. 26 cm txt rdacontent n rdamedia nc rdacarrier Topics in digital signal processing A Wiley Interscience publication Faltung Mathematik (DE-588)4141470-6 gnd rswk-swf Nachrichtentechnik (DE-588)4041066-3 gnd rswk-swf Faltungsgleichung (DE-588)4368138-4 gnd rswk-swf Digitale Signalverarbeitung (DE-588)4113314-6 gnd rswk-swf Fourier-Transformation (DE-588)4018014-1 gnd rswk-swf Signalprozessor 320 (DE-588)4296604-8 gnd rswk-swf Diskrete Fourier-Transformation (DE-588)4150175-5 gnd rswk-swf Schneller Faltungsalgorithmus (DE-588)4179867-3 gnd rswk-swf Nachrichtentechnik (DE-588)4041066-3 s Schneller Faltungsalgorithmus (DE-588)4179867-3 s 1\p DE-604 Fourier-Transformation (DE-588)4018014-1 s 2\p DE-604 Diskrete Fourier-Transformation (DE-588)4150175-5 s 3\p DE-604 Digitale Signalverarbeitung (DE-588)4113314-6 s 4\p DE-604 Signalprozessor 320 (DE-588)4296604-8 s 5\p DE-604 Faltungsgleichung (DE-588)4368138-4 s 6\p DE-604 Faltung Mathematik (DE-588)4141470-6 s 7\p DE-604 Parks, Thomas W. Sonstige oth 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 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Burrus, C. S. DFT FFT and convolution algorithms theory and implementation Faltung Mathematik (DE-588)4141470-6 gnd Nachrichtentechnik (DE-588)4041066-3 gnd Faltungsgleichung (DE-588)4368138-4 gnd Digitale Signalverarbeitung (DE-588)4113314-6 gnd Fourier-Transformation (DE-588)4018014-1 gnd Signalprozessor 320 (DE-588)4296604-8 gnd Diskrete Fourier-Transformation (DE-588)4150175-5 gnd Schneller Faltungsalgorithmus (DE-588)4179867-3 gnd
subject_GND	(DE-588)4141470-6 (DE-588)4041066-3 (DE-588)4368138-4 (DE-588)4113314-6 (DE-588)4018014-1 (DE-588)4296604-8 (DE-588)4150175-5 (DE-588)4179867-3
title	DFT FFT and convolution algorithms theory and implementation
title_auth	DFT FFT and convolution algorithms theory and implementation
title_exact_search	DFT FFT and convolution algorithms theory and implementation
title_full	DFT FFT and convolution algorithms theory and implementation C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts
title_fullStr	DFT FFT and convolution algorithms theory and implementation C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts
title_full_unstemmed	DFT FFT and convolution algorithms theory and implementation C. S. Burrus and T. W. Parks. With TMS 32010 programs by James F. Potts
title_short	DFT FFT and convolution algorithms
title_sort	dft fft and convolution algorithms theory and implementation
title_sub	theory and implementation
topic	Faltung Mathematik (DE-588)4141470-6 gnd Nachrichtentechnik (DE-588)4041066-3 gnd Faltungsgleichung (DE-588)4368138-4 gnd Digitale Signalverarbeitung (DE-588)4113314-6 gnd Fourier-Transformation (DE-588)4018014-1 gnd Signalprozessor 320 (DE-588)4296604-8 gnd Diskrete Fourier-Transformation (DE-588)4150175-5 gnd Schneller Faltungsalgorithmus (DE-588)4179867-3 gnd
topic_facet	Faltung Mathematik Nachrichtentechnik Faltungsgleichung Digitale Signalverarbeitung Fourier-Transformation Signalprozessor 320 Diskrete Fourier-Transformation Schneller Faltungsalgorithmus
work_keys_str_mv	AT burruscs dftfftandconvolutionalgorithmstheoryandimplementation AT parksthomasw dftfftandconvolutionalgorithmstheoryandimplementation

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge