Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.01578v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.01578v1 (cs)
[Submitted on 3 Dec 2022 ]

Title: High-Speed Resource Allocation Algorithm Using a Coherent Ising Machine for NOMA Systems

Title: 基于相干伊辛机的非正交多址系统高速资源分配算法

Authors:Teppei Otsuka, Aohan Li, Hiroki Takesue, Kensuke Inaba, Kazuyuki Aihara, Mikio Hasegawa
Abstract: Non-orthogonal multiple access (NOMA) technique is important for achieving a high data rate in next-generation wireless communications. A key challenge to fully utilizing the effectiveness of the NOMA technique is the optimization of the resource allocation (RA), e.g., channel and power. However, this RA optimization problem is NP-hard, and obtaining a good approximation of a solution with a low computational complexity algorithm is not easy. To overcome this problem, we propose the coherent Ising machine (CIM) based optimization method for channel allocation in NOMA systems. The CIM is an Ising system that can deliver fair approximate solutions to combinatorial optimization problems at high speed (millisecond order) by operating optimization algorithms based on mutually connected photonic neural networks. The performance of our proposed method was evaluated using a simulation model of the CIM. We compared the performance of our proposed method to simulated annealing, a conventional-NOMA pairing scheme, deep Q learning based scheme, and an exhaustive search scheme. Simulation results indicate that our proposed method is superior in terms of speed and the attained optimal solutions.
Abstract: 非正交多址接入(NOMA)技术对于实现下一代无线通信中的高数据速率非常重要。 充分利用NOMA技术的有效性的关键挑战是资源分配(RA)的优化,例如信道和功率。 然而,这种RA优化问题属于NP难问题,使用计算复杂度低的算法获得良好的近似解并不容易。 为了解决这个问题,我们提出了基于相干伊辛机(CIM)的优化方法,用于NOMA系统中的信道分配。 CIM是一种伊辛系统,可以通过基于相互连接的光子神经网络的操作优化算法,在高速(毫秒级)下提供公平的近似解。 我们使用CIM的仿真模型评估了所提出方法的性能。 我们将所提出方法的性能与模拟退火、传统NOMA配对方案、基于深度Q学习的方案和穷举搜索方案进行了比较。 仿真结果表明,所提出的方法在速度和获得的最优解方面具有优势。
Comments: 16 pages, 10 figures. This work has been submitted to the IEEE for possible publication
Subjects: Information Theory (cs.IT) ; Quantum Physics (quant-ph)
Cite as: arXiv:2212.01578 [cs.IT]
  (or arXiv:2212.01578v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01578
arXiv-issued DOI via DataCite

Submission history

From: Aohan Li [view email]
[v1] Sat, 3 Dec 2022 09:22:54 UTC (5,934 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号