Results 1  10
of
60
Mutual information and minimum meansquare error in Gaussian channels
 IEEE TRANS. INFORM. THEORY
, 2005
"... This paper deals with arbitrarily distributed finitepower input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the inputoutput mutual information and the minimum meansquare error (MMSE) achievable by optimal estimation of the input given the out ..."
Abstract

Cited by 288 (34 self)
 Add to MetaCart
(Show Context)
This paper deals with arbitrarily distributed finitepower input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the inputoutput mutual information and the minimum meansquare error (MMSE) achievable by optimal estimation of the input given the output. That is, the derivative of the mutual information (nats) with respect to the signaltonoise ratio (SNR) is equal to half the MMSE, regardless of the input statistics. This relationship holds for both scalar and vector signals, as well as for discretetime and continuoustime noncausal MMSE estimation. This fundamental informationtheoretic result has an unexpected consequence in continuoustime nonlinear estimation: For any input signal with finite power, the causal filtering MMSE achieved at SNR is equal to the average value of the noncausal smoothing MMSE achieved with a channel whose signaltonoise ratio is chosen uniformly distributed between 0 and SNR.
On the Complexity of Sphere Decoding in Digital Communications
 IN DIGITAL COMMUNICATIONS,” IEEE TRANSACTIONS ON SIGNAL PROCESSING, TO APPEAR
, 2005
"... ..."
Fundamental limits on detection in low SNR under noise uncertainty
 in WirelessCom 2005, Maui, HI
, 2005
"... uncertainty ..."
(Show Context)
NeymanPearson detection of GaussMarkov signals in noise: Closedform error exponent and properties,” preprint
, 2004
"... Abstract — The performance of NeymanPearson detection of correlated stochastic signals using noisy observations is investigated via the error exponent for the miss probability with a fixed level. Using the statespace structure of the signal and observation model, a closedform expression for the er ..."
Abstract

Cited by 34 (16 self)
 Add to MetaCart
(Show Context)
Abstract — The performance of NeymanPearson detection of correlated stochastic signals using noisy observations is investigated via the error exponent for the miss probability with a fixed level. Using the statespace structure of the signal and observation model, a closedform expression for the error exponent is derived, and the connection between the asymptotic behavior of the optimal detector and that of the Kalman filter is established. The properties of the error exponent are investigated for the scalar case. It is shown that the error exponent has distinct characteristics with respect to correlation strength: for signaltonoise ratio (SNR)> 1 the error exponent decreases monotonically as the correlation becomes stronger, whereas for SNR < 1 there is an optimal correlation that maximizes the error exponent for a given SNR. I.
Detection of GaussMarkov Random Fields with NearestNeighbor Dependency
, 2008
"... The problem of hypothesis testing against independence for a GaussMarkov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the loglikelihood ratio of detection is derived. Assuming random placement of nodes over a large region according to the Poisson or uni ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
The problem of hypothesis testing against independence for a GaussMarkov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the loglikelihood ratio of detection is derived. Assuming random placement of nodes over a large region according to the Poisson or uniform distribution and nearestneighbor dependency graph, the error exponent of the NeymanPearson detector is derived using largedeviations theory. The error exponent is expressed as a dependencygraph functional and the limit is evaluated through a special law of large numbers for stabilizing graph functionals. The exponent is analyzed for different values of the variance ratio and correlation. It is found that a more correlated GMRF has a higher exponent at low values of the variance ratio whereas the situation is reversed at high values of the variance ratio.
Sensor configuration and activation for field detection in large sensor arrays
 in Proc. 2005 Information Processing in Sensor Networks (IPSN
, 2005
"... The problems of sensor configuration for the detection of correlated random fields using large sensor arrays are considered. Using error exponents that characterize the asymptotic behavior of the optimal detector, the detection performance of different sensor configurations are analyzed and compared ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
(Show Context)
The problems of sensor configuration for the detection of correlated random fields using large sensor arrays are considered. Using error exponents that characterize the asymptotic behavior of the optimal detector, the detection performance of different sensor configurations are analyzed and compared. The dependence of the optimal configuration on parameters such as sensor signaltonoise ratio (SNR), field correlation, etc., is examined, yielding insights into the most effective choices for sensor selection in various operating conditions. Simulation results validate the analysis based on asymptotic results for finite sample
A nearoptimal multiuser detector for DSCDMA systems using semidefinite programming relaxation
 IEEE Trans. Signal Process
, 2003
"... Abstract—A multiuser detector for directsequence codedivision multipleaccess systems based on semidefinite programming (SDP) is proposed. It is shown that maximum likelihood (ML) detection can be carried out by “relaxing ” the associated integer programming problem to a dual SDP problem, which le ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract—A multiuser detector for directsequence codedivision multipleaccess systems based on semidefinite programming (SDP) is proposed. It is shown that maximum likelihood (ML) detection can be carried out by “relaxing ” the associated integer programming problem to a dual SDP problem, which leads to a detector of polynomial complexity. Computer simulations that demonstrate that the proposed detector offers nearoptimal performance with considerably reduced computational complexity compared with that of existing primalSDPrelaxation based detectors are presented. Index Terms—Duality theory, maximum likelihood detection, multiuser detection, semidefinite programming. I.
Regression in sensor networks: training distributively with alternating projections
 In Advanced Signal Processing Algorithms, Architectures, and Implementations XV, Volume SPIE 5910  1
, 2005
"... ..."
DETECTION OF GAUSSMARKOV RANDOM FIELD ON NEARESTNEIGHBOR GRAPH
"... The problem of hypothesis testing against independence for a GaussMarkov random field (GMRF) with nearestneighbor dependency graph is analyzed. The sensors measuring samples from the signal field are placed IID according to the uniform distribution. The asymptotic performance of NeymanPearson det ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
The problem of hypothesis testing against independence for a GaussMarkov random field (GMRF) with nearestneighbor dependency graph is analyzed. The sensors measuring samples from the signal field are placed IID according to the uniform distribution. The asymptotic performance of NeymanPearson detection is characterized through the largedeviation theory. An expression for the error exponent is derived using a special law of large numbers for graph functionals. The exponent is analyzed for different values of the variance ratio and correlation. It is found that a more correlated GMRF has a higher exponent (improved detection performance) at low values of the variance ratio, whereas the opposite is true at high values of the ratio.