arXiv subjects

Eren Balevi

Publications and source records attributed to Eren Balevi.

13 recordsLinked to original sources

arXiv2020

Wideband Channel Estimation with A Generative Adversarial Network

Communication at high carrier frequencies such as millimeter wave (mmWave) and terahertz (THz) requires channel estimation for very large bandwidths at low SNR. Hence, allocating an orthogonal pilot tone for each coherence bandwidth leads to excessive number of pilots. We leverage generative adversarial networks (GANs) to accurately estimate frequency selective channels with few pilots at low SNR. The proposed estimator first learns to produce channel samples from the true but unknown channel distribution via training the generative network, and then uses this trained network as a prior to estimate the current channel by optimizing the network's input vector in light of the current received signal. Our results show that at an SNR of -5 dB, even if a transceiver with one-bit phase shifters is employed, our design achieves the same channel estimation error as an LS estimator with SNR = 20 dB or the LMMSE estimator at 2.5 dB, both with fully digital architectures. Additionally, the GAN-based estimator reduces the required number of pilots by about 70% without significantly increasing the estimation error and required SNR. We also show that the generative network does not appear to require retraining even if the number of clusters and rays change considerably.

eess.SP↗

arXiv2020

High Dimensional Channel Estimation Using Deep Generative Networks

This paper presents a novel compressed sensing (CS) approach to high dimensional wireless channel estimation by optimizing the input to a deep generative network. Channel estimation using generative networks relies on the assumption that the reconstructed channel lies in the range of a generative model. Channel reconstruction using generative priors outperforms conventional CS techniques and requires fewer pilots. It also eliminates the need of a priori knowledge of the sparsifying basis, instead using the structure captured by the deep generative model as a prior. Using this prior, we also perform channel estimation from one-bit quantized pilot measurements, and propose a novel optimization objective function that attempts to maximize the correlation between the received signal and the generator's channel estimate while minimizing the rank of the channel estimate. Our approach significantly outperforms sparse signal recovery methods such as Orthogonal Matching Pursuit (OMP) and Approximate Message Passing (AMP) algorithms such as EM-GM-AMP for narrowband mmWave channel reconstruction, and its execution time is not noticeably affected by the increase in the number of received pilot symbols.

eess.SP↗

arXiv2020

Spatial Indexing for System-Level Evaluation of 5G Heterogeneous Cellular Networks

System level simulations of large 5G networks are essential to evaluate and design algorithms related to network issues such as scheduling, mobility management, interference management, and cell planning. In this paper, we look back to the idea of spatial indexing and its advantages, applications, and future potentials in accelerating large 5G network simulations. We introduce a multi-level inheritance based architecture which is used to index all elements of a heterogeneous network (HetNet) on a single geometry tree. Then, we define spatial queries to accelerate searches in distance, azimuth, and elevation. We demonstrate that spatial indexing can accelerate location-based searches by 3 orders of magnitude. Further, the proposed design is implemented as an open source platform freely available to all.

cs.IT↗

arXiv2020

High Rate Communication over One-Bit Quantized Channels via Deep Learning and LDPC Codes

This paper proposes a method for designing error correction codes by combining a known coding scheme with an autoencoder. Specifically, we integrate an LDPC code with a trained autoencoder to develop an error correction code for intractable nonlinear channels. The LDPC encoder shrinks the input space of the autoencoder, which enables the autoencoder to learn more easily. The proposed error correction code shows promising results for one-bit quantization, a challenging case of a nonlinear channel. Specifically, our design gives a waterfall slope bit error rate even with high order modulation formats such as 16-QAM and 64-QAM despite one-bit quantization. This gain is theoretically grounded by proving that the trained autoencoder provides approximately Gaussian distributed data to the LDPC decoder even though the received signal has non-Gaussian statistics due to the one-bit quantization.

cs.IT↗

arXiv2019

Two-Stage Learning for Uplink Channel Estimation in One-Bit Massive MIMO

