Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

The use of the method of maximum likelihood in estimating continuous-modulated intelligence which has been corrupted by noise

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)
Youla, Dante C. ; Jet Propulsion Laboratory, Pasadena, California

A signal is received in the time interval (t ¿ T ¿ ¿ ¿ t). It is known that this signal is composed of noise plus intelligence a(t) which is statistical in nature and which has been modulated in some known way. Assuming that both intelligence and noise are Gaussian (although not necessarily stationary) time series, the analog of the classical maximum-likelihood estimate for ¿(t) is derived. The advantage of this approach is that it can handle arbitrary types of modulation. For unmodulated stationary intelligence and stationary noise, the solution reduces to that of Zadeh and Ragazzini. In the general case, the optimum estimate is given as the solution of a pair of integral equations. The amplitude-modulated case is treated in some detail. The application of the maximum-likelihood technique to problems involving arbitrary modulation was first suggested, as far as the author is aware, by F. W. Lehan and R. J. Parks of the Jet Propulsion Laboratory.

Published in:

Information Theory, Transactions of the IRE Professional Group on  (Volume:3 ,  Issue: 3 )