The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis

Marc P.C. Fossorier, Takuya Koumoto, Toyoo Takata, Tadao Kasami, Shu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Suppose a binary linear block code C with weight profile W is used for error control over the AWGN channel. A codeword c is mapped into the BPSK sequence x. Let r denote the received noisy vector and z=(z1, ⋯,zN) denote the corresponding bit-by-bit hard decoded sequence. Let VN represent the set all binary N-tuples. For u=(u 1,⋯,uN) in VN, we define D 1(u)={i:ui≠zi,i≤N}, n(u)=|D 1(u)| and Do(u)={1,⋯,N}-D1(u). Then the maximum likelihood decoding (MLD) solution is the codeword c/sub opt/ which minimize the correlation discrepancy L(c)=ΣiεD1(c)|Ti|. Consequently if for c*εC and α(c*)=min εC,c≠c*{L(c)}, L(c*)≤α(c*), then c*=copt. Therefore any lower bound on alpha/(c*) will provide a sufficient condition on the optimality of a candidate codeword.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Number of pages1
DOIs
Publication statusPublished - Dec 1 1997
Externally publishedYes
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: Jun 29 1997Jul 4 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
CountryGermany
CityUlm
Period6/29/977/4/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis'. Together they form a unique fingerprint.

  • Cite this

    Fossorier, M. P. C., Koumoto, T., Takata, T., Kasami, T., & Lin, S. (1997). The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis. In Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997 [613367] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1997.613367