We develop a two-stage deep learning pipeline architecture to estimate the uplink massive MIMO channel with one-bit ADCs. This deep learning pipeline is composed of two separate generative deep learning models. The first one is a supervised learning model and designed to compensate for the quantization loss. The second one is an unsupervised learning model and optimized for denoising. Our results show that the proposed deep learning-based channel estimator can significantly outperform other state-of-the-art channel estimators for one-bit quantized massive MIMO systems. In particular, our design provides 5-10 dB gain in channel estimation error. Furthermore, it requires a reasonable amount of pilots, on the order of 20 per coherence time interval.

eess.SP↗

arXiv2019

Autoencoder-Based Error Correction Coding for One-Bit Quantization

This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that minimizes the probability of bit error can be obtained by perfectly training a special autoencoder, in which "perfectly" refers to converging the global minima. However, perfect training is not possible in most cases. To approach the performance of a perfectly trained autoencoder with a suboptimum training, we propose utilizing turbo codes as an implicit regularization, i.e., using a concatenation of a turbo code and an autoencoder. It is empirically shown that this design gives nearly the same performance as to the hypothetically perfectly trained autoencoder, and we also provide a theoretical proof of why that is so. The proposed coding method is as bandwidth efficient as the integrated (outer) turbo code, since the autoencoder exploits the excess bandwidth from pulse shaping and packs signals more intelligently thanks to sparsity in neural networks. Our results show that the proposed coding scheme at finite block lengths outperforms conventional turbo codes even for QPSK modulation. Furthermore, the proposed coding method can make one-bit quantization operational even for 16-QAM.

cs.IT↗

arXiv2019

Massive MIMO Channel Estimation with an Untrained Deep Neural Network

This paper proposes a deep learning-based channel estimation method for multi-cell interference-limited massive MIMO systems, in which base stations equipped with a large number of antennas serve multiple single-antenna users. The proposed estimator employs a specially designed deep neural network (DNN) to first denoise the received signal, followed by a conventional least-squares (LS) estimation. We analytically prove that our LS-type deep channel estimator can approach minimum mean square error (MMSE) estimator performance for high-dimensional signals, while avoiding MMSE's requirement for complex channel inversions and knowledge of the channel covariance matrix. This analytical result, while asymptotic, is observed in simulations to be operational for just 64 antennas and 64 subcarriers per OFDM symbol. The proposed method also does not require any training and utilizes several orders of magnitude fewer parameters than conventional DNNs. The proposed deep channel estimator is also robust to pilot contamination and can even completely eliminate it under certain conditions.

eess.SP↗

arXiv2019

Online Antenna Tuning in Heterogeneous Cellular Networks with Deep Reinforcement Learning

We aim to jointly optimize antenna tilt angle, and vertical and horizontal half-power beamwidths of the macrocells in a heterogeneous cellular network (HetNet). The interactions between the cells, most notably due to their coupled interference render this optimization prohibitively complex. Utilizing a single agent reinforcement learning (RL) algorithm for this optimization becomes quite suboptimum despite its scalability, whereas multi-agent RL algorithms yield better solutions at the expense of scalability. Hence, we propose a compromise algorithm between these two. Specifically, a multi-agent mean field RL algorithm is first utilized in the offline phase so as to transfer information as features for the second (online) phase single agent RL algorithm, which employs a deep neural network to learn users locations. This two-step approach is a practical solution for real deployments, which should automatically adapt to environmental changes in the network. Our results illustrate that the proposed algorithm approaches the performance of the multi-agent RL, which requires millions of trials, with hundreds of online trials, assuming relatively low environmental dynamics, and performs much better than a single agent RL. Furthermore, the proposed algorithm is compact and implementable, and empirically appears to provide a performance guarantee regardless of the amount of environmental dynamics.

cs.LG↗

arXiv2019

One-Bit OFDM Receivers via Deep Learning

This paper develops novel deep learning-based architectures and design methodologies for an orthogonal frequency division multiplexing (OFDM) receiver under the constraint of one-bit complex quantization. Single bit quantization greatly reduces complexity and power consumption, but makes accurate channel estimation and data detection difficult. This is particularly true for multicarrier waveforms, which have high peak-to-average ratio in the time domain and fragile subcarrier orthogonality in the frequency domain. The severe distortion for one-bit quantization typically results in an error floor even at moderately low signal-to-noise-ratio (SNR) such as 5 dB. For channel estimation (using pilots), we design a novel generative supervised deep neural network (DNN) that can be trained with a reasonable number of pilots. After channel estimation, a neural network-based receiver -- specifically, an autoencoder -- jointly learns a precoder and decoder for data symbol detection. Since quantization prevents end-to-end training, we propose a two-step sequential training policy for this model. With synthetic data, our deep learning-based channel estimation can outperform least squares (LS) channel estimation for unquantized (full-resolution) OFDM at average SNRs up to 14 dB. For data detection, our proposed design achieves lower bit error rate (BER) in fading than unquantized OFDM at average SNRs up to 10 dB.

