Show simple item record

dc.contributor.authorKing, Maurice A., Jr.
dc.date.accessioned2016-05-19T22:40:40Z
dc.date.available2016-05-19T22:40:40Z
dc.date.issued1978-11
dc.identifier.issn0884-5123
dc.identifier.issn0074-9079
dc.identifier.urihttp://hdl.handle.net/10150/609956
dc.descriptionInternational Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los Angeles, Californiaen_US
dc.description.abstractThere are many important problems in the field of communications theory whose solution is the expectation of a function of a random variable. Examples include linear interference problems such as intersymbol interference and co-channel interference. In these cases, it is often not computationally feasible to evaluate the expectation exactly. This paper presents an algorithm that will compute tight upper and lower bounds to generalized moments of a broad class of random variables. The procedure is based on an isomorphism theorem from Game Theory. The technique is easily understood while yielding excellent results for this class of communication problems.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.titleA Geometric Moment Bounding Algorithmen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentThe Aerospace Corporationen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-07-01T16:41:16Z
html.description.abstractThere are many important problems in the field of communications theory whose solution is the expectation of a function of a random variable. Examples include linear interference problems such as intersymbol interference and co-channel interference. In these cases, it is often not computationally feasible to evaluate the expectation exactly. This paper presents an algorithm that will compute tight upper and lower bounds to generalized moments of a broad class of random variables. The procedure is based on an isomorphism theorem from Game Theory. The technique is easily understood while yielding excellent results for this class of communication problems.


Files in this item

Thumbnail
Name:
ITC_1978_78-16-5.pdf
Size:
149.8Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record