In this paper, we develop a comprehensive theoretical framework for analyzing the performance of reconfigurable intelligent surfaces (RISs)-assisted communication systems over generalized fading channels and in the presence of phase noise. To this end, we propose the Fox's H model as a unified fading distribution for a large number of widely used generalized fading channels. In particular, we derive

We consider the problem of degradation in performance of multi-carrier multi-user massive MIMO systems when channel induced Doppler spread is high. Recently, Orthogonal Time Frequency Space (OTFS) modulation has been shown to be robust to channel induced Doppler spread. In OTFS based systems, information symbols are embedded in the delay-Doppler (DD) domain where they are jointly modulated to generate

Communication efficient distributed mean estimation is an important primitive that arises in many distributed learning and optimization scenarios such as federated learning. Without any probabilistic assumptions on the underlying data, we study the problem of distributed mean estimation where the server has access to side information. We propose \emph{Wyner-Ziv estimators}, which are communication

With entanglement-assisted (EA) formalism, arbitrary classical linear codes are allowed to transform into EAQECCs by using pre-shared entanglement between the sender and the receiver. In this paper, based on classical cyclic MDS codes by exploiting pre-shared maximally entangled states, we construct two families of $q$-ary entanglement-assisted quantum MDS codes $[[\frac{q^{2}+1}{a},\frac{q^{2}+1}{a}-2(d-1)+c

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.

In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal rings (PIRs). We determine the algebraic structures of all NIE-constacyclic codes over finite chain rings, give the unique form of the sets of the defining polynomials

A distributed algorithm for least mean square (LMS) can be used in distributed signal estimation and in distributed training for multivariate regression models. The convergence speed of an algorithm is a critical factor because a faster algorithm requires less communications overhead and it results in a narrower network bandwidth. The goal of this paper is to present that use of Chebyshev periodical

Millimeter-wave (mmWave) communication is a promising solution for achieving high data rate and low latency in 5G wireless cellular networks. Since directional beamforming and antenna arrays are exploited in the mmWave networks, accurate angle-of-arrival (AOA) information can be obtained and utilized for localization purposes. The performance of a localization system is typically assessed by the Cramer-Rao

In cryptography, we hope a sequence over $\mathbb{Z}_m$ with period $N$ having larger $m$-adic complexity. Compared with the binary case, the computation of 4-adic complexity of knowing quaternary sequences has not been well developed. In this paper, we determine the 4-adic complexity of the quaternary cyclotomic sequences with period 2$p$ defined in [6]. The main method we utilized is a quadratic

In this paper, we study an application of deep learning to uplink multiuser detection (MUD) for non-orthogonal multiple access (NOMA) scheme based on Welch bound equality spread multiple access (WSMA). Several non-cooperating users, each with its own preassigned NOMA signature sequence (SS), transmit over the same resource. These SSs have low correlation among them and aid in the user separation at

In this paper, for efficient data collection with limited bandwidth, data-aided sensing is applied to Gaussian process regression that is used to learn data sets collected from sensors in Internet-of-Things systems. We focus on the interpolation of sensors' measurements from a small number of measurements uploaded by a fraction of sensors using Gaussian process regression with data-aided sensing. Thanks

Non-orthogonal multiple access (NOMA) is being widely considered as a potential candidate to enhance the spectrum utilization in beyond fifth-generation (B5G) communications. In this paper, we derive closed-form expressions for the ergodic rate and outage probability of a multiple-antenna-assisted NOMA-based cooperative relaying system (CRS-NOMA). We present the performance analysis of the system for

We demonstrate a high capacity IF-over-fiber mobile fronthaul solution for multi-user massive MIMO 5G RAN. Using this scheme, a record aggregated radio bandwidth of 25.6 GHz was transmitted on a single optical wavelength over 40 km without fiber chromatic dispersion compensation

In this paper we revisit one of the classical statistical problems, the so-called sparse maximum-likelihood (ML) linear regression. As a way of attacking this type of regression, we present a novel CLuP mechanism that to a degree relies on the \bl{\textbf{Random Duality Theory (RDT)}} based algorithmic machinery that we recently introduced in \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19

In \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} we introduced CLuP, a \bl{\textbf{Random Duality Theory (RDT)}} based algorithmic mechanism that can be used for solving hard optimization problems. Due to their introductory nature, \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} discuss the most fundamental CLuP concepts. On the other hand, in our companion paper \cite{Stojniccluplargesc20}

Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algorithmic mechanism (called \bl{\textbf{CLuP}}) that can be utilized to solve \textbf{\emph{exactly}} NP hard optimization problems in polynomial time. Here we move things further and utilize another of remarkable RDT features

