• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 348,312
Next 10 →

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 2878 (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

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 436 (4 self) - Add to MetaCart
of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of co-located antennas as well as appropriate power control rules

Capacity of Fading Channels with Channel Side Information

by Andrea J. Goldsmith , et al. , 1997
"... We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency-sele ..."
Abstract - Cited by 579 (23 self) - Add to MetaCart
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency

Space-time block coding for wireless communications: performance results

by Vahid Tarokh, Hamid Jafarkhani, A. Robert Calderbank - IEEE J. Select. Areas. Commun , 1999
"... Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which are simultaneousl ..."
Abstract - Cited by 361 (12 self) - Add to MetaCart
Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE Trans. Inform. Theory , 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract - Cited by 600 (43 self) - Add to MetaCart
: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the log-likelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration

Good Error-Correcting Codes based on Very Sparse Matrices

by David J.C. MacKay , 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract - Cited by 741 (23 self) - Add to MetaCart
but also for any channel with symmetric stationary ergodic noise. We give experimental results for binary-symmetric channels and Gaussian channels demonstrating that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed

Gaussian interference channel capacity to within one bit

by Raul H. Etkin, David N. C. Tse, Hua Wang - 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract - Cited by 451 (28 self) - Add to MetaCart
Abstract—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing

Capacity Limits of MIMO Channels

by Andrea Goldsmith, Syed Ali Jafar, Nihar Jindal, Sriram Vishwanath - 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 409 (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

Image denoising using a scale mixture of Gaussians in the wavelet domain

by Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli - IEEE TRANS IMAGE PROCESSING , 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract - Cited by 514 (17 self) - Add to MetaCart
coefficient reduces to a weighted average of the local linear estimates over all possible values of the hidden multiplier variable. We demonstrate through simulations with images contaminated by additive white Gaussian noise that the performance of this method substantially surpasses that of previously

High-Rate Codes that are Linear in Space and Time

by Babak Hassibi, Bertrand Hochwald - IEEE Trans. Inform. Theory , 2000
"... Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens of bits/sec/Hz, V-BLAST, where every antenna transmits its own independent substream of data, has been shown to have good ..."
Abstract - Cited by 420 (12 self) - Add to MetaCart
Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens of bits/sec/Hz, V-BLAST, where every antenna transmits its own independent substream of data, has been shown to have
Next 10 →
Results 1 - 10 of 348,312
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University