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.
EUR 14,46 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Very Good. 1st Edition. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. N° de réf. du vendeur 52698713-6
Quantité disponible : 1 disponible(s)
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 228 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 2730847/2
Quantité disponible : 1 disponible(s)
Vendeur : Ammareal, Morangis, France
Hardcover. Etat : Très bon. Ancien livre de bibliothèque. Edition 1999. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1999. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur E-505-783
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. 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 5970802
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780792382812_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. 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 9780792382812
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9780792382812
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. 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 9780792382812
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 228. N° de réf. du vendeur 262521681
Quantité disponible : 4 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190185159
Quantité disponible : Plus de 20 disponibles