The capacity of a discrete-time model of optical fiber described by the split-step Fourier method (SSFM) as a function of the average input power $\mathcal P$ and the number of segments in distance $K$ is considered. It is shown that if $K\geq \mathcal{P}^{2/3}$ and $\mathcal P\rightarrow \infty$, the capacity of the resulting continuous-space lossless model is lower bounded by $\frac{1}{2}\log_2(1+\text{SNR})

Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years. Let $p$ be any prime. Recently, preimages of the $p-$linearized polynomials $\sum_{i=0}^{\frac kl-1} X^{p^{li}}$ and $\sum_{i=0}^{\frac kl-1} (-1)^i X^{p^{li}}$ were

This paper focuses on the structural properties of test channels, of Wyner's operational information rate distortion function (RDF), $\overline{R}(\Delta_X)$, of a tuple of multivariate correlated, jointly independent and identically distributed Gaussian random variables (RVs), $\{X_t, Y_t\}_{t=1}^\infty$, $X_t: \Omega \rightarrow {\mathbb R}^{n_x}$, $Y_t: \Omega \rightarrow {\mathbb R}^{n_y}$, with

The unsourced MAC model was originally introduced to study the communication scenario in which a number of devices with low-complexity and low-energy wish to upload their respective messages to a base station. In the original problem formulation, all devices communicate using the same information rate. This may be very inefficient in certain wireless situations with varied channel conditions, power

Recovery a planted signal perturbed by noise is a fundamental problem in machine learning. In this work, we consider the problem of recovery a planted $k$-densest sub-hypergraph on $h$-uniform hypergraphs over $n$ nodes. This fundamental problem appears in different contexts, e.g., community detection, average case complexity, and neuroscience applications. We first observe that it can be viewed as

Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the "channel" or relationship between signal transmitted and received. In this work, we focus on a certain channel model known as the delay-doppler channel. This model begins to be useful in the high frequency carrier setting, which is increasingly common with developments in millimeter-wave technology. Moreover

This paper proposes a deep learning approach to channel sensing and downlink hybrid analog and digital beamforming for massive multiple-input multiple-output systems with a limited number of radio-frequency chains operating in the time-division duplex mode at millimeter frequency. The conventional downlink precoding design hinges on the two-step process of first estimating the high-dimensional channel

This letter considers a wireless network where an access point (AP) broadcasts timely updates to several mobile users. The timeliness of information owned by a user is characterized by the recently proposed age of information. While frequently broadcasting the timely updates and always using the maximum power can minimize the age of information for all users, that wastes valuable communication resources

Intelligent reflecting surfaces (IRSs) are an emerging technology for future wireless communication. The vast majority of recent research on IRS has focused on system level optimizations. However, developing straightforward and tractable electromagnetic (EM) models that are suitable for IRS aided communication modeling remains an open issue. In this paper, we address this issue and derive communication

Eigenvectors of matrices on a network have been used for understanding spectral clustering and influence of a vertex. For matrices with small geodesic-width, we propose a distributed iterative algorithm in this letter to find eigenvectors associated with their given eigenvalues. We also consider the implementation of the proposed algorithm at the vertex/agent level in a spatially distributed network

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$. Cutting blocking sets give rise to saturating sets and minimal linear codes and those having size as small as possible are of particular interest. We observe that

Reconfigurable intelligent surface (RIS) empowered communications with non-orthogonal multiple access (NOMA) has recently become as an appealing research direction for the next-generation wireless communications. In this paper, we propose a novel NOMA solution with RIS partitioning, where we aim to enhance the spectrum efficiency by improving the ergodic rate of all users, and to maximize the user

A Coupled Variational Autoencoder, which incorporates both a generalized loss function and latent layer distribution, shows improvement in the accuracy and robustness of generated replicas of MNIST numerals. The latent layer uses a Student's t-distribution to incorporate heavy-tail decay. The loss function uses a coupled logarithm, which increases the penalty on images with outlier likelihood. The

It is common to assess the "memory strength" of a stationary process looking at how fast the normalized log-determinant of its covariance submatrices (i.e., entropy rate) decreases. In this work, we propose an alternative characterization in terms of the normalized trace-inverse of the covariance submatrices. We show that this sequence is monotonically non-decreasing and is constant if and only if

We study a fundamental problem in Bayesian learning, where the goal is to select a set of data sources with minimum cost while achieving a certain learning performance based on the data streams provided by the selected data sources. First, we show that the data source selection problem for Bayesian learning is NP-hard. We then show that the data source selection problem can be transformed into an instance

