David A. Schmidt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
David A. Schmidt has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Wolfgang Utschick
TUM School of Computation, Information and Technology, Technical University of Munich, Munich, Germany
3 shared publications - Changxin Shi
Department of Electrical Engineering and Computer Science Northwestern University 60208 Evanston Illinois
1 shared publication - Johannes Brehmer
Associate Institute for Signal Processing, Technische Universität München
1 shared publication Michael Joham
Associate Institute for Signal Processing, Technische Universität München, 80290 München, Germany
1 shared publication- Michael Joham
School of Computation, Information and Technology, Technical University of Munich, Munich, Germany
1 shared publication - Michael L. Honig
Centre for Wireless Communications University of Oulu Oulu Finland
1 shared publication
Latest Publications
- 4 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 26 (5) , 53-63
Distributed resource allocation schemes
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.
- 4 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 26 (5) , 53-63
Distributed resource allocation schemes
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.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 776-780
Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue Decompositions
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 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 776-780
Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue Decompositions
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.
- 21 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 55 (6) , 3073-3088
Finite-Length MMSE Tomlinson–Harashima Precoding for Frequency Selective Vector Channels
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
- 21 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 55 (6) , 3073-3088
Finite-Length MMSE Tomlinson–Harashima Precoding for Frequency Selective Vector Channels
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
- 13 March 2007
- Published by Wiley in European Transactions on Telecommunications
- Vol. 19 (3) , 219-231
Minimum mean square error vector precoding
We derive theminimum mean square error(MMSE) solution to vector precoding for frequency flat multiuser scenarios with a centralised multi‐antenna transmitter. The receivers employ a modulo operation, giving the transmitter the additional degree of freedom to choose aperturbation vector. Similar to existing vector precoding techniques, the optimum perturbation vector is found with a closest point search in a lattice. The proposed MMSE vector precoder does not, however, search for the perturbation vector resulting in the lowest unscaled transmit power, as proposed in all previous contributions on vector precoding, but finds an optimum compromise between noise enhancement and residual interference. We present simulation results showing that the proposed technique outperforms existing vector precoders, as well as the MMSETomlinson‐Harashima precoder, and compare the turbo‐coded performance to the capacity of the broadcast channel. Copyright © 2007 John Wiley & Sons, Ltd.
- 13 March 2007
- Published by Wiley in European Transactions on Telecommunications
- Vol. 19 (3) , 219-231
Minimum mean square error vector precoding
We derive theminimum mean square error(MMSE) solution to vector precoding for frequency flat multiuser scenarios with a centralised multi‐antenna transmitter. The receivers employ a modulo operation, giving the transmitter the additional degree of freedom to choose aperturbation vector. Similar to existing vector precoding techniques, the optimum perturbation vector is found with a closest point search in a lattice. The proposed MMSE vector precoder does not, however, search for the perturbation vector resulting in the lowest unscaled transmit power, as proposed in all previous contributions on vector precoding, but finds an optimum compromise between noise enhancement and residual interference. We present simulation results showing that the proposed technique outperforms existing vector precoders, as well as the MMSETomlinson‐Harashima precoder, and compare the turbo‐coded performance to the capacity of the broadcast channel. Copyright © 2007 John Wiley & Sons, Ltd.