%0 Conference Proceedings
%T A Fast Recursive Algorithm for Multiple Bridged Knife-Edge Diffraction
%+ Equipe Security, Intelligence and Integrity of Information (Lab-STICC_SI3)
%+ École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)
%+ Equipe PIM (Lab-STICC_PIM)
%+ Direction générale de l'armement [Bagneux] (DGA)
%A Nguyen, Viet Dung
%A Mansour, Ali
%A Coatanhay, Arnaud
%A Marsault, T.
%< avec comité de lecture
%B 2021 29th European Signal Processing Conference (EUSIPCO)
%C Dublin, Ireland
%I IEEE
%3 European Signal Processing Conference
%V 2021
%P 1651-1655
%8 2021-08-23
%D 2021
%R 10.23919/EUSIPCO54536.2021.9615940
%K Diffraction
%K Channel modeling
%K Irregular terrain
%K Multiple bridged knife-edges diffraction
%K Recursive algorithm
%K Reflection coefficients
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Multiple bridged knife-edge diffraction estimation can be seen as a generalization of the multiple knife-edge diffraction one which can be found in many applications of wireless communications. The considered model is formed by bridging the spaces among knife-edges with reflecting planes. So far, the series-based standard solution for this problem suffers from high computational complexity, thus limiting its use in practice. We, thus, propose a fast recursive algorithm to tackle its computational burden. To illustrate the effectiveness of the proposed algorithm, we compare our results with the state-of-the-art algorithms. Numerical results show that the running time of the proposed algorithm is much faster than that of the standard solution while benefiting from similar accuracy. © 2021 European Signal Processing Conference. All rights reserved.
%G English
%L hal-03550849
%U https://hal-ensta-bretagne.archives-ouvertes.fr/hal-03550849
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ ENIB
%~ LAB-STICC
%~ INSTITUTS-TELECOM
%~ LAB-STICC_PIM
%~ LAB-STICC_SI3
%~ LAB-STICC_SYPH
%~ LAB-STICC_T2I3