Abstract
In this paper, we propose the application of a new geometric procedure in order to calculate a set of transmission zeros of a propagation environment. Since the transmission zeros play a crucial role in modern communication systems, there is a need to apply the efficient solutions characterized by a maximum speed operation. It turns out that the classical method based on the Smith-McMillan factorization is time-consuming, so its contribution to the detection of transmission zeros could be unsatisfactory. Therefore, in order to fill the gap, we present a new algorithm strictly dedicated to the multivariable telecommunications systems described by the transfer-function approach. Consequently, a set of new achievements resulted, particularly in terms of computational efforts. Indeed, the proposed procedure allows us to overcome obstacles derived from technological limitations. The representative simulation examples confirm the great potential of this new method. Finally, it has been pointed out that the newly introduced geometric-originated approach has significantly reduced the computational burden. Indeed, for the randomly selected matrix of the 5×5 dimension describing the sensor-related propagation environment, two representative scenarios were performed in order to manifest the crucial properties. In the first scenario, the sets of multiple transmission zeros were analyzed, ultimately leading to intriguing results. The Smith-McMillan solution took three times longer to discover the mentioned sets. On the other hand, the second instance brought us the same result. Naturally, the discussed difference has increased as a function of the number of matrix elements. For the square matrices involving 100 components, we have observed the respective differences, both over QI=100 and QII=60. It should be emphasized that the finding derived from the Smith-McMillan factorization corresponds to the geometric-related approach in the context of some mechanisms. This is particularly visible when appointing the greatest common divisors.