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 > eess > arXiv:2510.01789

Help | Advanced Search

Electrical Engineering and Systems Science > Signal Processing

arXiv:2510.01789 (eess)
[Submitted on 2 Oct 2025 ]

Title: Performance Optimization for Movable Antenna Enhanced MISO-OFDM Systems

Title: 可移动天线增强的MISO-OFDM系统的性能优化

Authors:Ruixi Feng, Weidong Mei, Lele Lu, Xin Wei, Zhi Chen, Zhen Gao, Boyu Ning
Abstract: Movable antenna (MA) technology offers a flexible approach to enhancing wireless channel conditions by adjusting antenna positions within a designated region. While most existing works focus on narrowband MA systems, this paper investigates MA position optimization for an MA-enhanced multiple-input single-output (MISO) orthogonal frequency-division multiplexing (OFDM) system. This problem appears to be particularly challenging due to the frequency-flat nature of MA positioning, which should accommodate the channel conditions across different subcarriers. To overcome this challenge, we discretize the movement region into a multitude of sampling points, thereby converting the continuous position optimization problem into a discrete point selection problem. Although this problem is combinatorial, we develop an efficient partial enumeration algorithm to find the optimal solution using a branch-and-bound framework, where a graph-theoretic method is incorporated to effectively prune suboptimal solutions. In the low signal-to-noise ratio (SNR) regime, a simplified graph-based algorithm is also proposed to obtain the optimal MA positions without the need for enumeration. Simulation results reveal that the proposed algorithm outperforms conventional fixed-position antennas (FPAs), while narrowband-based antenna position optimization can achieve near-optimal performance.
Abstract: 可移动天线(MA)技术通过在指定区域内调整天线位置,提供了一种灵活的方法来改善无线信道条件。 尽管大多数现有工作集中在窄带MA系统上,本文研究了MA增强的多输入单输出(MISO)正交频分复用(OFDM)系统中的MA位置优化。 由于MA定位的频率平坦特性,需要适应不同子载波的信道条件,因此这个问题显得尤其具有挑战性。 为克服这一挑战,我们将运动区域离散化为大量采样点,从而将连续的位置优化问题转化为离散点选择问题。 虽然这个问题是组合性的,但我们开发了一种高效的局部枚举算法,利用分支定界框架找到最优解,其中结合了图论方法以有效剪枝次优解。 在低信噪比(SNR)范围内,还提出了一种简化的基于图的算法,无需枚举即可获得最优的MA位置。 仿真结果表明,所提出的算法优于传统的固定位置天线(FPAs),而基于窄带的天线位置优化可以实现接近最优的性能。
Comments: Accepted to IEEE GLOBECOM 2025 Workshop
Subjects: Signal Processing (eess.SP)
Cite as: arXiv:2510.01789 [eess.SP]
  (or arXiv:2510.01789v1 [eess.SP] for this version)
  https://doi.org/10.48550/arXiv.2510.01789
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Ruixi Feng [view email]
[v1] Thu, 2 Oct 2025 08:27:38 UTC (175 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
eess.SP
< prev   |   next >
new | recent | 2025-10
Change to browse by:
eess

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号