Timothy N. Davidson

Timothy N. Davidson

Auto-generated profile, based on publicly available information

Timothy N. Davidson

Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

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

Representative Publications

View All Publications
5 June 2006 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
NSN.D. Sidiropoulos
N.D. Sidiropoulos
TDT.N. Davidson
T.N. Davidson
ZLZhi-Quan Luo
Zhi-Quan Luo
This paper considers the problem of downlink transmit beamforming for wireless transmission and downstream precoding for digital subscriber wireline transmission, in the context of common information broadcasting or multicasting applications wherein channel state information (CSI) is available at the transmitter. Unlike the usual "blind" isotropic broadcasting scenario, the availability of CSI allows transmit optimization. A minimum transmission power criterion is adopted, subject to prescribed minimum received signal-to-noise ratios (SNRs) at each of the intended receivers. A related max-min SNR "fair" problem formulation is also considered subject to a transmitted power constraint. It is proven that both problems are NP-hard; however, suitable reformulation allows the successful application of semidefinite relaxation (SDR) techniques. SDR yields an approximate solution plus a bound on the optimum value of the associated cost/reward. SDR is motivated from a Lagrangian duality perspective, and its performance is assessed via pertinent simulations for the case of Rayleigh fading wireless channels. We find that SDR typically yields solutions that are within 3-4 dB of the optimum, which is often good enough in practice. In several scenarios, SDR generates exact solutions that meet the associated bound on the optimum value. This is illustrated using measured very-high-bit-rate Digital Subscriber line (VDSL) channel data, and far-field beamforming for a uniform linear transmit antenna array.

7 August 2002 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
WMWing-Kin Ma
Wing-Kin Ma
TDT.N. Davidson
T.N. Davidson
KWKon Max Wong
Kon Max Wong
ZLZhi-Quan Luo
Zhi-Quan Luo
PCPak-Chung Ching
Pak-Chung Ching
The maximum-likelihood (ML) multiuser detector is well known to exhibit better bit-error-rate (BER) performance than many other multiuser detectors. Unfortunately,ML detection (MLD) is a nondeterministic polynomial-time hard (NP-hard) problem, for which there is no known algorithm that can find the optimal solution with polynomial-time complexity (in the number of users). In this paper, a polynomial-time approximation method called semi-definite (SD) relaxation is applied to the MLD problem with antipodal data transmission. SD relaxation is an accurate approximation method for certain NP-hard problems. The SD relaxation ML (SDR-ML) detector is efficient in that its complexity is of the order of K3.5, where K is the number of users. We illustrate the potential of the SDR-ML detector by showing that some existing detectors, such as the decorrelator and the linear-minimum-mean-square-error detector, can be interpreted as degenerate forms of the SDR-ML detector. Simulation results indicate that the BER performance of the SDR-ML detector is better than that of these existing detectors and is close to that of the true ML detector, even when the cross-correlations between users are strong or the near-far effect is significant.

1 December 2007 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
MSMichael Botros Shenouda
Michael Botros Shenouda
TDTimothy N. Davidson
Timothy N. Davidson
We consider the design of linear precoders (beamformers) for broadcast channels with Quality of Service (QoS) constraints for each user, in scenarios with uncertain channel state information (CSI) at the transmitter. We consider a deterministically-bounded model for the channel uncertainty of each user, and our goal is to design a robust precoder that minimizes the total transmission power required to satisfy the users' QoS constraints for all channels within a specified uncertainty region around the transmitter's estimate of each user's channel. Since this problem is not known to be computationally tractable, we will derive three conservative design approaches that yield convex and computationally-efficient restrictions of the original design problem. The three approaches yield semidefinite program (SDP) formulations that offer different trade-offs between the degree of conservatism and the size of the SDP. We will also show how these conservative approaches can be used to derive efficiently-solvable quasi-convex restrictions of some related design problems, including the robust counterpart to the problem of maximizing the minimum signal-to-interference-plus-noise-ratio (SINR) subject to a given power constraint. Our simulation results indicate that in the presence of uncertain CSI the proposed approaches can satisfy the users' QoS requirements for a significantly larger set of uncertainties than existing methods, and require less transmission power to do so.

