2022
DOI: 10.1109/jiot.2021.3108894
|View full text |Cite
|
Sign up to set email alerts
|

Beamforming Design Based on Two-Stage Stochastic Optimization for RIS-Assisted Over-the-Air Computation Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 55 publications
0
15
0
Order By: Relevance
“…RISs have also been exploited in AirComp systems [27]- [30]. In particular, a joint active and passive beamforming design based on difference-of-convex (DC) programming and matrix lifting has been proposed in [27] for minimizing the computation MSE.…”
Section: A Prior Workmentioning
confidence: 99%
“…RISs have also been exploited in AirComp systems [27]- [30]. In particular, a joint active and passive beamforming design based on difference-of-convex (DC) programming and matrix lifting has been proposed in [27] for minimizing the computation MSE.…”
Section: A Prior Workmentioning
confidence: 99%
“…Intelligent reflecting surface (IRS), a metasurface equipped with massive reflecting elements [4], is a promising technology for enabling URLLC [1]. It is able to reconfigure the wireless environment and turn the random wireless channels into partially deterministic ones by beamforming design [5][6][7]. As a result, the received signal-to-noise ratio (SNR) can be significantly improved.…”
Section: A Related Workmentioning
confidence: 99%
“…As we can see, problem P4 is a quadratic problem with constant modulus constraints. To address such passive beamforming optimization problem for RISs, SDR is generally considered as one of effective methods in the literature [35]- [38]. Besides, there are some other alternating methods, e.g., PDD and Manifold optimization.…”
Section: B Optimization Of the Receive Beamforming Vector Umentioning
confidence: 99%
“…ζ({v k,r }, θ 1,r+1 , θ 2,r , u r ) ≤ ζ({v k,r }, θ 1,r , θ 2,r , u r ), (38) ζ({v k,r }, θ 1,r , θ 2,r+1 , u r ) ≤ ζ({v k,r }, θ 1,r , θ 2,r , u r ). (39) By combining ( 36)-( 39), the objective function value of problem P1 is lower bounded by zero and non-increasing at each iteration.…”
Section: Appendix a Proof Of Theoremmentioning
confidence: 99%
See 1 more Smart Citation