Reduced computational complexity beamspace beamforming design for MIMO multicast systems

Authors:
Nikolay Petrov;Vladimir Poulkov;Georgi Iliev
Affiliations:
Faculty of Telecommunications, Technical University of Sofia, Sofia, Bulgaria;Faculty of Telecommunications, Technical University of Sofia, Sofia, Bulgaria;Faculty of Telecommunications, Technical University of Sofia, Sofia, Bulgaria
Venue:
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Year:
2009

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Convex Optimization

Convex Optimization
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups

IEEE Transactions on Signal Processing
Transmit beamforming for physical-layer multicasting

IEEE Transactions on Signal Processing - Part I
Direction finding using beamspace root estimator banks

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm with reduced computational complexity for solving the transmit beamforming problem in the case of multiple co-channel multicast groups is considered. A new degree of freedom, which allows a trade-off between the transmission power, the number of antenna array elements and the computational time, is added. The optimization problem is transformed to a lower-dimensional optimization problem, which allows an antenna array with higher number of elements to operate with significant decrease in transmission power, while the increase in computational time is minor. The trade-off between the delay and the transmit power appears to be a promising direction for a crosslayer optimization research.