Performance analysis fdct algorithms di sanyal atri (3 risultati)
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 43,35
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Performance Analysis of FDCT Algorithms | The Performance Analysis of Fast DCT Algorithms on a Parallel Cluster Architecture | Atri Sanyal (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659306303 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Lan…dstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,67
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Sanyal AtriAtri Sanyal is an Assistant Professor of Department of Computer Application of NSHM College of Management & Technology, Kolkata. He did M.Sc(CS) from Banaras Hindu University and later on di…d ME(CSE) from West Bengal Univ.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,59
EUR 60,89 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The book identifies 4 popular FDCT algorithms. Next it is mapped in a cluster architecture.The cluster specific parallel algorithm is written. The algorithms are analyzed through a timing diagram and the cluster utilization and time uni…ts taken to implement the algorithm is calculated.Proposed algorithm parallel DCT is introduced and explained.It is also mapped in the cluster architecture, cluster specific algorithm is written,timing diagram is constructed, and cluster utilization and time units taken is calculated.It is shown thorough graphs and tables that cluster utilization is highest and time units taken is lowest in parallelDCT. It is concluded that, in order to minimize the number of multiplications in popular FDCT algorithms cluster utilization is ignored. Whereas parallelDCT contains more number of multiplications but the cluster utilization is more and time unit is less. Hence the simple approach of parallelDCT is more effective.
