Abstract
SummaryUnmanned aerial vehicle operations are quickly gaining ground due to rapid global market penetration. While on one hand, novel technologies that bridge communication networks to aviation industry are yet to be explored, on the other hand, their development requires highly scalable systems to enable beyond visual line‐of‐sight missions. This requirement imposes a big bottleneck in terms of computation complexity. This paper presents a method for fast computation of multiple diffraction of radio waves over knife‐edge obstacles based on the Deygout technique and some offline computation steps, including a ground profile analysis. We prove that this algorithm is equivalent to the original Deygout algorithm for all non‐line‐of‐sight points, show heuristics confirming that it is mostly applicable in the line‐of‐sight case. The computational and memory complexity of our algorithm is approximately , compared to for the original Deygout algorithm. Finally we discuss how to apply the approach to the Epstein‐Peterson technique and the Giovanelli technique, and how to use it to compute clutter‐loss.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
