Cart (Loading....) | Create Account
Close category search window
 

Some results on the problem of discriminating between two Gaussian processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This paper is concerned with certain aspects of the problem of discriminating between two Gaussian processes. The emphasis is on determining approximate optimum detector structures which avoid some of the mathematical difficulties inherent in the evaluation of the exact optimum detector structure. To this end, an approach termed the "inverse operator" approach is presented which leads to approximate detector structures via the Neumann series expansion of linear operator theory. These approximate detectors are found by using a finite number of terms in an "optimun detector" expansion which results from the use of the above Neumann series expansion. A sufficient condition for the rapid convergence of the optimum detector expansion is found to be that the eigenvalues of a certain operator have magnitudes much less than unity. An upper bound is derived for the error incurred at the detector output by the use of a finite number of terms in the optimum detector expansion. Error probabilities are calculated for the case in which the detector outputs may be assumed approximately normally distributed. From an output "signal-to-noise" ratio point of view, it is shown that the performance of the optimum detector and approximate detectors will differ negligibly if the above eigenvalues have squared magnitudes much less than unity. Some upper bounds are derived for the largest eigenvalue (magnitude).

Published in:

Information Theory, IRE Transactions on  (Volume:7 ,  Issue: 4 )

Date of Publication:

October 1961

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.