SULJE VALIKKO

avaa valikko

Yonghong Zeng | Akateeminen Kirjakauppa

Haullasi löytyi yhteensä 5 tuotetta
Haluatko tarkentaa hakukriteerejä?



Transforms and Fast Algorithms for Signal Analysis and Representations
Guoan Bi; Yonghong Zeng
Birkhäuser (2003)
Saatavuus: Tilaustuote
Kovakantinen kirja
49,60
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Transforms and Fast Algorithms for Signal Analysis and Representations
Guoan Bi; Yonghong Zeng
Birkhäuser (2012)
Saatavuus: Tilaustuote
Pehmeäkantinen kirja
49,60
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Bayesian Networks In Fault Diagnosis: Practice And Application
Baoping Cai; Yonghong Liu; Jinqiu Hu; Zengkai Liu; Shengnan Wu; Renjie Ji
World Scientific Publishing Co Pte Ltd (2018)
Saatavuus: Tilaustuote
Kovakantinen kirja
160,60
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Bayesian Networks for Reliability Engineering
Baoping Cai; Yonghong Liu; Zengkai Liu; Yuanjiang Chang; Lei Jiang
Springer (2019)
Saatavuus: Tilaustuote
Kovakantinen kirja
129,90
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Bayesian Networks for Reliability Engineering
Baoping Cai; Yonghong Liu; Zengkai Liu; Yuanjiang Chang; Lei Jiang
Springer (2020)
Saatavuus: Tilaustuote
Pehmeäkantinen kirja
129,90
Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
Transforms and Fast Algorithms for Signal Analysis and Representations
49,60 €
Birkhäuser
Sivumäärä: 422 sivua
Asu: Kovakantinen kirja
Painos: 2004
Julkaisuvuosi: 2003, 21.10.2003 (lisätietoa)
Kieli: Englanti
. . . that is what learning is. You suddenly understand something you've un­ derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth­ ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart­ ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu­ tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher­ ent problems still remain unsolved.

Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
LISÄÄ OSTOSKORIIN
Tilaustuote | Arvioimme, että tuote lähetetään meiltä noin 17-20 arkipäivässä
Myymäläsaatavuus
Helsinki
Tapiola
Turku
Tampere
Transforms and Fast Algorithms for Signal Analysis and Representations
Näytä kaikki tuotetiedot
Sisäänkirjautuminen
Kirjaudu sisään
Rekisteröityminen
Oma tili
Omat tiedot
Omat tilaukset
Omat laskut
Lisätietoja
Asiakaspalvelu
Tietoa verkkokaupasta
Toimitusehdot
Tietosuojaseloste