Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/1823
Nаziv: Improving FDTD algorithm performance using block floating-point
Аutоri: Pijetlović, Stefan 
Subotić, Miloš
Pjevalica, Nebojša 
Dаtum izdаvаnjа: 5-јан-2018
Čаsоpis: 2017 25th Telecommunications Forum, TELFOR 2017 - Proceedings
Sažetak: © 2017 IEEE. FDTD (finite-difference time-domain) algorithm is a memory intensive problem which requires more memory access in comparison to computing intensive problems. Existing FDTD solutions use either floating-point or fixed-point arithmetic. Floating-point solutions are less memory intensive but require more computation. Fixed-point solutions are the opposite-simpler computation but use up more memory bandwidth for the same precision. The method chosen in this paper includes using block floating-point arithmetic which is the middle ground. This approach requires less computation than floating-point arithmetic while at the same time using less memory access than plain fixed-point. The FDTD algorithm is converted from floating to fixed-point and then to block floating-point. The precision and memory access performance is compared.
URI: https://open.uns.ac.rs/handle/123456789/1823
ISBN: 9781538630723
DOI: 10.1109/TELFOR.2017.8249399
Nаlаzi sе u kоlеkciјаmа:FTN Publikacije/Publications

Prikаzаti cеlоkupаn zаpis stаvki

Prеglеd/i stаnicа

15
Prоtеklа nеdеljа
4
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.