arXiv subjects

Jamie Evans

Publications and source records attributed to Jamie Evans.

At least 55 records · Page 3Linked to original sources

arXiv2021

Is Phase Shift Keying Optimal for Channels with Phase-Quantized Output?

This paper establishes the capacity of additive white Gaussian noise (AWGN) channels with phase-quantized output. We show that a rotated $2^b$-phase shift keying scheme is the capacity-achieving input distribution for a complex AWGN channel with $b$-bit phase quantization. The result is then used to establish the expression for the channel capacity as a function of average power constraint $P$ and quantization bits $b$. The outage performance of phase-quantized system is also investigated for the case of Rayleigh fading when the channel state information (CSI) is only known at the receiver. Our findings suggest the existence of a threshold in the rate $R$, above which the outage exponent of the outage probability changes abruptly. In fact, this threshold effect in the outage exponent causes $2^b$-PSK to have suboptimal outage performance at high SNR.

cs.IT↗

arXiv2021

Separation of Control and Data Transmissions in 5G Networks may not be Beneficial

The logical separation of control signaling from data transmission in a mobile cellular network has been shown to have significant energy saving potential compared with the legacy systems. As a result, there has been a lot of focus in recent years on development and realization of separation architectures. Our study, however, shows that the energy savings of separation architecture remain under 16-17% when compared with legacy systems and this gain falls to a mere 7% when both architectures are realized under a CloudRAN (CRAN) setting. Moreover, when we strategically place some small base-stations (SBSs) to cover the area in a densely deployed scenario and allow all other base-stations (BSs) to be used only on-demand, the system consumes much less energy than the separation architecture. While we expected that most equipment would be shut down during nights, our study shows that around 70% of the small cells are required to be active to serve randomly distributed minimum data load, i.e., active mobile equipment. Contemporary mobile traffic is predominantly data which does not go to extremely low levels during nights. We discuss, in detail, the assumptions, their implications, and the effects of system parameter values on our conclusions.

cs.NI↗

arXiv2020

Reconfigurable Intelligent Surface assisted Two-Way Communications: Performance Analysis and Optimization

In this paper, we investigate the two-way communication between two users assisted by a re-configurable intelligent surface (RIS). The scheme that two users communicate simultaneously over Rayleigh fading channels is considered. The channels between the two users and RIS can either be reciprocal or non-reciprocal. For reciprocal channels, we determine the optimal phases at the RIS to maximize the signal-to-interference-plus-noise ratio (SINR). We then derive exact closed-form expressions for the outage probability and spectral efficiency for single-element RIS. By capitalizing the insights obtained from the single-element analysis, we introduce a gamma approximation to model the product of Rayleigh random variables which is useful for the evaluation of the performance metrics in multiple-element RIS. Asymptotic analysis shows that the outage decreases at $\left(\log(ρ)/ρ\right)^L$ rate where $L$ is the number of elements, whereas the spectral efficiency increases at $\log(ρ)$ rate at large average SINR $ρ$. For non-reciprocal channels, the minimum user SINR is targeted to be maximized. For single-element RIS, closed-form solution is derived whereas for multiple-element RIS the problem turns out to be non-convex. The latter one is solved through semidefinite programming relaxation and a proposed greedy-iterative method, which can achieve higher performance and lower computational complexity, respectively.

eess.SP↗

arXiv2020

Fractionally-Spaced Equalization and Decision Feedback Sequence Detection for Diffusive MC

In this paper, we consider diffusive molecular communication (MC) systems affected by signal-dependent diffusive noise, inter-symbol interference, and external noise. We design linear and nonlinear fractionally-spaced equalization schemes and a detection scheme which combines decision feedback and sequence detection (DFSD). In contrast to the symbol-rate equalization schemes in the MC literature, the proposed equalization and detection schemes exploit multiple samples of the received signal per symbol interval to achieve lower bit error rates (BERs) than existing schemes. The proposed DFSD scheme achieves a BER which is very close to that achieved by maximum likelihood sequence detection, but with lower computational complexity.

cs.IT↗

arXiv2020

Latency Minimization with Optimum Workload Distribution and Power Control for Fog Computing