Using commodity WiFi data for applications such as indoor localization, object identification and tracking and channel sounding has recently gained considerable attention. We study the problem of channel impulse response (CIR) estimation from commodity WiFi channel state information (CSI). The accuracy of a CIR estimation method in this setup is limited by both the available channel bandwidth as well

In this letter, we propose a progressive rate-filling method as a framework to study agile construction of multilevel polar-coded modulation. We show that the bit indices within each component polar code can follow a fixed, precomputed ranking sequence, e.g., the Polar sequence in the 5G standard, while their allocated rates (i.e., the number of information bits of each component polar code) can be

To exploit massive amounts of data generated at mobile edge networks, federated learning (FL) has been proposed as an attractive substitute for centralized machine learning (ML). By collaboratively training a shared learning model at edge devices, FL avoids direct data transmission and thus overcomes high communication latency and privacy issues as compared to centralized ML. To improve the communication

We consider a point-to-point communication system, where in addition to the encoder and the decoder, there is a helper that observes non-causally the realization of the noise vector and provides a (lossy) rate-$R_{\mbox{\tiny h}}$ description of it to the encoder ($R_{\mbox{\tiny h}} < \infty$). While Lapidoth and Marti (2020) derived coding theorems, associated with achievable channel-coding rates

This paper investigates an average secrecy rate (ASR) maximization problem for an unmanned aerial vehicle (UAV) enabled wireless communication system, wherein a UAV is employed to deliver confidential information to a ground destination in the presence of a terrestrial passive eavesdropper. By employing an artificial noise (AN) injection based secure two-phase transmission protocol, we aim at jointly

This paper investigates the issue of cooperative activity detection for grant-free random access in the sixth-generation (6G) cell-free wireless networks with sourced and unsourced paradigms. First, we propose a cooperative framework for solving the problem of device activity detection in sourced random access. In particular, multiple access points (APs) cooperatively detect the device activity via

Due to structural and functional abnormalities or genetic variations and mutations, there may be dysfunctional molecules within an intracellular signaling network that do not allow the network to correctly regulate its output molecules, such as transcription factors. This disruption in signaling interrupts normal cellular functions and may eventually develop some pathological conditions. In this paper

This work discusses the optimal placement of a reconfigurable intelligent surface (RIS) in a millimeter wave (mmWave) point-to-point link. In particular, we present a novel system model that takes into account the relationship between the transmission beam footprint size at the RIS plane and the RIS size. Moreover, we present the theoretical framework that quantifies the RIS gain loss in the case that

This paper proposes a hardware implementation architecture for Fano decoding of polarization-adjusted convolutional (PAC) codes. This architecture maintains a trade-off between the error-correction performance and throughput of the decoder by setting a strict limit on its search complexity. The paper presents analyses of the complexity, combinational delay, and latency of the proposed architecture

We derive various error exponents in the bee identification problem under two different decoding rules. Under na\"ive decoding, which decodes each bee independently of the others, we analyze a general discrete memoryless channel and a relatively wide family of stochastic decoders. Upper and lower bounds to the random coding error exponent are derived and proved to be equal at relatively high coding

The emergence of reconfigurable intelligent surfaces (RISs) enables us to establish programmable radio wave propagation that caters for wireless communications, via employing low-cost passive reflecting units. This work studies the non-trivial tradeoff between energy efficiency (EE) and spectral efficiency (SE) in multiuser multiple-input multiple-output (MIMO) uplink communications aided by a RIS

One of the most common, but at the same time expensive operations in linear algebra, is multiplying two matrices $A$ and $B$. With the rapid development of machine learning and increases in data volume, performing fast matrix intensive multiplications has become a major hurdle. Two different approaches to overcoming this issue are, 1) to approximate the product; and 2) to perform the multiplication

Reconfigurable intelligent surface-empowered communication (RIS) and sparse code multiple access (SCMA) are promising candidates for future generations of wireless networks. The former enhances the transmission environments, whereas the latter provides a high spectral efficiency transmission. This letter proposes, for the first time, an RIS-assisted uplink SCMA (SCMA-RIS) scheme to improve the conventional

La Fuenfr\'ia Hospital (LFH) operative parameters such as: hospitalised patients; daily admissions and discharges were studies for the hospital as a whole, and per each Hospital's service unit (just called "service" here). Data were used to build operative parameter value series and their variation. Conventional statistical analyses and fractal dimension analyses were performed on the series. Statistical

