Stephen Kasdorf

Stephen Kasdorf

Auto-generated profile, based on publicly available information

Stephen Kasdorf

Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2021 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
SKStephen Kasdorf
Stephen Kasdorf
BTBlake Troksa
Blake Troksa
CKCam Key
Cam Key
JHJake Harmon
Jake Harmon
BNBranislav Notaros
Branislav Notaros
We propose and evaluate several improvements to the accuracy of the shooting and bouncing ray (SBR) method for ray-tracing (RT) electromagnetic modeling. We propose per-ray cone angle calculation, with the maximum separation angle between rays calculated for every individual ray, based on a set of local neighbors rather than a single global maximum. This allows the smallest theoretical error of the SBR method, adaptive ray spawning procedures, and a unique analysis of the effect of ray cone sizes on the accuracy of the method. For the conventional uniform angular distribution of rays, a less general and versatile but more expeditious approach, we derive an analytical expression for the optimal choice of cone angle to again maximize the overall accuracy of the SBR computation. Both approaches are derived using icosahedral ray spawning geometry and adjacent ray sets, which are also used for our double counted rays identification and removal technique that avoids complicated ray path searches. The results demonstrate that the advanced shooting and bouncing RT method--using both proposed ray cone generation approaches--can perform wireless propagation modeling of tunnel environments with the same accuracy as image theory RT, a dramatically less efficient but traditionally considerably more accurate solver.

12 January 2024 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
SKStephen Kasdorf
Stephen Kasdorf
BTBlake Troksa
Blake Troksa
CKCam Key
Cam Key
JHJake Harmon
Jake Harmon
SPSudeep Pasricha
Sudeep Pasricha
BNBranislav Notaros
Branislav Notaros
We propose a novel unified parallelization framework, consisting of algorithms, strategies, and data structures, to radically enhance the efficiency of the shooting and bouncing rays (SBR) method for ray tracing (RT) electromagnetic propagation modeling. The massively parallel optimization of the SBR code is achieved by integration of the SBR with NVIDIA OptiX Prime programming interfaces on graphics processing units (GPUs), comprehensive parallelization of all components of the SBR algorithm, including electric field computation and postprocessing tasks being traditionally limited to sequential operation, and addressing and optimizing memory usage and constraints to further advance efficiency of the overall method. Numerical results demonstrate that the new proposed optimized SBR methodology achieves massive parallel vs. serial speedups and upwards of 99% parallelism under Amdahl’s parallelization scaling law. The strategic use of GPUs and the innovative meticulous parallel optimization of all computational aspects of the code, explained in detail in the paper, yield an SBR ray tracing methodology of unparalleled efficiency, without sacrificing the previously advanced and established accuracy of the method. Rather, the presented major enhancements of the efficiency and the uniquely high level of parallelism are enabled by and addressed synergistically with the improvements of the accuracy of the SBR computation.

11 December 2020 in IEEE Journal on Multiscale and Multiphysics Computational Techniques
Verified
Journal Article
Closed access
CKCam Key
Cam Key
BTBlake A. Troksa
Blake A. Troksa
SKStephen Kasdorf
Stephen Kasdorf
BNBranislav Notaros
Branislav Notaros
We propose and experimentally validate a new ray spawning and associated double count removal (DCR) technique for shooting bouncing ray tracing (SBR). This technique allows, for the first time, efficient parallelization of ray DCR, the major bottleneck and least parallel aspect of modern SBR ray-tracing relying on the ray-cone approximation (RCA). We define non-self-adjacent (NSA) ray classes on a recursively sampled icosahedron, guaranteeing removal of mutual adjacency data dependencies between rays that previously prevented efficient parallelization of ray double count removal and, by extension, SBR. Using a GPU-parallelized implementation of the technique, we demonstrate speedups of DCR over 300×, limited in our testing only by the available hardware. As DCR is the asymptotically dominant contributor to the computation time of SBR-RCA, with respect to the number of parallel processes available, the achieved speedup applies to parallel SBR-RCA as a whole.

1 July 2020
Verified
Conference Paper
Closed access
SKStephen Kasdorf
Stephen Kasdorf
BTBlake Troksa
Blake Troksa
JHJake Harmon
Jake Harmon
CKCam Key
Cam Key
BNBranislav Notaros
Branislav Notaros

1 July 2020
Verified
Conference Paper
Closed access
SKStephen Kasdorf
Stephen Kasdorf
BTBlake Troksa
Blake Troksa
JHJake Harmon
Jake Harmon
CKCam Key
Cam Key
BNBranislav Notaros
Branislav Notaros