This paper investigates a three-layer IoT-fog-cloud computing system to determine the optimum workload and power allocation at each layer. The objective is to minimize maximum per-layer latency (including both data processing and transmission delays) with individual power constraints. The resulting optimum resource allocation problem is a mixed-integer optimization problem with exponential complexity. Hence, the problem is first relaxed under appropriate modeling assumptions, and then an efficient iterative method is proposed to solve the relaxed but still non-convex problem. The proposed algorithm is based on an alternating optimization approach, which yields close-to-optimum results with significantly reduced complexity. Numerical results are provided to illustrate the performance of the proposed algorithm compared to the exhaustive search method. The latency gain of three-layer distributed IoT-fog-cloud computing is quantified with respect to fog-only and cloud-only computing systems.

eess.SP↗

arXiv2019

Resource Allocation in Dynamic DF Relay for SWIPT Network with Circuit Power Consumption

This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop dynamic decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The circuit power consumption (CPC), which includes power requirements for both decoding and encoding circuits, is considered at the relay. For a rate-dependent linear CPC model, we formulate an optimization problem to decide the optimal throughput, PS ratio, relay transmit power and time ratio for the source to relay transmission. Although the resultant optimization problem is non-convex, we derive an efficient optimization algorithm, requiring significantly less floating point operations than an interior point method. Finally, we present numerical results which lead to some interesting insights for system design.

eess.SP↗

arXiv2019

Diffusive Mobile MC with Absorbing Receivers: Stochastic Analysis and Applications

This paper presents a stochastic analysis of the time-variant channel impulse response (CIR) of a three dimensional diffusive mobile molecular communication (MC) system where the transmitter, the absorbing receiver, and the molecules can freely diffuse. In our analysis, we derive the mean, variance, probability density function (PDF), and cumulative distribution function (CDF) of the CIR. We also derive the PDF and CDF of the probability p that a released molecule is absorbed at the receiver during a given time period. The obtained analytical results are employed for the design of drug delivery and MC systems with imperfect channel state information. For the first application, we exploit the mean and variance of the CIR to optimize a controlled-release drug delivery system employing a mobile drug carrier. We evaluate the performance of the proposed release design based on the PDF and CDF of the CIR. We demonstrate significant savings in the amount of released drugs compared to a constant-release scheme and reveal the necessity of accounting for the drug-carrier's mobility to ensure reliable drug delivery. For the second application, we exploit the PDF of the distance between the mobile transceivers and the CDF of p to optimize three design parameters of an MC system employing on-off keying modulation and threshold detection. Specifically, we optimize the detection threshold at the receiver, the release profile at the transmitter, and the time duration of a bit frame. We show that the proposed optimal designs can significantly improve the system performance in terms of the bit error rate and the efficiency of molecule usage.

cs.IT↗

arXiv2019

Phase Modulated Communication with Low-Resolution ADCs

This paper considers a low-resolution wireless communication system in which transmitted signals are corrupted by fading and additive noise. First, a universal lower bound on the average symbol error probability (SEP), correct for all M-ary modulation schemes, is obtained when the number of quantization bits is not enough to resolve M signal points. Second, in the special case of M-ary phase shift keying (M-PSK), the optimum maximum likelihood detector for equiprobable signal points is derived. Third, utilizing the structure of the derived optimum receiver, a general average SEP expression for the M-PSK modulation with n-bit quantization is obtained when the wireless channel is subject to fading with a circularly-symmetric distribution. Finally, an extensive simulation study of the derived analytical results is presented for general Nakagami-m fading channels. It is observed that a transceiver architecture with n-bit quantization is asymptotically optimum in terms of communication reliability if n is greater than or equal to log_2(M +1). That is, the decay exponent for the average SEP is the same and equal to m with infinite-bit and n-bit quantizers for n greater than or equal to log_2(M+1). On the other hand, it is only equal to half and 0 for n = log_2(M) and n < log_2(M), respectively. Hence, for fading environments with a large value of m, using an extra quantization bit improves communication reliability significantly.

eess.SP↗

arXiv2019

Low-Resolution Quantization in Phase Modulated Systems: Optimum Detectors and Error Rate Analysis

This paper considers a wireless communication system with low-resolution quantizers, in which transmitted signals are corrupted by fading and additive noise. For such wireless systems, a universal lower bound on the average symbol error probability (SEP), correct for all M-ary modulation schemes, is obtained when the number of quantization bits is not enough to resolve M signal points. In the special case of M-ary phase shift keying (M-PSK), the optimum maximum likelihood detector for equi-probable signal points is derived. Utilizing the structure of the derived optimum receiver, a general average SEP expression for M-PSK modulation with n-bit quantization is obtained when the wireless channel is subject to fading with a circularly-symmetric distribution. Adopting this result for Nakagami-m fading channels, easy-to-evaluate expressions for the average SEP for M-PSK modulation are further derived. It is shown that a transceiver architecture with n-bit quantization is asymptotically optimum in terms of communication reliability if n is greater than or equal to log_2(M +1). That is, the decay exponent for the average SEP is the same and equal to m with infinite-bit and n-bit quantizers for n is greater than or equal to log_2(M+1). On the other hand, it is only equal to half and 0 for n = log_2(M) and n < log_2(M), respectively. An extensive simulation study is performed to illustrate the derived results and energy efficiency gains obtained by means of low-resolution quantizers.

