An Extended Generalized Minimum Distance Decoding for Binary Linear Codes on a 4-Level Quantization over an AWGN Channel

Shunsuke UEDA  Ken IKUTA  Takuya KUSAKA  Md. Al-Amin KHANDAKER  Md. Arshad ALI  Yasuyuki NOGAMI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.8   pp.1235-1244
Publication Date: 2018/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.1235
Type of Manuscript: PAPER
Category: Coding Theory
GMD decoding,  quantization,  AWGN,  binary linear codes,  

Full Text: PDF>>
Buy this Article

Generalized Minimum Distance (GMD) decoding is a well-known soft-decision decoding for linear codes. Previous research on GMD decoding focused mainly on unquantized AWGN channels with BPSK signaling for binary linear codes. In this paper, a study on the design of a 4-level uniform quantizer for GMD decoding is given. In addition, an extended version of a GMD decoding algorithm for a 4-level quantizer is proposed, and the effectiveness of the proposed decoding is shown by simulation.