Isbn: 9780792382812 - the nonuniform discrete fourier transform and its applications in signal processing (the springer international series in engineering and computer science, 463, band 463) (14 Ergebnisse)

Zustand: New.

Zustand: New. In English.

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. . . . .…

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.…

Zustand: New. pp. 228.

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.…

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: As New. Unread book in perfect condition.

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.…

Gebunden. 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.…

Buch. Zustand: Neu. The Nonuniform Discrete Fourier Transform and Its Applications in Signal Processing | Sonali Bagchi (u. a.) | Buch | The Springer International Series in Engineering and Computer Science | 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. …

Buch. Zustand: 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.…

Zustand: New. Print on Demand pp. 228 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: New. PRINT ON DEMAND pp. 228.