Reference : Efficient Algorithms for Constant-Modulus Analog Beamforming
Scientific journals : Article
Engineering, computing & technology : Electrical & electronics engineering
http://hdl.handle.net/10993/47891
Efficient Algorithms for Constant-Modulus Analog Beamforming
English
Arora, Aakash mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Tsinos, Christos []
Mysore Rama Rao, Bhavani Shankar mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Chatzinotas, Symeon mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2021
IEEE Transactions on Signal Processing
Institute of Electrical and Electronics Engineers
Yes
1053-587X
Luxembourg
[en] Analog beamforming ; Majorization- Minimization ; MM ; Alternating MM ; AMM ; Cyclic Coordinate Descent ; CCD ; Large-Scale Antenna Arrays ; Unit-Modulus Constraints ; Nonconvex Optimization ; Block Cyclic Coordinate Descent ; BCCD
[en] The use of a large-scale antenna array (LSAA) has become an important characteristic of multi-antenna communication systems to achieve beamforming gains. For example, in millimeter wave (mmWave) systems, an LSAA is employed at the transmitter/receiver end to combat severe propagation losses. In such applications, each antenna element has to be driven by a radio frequency (RF) chain for the implementation of fully-digital beamformers. This strict requirement significantly increases the hardware cost, complexity, and power consumption. Therefore, constant-modulus analog beamforming (CMAB) becomes a viable solution. In this paper, we consider the scaled analog beamforming (SAB) or CMAB architecture and design the system parameters by solving the beampattern matching problem. We consider two beampattern matching problems. In the first case, both the magnitude and phase of the beampattern are matched to the given desired beampattern whereas in the second case, only the magnitude of the beampattern is matched. Both the beampattern matching problems are cast as a variant of the constant-modulus least-squares problem. We provide efficient algorithms based on the alternating majorization-minimization (AMM) framework that combines the alternating minimization and the MM frameworks and the conventional-cyclic coordinate descent (C-CCD) framework to solve the problem in each case. We also propose algorithms based on a new modified-CCD (M-CCD) based approach. For all the developed algorithms we prove convergence to a Karush-Kuhn-Tucker (KKT) point (or a stationary point). Numerical results demonstrate that the proposed algorithms converge faster than state-of-the-art solutions. Among all the algorithms, the M-CCD-based algorithms have faster convergence when evaluated in terms of the number of iterations and the AMM-based algorithms offer lower complexity.
http://hdl.handle.net/10993/47891
10.1109/TSP.2021.3094653
https://ieeexplore.ieee.org/document/9478276
FnR ; FNR11607283 > Aakash Arora > SPASAT > Power Efficient Sparse Signal Processing For Digital Wideband On-board Techniques > 01/07/2017 > 30/06/2021 > 2017

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
IEEE_TSP_Efficient_Algorithms_for_Constant_Modulus_Analog_Beamforming.pdfAuthor postprint2.31 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.