Pith. sign in

REVIEW

Cooperative Beam Selection for RIS-Aided Terahertz MIMO Networks via Multi-Task Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.02597 v3 pith:2AL6YKHM submitted 2022-07-06 cs.IT eess.SPmath.IT

Cooperative Beam Selection for RIS-Aided Terahertz MIMO Networks via Multi-Task Learning

classification cs.IT eess.SPmath.IT
keywords selectionbeamnetworkproblemanalogbeamformingcooperativeframework
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Reconfigurable intelligent surface (RIS) have been cast as a promising alternative to alleviate blockage vulnerability and enhance coverage capability for terahertz (THz) communications. Owing to large-scale array elements at transceivers and RIS, the codebook based beamforming can be utilized in a computationally efficient manner. However, the codeword selection for analog beamforming is an intractable combinatorial optimization (CO) problem. To this end, by taking the CO problem as a classification problem, a multi-task learning based analog beam selection (MTL-ABS) framework is developed to implement cooperative beam selection concurrently at transceivers and RIS. In addition, residual network and self-attention mechanism are used to combat the network degradation and mine intrinsic THz channel features. Finally, the network convergence is analyzed from a blockwise perspective, and numerical results demonstrate that the MTL-ABS framework greatly decreases the beam selection overhead and achieves near optimal sum-rate compared with heuristic search based counterparts.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.