LDLinda M. Davis

Linda M. Davis

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Linda M. Davis has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Energy-Throughput Trade-offs in a Wireless Sensor Network with Mobile Relay

    by Guanghua Zhu, Linda M. Davis, Terence Chan

    In this paper we analyze the trade-offs between energy and throughput for links in a wireless sensor network. Our application of interest is one in which a number of low-powered sensors need to wirelessly communicate their measurements to a communications sink, or destination node, for communication to a central processor. We focus on one particular sensor source, and consider the case where the distance to the destination is beyond the peak power of the source. A relay node is required. Transmission energy of the sensor and the relay can be adjusted to minimize the total energy for a given throughput of the connection from sensor source to destination. We introduce a bounded random walk model for movement of the relay between the sensor and destination nodes, and characterize the total transmission energy and throughput performance using Markov steady state analysis. Based on the trade-offs between total energy and throughput we propose a new time-sharing protocol to exploit the movement of the relay to reduce the total energy. We demonstrate the effectiveness of time-sharing for minimizing the total energy consumption while achieving the throughput requirement. We then show that the time-sharing scheme is more energy efficient than the popular sleep mode scheme.

  • Finite Precision Analysis for Space-Time Decoding

    by Yiyue Wu, Linda M. Davis, A. Robert Calderbank

    Low complexity optimal (or nearly optimal) decoders for space-time codes have recently been under intensive investigation. For example, recent works by Sirianunpiboon and others show that the Silver code and the Golden code can be decoded optimally (or nearly optimally) with quadratic decoding complexity. Fast decodability makes them very attractive in practice. In implementing these decoders, floating-point to fixed-point conversion (FFC) needs to be carefully undertaken to minimize hardware cost while retaining decoding performance. The process of quantization for fixed-point representations is often ignored by research community and lacks investigation, and so FFC is often conducted heuristically based on simulations. This paper studies the effects of quantization to space-time coded systems from an information theoretic perspective. It shows the analytical relationship between quantization error and decoding performance deterioration. This paper also proposes a general finite precision implementation methodology including two FFC criteria for space-time coded systems within an integer optimization framework. As a particular example, this paper examines the finite precision implementation of the quadratic optimal decoding algorithm of the Silver code. However, our methodology and techniques can be applied to general space-time codes.


  • Alpha-Rule Scheduling for MIMO Broadcast Wireless Channels with Linear Receivers

    by M. Arif Khan, Rein Vesilo, Iain B. Collings, Linda M. Davis

    This paper considers a multi-user MIMO broadcast wireless channel where a MAC layer scheduler is used to improve system efficiency and provide quality of service improvements (fairness) to users. In particular, an alpha-rule scheduler is considered that uses rate estimates from users to make user selection decisions. The main challenge faced by the scheduler is that users need to estimate the interference caused by other users before transmit antenna allocation has been done. The paper examines two techniques for estimating data rates. The first technique assumes no interfering signals are present and the second technique includes the dominant interfering signal. We show that the scheduler can be tuned to significantly increase fairness with little reduction in mean sum rate to users and we show that both mean sum rate and fairness can be increased by including the dominant interfering signal to estimate data rates.


  • Fixed-Point Fast Decoding of the Silver Code

    by Yiyue Wu, Linda Davis

    The Silver code is a full rate and full diversity code constructed from two Alamouti blocks for 2times2 multiple input and multiple output systems. It is particularly attractive for practical implementation as it has been shown that the Silver code can be optimally decoded with quadratic decoding complexity. This paper, for the first time, studies the fixed-point implementation of the quadratic decoding with the aims of low hardware cost (area, power) and fast decoding response while retaining decoding performance.


  • Open Access

    On the Capacity of the Discrete-Time Channel with Uniform Output Quantization

    by Yiyue Wu, Linda M. Davis, Robert Calderbank

    This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager and Witsenhausen to provide a detailed analysis of two particular quantization schemes. The first is saturation quantization where overflows are mapped to the nearest quantization bin, and the second is wrapping quantization where overflows are mapped to the nearest quantization bin after reduction by some modulus. Both the capacity of wrapping quantization and the capacity achieving input distribution are determined. When the additive noise is gaussian and relatively small, the capacity of saturation quantization is shown to be bounded below by that of wrapping quantization. In the limit of arbitrarily many uniform quantization levels, it is shown that the difference between the upper and lower bounds on capacity given by Ihara is only 0.26 bits.

  • User and Transmit Antenna Selection for MIMO Broadcast Wireless Channels with Linear Receivers

    by M. Arif Khan, Rein Vesilo, Linda M. Davis, Iain B. Collings

    This paper considers a signalling scheme for a multi-user wireless broadcast system where the base station has multiple transmit antennas and users can have multiple receive antennas. Independent data streams are transmitted in this system by allocating different transmit antennas to different selected users where multiple transmit antennas may be allocated to each selected user. The signalling scheme is used to select the particular users to receive data in a transmission block and to allocate transmit antennas to those users. We examine two partial feedback schemes for selecting users: one that we call norm-based and the other that we call SINR-based. We also present a novel transmit-antenna selection scheme for allocating multiple transmit antennas to selected users based on the Gram-Schmidt orthogonalisation algorithm. The signalling scheme presented in this paper reduces the amount of channel information required by the base station. We study the performance of the user selection and transmit-antenna selection schemes when linear receivers are used at the receiver side for decoding the transmitted signal. In particular, we consider zero-forcing (ZF) and minimum mean square-error (MMSE) receivers. We examine the sum capacity performance of the system compared to schemes with no feedback and using random antenna selection. We show that the best performance is achieved with norm-based user selection, Gram-Schmidt antenna selection and MMSE receivers.