End-to-end learning of a communications system using the deep learning-based autoencoder concept has drawn interest in recent research due to its simplicity, flexibility and its potential of adapting to complex channel models and practical system imperfections. In this paper, we have compared the bit error rate (BER) performance of autoencoder based systems and conventional channel coded systems with convolutional coding (CC), in order to understand the potential of deep learning-based systems as alternatives to conventional systems. From the simulations, autoencoder implementation was observed to have a better BER in 0-5 dB E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> range than its equivalent half-rate convolutional coded BPSK with hard decision decoding, and to have only less than 1 dB gap at a BER of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-5</sup> . Furthermore, we have also proposed a novel low complexity autoencoder architecture to implement end-to-end learning of coded systems in which we have shown better BER performance than the baseline implementation. The newly proposed low complexity autoencoder was capable of achieving a better BER performance than half-rate 16-QAM with hard decision decoding over the full 0-10 dB E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> range and a better BER performance than the soft decision decoding in 0-4 dB E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> range.
In this paper, we examine the performance of the decode-and-forward (DF) relaying protocols with finite blocklength (FB). We provide the overall outage probability of three distinct DF relaying protocols, where the channels are assumed to be quasi static Rayleigh fading. More importantly, we derive the closed form expressions of the outage probability in the three relaying scenarios. We illustrate protocols where the cooperative communications outperform the direct transmission (DT). In addition, we compare the operating efficiency of the cooperative schemes in the ultra-reliable (UR) region.
This letter considers the design problem of coordinated downlink minimum power beamforming for a multiuser multi-cell network, where each multi-antenna base station (BS) serves multiple single antenna users. We propose a decentralized primal decomposition based algorithm where limited amount of information is exchanged between coupled BSs at each iteration. Algorithm converges to the globally optimal solution for a static scenario. Unlike most of the previous decentralized methods, a feasible set of beamformers is guaranteed at each iteration even when the exchanged backhaul information is outdated. Consequently, the proposed approach naturally lends itself to realistic time-correlated fading scenarios.
No abstract is provided for this article.
No abstract is provided for this article.
The knowledge of channel state information (CSI) at the transmitter (TX), which in case of time division duplex (TDD) can be easily obtained due to radio channel reciprocity, can dramatically increase the spectral efficiency of a multiple-input multiple-output (MIMO) system. This paper presents a robust link adaptation method for TDD systems employing MIMO-OFDM eigenmode based signalling. We propose a rather simple logarithm-free bit and power loading algorithm which requires low signalling overhead. For unbalanced MIMO systems with larger number of transmit than receive antennas, the achieved spectral efficiency at low and medium SNR is higher than the outage MlMO capacity with unknown CSI at the TX. The simulation results show that for a constant frame error rate, the throughput degradation comparing to the universally accepted Hughes-Hartogs algorithm is negligible.
Adaptive MIMO-OFDM systems employing eigenmode based signalling have a great potential to increase the spectral efficiency when the channel state information (CSI) is accurately known at transmitter (TX) side. However, the perfect CSI is a too strong assumption for a wireless system operating in frequency selective channels. In the presence of CSI errors, the eigenmodes orthogonality is lost and a spatial equalizer is used at each subcarrier to remove the inter-eigenmodes interference. In this paper we propose using a first order matrix inversion approximation (based on truncated Neumann expansion) to find an upper hound for the covariance matrix of the decision variable at equalizer's output. Based on this upper-bound we are able to find a new bit and power loading algorithm which maximizes the throughput subject to maximum transmit power and maximum frame error rate constraints. The effect of CSI errors on the achievable spectral efficiency is studied by computer simulations for different antenna correlation setups. The results clearly show that the proposed method is robust against CSI errors and channel spatial correlation. The achieved spectral efficiency at low and medium SNR is larger that the outage capacity with no CSI at TX side.