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
Exibições de texto completo
142
Propomos um método eficiente de solicitação de repetição automática híbrida (HARQ) que simultaneamente alcança a combinação de pacotes e a resolução das colisões de identificadores de acesso aleatório (RAIDs) durante a retransmissão em um sistema de acesso aleatório baseado em acesso múltiplo não ortogonal (NOMA). Aqui, o RAID funciona como um separador para pacotes recebidos simultaneamente que usam o mesmo canal no NOMA. Um exemplo disso é um código de codificação usado em sistemas 4G e 5G. Como os usuários selecionam independentemente um RAID do conjunto de candidatos preparado pelo sistema, a decodificação dos pacotes recebidos falha quando vários usuários selecionam o mesmo RAID. A nova seleção aleatória de RAID por cada usuário ao tentar a retransmissão pode resolver uma colisão de RAID; no entanto, a combinação de pacotes entre os pacotes anteriores e retransmitidos não é possível neste caso porque o receptor da estação base não conhece a relação entre o RAID do pacote transmitido anteriormente e o do pacote retransmitido. Para resolver este problema, propomos um método HARQ que emprega novos grupos RAID hierárquicos estruturados em árvore, nos quais o RAID para a transmissão de pacotes anterior tem um relacionamento um-para-um com o conjunto de RAIDs para retransmissão. O método proposto resolve colisões de RAID na retransmissão selecionando novamente aleatoriamente para cada usuário um RAID do conjunto RAID dedicado da transmissão anterior. Como a relação entre os RAIDs na transmissão e retransmissão anteriores é conhecida na estação base, a combinação de pacotes é obtida simultaneamente. Os resultados da simulação computacional mostram a eficácia do método proposto.
Megumi ASADA
Tokyo University of Science
Nobuhide NONAKA
NTT DOCOMO, INC.
Kenichi HIGUCHI
Tokyo University of Science
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
Megumi ASADA, Nobuhide NONAKA, Kenichi HIGUCHI, "HARQ Using Hierarchical Tree-Structured Random Access Identifiers in NOMA-Based Random Access" in IEICE TRANSACTIONS on Communications,
vol. E106-B, no. 8, pp. 696-704, August 2023, doi: 10.1587/transcom.2023EBP3001.
Abstract: We propose an efficient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during retransmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retransmission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retransmission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the effectiveness of the proposed method.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2023EBP3001/_p
Copiar
@ARTICLE{e106-b_8_696,
author={Megumi ASADA, Nobuhide NONAKA, Kenichi HIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={HARQ Using Hierarchical Tree-Structured Random Access Identifiers in NOMA-Based Random Access},
year={2023},
volume={E106-B},
number={8},
pages={696-704},
abstract={We propose an efficient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during retransmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retransmission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retransmission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the effectiveness of the proposed method.},
keywords={},
doi={10.1587/transcom.2023EBP3001},
ISSN={1745-1345},
month={August},}
Copiar
TY - JOUR
TI - HARQ Using Hierarchical Tree-Structured Random Access Identifiers in NOMA-Based Random Access
T2 - IEICE TRANSACTIONS on Communications
SP - 696
EP - 704
AU - Megumi ASADA
AU - Nobuhide NONAKA
AU - Kenichi HIGUCHI
PY - 2023
DO - 10.1587/transcom.2023EBP3001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2023
AB - We propose an efficient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during retransmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retransmission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retransmission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the effectiveness of the proposed method.
ER -