arXiv subjects

Branka Vucetic

Publications and source records attributed to Branka Vucetic.

At least 73 records · Page 4Linked to original sources

arXiv2022

Deep Reinforcement Learning for Radio Resource Allocation in NOMA-based Remote State Estimation

Remote state estimation, where many sensors send their measurements of distributed dynamic plants to a remote estimator over shared wireless resources, is essential for mission-critical applications of Industry 4.0. Most of the existing works on remote state estimation assumed orthogonal multiple access and the proposed dynamic radio resource allocation algorithms can only work for very small-scale settings. In this work, we consider a remote estimation system with non-orthogonal multiple access. We formulate a novel dynamic resource allocation problem for achieving the minimum overall long-term average estimation mean-square error. Both the estimation quality state and the channel quality state are taken into account for decision making at each time. The problem has a large hybrid discrete and continuous action space for joint channel assignment and power allocation. We propose a novel action-space compression method and develop an advanced deep reinforcement learning algorithm to solve the problem. Numerical results show that our algorithm solves the resource allocation problem effectively, presents much better scalability than the literature, and provides significant performance gain compared to some benchmarks.

cs.IT↗

arXiv2022

DRL-based Resource Allocation in Remote State Estimation

Remote state estimation, where sensors send their measurements of distributed dynamic plants to a remote estimator over shared wireless resources, is essential for mission-critical applications of Industry 4.0. Existing algorithms on dynamic radio resource allocation for remote estimation systems assumed oversimplified wireless communications models and can only work for small-scale settings. In this work, we consider remote estimation systems with practical wireless models over the orthogonal multiple-access and non-orthogonal multiple-access schemes. We derive necessary and sufficient conditions under which remote estimation systems can be stabilized. The conditions are described in terms of the transmission power budget, channel statistics, and plants' parameters. For each multiple-access scheme, we formulate a novel dynamic resource allocation problem as a decision-making problem for achieving the minimum overall long-term average estimation mean-square error. Both the estimation quality and the channel quality states are taken into account for decision making. We systematically investigated the problems under different multiple-access schemes with large discrete, hybrid discrete-and-continuous, and continuous action spaces, respectively. We propose novel action-space compression methods and develop advanced deep reinforcement learning algorithms to solve the problems. Numerical results show that our algorithms solve the resource allocation problems effectively and provide much better scalability than the literature.

eess.SY↗

arXiv2022

Rate-Convergence Tradeoff of Federated Learning over Wireless Channel

In this paper, we consider a federated learning problem over wireless channel that takes into account the coding rate and packet transmission errors. Communication channels are modelled as packet erasure channels (PEC), where the erasure probability is determined by the block length, code rate, and signal-to-noise ratio (SNR). To lessen the effect of packet erasure on the FL performance, we propose two schemes in which the central node (CN) reuses either the past local updates or the previous global parameters in case of packet erasure. We investigate the impact of coding rate on the convergence of federated learning (FL) for both short packet and long packet communications considering erroneous transmissions. Our simulation results shows that even one unit of memory has considerable impact on the performance of FL in erroneous communication.

cs.IT↗

arXiv2022

Performance Analysis of Multiple-Antenna Ambient Backscatter Systems at Finite Blocklengths

This paper analyzes the maximal achievable rate for a given blocklength and error probability over a multiple-antenna ambient backscatter channel with perfect channel state information at the receiver. The result consists of a finite blocklength channel coding achievability bound and a converse bound based on the Neyman-Pearson test and the normal approximation based on the Berry- Esseen Theorem. Numerical evaluation of these bounds shows fast convergence to the channel capacity as the blocklength increases and also proves that the channel dispersion is an accurate measure of the backoff from capacity due to finite blocklength.

cs.IT↗

arXiv2022

Practical Considerations of DER Coordination with Distributed Optimal Power Flow

The coordination of prosumer-owned, behind-the-meter distributed energy resources (DER) can be achieved using a multiperiod, distributed optimal power flow (DOPF), which satisfies network constraints and preserves the privacy of prosumers. To solve the problem in a distributed fashion, it is decomposed and solved using the alternating direction method of multipliers (ADMM), which may require many iterations between prosumers and the central entity (i.e., an aggregator). Furthermore, the computational burden is shared among the agents with different processing capacities. Therefore, computational constraints and communication requirements may make the DOPF infeasible or impractical. In this paper, part of the DOPF (some of the prosumer subproblems) is executed on a Raspberry Pi-based hardware prototype, which emulates a low processing power, edge computing device. Four important aspects are analyzed using test cases of different complexities. The first is the computation cost of executing the subproblems in the edge computing device. The second is the algorithm operation on congested electrical networks, which impacts the convergence speed of DOPF solutions. Third, the precision of the computed solution, including the trade-off between solution quality and the number of iterations, is examined. Fourth, the communication requirements for implementation across different communication networks are investigated. The above metrics are analyzed in four scenarios involving 26-bus and 51-bus networks.