Let $\varepsilon>0$. An $n$-tuple $(p_i)_{i=1}^n$ of probability vectors is called (classical) $\varepsilon$-differentially private ($\varepsilon$-DP) if $e^\varepsilon p_j-p_i$ has no negative entries for all $i,j=1,\ldots,n$. An $n$-tuple $(\rho_i)_{i=1}^n$ of density matrices is called classical-quantum $\varepsilon$-differentially private (CQ $\varepsilon$-DP) if $e^\varepsilon\rho_j-\rho_i$ is

Energy consumption of computing has found increasing prominence but the area still suffers from the lack of a consolidated formal theory. In this paper, a theory for the energy consumption of computing is structured as an axiomatic system. The work is pure theoretical, involving theorem proving and mathematical reasoning. It is also interdisciplinary, so that while it targets computing, it involves

Continuous changes in the technology and the business landscape place high strain on managing knowledge in organisations. Prior researchers highlight a positive connotation with knowledge management competence and organisational innovativeness in a turbulent environment. However, the rapid changes in the market and technology landscape may exert an additional pressure on the employees and such pressures

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiver 1 can send classical messages to Receiver 2. Another cooperation setting involves quantum conferencing, where Receiver 1 can teleport a quantum state to Receiver 2. When Receiver 1 is not required to recover information

In this paper, we investigate the performance of a mixed radio-frequency-underwater wireless optical communication (RF-UWOC) system where an unmanned aerial vehicle (UAV), as a low-altitude mobile aerial base station, transmits information to an autonomous underwater vehicle (AUV) through a fixed-gain amplify-and-forward (AF) or decode-and-forward (DF) relay. Our analysis accounts for the main factors

In this paper, we investigate the performance of a reconfigurable intelligent surface (RIS)-assisted dual-hop mixed radio-frequency underwater wireless optical communication (RF-UWOC) system. An RIS is an emerging and low-cost technology that aims to enhance the strength of the received signal, thus improving the system performance. In the considered system setup, a ground source does not have a reliable

In this paper, we study a dual-hop mixed power line communication and radio-frequency communication (PLC/RF) system, where the connection between the PLC link and the RF link is made by a decode-and-forward (DF) or amplify-and-forward (AF) relay. Assume that the PLC channel is affected by both additive background noise and impulsive noise suffers from Log-normal fading, while the RF link undergoes

In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate of relay systems that does not require the channel state information (CSI) of the eavesdroppers. We also devise relaying and jamming function selection (RJFS) algorithms

In this work, in order to achieve higher spectrum efficiency, we propose a reconfigurable intelligent surface (RIS)-assisted multi-user communication uplink system. Different from previous work in which the RIS only optimizes the phase of the incident users's signal, we propose the use of the RIS to create a virtual constellation diagram to transmit the data of an additional user signal. We focus on

We study the problem of semi-blind channel estimation and symbol detection in the uplink of multi-cell massive MIMO systems with spatially correlated time-varying channels. An algorithm based on expectation propagation (EP) is developed to iteratively approximate the joint a posteriori distribution of the unknown channel matrix and the transmitted data symbols with a distribution from an exponential

This paper addresses the issue of detecting hierarchical changes in latent variable models (HCDL) from data streams. There are three different levels of changes for latent variable models: 1) the first level is the change in data distribution for fixed latent variables, 2) the second one is that in the distribution over latent variables, and 3) the third one is that in the number of latent variables

Wireless communications is nowadays an important aspect of robotics. There are many applications in which a robot must move to a certain goal point while transmitting information through a wireless channel which depends on the particular trajectory chosen by the robot to reach the goal point. In this context, we develop a method to generate optimum trajectories which allow the robot to reach the goal

This paper considers downlink of reconfigurable intelligent surface (RIS) assisted cooperative non-orthogonal multiple access (CNOMA) systems. Our objective is to minimize the total transmit power by jointly optimizing the active beamforming vectors, transmit-relaying power, and RIS phase shifts. The formulated problem is a mixed-integer nonlinear programming (MINLP) problem. To tackle this problem

In this paper, we propose a novel joint hybrid precoder and combiner design for maximizing the average achievable sum-rate of single-user orthogonal frequency division multiplexing millimeter wave massive MIMO systems. We formulate the analog precoder and combiner design as a constrained Tucker2 decomposition and solve it by using the projected alternate least square method. Such a formulation allows

In this brief note we compute the Fisher information of a family of generalized normal distributions. Fisher information is usually defined for regular distributions, i.e. continuously differentiable (log) density functions whose support does not depend on the family parameter $\theta$. Although the uniform distribution in $[-\theta, + \theta]$ does not satisfy the regularity requirements, as a special