Searcharxiv⌕ Search

arXiv subjects

Robert W. Heath Jr

Publications and source records attributed to Robert W. Heath Jr.

214 records · Page 12Linked to original sources
arXiv2009

Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ

This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with packets arriving according to a Poisson process and for an increasing convex cost function where packets must be drained from the queues at the base station.

cs.IT↗
arXiv2009

End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time codes were proposed to maximize the achievable diversity-multiplexing tradeoff, however, they fail to achieve all the points of the optimal diversity-multiplexing tradeoff. In the presence of a low-rate feedback link from the destination to each relay stage and the source, this paper proposes an end-to-end antenna selection (EEAS) strategy as an alternative to distributed space-time codes. The EEAS strategy uses a subset of antennas of each relay stage for transmission of the source signal to the destination with amplify and forwarding at each relay stage. The subsets are chosen such that they maximize the end-to-end mutual information at the destination. The EEAS strategy achieves the corner points of the optimal diversity-multiplexing tradeoff (corresponding to maximum diversity gain and maximum multiplexing gain) and achieves better diversity gain at intermediate values of multiplexing gain, versus the best known distributed space-time coding strategies. A distributed compress and forward (CF) strategy is also proposed to achieve all points of the optimal diversity-multiplexing tradeoff for a two-hop relay channel with multiple relay nodes.

cs.IT↗
arXiv2008

Achievable Throughput of Multi-mode Multiuser MIMO with Imperfect CSI Constraints

For the multiple-input multiple-output (MIMO) broadcast channel with imperfect channel state information (CSI), neither the capacity nor the optimal transmission technique have been fully discovered. In this paper, we derive achievable ergodic rates for a MIMO fading broadcast channel when CSI is delayed and quantized. It is shown that we should not support too many users with spatial division multiplexing due to the residual inter-user interference caused by imperfect CSI. Based on the derived achievable rates, we propose a multi-mode transmission strategy to maximize the throughput, which adaptively adjusts the number of active users based on the channel statistics information.

cs.IT↗
arXiv2008

On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel

This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate region, when each relay employs an amplify and forward (AF) strategy. The iterative algorithm solves a power minimization problem at every step, subject to minimum signal-to-interference-and-noise ratio constraints, which is non-convex, however, for which the Karush Kuhn Tuker conditions are sufficient for optimality. The optimal AF strategy assumes global channel state information (CSI) at each relay. To simplify the CSI requirements, a simple amplify and forward strategy, called dual channel matching, is also proposed, that requires only local channel state information, and whose achievable rate region is close to that of the optimal AF strategy. In the asymptotic regime of large number of relays, we show that the achievable rate region of the dual channel matching and an upper bound differ by only a constant term and establish the capacity scaling law of the two-way relay channel. Relay strategies achieving optimal diversity-multiplexing tradeoff are also considered with a single relay node. A compress and forward strategy is shown to be optimal for achieving diversity multiplexing tradeoff for the full-duplex case, in general, and for the half-duplex case in some cases.

cs.IT↗
arXiv2008

Networked MIMO with Clustered Linear Precoding

A clustered base transceiver station (BTS) coordination strategy is proposed for a large cellular MIMO network, which includes full intra-cluster coordination to enhance the sum rate and limited inter-cluster coordination to reduce interference for the cluster edge users. Multi-cell block diagonalization is used to coordinate the transmissions across multiple BTSs in the same cluster. To satisfy per-BTS power constraints, three combined precoder and power allocation algorithms are proposed with different performance and complexity tradeoffs. For inter-cluster coordination, the coordination area is chosen to balance fairness for edge users and the achievable sum rate. It is shown that a small cluster size (about 7 cells) is sufficient to obtain most of the sum rate benefits from clustered coordination while greatly relieving channel feedback requirement. Simulations show that the proposed coordination strategy efficiently reduces interference and provides a considerable sum rate gain for cellular MIMO networks.