eess.SP↗

arXiv2019

Location-Based Optimum Relay Selection in Random Spatial Networks

This paper investigates the location-based relay selection problem, where the source node chooses its relay from a set of spatially deployed decode-and-forward relays. The advantages of location-based relay selection are the elimination of excessive relay switching rate and the feedback reduction avoiding the requirement of having full channel state information at the source node. For a homogeneous Poisson point process of candidate relays, we first derive the distribution for the distance of the relay (relative to the source and destination nodes) selected by the optimum location-based relay selection policy. This result is independent of the functional form of the path-loss function as long as it is a non-increasing function of the transmitter-receiver separation. By utilizing the derived optimum relay distance distribution, we then obtain analytical expressions for the average rate and outage probability by considering the power-law decaying path-loss function for the no-fading and Rayleigh fading communication scenarios. It is observed that the optimum relay selection policy outperforms the other common selection strategies notably, including the ones choosing the relay closest to the source, the relay closest to the destination and the relay closest to the mid-point between source and destination.

eess.SP↗

arXiv2019

Average Transmission Success Probability Bound for SWIPT Relay Networks

Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average success probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average success probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.

eess.SP↗

arXiv2019

Opportunistic Wireless Energy Transfer in Point-to-Point Links

In this paper we consider wireless energy transfer for a point-to-point link. The energy transmitter sees a finite number of independent channel realizations, and, armed with (causal) knowledge of the channels, must decide how much energy to transmit in each time slot. The objective is to maximize the expected energy transferred to the receiver at the end of the time period. We show that the optimal energy allocation policy is binary: the transmitter sends no energy or all energy in a slot with this decision based on a simple threshold on the channel. As intuition demands, this threshold for transmission decreases as we move closer to the last available time slot. The performance of the optimal scheme is studied both analytically and numerically.

eess.SP↗

arXiv2018

Diffusive Mobile MC for Controlled-Release Drug Delivery with Absorbing Receiver

Nanoparticle drug carriers play an important role in facilitating efficient targeted drug delivery, i.e., improving treatment success and reducing drug costs and side effects. However, the mobility of nanoparticle drug carriers poses a challenge in designing drug delivery systems. Moreover, healing results critically depend on the rate and time duration of drug absorption. Therefore, in this paper, we aim to design a controlled-release drug delivery system with a mobile drug carrier that minimizes the total amount of released drugs while ensuring a desired rate of drug absorption during a prescribed time period. We model the mobile drug carrier as a mobile transmitter, the targeted diseased cells as an absorbing receiver, and the channel between the transceivers as a time-variant channel since the carrier mobility results in a time-variant absorption rate of the drug molecules. Based on this, we develop a molecular communication (MC) framework to design the controlled-release drug delivery system. In particular, we develop new analytical expressions for the mean, variance, probability density function, and cumulative distribution function of the channel impulse response (CIR). Equipped with the statistical analysis of the CIR, we design and evaluate the performance of the controlled-release drug delivery system. Numerical results show significant savings in the amount of released drugs compared to a constant-release rate design and reveal the necessity of accounting for drug carrier mobility for reliable drug delivery.

physics.med-ph↗

arXiv2017

Performance Analysis of Massive MIMO Networks with Random Unitary Pilot Matrices

A common approach to obtain channel state information for massive MIMO networks is to use the same orthogonal training sequences in each cell. We call this the full-pilot reuse (FPR) scheme. In this paper, we study an alternative approach where each cell uses different sets of orthogonal pilot (DOP) sequences. Considering uplink communications with matched filter (MF) receivers, we first derive the SINR in the large system regime where the number of antennas at the base station, the number of users in each cell, and training duration grow large with fixed ratios. For tractability in the analysis, the orthogonal pilots are drawn from Haar distributed random unitary matrices. The resulting expression is simple and easy to compute. As shown by the numerical simulations, the asymptotic SINR approximates the finite-size systems accurately. Secondly, we derive the user capacity of the DOP scheme under a simple power control and show that it is generally better than that of the FPR scheme.

