Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAchievable Rates of Buffer-Aided Full-Duplex Gaussian Relay Channels
85
0
0.0
(
0
)
Added by
Ahmed El Shafie
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We derive closed-form expressions for the achievable rates of a buffer-aided full-duplex (FD) multiple-input multiple-output (MIMO) Gaussian relay channel. The FD relay still suffers from residual self-interference (RSI) after the application of self-interference mitigation techniques. We investigate both cases of a slow-RSI channel where the RSI is fixed over the entire codeword, and a fast-RSI channel where the RSI changes from one symbol duration to another within the codeword. We show that the RSI can be completely eliminated in the slow-RSI case when the FD relay is equipped with a buffer while the fast RSI cannot be eliminated. For the fixed-rate data transmission scenario, we derive the optimal transmission strategy that should be adopted by the source node and relay node to maximize the system throughput. We verify our analytical findings through simulations.
rate research
Read More
The recent progress in the area of self-interference cancellation (SIC) design has enabled the development of full-duplex (FD) single and multiple antenna systems. In this paper, we propose a design for FD eNodeB (eNB) and user equipment (UE) for 5G networks. The use of FD operation enables simultaneous in-band uplink and downlink operation and thereby cutting down the spectrum requirement by half. FD operation requires the same subcarrier allocation to UE in both uplink and downlink. Long Term Evolution LTE) uses orthogonal frequency division multiple access (OFDMA) for downlink. To enable FD operation, we propose using single carrier frequency division multiple access SC-FDMA) for downlink along with the conventional method of using it for uplink. Taking advantage of channel reciprocity, singular value decomposition (SVD) based eamforming in the downlink allows multiple users (MU) to operate on same set of subcarriers. In uplink, frequency domain minimum mean square error (MMSE) equalizer along with successive interference cancellation with optimal ordering (SSIC-OO) algorithm is used to decouple signals of users operating in the same set of subcarriers. The work includes simulations showing efficient FD operation both at UE and eNB for downlink and uplink respectively.
We assume that a buffer-aided transmitter communicates with a receiving node in the presence of an attacker. We investigate the impact of a radio-frequency energy-harvesting attacker that probabilistically operates as a jammer or an eavesdropper. We show that even without the need for an external energy source, the attacker can still degrade the security of the legitimate system. We show that the random data arrival behavior at the transmitter and the channel randomness of the legitimate link can improve the systems security. Moreover, we design a jamming scheme for the attacker and investigate its impact on the secure throughput of the legitimate system. The attacker designs his power splitting parameter and jamming/eavesdropping probability based on the energy state of the attackers battery to minimize the secure throughput of the legitimate system.
Regular perturbation is applied to space-division multiplexing (SDM) on optical fibers and motivates a correlated rotation-and-additive noise (CRAN) model. For S spatial modes, or 2S complex-alphabet channels, the model has 4S(S+1) hidden independent real Gauss-Markov processes, of which 2S model phase noise, 2S(2S-1) model spatial mode rotation, and 4S model additive noise. Achievable information rates of multi-carrier communication are computed by using particle filters. For S=2 spatial modes with strong coupling and a 1000 km link, joint processing of the spatial modes gains 0.5 bits/s/Hz/channel in rate and 1.4 dB in power with respect to separate processing of 2S complex-alphabet channels without considering CRAN.
To accommodate the explosive growth of the Internet-of-Things (IoT), incorporating interference alignment (IA) into existing multiple access (MA) schemes is under investigation. However, when it is applied in MIMO networks to improve the system compacity, the incoming problem regarding information delay arises which does not meet the requirement of low-latency. Therefore, in this paper, we first propose a new metric, degree of delay (DoD), to quantify the issue of information delay, and characterize DoD for three typical transmission schemes, i.e., TDMA, beamforming based TDMA (BD-TDMA), and retrospective interference alignment (RIA). By analyzing DoD in these schemes, its value mainly depends on three factors, i.e., delay sensitive factor, size of data set, and queueing delay slot. The first two reflect the relationship between quality of service (QoS) and information delay sensitivity, and normalize time cost for each symbol, respectively. These two factors are independent of the transmission schemes, and thus we aim to reduce the queueing delay slot to improve DoD. Herein, three novel joint IA schemes are proposed for MIMO downlink networks with different number of users. That is, hybrid antenna array based partial interference elimination and retrospective interference regeneration scheme (HAA-PIE-RIR), HAA based improved PIE and RIR scheme (HAA-IPIE-RIR), and HAA based cyclic interference elimination and RIR scheme (HAA-CIE-RIR). Based on the first scheme, the second scheme extends the application scenarios from $2$-user to $K$-user while causing heavy computational burden. The third scheme relieves such computational burden, though it has certain degree of freedom (DoF) loss due to insufficient utilization of space resources.
We study the beamforming optimization for an intelligent reflecting surface (IRS)-aided full-duplex (FD) communication system in this letter. Specifically, we maximize the sum rate of bi-directional transmissions by jointly optimizing the transmit beamforming and the beamforming of the IRS reflection. A fast converging alternating algorithm is developed to tackle this problem. In each iteration of the proposed algorithm, the solutions to the transmit beamforming and the IRS reflect beamforming are obtained in a semi-closed form and a closed form, respectively. Compared to an existing method based on the Arimoto-Blahut algorithm, the proposed method achieves almost the same performance while enjoying much faster convergence and lower computational complexity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