cs.CE↗

arXiv2022

Significant Low-dimensional Spectral-temporal Features for Seizure Detection

Seizure onset detection in electroencephalography (EEG) signals is a challenging task due to the non-stereotyped seizure activities as well as their stochastic and non-stationary characteristics in nature. Joint spectral-temporal features are believed to contain sufficient and powerful feature information for absence seizure detection. However, the resulting high-dimensional features involve redundant information and require heavy computational load. Here, we discover significant low-dimensional spectral-temporal features in terms of mean-standard deviation of wavelet transform coefficient (MS-WTC), based on which a novel absence seizure detection framework is developed. The EEG signals are transformed into the spectral-temporal domain, with their low-dimensional features fed into a convolutional neural network. Superior detection performance is achieved on the widely-used benchmark dataset as well as a clinical dataset from the Chinese 301 Hospital. For the former, seven classification tasks were evaluated with the accuracy from 99.8% to 100.0%, while for the latter, the method achieved a mean accuracy of 94.7%, overwhelming other methods with low-dimensional temporal and spectral features. Experimental results on two seizure datasets demonstrate reliability, efficiency and stability of our proposed MS-WTC method, validating the significance of the extracted low-dimensional spectral-temporal features.

eess.SP↗

arXiv2022

Graph Neural Network Aided Expectation Propagation Detector for MU-MIMO Systems

Multiuser massive multiple-input multiple-output (MU-MIMO) systems can be used to meet high throughput requirements of 5G and beyond networks. In an uplink MUMIMO system, a base station is serving a large number of users, leading to a strong multi-user interference (MUI). Designing a high performance detector in the presence of a strong MUI is a challenging problem. This work proposes a novel detector based on the concepts of expectation propagation (EP) and graph neural network, referred to as the GEPNet detector, addressing the limitation of the independent Gaussian approximation in EP. The simulation results show that the proposed GEPNet detector significantly outperforms the state-of-the-art MU-MIMO detectors in strong MUI scenarios with equal number of transmit and receive antennas.

cs.IT↗

arXiv2021

Density Evolution Analysis of the Iterative Joint Ordered-Statistics Decoding for NOMA

In this paper, we develop a density evolution (DE) framework for analyzing the iterative joint decoding (JD) for non-orthogonal multiple access (NOMA) systems, where the ordered-statistics decoding (OSD) is applied to decode short block codes. We first investigate the density-transform feature of the soft-output OSD (SOSD), by deriving the density of the extrinsic log-likelihood ratio (LLR) with known densities of the priori LLR. Then, we represent the OSD-based JD by bipartite graphs (BGs), and develop the DE framework by characterizing the density-transform features of nodes over the BG. Numerical examples show that the proposed DE framework accurately tracks the evolution of LLRs during the iterative decoding, especially at moderate-to-high SNRs. Based on the DE framework, we further analyze the BER performance of the OSD-based JD, and the convergence points of the two-user and equal-power systems.

cs.IT↗

arXiv2021

NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes

In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding stopping condition, derived from approximations of the a-posterior probabilities of codeword estimates. Simulation results show that LC-SOSD has the similar mutual information transform property to the original SOSD with a significantly reduced complexity. Then, based on the analysis, an efficient JD receiver which combines the parallel interference cancellation (PIC) and the proposed LC-SOSD is developed for NOMA systems. Two novel techniques, namely decoding switch (DS) and decoding combiner (DC), are introduced to accelerate the convergence speed. Simulation results show that the proposed receiver can achieve a lower bit-error rate (BER) compared to the successive interference cancellation (SIC) decoding over the additive-white-Gaussian-noise (AWGN) and fading channel, with a lower complexity in terms of the number of decoding iterations.

cs.IT↗

arXiv2021

Improving Cell-Free Massive MIMO Detection Performance via Expectation Propagation

Cell-free (CF) massive multiple-input multiple-output (M-MIMO) technology plays a prominent role in the beyond fifth-generation (5G) networks. However, designing a high performance CF M-MIMO detector is a challenging task due to the presence of pilot contamination which appears when the number of pilot sequences is smaller than the number of users. This work proposes a CF M-MIMO detector referred to as CF expectation propagation (CF-EP) that incorporates the pilot contamination when calculating the posterior belief. The simulation results show that the proposed detector achieves significant improvements in terms of the bit-error rate and sum spectral efficiency performances as compared to the ones of the state-of-the-art CF detectors.

