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

doi:10.1587/transfun.E101.A.1235

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

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	1235-1244
Number of pages	10
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E101A
Issue number	8
DOIs	https://doi.org/10.1587/transfun.E101.A.1235
Publication status	Published - Aug 1 2018

Keywords

AWGN
Binary linear codes
GMD decoding
Quantization

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1587/transfun.E101.A.1235

Fingerprint Dive into the research topics of 'An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel'. Together they form a unique fingerprint.

Cite this

An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel. / Ueda, Shunsuke; Ikuta, Ken; Kusaka, Takuya; Khandaker, Md Al Amin; Ali, Md Arshad; Nogami, Yasuyuki.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101A, No. 8, 01.08.2018, p. 1235-1244.

Research output: Contribution to journal › Article › peer-review

@article{8bd8746820534bccabd6178c16a64b36,

title = "An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel",

abstract = "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.",

keywords = "AWGN, Binary linear codes, GMD decoding, Quantization",

author = "Shunsuke Ueda and Ken Ikuta and Takuya Kusaka and Khandaker, {Md Al Amin} and Ali, {Md Arshad} and Yasuyuki Nogami",

year = "2018",

month = aug,

day = "1",

doi = "10.1587/transfun.E101.A.1235",

language = "English",

volume = "E101A",

pages = "1235--1244",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "8",

}

TY - JOUR

T1 - An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel

AU - Ueda, Shunsuke

AU - Ikuta, Ken

AU - Kusaka, Takuya

AU - Khandaker, Md Al Amin

AU - Ali, Md Arshad

AU - Nogami, Yasuyuki

PY - 2018/8/1

Y1 - 2018/8/1

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

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

KW - AWGN

KW - Binary linear codes

KW - GMD decoding

KW - Quantization

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

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

U2 - 10.1587/transfun.E101.A.1235

DO - 10.1587/transfun.E101.A.1235

M3 - Article

AN - SCOPUS:85052016080

VL - E101A

SP - 1235

EP - 1244

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -

An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this