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
전파 지연 기반 X 채널에 대한 잠재적인 응용 프로그램의 전체 그림을 얻으려면 인코더, 채널 인스턴스 및 디코더를 포함하여 순환 간섭 정렬의 모든 실현 가능한 방식을 얻는 것이 중요합니다. 그러나 차원이 커지면 이 문제에 대한 이론적 분석은 지루하고 심지어 불가능해진다. 이 편지에서 우리는 채널 공간과 스케줄링 공간을 검색하여 가능한 모든 방식을 세부적으로 찾을 수 있는 컴퓨터 지원 솔루션을 제안합니다. 몇 가지 일반적인 X 채널에 대한 예가 제공됩니다. 계산 복잡성이 추가로 분석됩니다.
Conggai LI
Shanghai Jian Qiao University
Feng LIU
Shanghai Maritime University
Xin ZHOU
Shanghai Maritime University
Yanli XU
Shanghai Maritime 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.
부
Conggai LI, Feng LIU, Xin ZHOU, Yanli XU, "A Computer-Aided Solution to Find All Feasible Schemes of Cyclic Interference Alignment for Propagation-Delay Based X Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 5, pp. 868-870, May 2023, doi: 10.1587/transfun.2022EAL2078.
Abstract: To obtain a full picture of potential applications for propagation-delay based X channels, it is important to obtain all feasible schemes of cyclic interference alignment including the encoder, channel instance, and decoder. However, when the dimension goes larger, theoretical analysis about this issue will become tedious and even impossible. In this letter, we propose a computer-aided solution by searching the channel space and the scheduling space, which can find all feasible schemes in details. Examples are given for some typical X channels. Computational complexity is further analyzed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022EAL2078/_p
부
@ARTICLE{e106-a_5_868,
author={Conggai LI, Feng LIU, Xin ZHOU, Yanli XU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Computer-Aided Solution to Find All Feasible Schemes of Cyclic Interference Alignment for Propagation-Delay Based X Channels},
year={2023},
volume={E106-A},
number={5},
pages={868-870},
abstract={To obtain a full picture of potential applications for propagation-delay based X channels, it is important to obtain all feasible schemes of cyclic interference alignment including the encoder, channel instance, and decoder. However, when the dimension goes larger, theoretical analysis about this issue will become tedious and even impossible. In this letter, we propose a computer-aided solution by searching the channel space and the scheduling space, which can find all feasible schemes in details. Examples are given for some typical X channels. Computational complexity is further analyzed.},
keywords={},
doi={10.1587/transfun.2022EAL2078},
ISSN={1745-1337},
month={May},}
부
TY - JOUR
TI - A Computer-Aided Solution to Find All Feasible Schemes of Cyclic Interference Alignment for Propagation-Delay Based X Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 868
EP - 870
AU - Conggai LI
AU - Feng LIU
AU - Xin ZHOU
AU - Yanli XU
PY - 2023
DO - 10.1587/transfun.2022EAL2078
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2023
AB - To obtain a full picture of potential applications for propagation-delay based X channels, it is important to obtain all feasible schemes of cyclic interference alignment including the encoder, channel instance, and decoder. However, when the dimension goes larger, theoretical analysis about this issue will become tedious and even impossible. In this letter, we propose a computer-aided solution by searching the channel space and the scheduling space, which can find all feasible schemes in details. Examples are given for some typical X channels. Computational complexity is further analyzed.
ER -