Paper Info
Title
Low-Complexity Linear Zero-Forcing for the MIMO Broadcast Channel
Abstract
Maximizing the sum capacity in the multiple-input multiple-output (MIMO) broadcast channel requires the use of dirty paper coding (DPC). However, practical implementations of DPC which are nearly optimum exhibit high computational complexity. As an alternative to DPC linear zero-forcing can be used where the multiuser interference is completely canceled by linear beamforming. Determining the optimum user allocation, transmit and receive filters thereby constitutes a combinatorial and nonconvex optimization problem. To circumvent its direct solution and therefore reduce complexity, we propose an algorithm that successively allocates data streams to users and, in contrast to state-of-the-art approaches, includes the receive filters into the optimization. We then show several steps that reduce the complexity of the algorithm at marginal performance losses. Thus, performance of state-of-the-art approaches can be maintained while the computational complexity is reduced considerably, as it is shown by a detailed complexity analysis and simulation results.
Year
DOI
Venue
2009
10.1109/JSTSP.2009.2036954
J. Sel. Topics Signal Processing
Keywords
Field
DocType
MIMO communication,computational complexity,interference (signal),multiuser channels,MIMO broadcast channel,computational complexity,dirty paper coding,low-complexity linear zero-forcing,multiuser interference,optimum user allocation,Broadcast channel,linear zero-forcing,multiple-input multiple-output (MIMO) systems
Dirty paper coding,Beamforming,Mathematical optimization,Algorithm design,Computer science,Single antenna interference cancellation,MIMO,Interference (wave propagation),Optimization problem,Computational complexity theory
Journal
Volume
Issue
ISSN
3
6
1932-4553
Citations 
PageRank 
References 
11
0.84
21
Authors
3
Name
Order
Citations
PageRank
Christian Guthy1696.20
Wolfgang Utschick21755176.66
Guido Dietl312715.21