cs.IT↗

arXiv2019

Deep Learning-Based Channel Estimation for High-Dimensional Signals

We propose a novel deep learning-based channel estimation technique for high-dimensional communication signals that does not require any training. Our method is broadly applicable to channel estimation for multicarrier signals with any number of antennas, and has low enough complexity to be used in a mobile station. The proposed deep channel estimator can outperform LS estimation with nearly the same complexity, and approach MMSE estimation performance to within 1 dB without knowing the second order statistics. The only complexity increase with respect to LS estimator lies in fitting the parameters of a deep neural network (DNN) periodically on the order of the channel coherence time. We empirically show that the main benefit of this method accrues from the ability of this specially designed DNN to exploit correlations in the time-frequency grid. The proposed estimator can also reduce the number of pilot tones needed in an OFDM time-frequency grid, e.g. in an LTE scenario by 98% (68%) when the channel coherence time interval is 73ms (4.5ms).

eess.SP↗

arXiv2018

Enabling Aloha-NOMA for Massive M2M Communication in IoT Networks

The Internet of things (IoT), which is the network of physical devices embedded with sensors, actuators, and connec- tivity, is being accelerated into the mainstream by the emergence of 5G wireless networking. This paper presents an uncoordinated non-orthogonal random access protocol, an enhancement to the recently introduced Aloha-NOMA protocol, which provides high throughput, while being matched to the low complexity requirements and the sporadic traffic pattern of IoT devices. Under ideal conditions it has been shown that Aloha-NOMA, using power-domain orthogonality, can significantly increase the throughput using SIC (Successive Interference Cancellation) to enable correct reception of multiple simultaneous transmitted signals. For this ideal performance, the enhanced Aloha-NOMA receiver adaptively learns the number of active devices (which is not known a priori) using a form of multi-hypothesis testing. For small numbers of simultaneous transmissions, it is shown that there can be substantial throughput gain of 6.9 dB relative to pure Aloha for 0.25 probability of transmission and up to 3 active transmitters.

eess.SP↗

arXiv2018

ALOHA-NOMA for Massive Machine-to-Machine IoT Communication

This paper proposes a new medium access control (MAC) protocol for Internet of Things (IoT) applications incorporating pure ALOHA with power domain non-orthogonal multiple access (NOMA) in which the number of transmitters are not known as a priori information and estimated with multi-hypothesis testing. The proposed protocol referred to as ALOHA-NOMA is not only scalable, energy efficient and matched to the low complexity requirements of IoT devices, but it also significantly increases the throughput. Specifically, throughput is increased to 1.27 with ALOHA-NOMA when 5 users can be separated via a SIC (Successive Interference Cancellation) receiver in comparison to the classical result of 0.18 in pure ALOHA. The results further show that there is a greater than linear increase in throughput as the number of active IoT devices increases.

eess.SP↗

arXiv2018

Optimizing the Number of Fog Nodes for Cloud-Fog-Thing Networks

Going from theory to practice in fog networking raises the question of the optimum number of fog nodes that will be upgraded from the existing nodes. This paper finds the optimum number of fog nodes for a given total number of ordinary nodes residing in the area of interest for different channel conditions. Determining the optimum number of fog nodes is quite beneficial, because it can strongly affect the SINR, and thus the average data rate and transmission delay. The numerical results indicate that the average data rate increases nearly an order of magnitude for an optimized number of fog nodes in case of shadowing and fading. It is further shown that the optimum number of fog nodes does not increase in direct proportion to the increase in the total number of nodes. Furthermore, the optimum number of fog nodes decreases when channels have high path loss exponents. These findings suggest that the fog nodes must be selected among those that have the highest computation capability for densely deployed networks and high path loss exponents channels.

cs.NI↗