cs.IT↗

arXiv2016

Dynamic Control of Interference Limited Underlay D2D Network

Device-to-Device (D2D) communication appears as a key communication paradigm to realizing the vision of Internet of Things (IoT) into reality by supporting heterogeneous objects interconnection in a large scale network. These devices may be many types of objects with embedded intelligence and communication capabilities, e.g., smart phones, cars, or home appliances. The issue in in this type of communication is the interference to cellular communication caused by D2D communication. Thus, proper power control and resource allocation should be coordinated in D2D network to prevent excessive interference and drastic decrease in the throughput of the cellular system. In this paper, we consider the problem of cross-layer resource allocation in time-varying cellular wireless networks with D2D communication and incorporate average interference to cellular system as a quality-of-service constraint. Specifically, each D2D pair in the network injects packets to its queue, at rates chosen in order to maximize a global utility function, subject to network stability and interference constraints. The interference constraint enforces an arbitrarily low interference to the cellular system caused by D2D communication. We first obtain the stability region for the multiuser systems assuming that the nodes have full channel state information (CSI) of their neighbors. Then, we provide a joint flow control and scheduling scheme, which is proven to achieve a utility arbitrarily close to the maximum achievable utility. Finally, we address the consequences of practical implementation issue such as distributed scheduling by a designing algorithm, which is capable of taking advantage of diversity gain introduced by fading channels. We demonstrate the efficacy of our policies by numerical studies under various network conditions.

cs.NI↗

arXiv2014

Transmission Rank Selection for Opportunistic Beamforming with Quality of Service Constraints

In this paper, we consider a multi-cell multi-user MISO broadcast channel. The system operates according to the opportunistic beamforming framework in a multi-cell environment with variable number of transmit beams (may alternatively be referred as the transmission rank) at each base station. The maximum number of co-scheduled users in a cell is equal to its transmission rank, thus increasing it will have the effect of increasing the multiplexing gain. However, this will simultaneously increase the amount of interference in the network, which will decrease the rate of communication. This paper focuses on optimally setting the transmission rank at each base station such that a set of Quality of Service (QoS) constraints, that will ensure a guaranteed minimum rate per beam at each base station, is not violated. Expressions representing the achievable region of transmission ranks are obtained considering different network settings. The achievable transmission rank region consists of all achievable transmission rank tuples that satisfy the QoS constraints. Numerical results are also presented to provide further insights on the feasibility problem.

cs.IT↗

arXiv2013

Outage Capacity of Opportunistic Beamforming with Random User Locations

This paper studies the outage capacity of a network consisting of a multitude of heterogenous mobile users, and operating according to the classical opportunistic beamforming framework. The base station is located at the center of the cell, which is modeled as a disk of finite radius. The random user locations are modeled using a homogenous spatial Poisson point process. The received signals are impaired by both fading and location dependent path loss. For this system, we first derive an expression for the beam outage probability. This expression holds for all path loss models that satisfy some mild conditions. Then, we focus on two specific path loss models (i.e., an unbounded model and a more realistic bounded one) to illustrate the applications of our results. In the large system limit where the cell radius tends to infinity, the beam outage capacity and its scaling behavior are derived for the selected specific path loss models. It is shown that the beam outage capacity scales logarithmically for the unbounded model. On the other hand, this scaling behavior becomes double logarithmic for the bounded model. Intuitive explanations are provided as to why we observe different scaling behavior for different path loss models. Numerical evaluations are performed to give further insights, and to illustrate the applicability of the outage capacity results even to a cell having a small finite radius.

cs.IT↗

arXiv2013

Optimal Power Allocation and User Loading for Multiuser MISO Channels with Regularized Channel Inversion

We consider a multiuser system where a single transmitter equipped with multiple antennas (the base station) communicates with multiple users each with a single antenna. Regularized channel inversion is employed as the precoding strategy at the base station. Within this scenario we are interested in the problems of power allocation and user admission control so as to maximize the system throughput, i.e., which users should we communicate with and what power should we use for each of the admitted users so as to get the highest sum rate. This is in general a very difficult problem but we do two things to allow some progress to be made. Firstly we consider the large system regime where the number of antennas at the base station is large along with the number of users. Secondly we cluster the downlink path gains of users into a finite number of groups. By doing this we are able to show that the optimal power allocation under an average transmit power constraint follows the well-known water filling scheme. We also investigate the user admission problem which reduces in the large system regime to optimization of the user loading in the system.

cs.IT↗