Persistent Link:
http://hdl.handle.net/10150/609945
Title:
Quasi-Optimal Decoding of Linear Block Codes Using Soft Decision Detection
Author:
Greene, Edward P.
Affiliation:
NASA/Goddard Space Flight Center
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:
A simple but effective decoding procedure, applicable to any (n,k) linear block code with symbols from GF(q), is described. The technique involves a transformation of the parity check equations which focuses the code's correction power on the soft symbol set while still retaining the capability to correct one symbol error from outside this set. The soft symbol set is defined to be the n-k least reliably detected code symbol positions whose parity check rowspaces are linearly independent. The process generates a number of error vector screening candidates, each a solution to the parity check equations, and the maximum-likelihood candidate is accepted. If P(opt) and P(qopt) are the decoder error rates for the optimal and quasi-optimal decoders respectively, then P(opt) < P(qopt) < P(opt) + P(se) where P(se) is the probability that the actual error vector is not included in the screening candidate set. Since P(se) can be shown to approach zero for a wide range of codes and operating conditions, the performance of this decoder can be quasi-optimal in these cases.
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.titleQuasi-Optimal Decoding of Linear Block Codes Using Soft Decision Detectionen_US
dc.contributor.authorGreene, Edward P.en
dc.contributor.departmentNASA/Goddard Space Flight Centeren
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.abstractA simple but effective decoding procedure, applicable to any (n,k) linear block code with symbols from GF(q), is described. The technique involves a transformation of the parity check equations which focuses the code's correction power on the soft symbol set while still retaining the capability to correct one symbol error from outside this set. The soft symbol set is defined to be the n-k least reliably detected code symbol positions whose parity check rowspaces are linearly independent. The process generates a number of error vector screening candidates, each a solution to the parity check equations, and the maximum-likelihood candidate is accepted. If P(opt) and P(qopt) are the decoder error rates for the optimal and quasi-optimal decoders respectively, then P(opt) < P(qopt) < P(opt) + P(se) where P(se) is the probability that the actual error vector is not included in the screening candidate set. Since P(se) can be shown to approach zero for a wide range of codes and operating conditions, the performance of this decoder can be quasi-optimal in these cases.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123-
dc.identifier.issn0074-9079-
dc.identifier.urihttp://hdl.handle.net/10150/609945-
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.