The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, consideramos sistemas codificados de múltiplas entradas e múltiplas saídas (MIMO) com códigos de verificação de paridade de baixa densidade (LDPC) e código de bloco de espaço-tempo (STBC) em canais MIMO. O código LDPC assume o papel de código de canal enquanto o STBC fornece diversidade espaço-temporal. O desempenho desse sistema MIMO codificado demonstrou ser excelente no passado. Neste artigo, apresentamos uma análise de desempenho para um limite superior de probabilidade de erro para esquemas MIMO codificados. Em comparação com trabalhos anteriores, a abordagem proposta para o limite superior pode evitar qualquer enumeração explícita de pesos de palavras-código e fornecer um passo significativo para o limite superior usando um teorema multinomial. Além disso, propomos uma convolução de domínio logarítmico que nos permite lidar com números enormes, por exemplo, 10500. A comparação de simulações de sistemas e avaliações numéricas mostra que o limite superior proposto é aplicável a vários sistemas MIMO codificados.
Jin-Taek SEONG
Mokpo National University
Jin-Ho YOU
Mokpo National University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
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., 10500. 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
Copiar
@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., 10500. 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},}
Copiar
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., 10500. Comparison of system simulations and numerical evaluations shows that the proposed upper bound is applicable for various coded MIMO systems.
ER -