eess.SP↗

arXiv2021

A Linear Bayesian Learning Receiver Scheme for Massive MIMO Systems

Much stringent reliability and processing latency requirements in ultra-reliable-low-latency-communication (URLLC) traffic make the design of linear massive multiple-input-multiple-output (M-MIMO) receivers becomes very challenging. Recently, Bayesian concept has been used to increase the detection reliability in minimum-mean-square-error (MMSE) linear receivers. However, the latency processing time is a major concern due to the exponential complexity of matrix inversion operations in MMSE schemes. This paper proposes an iterative M-MIMO receiver that is developed by using a Bayesian concept and a parallel interference cancellation (PIC) scheme, referred to as a linear Bayesian learning (LBL) receiver. PIC has a linear complexity as it uses a combination of maximum ratio combining (MRC) and decision statistic combining (DSC) schemes to avoid matrix inversion operations. Simulation results show that the bit-error-rate (BER) and latency processing performances of the proposed receiver outperform the ones of MMSE and best Bayesian-based receivers by minimum $2$ dB and $19$ times for various M-MIMO system configurations.

cs.IT↗

arXiv2021

Bayesian-based Symbol Detector for Orthogonal Time Frequency Space Modulation Systems

Recently, the orthogonal time frequency space (OTFS) modulation is proposed for 6G wireless system to deal with high Doppler spread. The high Doppler spread happens when the transmitted signal is reflected towards the receiver by fast moving objects (e.g. high speed cars), which causes inter-carrier interference (ICI). Recent state-of-the-art OTFS detectors fail to achieve an acceptable bit-error-rate (BER) performance as the number of mobile reflectors increases which in turn, results in high inter-carrier-interference (ICI). In this paper, we propose a novel detector for OTFS systems, referred to as the Bayesian based parallel interference and decision statistics combining (B-PIC-DSC) OTFS detector that can achieve a high BER performance, under high ICI environments. The B-PIC-DSC OTFS detector employs the PIC and DSC schemes to iteratively cancel the interference, and the Bayesian concept to take the probability measure into the consideration when refining the transmitted symbols. Our simulation results show that in contrast to the state-of-the-art OTFS detectors, the proposed detector is able to achieve a BER of less than $10^{-5}$, when SNR is over $14$ dB, under high ICI environments.

eess.SP↗

arXiv2021

A Bayesian Receiver with Improved Complexity-Reliability Trade-off in Massive MIMO Systems

The stringent requirements on reliability and processing delay in the fifth-generation ($5$G) cellular networks introduce considerable challenges in the design of massive multiple-input-multiple-output (M-MIMO) receivers. The two main components of an M-MIMO receiver are a detector and a decoder. To improve the trade-off between reliability and complexity, a Bayesian concept has been considered as a promising approach that enhances classical detectors, e.g. minimum-mean-square-error detector. This work proposes an iterative M-MIMO detector based on a Bayesian framework, a parallel interference cancellation scheme, and a decision statistics combining concept. We then develop a high performance M-MIMO receiver, integrating the proposed detector with a low complexity sequential decoding for polar codes. Simulation results of the proposed detector show a significant performance gain compared to other low complexity detectors. Furthermore, the proposed M-MIMO receiver with sequential decoding ensures one order magnitude lower complexity compared to a receiver with stack successive cancellation decoding for polar codes from the 5G New Radio standard.

cs.IT↗

arXiv2021

Linear-Equation Ordered-Statistics Decoding

In this paper, we propose a new linear-equation ordered-statistics decoding (LE-OSD). Unlike the OSD, LE-OSD uses high reliable parity bits rather than information bits to recover the codeword estimates, which is equivalent to solving a system of linear equations (SLE). Only test error patterns (TEPs) that create feasible SLEs, referred to as the valid TEPs, are used to obtain different codeword estimates. We introduce several constraints on the Hamming weight of TEPs to limit the overall decoding complexity. Furthermore, we analyze the block error rate (BLER) and the computational complexity of the proposed approach. It is shown that LE-OSD has a similar performance as OSD in terms of BLER, which can asymptotically approach Maximum-likelihood (ML) performance with proper parameter selections. Simulation results demonstrate that the LE-OSD has a significantly reduced complexity compared to OSD, especially for low-rate codes, that usually require high decoding order in OSD. Nevertheless, the complexity reduction can also be observed for high-rate codes. In addition, we further improve LE-OSD by applying the decoding stopping condition and the TEP discarding condition. As shown by simulations, the improved LE-OSD has a considerably reduced complexity while maintaining the BLER performance, compared to the latest OSD approach from literature.

