A Linear Time Algorithm for the Optimal Discrete IRS Beamforming

It remains an open problem to find the optimal configuration of phase shifts under the discrete constraint for intelligent reflecting surface (IRS) in polynomial time. The above problem is widely believed to be difficult because it is not linked to any known combinatorial problems that can be solved...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE wireless communications letters Jg. 12; H. 3; S. 1
Hauptverfasser:	Ren, Shuyi, Shen, Kaiming, Li, Xin, Chen, Xin, Luo, Zhi-Quan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.03.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Array signal processing Beamforming Big Data Combinatorial analysis Discrete beamforming for IRS/RIS discrete quadratic program global optimum linear time algorithm Optimization Polynomials Quadratic programming Signal to noise ratio Visualization Wireless communication
ISSN:	2162-2337, 2162-2345
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!