26 August 2003 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YDYanwu Ding
Yanwu Ding
TDT.N. Davidson
T.N. Davidson
ZLZhi-Quan Luo
Zhi-Quan Luo
KWKon Max Wong
Kon Max Wong
We determine the linear precoder that minimizes the bit error rate (BER) at moderate-to-high signal-to-noise ratios (SNRs) for block transmission systems with zero-forcing (ZF) equalization and threshold detection. The design is developed for the two standard schemes for eliminating inter-block interference, viz, zero padding (ZP) and cyclic prefix (CP). We show that both the ZP minimum BER precoder and the CP minimum BER precoder provide substantially lower error rates than standard block transmission schemes, such as orthogonal frequency division multiplexing (OFDM). The corresponding SNR gains can be on the order of several decibels. We also show that the CP minimum BER precoder can be obtained by a two-stage modification of the water-filling discrete multitone modulation (DMT) scheme in which the diagonal water-filling power loading is replaced by a full matrix consisting of a diagonal minimum mean square error power loading matrix post multiplied by a discrete Fourier transform (DFT) matrix.

24 February 2009 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RGRamy H. Gohary
Ramy H. Gohary
TDTimothy N. Davidson
Timothy N. Davidson
This paper considers the design of both a transmitter and a receiver for noncoherent communication over a frequency-flat, richly scattered multiple-input multiple-output (MIMO) channel. The design is guided by the fact that at high signal-to-noise ratios (SNRs), the ergodic capacity of the channel can be achieved by input signals that are isotropically distributed on the (compact) Grassmann manifold. The first part of the paper considers the design of Grassmannian constellations that MIMIC the isotropic distribution. A subspace perturbation analysis is used to determine an appropriate metric for the distance between Grassmannian constellation points, and using this metric, greedy, direct and rotation-based techniques for designing constellations are proposed. These techniques offer different tradeoffs between the minimum distance of the constellation and the design complexity. In addition, the rotation-based technique results in constellations that have lower storage requirements and admit a natural ldquoquasi-set-partitioningrdquo binary labeling.

1 August 2008 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MSMichael Botros Shenouda
Michael Botros Shenouda
TDTimothy N. Davidson
Timothy N. Davidson
We consider the design of linear transceivers for multiuser communication systems in the presence of uncertain channel state information (CSI), with an emphasis on downlink systems with a single antenna at each receiver. For systems with uplink-downlink reciprocity, we consider a stochastic model for the channel uncertainty, and we propose an efficient algorithm for the joint design of the linear preceding matrix at the base station and the equalizing gains at the receivers so as to minimize the average mean-square-error (MSE) over the channel uncertainty. The design is based on a generalization, derived herein, of the MSE duality between the broadcast and multiple access channels (MAC) to scenarios with uncertain CSI, and on a convex formulation for the design of robust transceivers for the dual MAC. For systems in which quantized channel feedback is employed, we consider a deterministically-bounded model for the channel uncertainty, and we study the design of robust downlink transceivers that minimize the worst- case MSE over all admissible channels. While we show that the design problem is NP-hard, we also propose an iterative local optimization algorithm that is based on efficiently-solvable convex conic formulations. Our framework is quite flexible, and can incorporate different bounded uncertainty models as well as a variety of power constraints. In particular, we study a "system-wide" uncertainty model, and although the resulting design problem is still NP hard, it does result in a significantly simpler iterative local design algorithm than the "per-user" uncertainty model. Our approaches to the minimax design for the downlink can be extended to the uplink, and we provide explicit formulations for the resulting uplink designs. Simulation results indicate that the proposed approaches to robust linear transceiver design can significantly reduce the sensitivity of the downlink to uncertain CSI, and can provide improved performance over that of existing robust designs.