Low-Density Code-Domain NOMA: Better Be Regular

  • Shamai (Shitz) S.
  • Shental O.
  • Zaidel B.

A closed-form analytical expression is derived for the limiting empirical squared singular value density of a channel transfer matrix corresponding to sparse low-density code-domain (LDCD) non-orthogonal multiple-access (NOMA) with regular random user-resource allocation. The derivation relies on associating the channel transfer matrix with the adjacency matrix of a large semi-regular ...

Principal Pivot Transforms on Radix -2 DFT type Matrices

  • Alloum A.
  • Sian-Jheng Lin
  • Tareq Al-Naffouri

In this paper, we discuss the principal pivot transforms (PPT) on a family of matrices, called the radix-2 DFTtype matrices. Given a transformation matrix, the PPT of the matrix is a transformation matrix with exchanging some entries between the input array and the output array. The radix- 2 DFT-type matrices ...

Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szemeredi Graphs

  • Dimakis A.
  • Shanmugam K.
  • Tulino A.

Coded caching is a problem where encoded broadcasts are used to satisfy users requesting popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen showed that it is possible to satisfy a scaling number of users with only a constant number of broadcast transmissions by exploiting coding and ...

Linear Programming Bounds for Entanglement-Assisted Quantum Codes

  • Ashikhmin A.
  • Laim Ching-Yi

In this paper, we define two split weight enumerators for general quantum codes with entanglement assistance, including nonadditive codes. We show that they obey a MacWilliams identity, which allows us to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. ...

Rate-Memory Trade-off for the Two-User Broadcast Caching Network with Correlated Sources

  • Erkip E.
  • Hassanzadeh P.
  • Llorca J.
  • Tulino A.

This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. ...

Probabilistic Shaping via Non-Binary Codes

  • Jardel F.
  • Joseph J. Boutros
  • Measson C.

Shaping refers to engineering methods that adapt the signal distribution to a communication channel for increased efficiency. Recently, shaping methods have regained interest especially in optical communications where current technologies operate close the fundamental limits of the linear fiber channel model. Probabilistic amplitude shaping (PAS) has been proposed in [1] ...

Compressed Sensing of Compressible Signals

  • Beygi S.
  • Jalali S.
  • Maleki A.
  • Mitra U.

We present a novel and general approach that elevates the scope of compressed sensing recovery algorithms far beyond simple structures such as sparsity. The proposed method, referred to as compressionbased gradient descent (C-GD), is capable of employing state-of-the-art compression algorithms to solve structured signal recovery problems. This enables CGD to ...

Telecom Microservices Orchestration

  • Luong D.
  • Mongazon-Cazavet B.
  • Outtagarts A.
  • Thieu H.

The introduction of microservices in cloud infrastructure provides modularity, flexible with distributed software components. In telecom, the Network Function Virtualization (NFV) approach enable running an application as a collection of small components and microservices that share an operating system (OS) or distributed platform across many servers in cloud. In this ...

Characterization of degrees of freedom versus receivers backhaul load in K-user interference channel

  • Kananian B.
  • Khalaj B.
  • Maddah-Ali M.
  • Shariatpanahi S.

We consider a K-user Interference Channel where each transmitter is interested in conveying a message to its corresponding receiver. In addition, we assume a fully connected noiseless backhaul network through which receivers can collaborate and help each other recover their desired messages. In this paper, we fully characterize the trade-off ...

On the optimality of separation between caching and delivery in general cache networks

  • Avestimehr A.
  • Maddah-Ali M.
  • Naderializadeh N.

We consider a system, containing a library of multiple files and a general memoryless communication network through which a server is connected to multiple users, each equipped with a local isolated cache of certain size that can be used to store part of the library. Each user will ask for ...

On time-bandwidth product of multi-soliton pulses

  • Aref V.
  • Bulow H.
  • Span A.
  • Ten Brink S.

Multi-soliton pulses are potential candidates for fiber optical transmission where the information is modulated and recovered in the so-called nonlinear Fourier domain. While this is an elegant technique to account for the channel nonlinearity, the obtained spectral efficiency, so far, is not competitive with the classic Nyquist-based schemes. In this ...

Communication-aware computing for edge processing

  • Avestimehr A.
  • Li S.
  • Maddah-Ali M.

We consider a mobile edge computing problem, in which mobile users offload their computation tasks to computing nodes (e.g., base stations) at the network edge. The edge nodes compute the requested functions and communicate the computed results to the users via wireless links. For this problem, we propose a Universal ...

The exact rate-memory tradeoff for caching with uncoded prefetching

  • Avestimehr A.
  • Maddah-Ali M.
  • Yu Q.

We consider a cache network, where a single server is connected to multiple users via a shared bottleneck link. The server has a set of files, which can be cached by each user in a prefetching phase. In a following delivery phase, each user requests a file and the server ...

Characterizing the rate-memory tradeoff in cache networks within a factor of 2

  • Avestimehr A.
  • Maddah-Ali M.
  • Yu Q.

We consider a basic caching system, where a single server with a database of N files (e.g. movies) is connected to a set of K users through a shared bottleneck link. Each user has a local cache memory with a size of M files. The system operates in two phases: ...

Tablevisor 2.0: Towards full-featured, scalable and hardware-independent multi table processing

  • Bauer R.
  • Gebert S.
  • Geissler S.
  • Herrnleben S.
  • Jarschel M.
  • Zinner T.

Modern Software Defined Networking (SDN) applications rely on sophisticated packet processing. However, there is a mismatch between control plane requirements and data plane capabilities caused by increasing hardware heterogeneity. To overcome this challenge, we propose TableVisor, a proxy-layer for the OpenFlow control channel that enables the flexible and scalable abstraction ...

The Era of 5G and Its Impacts on EMC Design and Testing

  • Yu Q.

It is part of presentation in Workshop "Equipment & System Design for EMC" at 2017 IEEE International Symposium on EMC, Washington, D.C. The presentation agenda is: 5G Era - Coming, What is 5G?, What are 5G Capabilities?, What are 5G Performance Requirements?, What is mmWave?, Why use mmWave spectrum?, 5G ...

POUX: Performance Optimization Strategy for Cloud Platforms Based on User Experience

  • Guo Z.
  • Liu Y.
  • Qiu Z.
  • Sun Y.
  • Wang Y.

Cloud computing has been widely used in almost every areas of our life. System virtualization is one of the key technologies in cloud computing. However, it is a great challenge to achieve a balance among the virtual machines (VMs) in different physical machines (PMs) by migrating overloaded VMs to underloaded ...

A Cloud Native Approach to 5G Network Slicing

  • Francini A.
  • Miller R.
  • Sharma S.

5G networks will have to support a set of very diverse and often extreme requirements. Network slicing offers an effective way to unlock the full potential of 5G networks and meet those requirements on a shared network infrastructure. This paper presents a cloud native approach to network slicing. The cloud ...

Chirp Management in Silicon-Graphene Electro Absorption Modulators

  • Asselbergs I.
  • Contestabile G.
  • D'Errico A.
  • Galli P.
  • Huyghebaerts C.
  • Midrio M.
  • Pantouvaki M.
  • Romagnoli M.
  • Sorianello V.
  • Van Campenhout J.

We study the frequency chirp properties of Graphene-on- Silicon electro-absorption modulators (EAMs). By experimentally measuring the chirp of a 100 um long single layer Graphene EAM, we show that the optoelectronic properties of Graphene induce a large positive linear chirp (up to 1.8 GHz) on the optical signal generated by ...

5G US Spectrum Development , Products and mmWave Testing Including Measurements of Fixed Satellite Service (FSS) Earth Station Spillover Emissions.

  • Majkowski W.

The 5G shared spectrum for mobile wireless above 24 GHz was authorized by the FCC. This paper traces the development of the shared spectrum authorization, testing issues, 5G goals and interference measurements of Fixed Satellite Service (FSS) Earth Station Spillover Emissions.