No abstract

We consider a dual-hop full-duplex relaying system, where the energy constrained relay node is powered by radio frequency signals from the source using the time-switching architecture, both the amplify-and-forward and decode-andforward relaying protocols are studied. Specifically, we provide an analytical characterization of the achievable throughput of three different communication modes, namely, instantaneous transmission, delay-constrained transmission, and delay tolerant transmission. In addition, the optimal time split is studied for different transmission modes. Our results reveal that, when the time split is optimized, the full-duplex relaying could substantially boost the system throughput compared to the conventional halfduplex relaying architecture for all three transmission modes. In addition, it is shown that the instantaneous transmission mode attains the highest throughput. However, compared to the delayconstrained transmission mode, the throughput gap is rather small. Unlike the instantaneous time split optimization which requires instantaneous channel state information, the optimal time split in the delay-constrained transmission mode depends only on the statistics of the channel, hence, is suitable for practical implementations.

Reconfigurable Intelligent Surfaces (RISs) have been recently considered as an energy-efficient solution for future wireless networks due to their fast and low-power configuration, which has increased potential in enabling massive connectivity and low-latency communications. Accurate and low-overhead channel estimation in RIS-based systems is one of the most critical challenges due to the usually large number of RIS unit elements and their distinctive hardware constraints. In this paper, we focus on the downlink of a RIS-empowered multi-user Multiple Input Single Output (MISO) downlink communication systems and propose a channel estimation framework based on the PARAllel FACtor (PARAFAC) decomposition to unfold the resulting cascaded channel model. We present two iterative estimation algorithms for the channels between the base station and RIS, as well as the channels between RIS and users. One is based on alternating least squares (ALS), while the other uses vector approximate message passing to iteratively reconstruct two unknown channels from the estimated vectors. To theoretically assess the performance of the ALS-based algorithm, we derived its estimation Cramér-Rao Bound (CRB).We also discuss the achievable sum-rate computation with estimated channels and different precoding schemes for the base station. Our extensive simulation results show that our algorithms outperform Part of this work has been presented in IEEE SAM,

No abstract