cs.IT↗
arXiv2008

Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing the overall throughput is a difficult problem that depends on multiple factors including node locations, queue lengths and power consumption. A partial decode-and-forward strategy is applied in this paper to improve the tractability of the relay selection problem and performance of the overall network. Note that the number of relays selected ultimately determines the performance of the network. This paper benchmarks this performance by determining the net diversity achieved using the relays selected and the partial decode-and-forward strategy. This framework is subsequently used to further transform relay selection into a simpler relay placement problem, and two proximity-based approximation algorithms are developed to determine the appropriate set of relays to be selected in the network. Other selection strategies such as random relay selection and a greedy algorithm that relies on channel state information are also presented. This paper concludes by showing that the proposed proximity-based relay selection strategies yield near-optimal expected rates for a small number of selected relays.

cs.IT↗
arXiv2008

To Code or Not To Code in Multi-Hop Relay Channels

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time coding was used to maximize diversity gain. Assuming a low-rate feedback link from the destination to each relay stage and the source, this paper proposes end-to-end antenna selection strategies as an alternative to distributed space-time coding. One-way (where only the source has data for destination) and two-way (where the destination also has data for the source) multi-hop relay channels are considered with both the full-duplex and half duplex relay nodes. End-to-end antenna selection strategies are designed and proven to achieve maximum diversity gain by using a single antenna path (using single antenna of the source, each relay stage and the destination) with the maximum signal-to-noise ratio at the destination. For the half-duplex case, two single antenna paths with the two best signal-to-noise ratios in alternate time slots are used to overcome the rate loss with half-duplex nodes, with a small diversity gain penalty. Finally to answer the question, whether to code (distributed space-time code) or not (the proposed end-to-end antenna selection strategy) in a multi-hop relay channel, end-to-end antenna selection strategy and distributed space-time coding is compared with respect to several important performance metrics.

cs.IT↗
arXiv2008

Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay Networks

Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more single antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes are used in cascade by the source and each relay stage. In the COSTBC, each relay stage separates the constellation symbols of the orthogonal space-time block code sent by the preceding relay stage using its CSI, and then transmits another orthogonal space-time block code to the next relay stage. COSTBCs are shown to achieve the maximum diversity gain in a multi-hop wireless network with flat Rayleigh fading channels. Several explicit constructions of COSTBCs are also provided for two-hop wireless networks with two and four source antennas and relay nodes. It is also shown that COSTBCs require minimum decoding complexity thanks to the connection to orthogonal space-time block codes.

cs.IT↗
arXiv2008

Performance of Orthogonal Beamforming for SDMA with Limited Feedback

On the multi-antenna broadcast channel, the spatial degrees of freedom support simultaneous transmission to multiple users. The optimal multiuser transmission, known as dirty paper coding, is not directly realizable. Moreover, close-to-optimal solutions such as Tomlinson-Harashima precoding are sensitive to CSI inaccuracy. This paper considers a more practical design called per user unitary and rate control (PU2RC), which has been proposed for emerging cellular standards. PU2RC supports multiuser simultaneous transmission, enables limited feedback, and is capable of exploiting multiuser diversity. Its key feature is an orthogonal beamforming (or precoding) constraint, where each user selects a beamformer (or precoder) from a codebook of multiple orthonormal bases. In this paper, the asymptotic throughput scaling laws for PU2RC with a large user pool are derived for different regimes of the signal-to-noise ratio (SNR). In the multiuser-interference-limited regime, the throughput of PU2RC is shown to scale logarithmically with the number of users. In the normal SNR and noise-limited regimes, the throughput is found to scale double logarithmically with the number of users and also linearly with the number of antennas at the base station. In addition, numerical results show that PU2RC achieves higher throughput and is more robust against CSI quantization errors than the popular alternative of zero-forcing beamforming if the number of users is sufficiently large.

cs.IT↗
arXiv2008

Rate Bounds for MIMO Relay Channels

This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.

cs.IT↗
arXiv2008

Limited Feedback Beamforming Over Temporally-Correlated Channels

