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:2306.01458v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2306.01458v1 (cs)
[Submitted on 2 Jun 2023 (this version) , latest version 24 Aug 2023 (v2) ]

Title: Extremely large-scale Array Systems: Near-Filed Codebook Design and Performance Analysis

Title: 超大规模阵列系统:近场码本设计与性能分析

Authors:Feng Zheng
Abstract: Extremely large-scale Array (ELAA) promises to deliver ultra-high data rates with more antenna elements. Meanwhile, the increase of antenna elements leads to a wider realm of near-field, which challenges the traditional design of codebooks. In this paper, we propose novel codebook design schemes which provide better quantized correlation with limited overhead. First, we analyze the correlation between codewords and channel vectors uniform linear array (ULA) and uniform planar array (UPA). The correlation formula for the ULA channel can be expressed as an elliptic function, and the correlation formula for the UPA channel can be represented as an ellipsoid formula. Based on the analysis, we design a uniform sampling codebook to maximize the minimum quantized correlation and a dislocation ULA codebook to reduce the number of quantized bits further. Besides, we give a better sampling interval for the codebook of the UPA channel. Numerical results demonstrate the appealing advantages of the proposed codebook over existing methods in quantization bit number and quantization accuracy.
Abstract: 超大规模阵列(ELAA)有望通过更多的天线元件提供超高速数据速率。 同时,天线元件的增加导致了更广泛的近场区域,这挑战了传统码本的设计。 在本文中,我们提出了新颖的码本设计方案,能够在有限开销下提供更好的量化相关性。 首先,我们分析了码字与均匀线性阵列(ULA)和均匀平面阵列(UPA)信道向量之间的相关性。 ULA信道的相关性公式可以表示为椭圆函数,而UPA信道的相关性公式可以表示为椭球公式。 基于分析,我们设计了一个均匀采样码本以最大化最小量化相关性,并设计了一个错位ULA码本以进一步减少量化比特数。 此外,我们给出了UPA信道码本的更好采样间隔。 数值结果展示了所提出的码本在量化比特数和量化精度方面相对于现有方法的优势。
Subjects: Information Theory (cs.IT) ; Signal Processing (eess.SP); Systems and Control (eess.SY)
Cite as: arXiv:2306.01458 [cs.IT]
  (or arXiv:2306.01458v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2306.01458
arXiv-issued DOI via DataCite

Submission history

From: Feng Zheng [view email]
[v1] Fri, 2 Jun 2023 11:36:02 UTC (3,425 KB)
[v2] Thu, 24 Aug 2023 11:29:48 UTC (3,240 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2023-06
Change to browse by:
cs
cs.SY
eess
eess.SP
eess.SY
math
math.IT

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号