TY - GEN

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

AU - Fossorier, Marc P.C.

AU - Koumoto, Takuya

AU - Takata, Toyoo

AU - Kasami, Tadao

AU - Lin, Shu

N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030720705&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030720705&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1997.613367

DO - 10.1109/ISIT.1997.613367

M3 - Conference contribution

AN - SCOPUS:0030720705

SN - 0780339568

SN - 9780780339569

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 430

BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -