arXiv subjects

Abolfazl Seyed Motahari

Publications and source records attributed to Abolfazl Seyed Motahari.

7 recordsLinked to original sources

arXiv2019

Cache-Aided Combination Networks with Interference

Centralized coded caching and delivery is studied for a radio access combination network (RACN), whereby a set of $H$ edge nodes (ENs), connected to a cloud server via orthogonal fronthaul links with limited capacity, serve a total of $K$ user equipments (UEs) over wireless links. Each user, equipped with a cache of size $μ_R N F$ bits, is connected to a distinct set of $r$ ENs each of which equipped with a cache of size $μ_T N F$ bits, where $μ_T$, $μ_R \in [0,1]$ are the fractional cache capacities of the UEs and the ENs, respectively. The objective is to minimize the normalized delivery time (NDT. Three coded caching and transmission schemes are considered, namely the\textit{ MDS-IA}, \textit{soft-transfer} and \textit{ zero-forcing (ZF)} schemes. The achievable NDT for MDS-IA scheme is presented for $r=2$ and arbitrary fractional cache sizes $μ_T$ and $μ_R$, and also for arbitrary value of $r$ and fractional cache size $μ_T$ when the cache capacity of the UE is above a certain threshold. The achievable NDT for the soft-transfer scheme is presented for arbitrary $r$ and arbitrary fractional cache sizes $μ_T$ and $μ_R$. The last scheme utilizes ZF between the ENs and the UEs without the participation of the cloud server in the delivery phase. The achievable NDT for this scheme is presented for an arbitrary value of $r$ when the total cache size at a pair of UE and EN is sufficient to store the whole library, i.e., $μ_T+μ_R \geq 1$. The results indicate that the fronthaul capacity determines which scheme achieves a better performance in terms of the NDT, and the soft-transfer scheme becomes favorable as the fronthaul capacity increases.

cs.IT↗

arXiv2018

Cache-Aided Fog Radio Access Networks with Partial Connectivity

Centralized coded caching and delivery is studied for a partially-connected fog radio access network (F-RAN), whereby a set of H edge nodes (ENs) (without caches), connected to a cloud server via orthogonal fronthaul links, serve K users over the wireless edge. The cloud server is assumed to hold a library of N files, each of size F bits; and each user, equipped with a cache of size MF bits, is connected to a distinct set of r ENs; or equivalently, the wireless edge from the ENs to the users is modeled as a partial interference channel. The objective is to minimize the normalized delivery time (NDT), which refers to the worst case delivery latency, when each user requests a single file from the library. An achievable coded caching and transmission scheme is proposed, which utilizes maximum distance separable (MDS) codes in the placement phase, and real interference alignment (IA) in the delivery phase, and its achievable NDT is presented for r = 2 and arbitrary cache size M, and also for arbitrary values of r when the cache capacity is sufficiently large.

cs.IT↗

arXiv2014

Layered Interference Alignment: Achieving the Total DoF of MIMO X Channels

The $K\times 2$ and $2\times K$, Multiple-Input Multiple-Output (MIMO) X channel with constant channel coefficients available at all transmitters and receivers is considered. A new alignment scheme, named \emph{layered interference alignment}, is proposed in which both vector and real interference alignment are exploited, in conjunction with joint processing at receiver sides. Data streams with fractional multiplexing gains are sent in the desired directions to align the interfering signals at receivers. To decode the intended messages at receivers, a joint processing/simultaneous decoding technique, which exploits the availability of several receive antennas, is proposed. This analysis is subsequently backed up by metrical results for systems of linear forms. In particular, for such linear forms, Khintchine--Groshev type theorems are proved over real and complex numbers. It is observed that $K\times 2$ and $2\times K$, X channels with $M$ antennas at all transmitters/receivers enjoy duality in Degrees of Freedom (DoF). It is shown that incorporating the layered interference alignment is essential to characterize the total DoF of $\frac{2KM}{K+1}$ in the $K\times 2$ and $2\times K$, $M$ antenna X channels.

cs.IT↗

arXiv2011

Interference Alignment for the $K$ User MIMO Interference Channel

We consider the $K$-user Multiple Input Multiple Output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver. It is assumed that channel coefficients are constant and are available at all transmitters and at all receivers. The main objective of this paper is to characterize the Degrees of Freedom (DoF) for this channel. Using a new interference alignment technique which has been recently introduced in \cite{abolfazl-final}, we show that $\frac{MN}{M+N} K$ degrees of freedom can be achieved for almost all channel realizations. Also, a new upper-bound on the DoF of this channel is provided. This upper-bound coincides with our achievable DoF for $K\geq K_u\define\frac{M+N}{\gcd(M,N)}$, where $\gcd(M,N)$ denotes the greatest common divisor of $M$ and $N$. This gives an exact characterization of DoF for $M\times N$ MIMO Gaussian interference channel in the case of $K\geq K_u$.

cs.IT↗

arXiv2011

Interference Alignment for the MIMO Interference Channel with Delayed Local CSIT

We consider the MIMO (multiple-input multiple-output) Gaussian interference channel with i.i.d. fading across antennas and channel uses and with the delayed local channel state information at the transmitters (CSIT). For the two-user case, achievability results for the degrees of freedom (DoF) region of this channel are provided. We also prove the tightness of our achievable DoF region for some antenna configurations. Interestingly, there are some cases in which the DoF region with delayed local CSIT is identical to the DoF region with perfect CSIT and that is strictly larger than the DoF region with no CSIT. We then consider the $K$-user MISO (multiple-input single-output) IC and show that the degrees of freedom of this channel could be greater than one with delayed local CSIT.

cs.IT↗

arXiv2010

Real Interference Alignment

In this paper, we show that the total Degrees-Of-Freedoms (DOF) of the $K$-user Gaussian Interference Channel (GIC) can be achieved by incorporating a new alignment technique known as \emph{real interference alignment}. This technique compared to its ancestor \emph{vector interference alignment} performs on a single real line and exploits the properties of real numbers to provide optimal signaling. The real interference alignment relies on a new coding scheme in which several data streams having fractional multiplexing gains are sent by transmitters and interfering streams are aligned at receivers. The coding scheme is backed up by a recent result in the field of Diophantine approximation, which states that the convergence part of the Khintchine-Groshev theorem holds for points on non-degenerate manifolds.

cs.IT↗

arXiv2009

Real Interference Alignment: Exploiting the Potential of Single Antenna Systems

In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and interfering streams are aligned at receivers. Viewed as a field over rational numbers, a received signal has infinite fractional DOFs, allowing simultaneous interference alignment of any finite number of signals at any finite number of receivers. The coding scheme is backed up by a recent result in the field of Diophantine approximation, which states that the convergence part of the Khintchine-Groshev theorem holds for points on non-degenerate manifolds. The proposed coding scheme is proved to be optimal for three communication channels, namely the Gaussian Interference Channel (GIC), the uplink channel in cellular systems, and the $X$ channel. It is proved that the total DOF of the $K$-user GIC is $\frac{K}{2}$ almost surely, i.e. each user enjoys half of its maximum DOF. Having $K$ cells and $M$ users within each cell in a cellular system, the total DOF of the uplink channel is proved to be $\frac{KM}{M+1}$. Finally, the total DOF of the $X$ channel with $K$ transmitters and $M$ receivers is shown to be $\frac{KM}{K+M-1}$.

cs.IT↗