Raphael Hunger

Raphael Hunger

Auto-generated profile, based on publicly available information

Raphael Hunger

Associate Institute for Signal Processing Technische Universität München 80290 Munich Germany

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 January 2010 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
CGChristian Guthy
Christian Guthy
WUWolfgang Utschick
Wolfgang Utschick
RHRaphael Hunger
Raphael Hunger
MJMichael Joham
Michael Joham
Achieving the boundary of the capacity region in the multiple-input multiple-output (MIMO) broadcast channel requires the use of dirty paper coding (DPC). As practical nearly optimum implementations of DPC are computationally complex, purely linear approaches are often used instead. However, in this case, the problem of maximizing a weighted sum rate constitutes a nonconvex and, in most cases, also a combinatorial optimization problem. In this paper, we present two heuristic nearly optimum algorithms with reduced computational complexity. For this purpose, a lower bound for the weighted sum rate under linear zero-forcing constraints is used. Based on this bound, both greedy algorithms successively allocate data streams to users. In each step, the user is determined that is given an additional data stream such that the increase in weighted sum rate becomes maximum. Thereby, the data stream allocations and filters obtained in the previous steps are kept fixed and only the filter corresponding to the additional data stream is optimized. The first algorithm determines the receive and transmit filters directly in the downlink. The other algorithm operates in the dual uplink, from which the downlink transmit and receive filters can be obtained via the general rate duality leading to nonzero-forcing in the downlink. Simulation results reveal marginal performance losses compared to more complex algorithms.

1 June 2007
Verified
Conference Paper
Closed access
RHRaphael Hunger
Raphael Hunger
DSDavid A. Schmidt
David A. Schmidt
WUWolfgang Utschick
Wolfgang Utschick
In this paper, we present a novel algorithm for determining the sum-rate optimal transmit covariance matrices for the MIMO broadcast channel. Instead of optimizing the covariances directly, our algorithm operates on the preceding matrices, i.e., the square roots of the covariances. As a result, no eigenvalue decompositions are required in the iterations, and the complexity per iteration is significantly lower. A look at the convergence over the required number of computations shows a visible advantage over the state-of-the-art sum power iterative waterfilling algorithm. Also, our algorithm allows us to find the optimal sum-rate for an arbitrarily limited number of data streams per user. Finally, with a simple modification, our algorithm can also be used for sum-MSE minimization.

1 November 2007
Verified
Conference Paper
Closed access
RHRaphael Hunger
Raphael Hunger
MJMichael Joham
Michael Joham
WUWolfgang Utschick
Wolfgang Utschick
A novel MSE balancing paradigm is presented which is based on the unweighted sum-MSE minimization with individual power constraints in conjunction with an adaptive power allocation. By means of a counter-example, we show that even the two-user MSE region may be nonconvex in case of multi- antenna users which is in contrast to the predominant opinion. Any algorithm utilizing the weighted sum-MSE minimization hence cannot achieve the complete MSE region for any channel realization. This resulting gap due to the nonconvex dent is closed by the presented approach. For the unweighted sum-MSE minimization with individual power constraints which represents the core of the balancing algorithm, we come up with an extremely fast converging alternating optimization outperforming all hitherto existing approaches.

17 July 2008 in arXiv
Verified
Preprint
Open access
PDF file
RHRaphael Hunger
Raphael Hunger
MJMichael Joham
Michael Joham
We investigate the MIMO broadcast channel in the high SNR regime when linear filtering is applied instead of dirty paper coding. Using a user-wise rate duality where the streams of every single user are not treated as self-interference as in the hitherto existing stream-wise rate dualities for linear filtering, we solve the weighted sum rate maximization problem of the broadcast channel in the dual multiple access channel. Thus, we can exactly quantify the asymptotic rate loss of linear filtering compared to dirty paper coding for any channel realization. Having converted the optimum covariance matrices to the broadcast channel by means of the duality, we observe that the optimal covariance matrices in the broadcast channel feature quite complicated but still closed form expressions although the respective transmit covariance matrices in the dual multiple access channel share a very simple structure. We immediately come to the conclusion that block-diagonalization is the asymptotically optimum transmit strategy in the broadcast channel. Out of the set of block-diagonalizing precoders, we present the one which achieves the largest sum rate and thus corresponds to the optimum solution found in the dual multiple access channel. Additionally, we quantify the ergodic rate loss of linear coding compared to dirty paper coding for Gaussian channels with correlations at the mobiles.

28 July 2008 in arXiv
Verified
Preprint
Open access
PDF file
RHRaphael Hunger
Raphael Hunger
MJMichael Joham
Michael Joham
We present a general rate duality between the multiple access channel (MAC) and the broadcast channel (BC) which is applicable to systems with and without nonlinear interference cancellation. Different to the state-of-the-art rate duality with interference subtraction from Vishwanath et al., the proposed duality is filter-based instead of covariance-based and exploits the arising unitary degree of freedom to decorrelate every point-to-point link. Therefore, it allows for noncooperative stream-wise decoding which reduces complexity and latency. Moreover, the conversion from one domain to the other does not exhibit any dependencies during its computation making it accessible to a parallel implementation instead of a serial one. We additionally derive a rate duality for systems with multi-antenna terminals when linear filtering without interference (pre-)subtraction is applied and the different streams of a single user are not treated as self-interference. Both dualities are based on a framework already applied to a mean-square-error duality between the MAC and the BC. Thanks to this novel rate duality, any rate-based optimization with linear filtering in the BC can now be handled in the dual MAC where the arising expressions lead to more efficient algorithmic solutions than in the BC due to the alignment of the channel and precoder indices.