Results 1 - 10 of 10,588

Capacity Limits of MIMO Channels

by Andrea Goldsmith, Sriram Vishwanath, et al. - IEEE J. SELECT. AREAS COMMUN , 2003
"... We provide an overview of the extensive recent results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about t ..."
Abstract - Cited by 419 (17 self) - Add to MetaCart
the underlying time-varying channel model and how well it can be tracked at the receiver, as well as at the transmitter. More realistic assumptions can dramatically impact the potential capacity gains of MIMO techniques. For time-varying MIMO channels there are multiple Shannon theoretic capacity definitions and

The capacity of wireless networks

by Piyush Gupta, P. R. Kumar - IEEE TRANSACTIONS ON INFORMATION THEORY , 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract - Cited by 3243 (42 self) - Add to MetaCart
second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion

EEGLAB: an open source toolbox for analysis of single-trial EEG dynamics including independent component analysis

by Arnaud Delorme, Scott Makeig - J. Neurosci. Methods
"... Abstract: We have developed a toolbox and graphic user interface, EEGLAB, running under the cross-platform MATLAB environment (The Mathworks, Inc.) for processing collections of single-trial and/or averaged EEG data of any number of channels. Available functions include EEG data, channel and event i ..."
Abstract - Cited by 886 (45 self) - Add to MetaCart
information importing, data visualization (scrolling, scalp map and dipole model plotting, plus multi-trial ERP-image plots), preprocessing (including artifact rejection, filtering, epoch selection, and averaging), Independent Component Analysis (ICA) and time/frequency decompositions including channel

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
to work well. In this paper we investigate loopy prop agation empirically under a wider range of conditions. Is there something special about the error-correcting code setting, or does loopy propagation work as an approximation scheme for a wider range of networks? ..\ x(:x).) (1) where: and: The message

Fading relay channels: Performance limits and space-time signal design

by Rohit U. Nabar, Helmut Bölcskei, Felix W. Kneubühler - IEEE J. SELECT. AREAS COMMUN , 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract - Cited by 445 (4 self) - Add to MetaCart
channel where the source, destination and relay terminals are each equipped with single antenna transceivers. We consider three different TDMA-based cooperative protocols that vary the degree of broadcasting and receive collision. The relay terminal operates in either the amplify-and-forward (AF

Dynamic Power Allocation and Routing for Time Varying Wireless Networks

by Michael J. Neely, Eytan Modiano, Charles E. Rohrs - IEEE Journal on Selected Areas in Communications , 2003
"... We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be tran ..."
Abstract - Cited by 358 (73 self) - Add to MetaCart
We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues

Capacity Limits of MIMO Channels

by Sriram Vishwanath, Student Member - IEEE J. Select. Areas Commun , 2003
"... Abstract—We provide an overview of the extensive recent results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
assumptions about the underlying time-varying channel model and how well it can be tracked at the receiver, as well as at the transmitter. More realistic assumptions can dramatically impact the potential capacity gains of MIMO techniques. For time-varying MIMO channels there are multiple Shannon theoretic

Identification of time-varying linear channels

by Linda M. Davis, Iain B. Collings, Robin J. Evans - in Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASSP , 1997
"... In this paper, we present a new method for on-line identification of time-varying FIR channels. Two conditionally coupled estimators are proposed. In both cases an augmented-state adaptive Kalman filter is employed for tracking the time-varying channel and esti-mating the mean channel response. Coup ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
In this paper, we present a new method for on-line identification of time-varying FIR channels. Two conditionally coupled estimators are proposed. In both cases an augmented-state adaptive Kalman filter is employed for tracking the time-varying channel and esti-mating the mean channel response

Channel Assignment for Time-Varying Demand

by Sa Liu, Karen Daniels, Kavitha Chandra
"... This paper presents an integer programming model for dynamic channel assignment (DCA) under space and time-varying traffic demand. The algorithmmin-imizes the number of channels required to satisfy the traÆc demand using a threshold based decision cri-teria on the carrier-to-interference ratio. A ne ..."
Abstract - Add to MetaCart
This paper presents an integer programming model for dynamic channel assignment (DCA) under space and time-varying traffic demand. The algorithmmin-imizes the number of channels required to satisfy the traÆc demand using a threshold based decision cri-teria on the carrier-to-interference ratio. A

Scheduling for Multiple Flows Sharing a Time-Varying Channel: The Exponential Rule

by Sanjay Shakkottai, Alexander L. Stolyar - American Mathematical Society Translations, Series , 2000
"... We consider the following queueing system which arises as a model of a wireless link shared by multiple users. Multiple flows must be served by a "channel" (server). The channel capacity (service rate) changes in time randomly and asynchronously with respect to different flows. In each tim ..."
Abstract - Cited by 174 (16 self) - Add to MetaCart
We consider the following queueing system which arises as a model of a wireless link shared by multiple users. Multiple flows must be served by a "channel" (server). The channel capacity (service rate) changes in time randomly and asynchronously with respect to different flows. In each
Results 1 - 10 of 10,588