Results 1  10
of
500,224
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 491 (22 self)
 Add to MetaCart
signals. We prove that there is no point in making the number of transmitter antennas greater than the length of the coherence interval: the capacity for M> Tis equal to the capacity for M = T. Capacity is achieved when the T M transmitted signal matrix is equal to the product of two statistically
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1757 (28 self)
 Add to MetaCart
constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 517 (5 self)
 Add to MetaCart
distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly
ExOR: Opportunistic MultiHop Routing for Wireless Networks
 in SIGCOMM
, 2005
"... This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multihop wireless networks. ExOR chooses each hop of a packetâ€™s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually r ..."
Abstract

Cited by 448 (0 self)
 Add to MetaCart
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multihop wireless networks. ExOR chooses each hop of a packetâ€™s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually
Implementation issues in spectrum sensing for cognitive radios
 in Proc. the 38th. Asilomar Conference on Signals, Systems, and Computers
, 2004
"... Abstract There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while coexisting with legacy wireless networks. The cri ..."
Abstract

Cited by 430 (6 self)
 Add to MetaCart
Abstract There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while coexisting with legacy wireless networks
Capacity Regions for Wireless Ad Hoc Networks
 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
, 2003
"... We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all sourcedestination pairs in the network under various transmission strategies, such as variablerate transmissi ..."
Abstract

Cited by 279 (16 self)
 Add to MetaCart
We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all sourcedestination pairs in the network under various transmission strategies, such as variable
Learning from demonstration
 Advances in Neural Information Processing Systems 9
, 1997
"... By now it is widely accepted that learning a task from scratch, i.e., without any prior knowledge, is a daunting undertaking. Humans, however, rarely attempt to learn from scratch. They extract initial biases as well as strategies how to approach a learning problem from instructions and/or demonstra ..."
Abstract

Cited by 392 (32 self)
 Add to MetaCart
By now it is widely accepted that learning a task from scratch, i.e., without any prior knowledge, is a daunting undertaking. Humans, however, rarely attempt to learn from scratch. They extract initial biases as well as strategies how to approach a learning problem from instructions and/or demonstrations of other humans. For learning control, this paper investigates how learning from demonstration can be applied in the context of reinforcement learning. We consider priming the Qfunction, the value function, the policy, and the model of the task dynamics as possible areas where demonstrations can speed up learning. In general nonlinear learning problems, only modelbased reinforcement learning shows significant speedup after a demonstration, while in the special case of linear quadratic regulator (LQR) problems, all methods profit from the demonstration. In an implementation of pole balancing on a complex anthropomorphic robot arm, we demonstrate that, when facing the complexities of real signal processing, modelbased reinforcement learning offers the most robustness for LQR problems. Using the suggested methods, the robot learns pole balancing in just a single trial after a 30 second long demonstration of the human instructor. 1.
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 293 (43 self)
 Add to MetaCart
the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the endtoend capacity when there is a single source and one
Grassmannian beamforming for multipleinput multipleoutput wireless systems
 IEEE TRANS. INFORM. THEORY
, 2003
"... Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in multipleinput and multipleoutput (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal beamformi ..."
Abstract

Cited by 327 (38 self)
 Add to MetaCart
Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in multipleinput and multipleoutput (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal
Zeroforcing methods for downlink spatial multiplexing in multiuser MIMO channels
 IEEE TRANS. SIGNAL PROCESSING
, 2004
"... The use of spacedivision multiple access (SDMA) in the downlink of a multiuser multipleinput, multipleoutput (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the coc ..."
Abstract

Cited by 362 (28 self)
 Add to MetaCart
The use of spacedivision multiple access (SDMA) in the downlink of a multiuser multipleinput, multipleoutput (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the co
Results 1  10
of
500,224