Upper Bound for Coded MIMO Systems without Enumeration of Codewords

Jin-Taek SEONG; Jin-Ho YOU

doi:10.1587/transfun.E101.A.1925

Upper Bound for Coded MIMO Systems without Enumeration of Codewords

Jin-Taek SEONG, Jin-Ho YOU

Full Text Views

0

Cite this

Summary :

In this paper, we consider coded multi-input multi-output (MIMO) systems with low-density parity-check (LDPC) codes and space-time block code (STBC) in MIMO channels. The LDPC code takes the role of a channel code while the STBC provides spatial-temporal diversity. The performance of such coded MIMO system has been shown to be excellent in the past. In this paper, we present a performance analysis for an upper bound on probability of error for coded MIMO schemes. Compared to previous works, the proposed approach for the upper bound can avoid any explicit weight enumeration of codewords and provide a significant step for the upper bound by using a multinomial theorem. In addition, we propose a log domain convolution that enables us to handle huge numbers, e.g., 10⁵⁰⁰. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.11 pp.1925-1933

Publication Date: 2018/11/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E101.A.1925

Type of Manuscript: PAPER

Category: Communication Theory and Signals

Authors

Jin-Taek SEONG
Mokpo National University
Jin-Ho YOU
Mokpo National University

Keyword

LDPC code, MIMO system, space-time block code, upper bound, weight enumeration

Cite this

Copy

Jin-Taek SEONG, Jin-Ho YOU, "Upper Bound for Coded MIMO Systems without Enumeration of Codewords" in IEICE TRANSACTIONS on Fundamentals, vol. E101-A, no. 11, pp. 1925-1933, November 2018, doi: 10.1587/transfun.E101.A.1925.
Abstract: In this paper, we consider coded multi-input multi-output (MIMO) systems with low-density parity-check (LDPC) codes and space-time block code (STBC) in MIMO channels. The LDPC code takes the role of a channel code while the STBC provides spatial-temporal diversity. The performance of such coded MIMO system has been shown to be excellent in the past. In this paper, we present a performance analysis for an upper bound on probability of error for coded MIMO schemes. Compared to previous works, the proposed approach for the upper bound can avoid any explicit weight enumeration of codewords and provide a significant step for the upper bound by using a multinomial theorem. In addition, we propose a log domain convolution that enables us to handle huge numbers, e.g., 10⁵⁰⁰. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1925/_p

Copy

@ARTICLE{e101-a_11_1925,
author={Jin-Taek SEONG, Jin-Ho YOU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Upper Bound for Coded MIMO Systems without Enumeration of Codewords},
year={2018},
volume={E101-A},
number={11},
pages={1925-1933},
abstract={In this paper, we consider coded multi-input multi-output (MIMO) systems with low-density parity-check (LDPC) codes and space-time block code (STBC) in MIMO channels. The LDPC code takes the role of a channel code while the STBC provides spatial-temporal diversity. The performance of such coded MIMO system has been shown to be excellent in the past. In this paper, we present a performance analysis for an upper bound on probability of error for coded MIMO schemes. Compared to previous works, the proposed approach for the upper bound can avoid any explicit weight enumeration of codewords and provide a significant step for the upper bound by using a multinomial theorem. In addition, we propose a log domain convolution that enables us to handle huge numbers, e.g., 10⁵⁰⁰. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.},
keywords={},
doi={10.1587/transfun.E101.A.1925},
ISSN={1745-1337},
month={November},}

Copy

TY - JOUR
TI - Upper Bound for Coded MIMO Systems without Enumeration of Codewords
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1925
EP - 1933
AU - Jin-Taek SEONG
AU - Jin-Ho YOU
PY - 2018
DO - 10.1587/transfun.E101.A.1925
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2018
AB - In this paper, we consider coded multi-input multi-output (MIMO) systems with low-density parity-check (LDPC) codes and space-time block code (STBC) in MIMO channels. The LDPC code takes the role of a channel code while the STBC provides spatial-temporal diversity. The performance of such coded MIMO system has been shown to be excellent in the past. In this paper, we present a performance analysis for an upper bound on probability of error for coded MIMO schemes. Compared to previous works, the proposed approach for the upper bound can avoid any explicit weight enumeration of codewords and provide a significant step for the upper bound by using a multinomial theorem. In addition, we propose a log domain convolution that enables us to handle huge numbers, e.g., 10⁵⁰⁰. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.
ER -