Precoder Design for Physical Layer Multicasting

• Published in: IEEE transactions on signal processing Vol. 60; no. 11; pp. 5932 - 5947
• Main Authors: Hao Zhu, Prasad, N., Rangarajan, S.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.11.2012; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Applied sciences; Approximation; Array signal processing; Channels; Coding, codes; Cyclic alternating ascent; Delay; Detection, estimation, filtering, equalization, prediction; Exact sciences and technology; Information, signal and communications theory; Mathematical analysis; Maximization; Minimization; multicast; Multicast communication; NP hard; Operations research; Optimization; Signal and communications theory; Signal processing algorithms; Signal, noise; Studies; submodular set function; Telecommunications and information theory; Transmitting antennas; Vectors; Performance evaluation; Coding circuit; Transmitter; Combinatorial optimization; Data broadcast; Information dissemination; Cyclic alternating ascent; Complex variable method; Knapsack problem; Multicast; Codebook; Simulation; NP hard; Coding; submodular set function; NP hard problem; Greedy algorithm; Signal processing; Delay time; Pretreatment; Antenna array; Deterministic algorithms
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2012.2210710

This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K -user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered by linear precoding schemes, we consider the design of linear precoders using the aforementioned two criteria. We first consider the scenario wherein the linear precoder can be any complex-valued matrix subject to rank and power constraints. We propose cyclic alternating ascent based precoder design algorithms and establish their convergence to respective stationary points. Simulation results reveal that our proposed algorithms considerably outperform known competing solutions. We then consider a scenario in which the linear precoder can be formed by selecting and concatenating precoders from a given finite codebook of precoding matrices, subject to rank and power constraints. We show that under this scenario, the instantaneous rate maximization problem is equivalent to a robust submodular maximization problem which is strongly NP hard. We propose a deterministic approximation algorithm and show that it yields a bicriteria approximation. For the weighted sum delay minimization problem we propose a simple deterministic greedy algorithm, which at each step entails approximately maximizing a submodular set function subject to multiple knapsack constraints, and establish its performance guarantee.