David A. Schmidt

David A. Schmidt

Auto-generated profile, based on publicly available information

David A. Schmidt

Is a research assistant at the Associate Institute for Signal Processing at Technische Universität München (TUM), Munich, Germany, where he is working towards his doctorate degree. He received his Dipl.-Ing. degree from TUM in 2005. His current research interests include optimal resource allocation and distributed algorithms for MIMO interference networks. He is a Student Member of the IEEE

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
4 September 2009 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
DSDavid A. Schmidt
David A. Schmidt
CSChangxin Shi
Changxin Shi
RBRandall A. Berry
Randall A. Berry
MHMichael L. Honig
Michael L. Honig
WUWolfgang Utschick
Wolfgang Utschick
In this article, we discuss distributed resource allocation schemes in which each transmitter determines its allocation autonomously, based on the exchange of interference prices. These schemes have been primarily motivated by the common model for spectrum sharing in which a user or service provider may transmit in a designated band provided that they abide by certain rules (e.g., a standard such as 802.11). An attractive property of these schemes is that they are scalable, i.e., the information exchange and overhead can be adapted according to the size of the network.

13 March 2007 in European Transactions on Telecommunications
Verified
Journal Article
Closed access
PDF file
DSDavid A. Schmidt
David A. Schmidt
MJMichael Joham
Michael Joham
WUWolfgang Utschick
Wolfgang Utschick

21 May 2007 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MJMichael Joham
Michael Joham
DSDavid A. Schmidt
David A. Schmidt
JBJohannes Brehmer
Johannes Brehmer
WUWolfgang Utschick
Wolfgang Utschick
We design Tomlinson-Harashima precoding for decentralized receivers and frequency-selective channels based on the minimum mean square error criterion, where the feedforward filter is restricted to have finite length. Contrary to most other publications on Tomlinson-Harashima precoding which rely on solutions for decision feedback equalization to find the corresponding precoding filters in a heuristic manner, we deduce the optimization for Tomlinson-Harashima precoding from the optimization for the linear minimum mean square error transmit filter. Thereby, we include the precoding order explicitly in the problem formulation and thus obtain the precoding filter solutions, together with the algorithms to compute the latency time, i.e., the time difference between application of the precoder at the transmitter and detection at the receiver and the precoding order from a single optimization. Since the algorithm for THP filter computation resulting from the optimization has a high computational complexity, we present an alternative algorithm to compute the Tomlinson-Harashima precoding filters based on a Cholesky factorization with symmetric permutation, resulting in an order of complexity that is the same as for the computation of the linear transmit filters. The simulations reveal that the latency time optimization can be omitted without performance degradation for most practical channel models, i.e., the latency time can be chosen to be the order of the feedforward filter

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.