Results 1 - 10 of 5,167

Capacity of multi-antenna Gaussian channels

by I. Emre Telatar - EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS , 1999
"... We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such form ..."
Abstract - Cited by 2923 (6 self) - Add to MetaCart
We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate

Gaussian channels

by Nicolas Pugeault, Richard Bowden, Bank Of Gabor Filters, C. Multiclass, Random Forest
"... This article presents an interactive hand shape recognition ..."
Abstract - Add to MetaCart
This article presents an interactive hand shape recognition

Fidelity of Gaussian Channels

by Carlton M. Caves, Krzysztof Wódkiewicz , 2004
"... Abstract. A noisy Gaussian channel is defined as a channel in which an input field mode is subjected to random Gaussian displacements in phase space. We introduce the quantum fidelity of a Gaussian channel for pure and mixed input states, and we derive a universal scaling law of the fidelity for pur ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. A noisy Gaussian channel is defined as a channel in which an input field mode is subjected to random Gaussian displacements in phase space. We introduce the quantum fidelity of a Gaussian channel for pure and mixed input states, and we derive a universal scaling law of the fidelity

THE SEMIGROUP STRUCTURE OF GAUSSIAN CHANNELS

by Teiko Heinosaari, Alexander S. Holevo, Michael, M. Wolf , 909
"... Abstract. We investigate the semigroup structure of bosonic Gaussian quantum channels. Particular focus lies on the sets of channels which are divisible, idempotent or Markovian (in the sense of either belonging to one-parameter semigroups or being infinitesimal divisible). We show that the non-comp ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. We investigate the semigroup structure of bosonic Gaussian quantum channels. Particular focus lies on the sets of channels which are divisible, idempotent or Markovian (in the sense of either belonging to one-parameter semigroups or being infinitesimal divisible). We show that the non

Dispersion of Gaussian channels

by Yury Polyanskiy, H. Vincent Poor - IEEE Int. Symp. Inform. Theory , 2009
"... Abstract—The minimum blocklength required to achieve a given rate and error probability can be easily and tightly approximated from two key channel parameters: the capacity and the channel dispersion. The channel dispersion gauges the variability of the channel relative to a deterministic bit pipe w ..."
Abstract - Cited by 17 (3 self) - Add to MetaCart
with the same capacity. This paper finds the dispersion of the additive white Gaussian noise (AWGN) channel, the parallel AWGN channel, and the Gaussian channel with non-white noise and intersymbol interference. I.

On the Security and Degradability of Gaussian Channels

by Stefano Pir, Samuel L. Braunstein, Seth Lloyd
"... Abstract. We consider the notion of canonical attacks, which are the cryptographic analog of the canonical forms of a one-mode Gaussian channel. Using this notion, we explore the connections between the degradability properties of the channel and its security for quantum key distribution. Finally, w ..."
Abstract - Add to MetaCart
Abstract. We consider the notion of canonical attacks, which are the cryptographic analog of the canonical forms of a one-mode Gaussian channel. Using this notion, we explore the connections between the degradability properties of the channel and its security for quantum key distribution. Finally

SIGNAL MASKING IN GAUSSIAN CHANNELS

by John A. Quinn, Christopher K. I. Williams
"... We consider the problem of modifying the noise properties of a channel in order to make the source as indecipherable as possible given the output. Applications include jamming communications, maintaining confidentiality near spoken conversations and masking noise pollution. We present results as to ..."
Abstract - Add to MetaCart
as to how this can be done efficiently, assuming that we have a Gaussian channel and a constraint on the power of the noise. We go on to consider the case in which there is a positive signal which we want to remain coherent, as well as a negative signal which we wish to confound. We also discuss

Minimum output entropy of Gaussian channels

by S. Lloyd, V. Giovannetti, L. Maccone, S. Pir, R. Garcia-patron , 906
"... Abstract: We show that the minimum output entropy for all single-mode Gaussian channels is additive and is attained for Gaussian inputs. This allows the derivation of the channel capacity for a number of Gaussian channels, including that of the channel with linear loss, thermal noise, and linear amp ..."
Abstract - Add to MetaCart
Abstract: We show that the minimum output entropy for all single-mode Gaussian channels is additive and is attained for Gaussian inputs. This allows the derivation of the channel capacity for a number of Gaussian channels, including that of the channel with linear loss, thermal noise, and linear

Mutual information and minimum mean-square error in Gaussian channels

by Dongning Guo, Shlomo Shamai (Shitz), Sergio Verdú - IEEE TRANS. INFORM. THEORY , 2005
"... This paper deals with arbitrarily distributed finite-power input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the input-output mutual information and the minimum mean-square error (MMSE) achievable by optimal estimation of the input given the out ..."
Abstract - Cited by 288 (34 self) - Add to MetaCart
This paper deals with arbitrarily distributed finite-power input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the input-output mutual information and the minimum mean-square error (MMSE) achievable by optimal estimation of the input given

Rateless Coding for Gaussian Channels

by Uri Erez, Mitchell D. Trott, Gregory W. Wornell - IEEE Trans. Info. Theory
"... Abstract—A rateless code—i.e., a rate-compatible family of codes—has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that p ..."
Abstract - Cited by 19 (6 self) - Add to MetaCart
that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a
Results 1 - 10 of 5,167