Persistent Link:
http://hdl.handle.net/10150/609956
Title:
A Geometric Moment Bounding Algorithm
Author:
King, Maurice A., Jr.
Affiliation:
The Aerospace Corporation
Issue Date:
1978-11
Rights:
Copyright © International Foundation for Telemetering
Collection Information:
Proceedings 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.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
There 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.
Sponsors:
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
Additional Links:
http://www.telemetry.org/

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleA Geometric Moment Bounding Algorithmen_US
dc.contributor.authorKing, Maurice A., Jr.en
dc.contributor.departmentThe Aerospace Corporationen
dc.date.issued1978-11-
dc.rightsCopyright © International Foundation for Telemeteringen
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
dc.publisherInternational Foundation for Telemeteringen
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.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123-
dc.identifier.issn0074-9079-
dc.identifier.urihttp://hdl.handle.net/10150/609956-
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.