IEICE TRANSACTIONS on Fundamentals
A Computer-Aided Solution to Find All Feasible Schemes of Cyclic Interference Alignment for Propagation-Delay Based X Channels
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E106-A No.5 pp.868-870
- Publication Date
- 2023/05/01
- Publicized
- 2022/11/02
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2022EAL2078
- Type of Manuscript
- LETTER
- Category
- Communication Theory and Signals
Authors
Conggai LI
Shanghai Jian Qiao University
Feng LIU
Shanghai Maritime University
Xin ZHOU
Shanghai Maritime University
Yanli XU
Shanghai Maritime University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
