Show simple item record

dc.contributor.authorHolmes, J. K.
dc.contributor.authorButman, S.
dc.date.accessioned2016-04-21T21:52:33Zen
dc.date.available2016-04-21T21:52:33Zen
dc.date.issued1968-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/606506en
dc.descriptionInternational Telemetering Conference Proceedings / October 08-11, 1968 / Ambassador Hotel, Los Angeles, Californiaen_US
dc.description.abstractThis paper presents an optimum and a sub-optimum, but easily recognizable, method for the detection of K binary symbols corrupted by white Gaussian noise with unknown mean. Basically the optimum procedure requires picking the sequence from a set of 2ᴷ sequences which minimizes a certain functional. However this procedure requires a great deal of computation. This computational problem is considerably reduced by the use of an efficient searching procedure developed in this paper. However a sub-optimum procedure exists and is very simple to instrument with the advantage that decisions are made in a bit-by-bit fashion. This procedure is analyzed and the average error probability is obtained.
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.titleOptimum and Sub-optimum Detection of Digital Sequences Corrupted by White Noiseen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentJet Propulsion Laboratoryen
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-01T02:38:46Z
html.description.abstractThis paper presents an optimum and a sub-optimum, but easily recognizable, method for the detection of K binary symbols corrupted by white Gaussian noise with unknown mean. Basically the optimum procedure requires picking the sequence from a set of 2ᴷ sequences which minimizes a certain functional. However this procedure requires a great deal of computation. This computational problem is considerably reduced by the use of an efficient searching procedure developed in this paper. However a sub-optimum procedure exists and is very simple to instrument with the advantage that decisions are made in a bit-by-bit fashion. This procedure is analyzed and the average error probability is obtained.


Files in this item

Thumbnail
Name:
ITC_1968_68-01-5.pdf
Size:
1.352Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record