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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 23b626a73a7321332111ceba47d2c5e7
Quantité disponible : Plus de 20 disponibles
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de réf. du vendeur 56499417-6
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781461372349_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461372349
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : 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. N° de réf. du vendeur 4195379
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. The Nonuniform Discrete Fourier Transform and Its Applications in Signal Processing | Sonali Bagchi (u. a.) | Taschenbuch | xiv | Englisch | 2012 | Springer | EAN 9781461372349 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 105720863
Quantité disponible : 5 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 228. N° de réf. du vendeur 2697849325
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 228 pp. Englisch. N° de réf. du vendeur 9781461372349
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 228 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 94548018
Quantité disponible : 4 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461372349
Quantité disponible : 1 disponible(s)