cs.IT↗

arXiv2021

Analysis and Design of Analog Fountain Codes for Short Packet Communications

In this paper, we focus on the design and analysis of the Analog Fountain Code (AFC) for short packet communications. We first propose a density evolution (DE) based framework, which tracks the evolution of the probability density function of the messages exchanged between variable and check nodes of AFC in the belief propagation decoder. Using the proposed DE framework, we formulate an optimisation problem to find the optimal AFC code parameters, including the weight-set, which minimises the bit error rate at a given signal-to-noise ratio (SNR). Our results show the superiority of our AFC code design compared to existing designs of AFC in the literature and thus the validity of the proposed DE framework in the asymptotically long block length regime. We then focus on selecting the precoder to improve the performance of AFC at short block lengths. Simulation results show that lower precode rates obtain better realised rates over a wide SNR range for short information block lengths. We also discuss the complexity of the AFC decoder and propose a threshold-based decoder to reduce the complexity.

cs.IT↗

arXiv2021

Analysis and Optimization of HARQ for URLLC

In this paper, we investigate the effectiveness of the hybrid automatic repeat request (HARQ) technique in providing high-reliability and low-latency in the finite blocklength (FBL) regime in a single user uplink scenario. We characterize the packet error rate (PER), throughput, and delay performance of chase combining HARQ (CC-HARQ) and incremental redundancy HARQ (IR-HARQ) in AWGN and Rayleigh fading channel with $m$ retransmissions. Furthermore, we consider a quasi-static fading channel model, which is more accurate than the over-simplified i.i.d. block fading or same channel assumption over consecutive packets. We use finite state Markov model under the FBL regime to model correlative fading. Numerical results present interesting insight into the reliability-latency trade-off of HARQ. Furthermore, we formulate an optimization problem to maximize the throughput performance of IR-HARQ by reducing excessive retransmission overhead for a target packet error performance under different SNRs, Doppler frequencies, and rate regimes.

cs.IT↗

arXiv2021

Remote State Estimation with Smart Sensors over Markov Fading Channels

We consider a fundamental remote state estimation problem of discrete-time linear time-invariant (LTI) systems. A smart sensor forwards its local state estimate to a remote estimator over a time-correlated $M$-state Markov fading channel, where the packet drop probability is time-varying and depends on the current fading channel state. We establish a necessary and sufficient condition for mean-square stability of the remote estimation error covariance as $ρ^2(\mathbf{A})ρ(\mathbf{DM})<1$, where $ρ(\cdot)$ denotes the spectral radius, $\mathbf{A}$ is the state transition matrix of the LTI system, $\mathbf{D}$ is a diagonal matrix containing the packet drop probabilities in different channel states, and $\mathbf{M}$ is the transition probability matrix of the Markov channel states. To derive this result, we propose a novel estimation-cycle based approach, and provide new element-wise bounds of matrix powers. The stability condition is verified by numerical results, and is shown more effective than existing sufficient conditions in the literature. We observe that the stability region in terms of the packet drop probabilities in different channel states can either be convex or concave depending on the transition probability matrix $\mathbf{M}$. Our numerical results suggest that the stability conditions for remote estimation may coincide for setups with a smart sensor and with a conventional one (which sends raw measurements to the remote estimator), though the smart sensor setup achieves a better estimation performance.

eess.SY↗

arXiv2021

Over-the-Air Computation via Broadband Channels

Over-the-air computation (AirComp) has been recognized as a low-latency solution for wireless sensor data fusion, where multiple sensors send their measurement signals to a receiver simultaneously for computation. Most existing work only considered performing AirComp over a single frequency channel. However, for a sensor network with a massive number of nodes, a single frequency channel may not be sufficient to accommodate the large number of sensors, and the AirComp performance will be very limited. So it is highly desirable to have more frequency channels for large-scale AirComp systems to benefit from multi-channel diversity. In this letter, we propose an $M$-frequency AirComp system, where each sensor selects a subset of the $M$ frequencies and broadcasts its signal over these channels under a certain power constraint. We derive the optimal sensors' transmission and receiver's signal processing methods separately, and develop an algorithm for joint design to achieve the best AirComp performance. Numerical results show that increasing one frequency channel can improve the AirComp performance by threefold compared to the single-frequency case.

cs.IT↗