- Recherche et sélection de publications
|
Low-complexity MRC for ESPAR based on the polynomial expansion of the admittance matrix
- Juan Bucheli Garcia #1 #2, Mohamed Kamoun #2, Alain Sibille #1
-
| #1 |
Laboratoire traitement et communication de l'information (LTCI)
- Télécm ParisTech
- Institut Mines-Télécom
- Université Paris-Saclay
|
| #2 |
Huawei Technologies |
- References
- IEEE International Conference on Communications, Shanghai, China, IEEE, May 2019,
- Abstract
The electronically steerable parasitic array radiator (ESPAR) has been acknowledged as an inexpensive multiple antenna architecture. Nonetheless, due to the non-linear behavior on the loads used in its control, its related computational complexity can be prohibitive for practical implementations. The current paper deals with such an issue by proposing an approximation of its model via a truncated polynomial expansion of the inverse impedance matrix. The proposed approximation allows to reframe the problem of reactance optimization for beamforming, referred to as analog maximum ratio combining (A-MRC) in previous work. The method proposed in this paper provides a means to obtain a computationally efficient solution to the problem of reactance optimization and it avoids the need of an iterative-based approach. Therefore, resulting in a major computational complexity reduction with respect to related work in the literature.
- Keywords
- ESPAR, SISO, MRC, Low-complexity, Model approximation
- Category
- Paper in proceedings
- Research Area(s)
- Computer Science/Networking and Internet Architecture
Engineering Sciences/Electromagnetism
- Identifier(s)
-
DOI 10.1109/ICC.2019.8761229
Bibliographic key JB:ICC-2019
- Export
-
- Last update
- on september 08, 2019 by Alain Sibille
|
