Results 11 - 20 of 3,925

Training with Noise is Equivalent to Tikhonov Regularization

by Chris M. Bishop - Neural Computation , 1994
"... It is well known that the addition of noise to the input data of a neural network during training can, in some circumstances, lead to significant improvements in generalization performance. Previous work has shown that such training with noise is equivalent to a form of regularization in which an ex ..."
Abstract - Cited by 158 (0 self) - Add to MetaCart
It is well known that the addition of noise to the input data of a neural network during training can, in some circumstances, lead to significant improvements in generalization performance. Previous work has shown that such training with noise is equivalent to a form of regularization in which

Wireless Network Information Flow: A Deterministic Approach

by A. Salman Avestimehr, et al. , 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 296 (42 self) - Add to MetaCart
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

Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel

by Ashish Khisti, Gregory W. Wornell , 2007
"... The role of multiple antennas for secure communication is investigated within the framework of Wyner’s wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and t ..."
Abstract - Cited by 240 (19 self) - Add to MetaCart
, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy is capacity-achieving. In addition, we show that in the high signal-to-noise (SNR) ratio regime the penalty for not knowing eavesdropper’s channel is small—a simple “secure space-time code ” that can be thought

Blind Source Separation by Sparse Decomposition in a Signal Dictionary

by M. Zibulevsky, B. A. Pearlmutter, P. Bofill, P. Kisilev , 2000
"... Introduction In blind source separation an N-channel sensor signal x(t) arises from M unknown scalar source signals s i (t), linearly mixed together by an unknown N M matrix A, and possibly corrupted by additive noise (t) x(t) = As(t) + (t) (1.1) We wish to estimate the mixing matrix A and the M- ..."
Abstract - Cited by 274 (34 self) - Add to MetaCart
Introduction In blind source separation an N-channel sensor signal x(t) arises from M unknown scalar source signals s i (t), linearly mixed together by an unknown N M matrix A, and possibly corrupted by additive noise (t) x(t) = As(t) + (t) (1.1) We wish to estimate the mixing matrix A and the M

On Beamforming with Finite Rate Feedback in Multiple Antenna Systems

by Krishna Kiran Mukkavilli, Ashutosh Sabharwal, Elza Erkip, Behnaam Aazhang , 2003
"... In this paper, we study a multiple antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any f ..."
Abstract - Cited by 272 (14 self) - Add to MetaCart
finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t 1)2 , where B

Adaptive Coded Modulation for Fading Channels

by Andrea J. Goldsmith, Soon-Ghee Chua - IEEE TRANS. COMMUN , 1998
"... We apply coset codes to adaptive modulation in fading channels. Adaptive modulation is a powerful technique to improve the energy efficiency and increase the data rate over a fading channel. Coset codes are a natural choice to use with adaptive modulation since the channel coding and modulation desi ..."
Abstract - Cited by 204 (11 self) - Add to MetaCart
designs are separable. Therefore, trellis and lattice codes designed for additive white Gaussian noise (AWGN) channels can be superimposed on adaptive modulation for fading channels, with the same approximate coding gains. We first describe the methodology for combining coset codes with a general class

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

by Sae-Young Chung, Thomas J. Richardson, Rüdiger L. Urbanke - 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

Secure communication over fading channels

by Yingbin Liang, H. Vincent Poor, Shlomo Shamai (Shitz) , 2007
"... The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from rec ..."
Abstract - Cited by 186 (21 self) - Add to MetaCart
receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC

Communication by energy modulation: The additive exponential noise channel

by Alfonso Martinez, Senior Member - IEEE Trans. Inform. Theory , 2011
"... Abstract—Communication across an additive exponential noise (AEN) channel is studied. The AEN channel is derived from a continuous-time Gaussian channel by assuming decoherence between the signal and noise components. Decoherence renders impossible the use of the complex amplitude and information is ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract—Communication across an additive exponential noise (AEN) channel is studied. The AEN channel is derived from a continuous-time Gaussian channel by assuming decoherence between the signal and noise components. Decoherence renders impossible the use of the complex amplitude and information

Coding and Modulation for the Additive Exponential Noise Channel

by Alfonso Martinez
"... Abstract—Communication across an additive exponential noise (AEN) channel is studied. Constellations are designed for low signal-to-noise ratio, where the minimum energy per bit is not universally attained by all modulations, and for high signal-tonoise ratio, where an equiprobable non-uniform const ..."
Abstract - Add to MetaCart
Abstract—Communication across an additive exponential noise (AEN) channel is studied. Constellations are designed for low signal-to-noise ratio, where the minimum energy per bit is not universally attained by all modulations, and for high signal-tonoise ratio, where an equiprobable non
Results 11 - 20 of 3,925