Feedback of quantized channel state information (CSI), called limited feedback, enables transmit beamforming in multiple-input-multiple-output (MIMO) wireless systems with a small amount of overhead. Due to its efficiency, beamforming with limited feedback has been adopted in several wireless communication standards. Prior work on limited feedback commonly adopts the block fading channel model where temporal correlation in wireless channels is neglected. This paper considers temporally-correlated channels and designs single-user transmit beamforming with limited feedback. Analytical results concerning CSI feedback are derived by modeling quantized CSI as a first-order finite-state Markov chain. These results include the source bit rate generated by time-varying quantized CSI, the required bit rate for a CSI feedback channel, and the effect of feedback delay. In particular, based on the theory of Markov chain convergence rate, feedback delay is proved to reduce the throughput gain due to CSI feedback at least exponentially. Furthermore, an algorithm is proposed for CSI feedback compression in time. Combining the results in this work leads to a new method for designing limited feedback beamforming as demonstrated by a design example.

cs.IT↗
arXiv2008

Capacity Scaling for MIMO Two-Way Relaying

A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the sources and relay nodes are equipped with multiple antennas. Both the sources are assumed to have equal number of antennas and have perfect channel state information (CSI) for all the channels of the MIMO two-way relay channel, whereas, each relay node is either assumed to have CSI for its transmit and receive channel (the coherent case) or no CSI for any of the channels (the non-coherent case). The main results in this paper are on the scaling behavior of the capacity region of the MIMO two-way relay channel with increasing number of relay nodes. In the coherent case, the capacity region of the MIMO two-way relay channel is shown to scale linearly with the number of antennas at source nodes and logarithmically with the number of relay nodes. In the non-coherent case, the capacity region is shown to scale linearly with the number of antennas at the source nodes and logarithmically with the signal to noise ratio.

cs.IT↗
arXiv2008

Kerdock Codes for Limited Feedback Precoded MIMO Systems

A codebook based limited feedback strategy is a practical way to obtain partial channel state information at the transmitter in a precoded multiple-input multiple-output (MIMO) wireless system. Conventional codebook designs use Grassmannian packing, equiangular frames, vector quantization, or Fourier based constructions. While the capacity and error rate performance of conventional codebook constructions have been extensively investigated, constructing these codebooks is notoriously difficult relying on techniques such as nonlinear search or iterative algorithms. Further, the resulting codebooks may not have a systematic structure to facilitate storage of the codebook and low search complexity. In this paper, we propose a new systematic codebook design based on Kerdock codes and mutually unbiased bases. The proposed Kerdock codebook consists of multiple mutually unbiased unitary bases matrices with quaternary entries and the identity matrix. We propose to derive the beamforming and precoding codebooks from this base codebook, eliminating the requirement to store multiple codebooks. The propose structure requires little memory to store and, as we show, the quaternary structure facilitates codeword search. We derive the chordal distance for two antenna and four antenna codebooks, showing that the proposed codebooks compare favorably with prior designs. Monte Carlo simulations are used to compare achievable rates and error rates for different codebooks sizes.

cs.IT↗
arXiv2008

Nonregenerative MIMO Relaying with Optimal Transmit Antenna Selection

We derive optimal SNR-based transmit antenna selection rules at the source and relay for the nonregenerative half duplex MIMO relay channel. While antenna selection is a suboptimal form of beamforming, it has the advantage that the optimization is tractable and can be implemented with only a few bits of feedback from the destination to the source and relay. We compare the bit error rate of optimal antenna selection at both the source and relay to other proposed beamforming techniques and propose methods for performing the necessary limited feedback.

cs.IT↗
arXiv2006

A Lattice-Based MIMO Broadcast Precoder for Multi-Stream Transmission

Precoding with block diagonalization is an attractive scheme for approaching sum capacity in multiuser multiple input multiple output (MIMO) broadcast channels. This method requires either global channel state information at every receiver or an additional training phase, which demands additional system planning. In this paper we propose a lattice based multi-user precoder that uses block diagonalization combined with pre-equalization and perturbation for the multiuser MIMO broadcast channel. An achievable sum rate of the proposed scheme is derived and used to show that the proposed technique approaches the achievable sum rate of block diagonalization with water-filling but does not require the additional information at the receiver. Monte Carlo simulations with equal power allocation show that the proposed method provides better bit error rate and diversity performance than block diagonalization with a zero-forcing receiver. Additionally, the proposed method shows similar performance to the maximum likelihood receiver but with much lower receiver complexity.

cs.IT↗