Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,219
On the Gaussian MIMO Relay Channel With Full Channel State Information
"... Abstract—This paper addresses the problem of source and relay transmit covariance optimization on the Gaussian MIMO relay channel with full channel state information (CSI), i.e., assuming perfect knowledge of all channels. For full-duplex relaying, we show that the cut-set bound on capacity can be c ..."
Abstract
-
Cited by 17 (3 self)
- Add to MetaCart
Abstract—This paper addresses the problem of source and relay transmit covariance optimization on the Gaussian MIMO relay channel with full channel state information (CSI), i.e., assuming perfect knowledge of all channels. For full-duplex relaying, we show that the cut-set bound on capacity can
Compress-and-Forward Cooperative MIMO Relaying with Full Channel State Information
, 2009
"... This paper addresses cooperative Time Division Duplex (TDD) relaying in the multiple-antenna case with full Channel State Information (CSI), i.e. assuming perfect knowledge of all channels. The main focus of the paper is on the Compress-and-Forward (CF) strategy, for which an achievable rate on the ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
This paper addresses cooperative Time Division Duplex (TDD) relaying in the multiple-antenna case with full Channel State Information (CSI), i.e. assuming perfect knowledge of all channels. The main focus of the paper is on the Compress-and-Forward (CF) strategy, for which an achievable rate
On the Low SNR Capacity of Maximum Ratio Combining over Rician Fading Channels with Full Channel State Information
"... ar ..."
Teleporting an Unknown Quantum State via Dual Classical and EPR Channels
, 1993
"... An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles. ..."
Abstract
-
Cited by 649 (22 self)
- Add to MetaCart
An unknown quantum state jOEi can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, "Alice," and the receiver, "Bob," must prearrange the sharing of an EPRcorrelated pair of particles
Cooperative strategies and capacity theorems for relay networks
- IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract
-
Cited by 739 (19 self)
- Add to MetaCart
outputs and the destination’s channel output. The strategies are applied to wireless channels, and it is shown that decode-and-forward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides
A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications
, 2001
"... Computing devices and applications are now used beyond the desktop, in diverse environments, and this trend toward ubiquitous computing is accelerating. One challenge that remains in this emerging research field is the ability to enhance the behavior of any application by informing it of the context ..."
Abstract
-
Cited by 906 (28 self)
- Add to MetaCart
it of the context of its use. By context, we refer to any information that characterizes a situation related to the interaction between humans, applications and the surrounding environment. Context-aware applications promise richer and easier interaction, but the current state of research in this field is still far
Token flow control
"... As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with route ..."
Abstract
-
Cited by 635 (35 self)
- Add to MetaCart
As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design
Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results
, 1996
"... We present Scatter/Gather, a cluster-based document browsing method, as an alternative to ranked titles for the organization and viewing of retrieval results. We systematically evaluate Scatter/Gather in this context and find significant improvements over similarity search ranking alone. This resul ..."
Abstract
-
Cited by 480 (5 self)
- Add to MetaCart
. This result provides evidence validating the cluster hypothesis which states that relevant documents tend to be more similar to each other than to non-relevant documents. We describe a system employing Scatter/Gather and demonstrate that users are able to use this system close to its full potential. 1
On the capacity of MIMO broadcast channel with partial side information
- IEEE TRANS. INFORM. THEORY
, 2005
"... In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and single-antenna users, the ..."
Abstract
-
Cited by 349 (9 self)
- Add to MetaCart
, the sum rate capacity scales like log log for large if perfect channel state information (CSI) is available at the transmitter, yet only logarithmically with if it is not. In systems with large, obtaining full CSI from all users may not be feasible. Since lack of CSI does not lead to multiuser gains
Gamal, “On the secrecy capacity of fading channels
- in Proc. IEEE Int. Symp. Information Theory (ISIT
"... We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner’s wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long c ..."
Abstract
-
Cited by 203 (9 self)
- Add to MetaCart
coherence intervals. We first consider the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI
Results 1 - 10
of
10,219
