The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as interpolation and integration. During the last 40 years, there have been phenomenal advances in the theory and application of digital signal processing. In many applications, the representation of a discrete-time signal or a sys tem in the frequency domain is of interest. To this end, the discrete-time Fourier transform (DTFT) and the z-transform are often used. In the case of a discrete-time signal of finite length, the most widely used frequency-domain representation is the discrete Fourier transform (DFT) which results in a finite length sequence in the frequency domain. The DFT is simply composed of the samples of the DTFT of the sequence at equally spaced frequency points, or equivalently, the samples of its z-transform at equally spaced points on the unit circle. The DFT provides information about the spectral contents of the signal at equally spaced discrete frequency points, and thus, can be used for spectral analysis of signals. Various techniques, commonly known as the fast Fourier transform (FFT) algorithms, have been advanced for the efficient com putation of the DFT. An important tool in digital signal processing is the linear convolution of two finite-length signals, which often can be implemented very efficiently using the DFT.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as interpolation and integration. During the last 40 years, there have been phenomenal advances in the theory and application of digital signal processing. In many applications, the representation of a discrete-time signal or a sys tem in the frequency domain is of interest. To this end, the discrete-time Fourier transform (DTFT) and the z-transform are often used. In the case of a discrete-time signal of finite length, the most widely used frequency-domain representation is the discrete Fourier transform (DFT) which results in a finite length sequence in the frequency domain. The DFT is simply composed of the samples of the DTFT of the sequence at equally spaced frequency points, or equivalently, the samples of its z-transform at equally spaced points on the unit circle. The DFT provides information about the spectral contents of the signal at equally spaced discrete frequency points, and thus, can be used for spectral analysis of signals. Various techniques, commonly known as the fast Fourier transform (FFT) algorithms, have been advanced for the efficient com putation of the DFT. An important tool in digital signal processing is the linear convolution of two finite-length signals, which often can be implemented very efficiently using the DFT. Bestandsnummer des Verkäufers 2730847/2
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780792382812_new
Anzahl: Mehr als 20 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as interpolation and integration. During the last 40 years, there have been phenomenal advances in the theory and application of digital signal processing. In many applications, the representation of a discrete-time signal or a sys tem in the frequency domain is of interest. To this end, the discrete-time Fourier transform (DTFT) and the z-transform are often used. In the case of a discrete-time signal of finite length, the most widely used frequency-domain representation is the discrete Fourier transform (DFT) which results in a finite length sequence in the frequency domain. The DFT is simply composed of the samples of the DTFT of the sequence at equally spaced frequency points, or equivalently, the samples of its z-transform at equally spaced points on the unit circle. The DFT provides information about the spectral contents of the signal at equally spaced discrete frequency points, and thus, can be used for spectral analysis of signals. Various techniques, commonly known as the fast Fourier transform (FFT) algorithms, have been advanced for the efficient com putation of the DFT. An important tool in digital signal processing is the linear convolution of two finite-length signals, which often can be implemented very efficiently using the DFT. 228 pp. Englisch. Bestandsnummer des Verkäufers 9780792382812
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as int. Bestandsnummer des Verkäufers 5970802
Anzahl: Mehr als 20 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Buch. Zustand: Neu. The Nonuniform Discrete Fourier Transform and Its Applications in Signal Processing | Sonali Bagchi (u. a.) | Buch | xiv | Englisch | 1998 | Springer | EAN 9780792382812 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Bestandsnummer des Verkäufers 102549233
Anzahl: 5 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. Introduces the problem of computing frequency samples of the z-transform of a finite-length sequence. This book develops the basics of the Nonuniform Discrete Fourier Transform (NDFT) including its definition, properties and computational aspects. It also proposes a nonuniform frequency sampling technique for designing 1-D FIR digital filters. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 208 pages, biography. BIC Classification: PHDS; TJK. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 498. . 1998. New ed. Hardback. . . . . Bestandsnummer des Verkäufers V9780792382812
Anzahl: 15 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Buch. Zustand: Neu. Neuware -The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as interpolation and integration. During the last 40 years, there have been phenomenal advances in the theory and application of digital signal processing. In many applications, the representation of a discrete-time signal or a sys tem in the frequency domain is of interest. To this end, the discrete-time Fourier transform (DTFT) and the z-transform are often used. In the case of a discrete-time signal of finite length, the most widely used frequency-domain representation is the discrete Fourier transform (DFT) which results in a finite length sequence in the frequency domain. The DFT is simply composed of the samples of the DTFT of the sequence at equally spaced frequency points, or equivalently, the samples of its z-transform at equally spaced points on the unit circle. The DFT provides information about the spectral contents of the signal at equally spaced discrete frequency points, and thus, can be used for spectral analysis of signals. Various techniques, commonly known as the fast Fourier transform (FFT) algorithms, have been advanced for the efficient com putation of the DFT. An important tool in digital signal processing is the linear convolution of two finite-length signals, which often can be implemented very efficiently using the DFT.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. Bestandsnummer des Verkäufers 9780792382812
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The growth in the field of digital signal processing began with the simulation of continuous-time systems in the 1950s, even though the origin of the field can be traced back to 400 years when methods were developed to solve numerically problems such as interpolation and integration. During the last 40 years, there have been phenomenal advances in the theory and application of digital signal processing. In many applications, the representation of a discrete-time signal or a sys tem in the frequency domain is of interest. To this end, the discrete-time Fourier transform (DTFT) and the z-transform are often used. In the case of a discrete-time signal of finite length, the most widely used frequency-domain representation is the discrete Fourier transform (DFT) which results in a finite length sequence in the frequency domain. The DFT is simply composed of the samples of the DTFT of the sequence at equally spaced frequency points, or equivalently, the samples of its z-transform at equally spaced points on the unit circle. The DFT provides information about the spectral contents of the signal at equally spaced discrete frequency points, and thus, can be used for spectral analysis of signals. Various techniques, commonly known as the fast Fourier transform (FFT) algorithms, have been advanced for the efficient com putation of the DFT. An important tool in digital signal processing is the linear convolution of two finite-length signals, which often can be implemented very efficiently using the DFT. Bestandsnummer des Verkäufers 9780792382812
Anzahl: 1 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA75807923828115
Anzahl: 1 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Introduces the problem of computing frequency samples of the z-transform of a finite-length sequence. This book develops the basics of the Nonuniform Discrete Fourier Transform (NDFT) including its definition, properties and computational aspects. It also proposes a nonuniform frequency sampling technique for designing 1-D FIR digital filters. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 208 pages, biography. BIC Classification: PHDS; TJK. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 498. . 1998. New ed. Hardback. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780792382812
Anzahl: 15 verfügbar