RXs Directions based Codebook Solution for Passive RIS Beamforming
Guardado en:
| Publicado en: | arXiv.org (May 30, 2023), p. n/a |
|---|---|
| Autor principal: | |
| Otros Autores: | , , |
| Publicado: |
Cornell University Library, arXiv.org
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full text outside of ProQuest |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2829564257 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2829564257 | ||
| 045 | 0 | |b d20230530 | |
| 100 | 1 | |a Nor, Ahmed M | |
| 245 | 1 | |a RXs Directions based Codebook Solution for Passive RIS Beamforming | |
| 260 | |b Cornell University Library, arXiv.org |c May 30, 2023 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Recently, reconfigurable intelligent surface (RIS) has immensely been deployed to overcome blockage issue and widen coverage for enabling superior performance 6G networks. Mainly, systems use RIS as an assistant to redirect the transmitter (TX) incident signal towards the receiver (RX) by configuring RIS elements amplitudes and phase shifts in a passive beamforming (PBF) process. Channel estimation (CE) based PBF schemes achieve optimal performance, but they need high overhead and time consumption, especially with high number of RIS elements. Codebook (CB) based PBF solutions can be alternatives to overcome these issues by only searching through a limited reflection patterns (RPs) and determining the optimal one based on a predefined metric. However, they consume high power and time relevant to the used CB size. In this work, we propose a direction based PBF (D-PBF) scheme, where we aim to map between the RXs directions and the codebook RPs and store this information in an updated database (DB). Hence, if the matching between a coming RX and a particular RP exists, the proposed scheme will directly select this RP to configure the RIS elements, otherwise, it memorizes this codeword for future searching. Finally, if the matching failed, searching through the memorized RPs will be done to find the optimal one, then updating the DB accordingly. After a time period, which depends on the CB size, the DB will converge, and the D-PBF scheme will need no searching to select the optimal RP. Hence, the proposed scheme needs extremely lower overhead, power, and time comparable to the CE and conventional CB based solutions, while obtaining acceptable performance in terms of effective rate. | |
| 653 | |a Beamforming | ||
| 653 | |a Matching | ||
| 653 | |a Power consumption | ||
| 653 | |a Acceptable noise levels | ||
| 653 | |a Searching | ||
| 700 | 1 | |a Sefati, S S | |
| 700 | 1 | |a Fratu, Octavian | |
| 700 | 1 | |a Halunga, Simona | |
| 773 | 0 | |t arXiv.org |g (May 30, 2023), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2829564257/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2306.13094 |