Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
3,526
Fading relay channels: Performance limits and space-time signal design
- 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
) or decode-and-forward (DF) modes. For each protocol, we study the ergodic and outage capacity behavior (assuming Gaussian code books) under the AF and DF modes of relaying. We analyze the spatial diversity performance of the various protocols and find that full spatial diversity (second-order in this case
Distributed Source Coding Using Syndromes (DISCUS): Design and Construction
- IEEE TRANS. INFORM. THEORY
, 1999
"... We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot communicate with each other to minimize their joint description cost. In this work we tackle the related problem of compressing a source that is correlated with anothe ..."
Abstract
-
Cited by 407 (9 self)
- Add to MetaCart
-ground for the distributed source coding problem. For the distributed coding of correlated i.i.d. Gaussian sources that are ...
The minimum description length principle in coding and modeling
- IEEE TRANS. INFORM. THEORY
, 1998
"... We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized ..."
Abstract
-
Cited by 394 (18 self)
- Add to MetaCart
We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized
Linear multiuser detectors for synchronous code-division multiple-access channels
- IEEE TRANS. INFORM. THEORY
, 1989
"... In code-division multiple-access systems, simultaneous mul-tiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract
-
Cited by 385 (4 self)
- Add to MetaCart
In code-division multiple-access systems, simultaneous mul-tiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum
Group Detection for Synchronous Gaussian Code-Division Multiple-Access Channels
"... Abstract- The concept of group detection is introduced to address the design of suboptimum multiuser detectors for Code-Division Multiple-Access (CDMA) channels. A group detection scheme consists of a bank of P group detectors, one each for detecting the information symbols of users in each group of ..."
Abstract
- Add to MetaCart
Abstract- The concept of group detection is introduced to address the design of suboptimum multiuser detectors for Code-Division Multiple-Access (CDMA) channels. A group detection scheme consists of a bank of P group detectors, one each for detecting the information symbols of users in each group
Achieving near-capacity on a multiple-antenna channel
- IEEE Trans. Commun
, 2003
"... Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve nea ..."
Abstract
-
Cited by 402 (2 self)
- Add to MetaCart
Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve
Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- NEURAL COMPUTATION
, 1999
"... Local "belief propagation" rules of the sort proposed byPearl [12] are guaranteed to converge to the correct posterior probabilities in singly connected graphical models. Recently, a number of researchers have empirically demonstrated good performance of "loopy belief propagation&q ..."
Abstract
-
Cited by 296 (7 self)
- Add to MetaCart
" -- using these same rules on graphs with loops. Perhaps the most dramatic instance is the near Shannonlimit performance of "Turbo codes", whose decoding algorithm is equivalentto loopy belief propagation. Except for the
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
- IEEE COMMUNICATIONS LETTERS
, 2001
"... We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold within 0.0045 dB of the Shannon limit of the binary-input additive white Gaussian noise channel. Simulation results with a ..."
Abstract
-
Cited by 306 (6 self)
- Add to MetaCart
We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold within 0.0045 dB of the Shannon limit of the binary-input additive white Gaussian noise channel. Simulation results with a
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- IEEE TRANS. INFORM. THEORY
, 2001
"... Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under messagepassing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densi ..."
Abstract
-
Cited by 244 (2 self)
- Add to MetaCart
Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under messagepassing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message
Results 11 - 20
of
3,526
