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 | |
| 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
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
Ueda, S., Ikuta, K., Kusaka, T., Khandaker, M. A. A., Ali, M. A., & Nogami, Y. (2018). An extended generalized minimum distance decoding for binary linear codes on a 4-level quantization over an AWGN channel. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E101A(8), 1235-1244. https://doi.org/10.1587/transfun.E101.A.1235