Overlay transmission of sporadic random access and broadband traffic for 5G networks

  • Berardinelli G.
  • Viswanathan H.

Providing services to devices with varied rate, latency and energy consumption requirements is a major challenge for 5th Generation (5G) radio access technology. Overlay transmission or non-orthogonal multiple access, wherein multiple devices with same or different service requirements use the same time-frequency resources, may overcome the poor trunking efficiency of ...

3D thermal simulations and modeling of multi-finger InP DHBTs for millimeter-wave power amplifiers

  • Dupuy J.
  • Johansen T.
  • Konczykowska A.
  • Midili V.
  • Nodjiadjim V.
  • Riet M.
  • Squartecchia M.

This paper presents the comparison between the simulated and measured thermal resistance of InP Double Heterojunction Bipolar Transistors (DHBT). 3D thermal simulations were carried out in order to compute the temperature distribution across the full structure due to a constant power excitation of devices with up to 8 emitter fingers. ...

Long delay optical feedback sensitivity of hybrid III-V/SOI directly modulated DFB lasers

  • Accard A.
  • Duan G.
  • Gallet A.
  • Grillot F.
  • Huang H.
  • Make D.
  • Olivier S.
  • Schires K.
  • Song M.

Hybrid III-V/SOI DFB lasers subjected to external optical feedback is analyzed. Its impact on optical spectrum, eye diagram and bit error rate (BER) is discussed.

Network Energy: Problematic and solutions towards sustainable ICT

  • Chiaroni D.

The energy efficiency has been identified by international institutions as fundamental to have a major ecological impact on the planet. This paper will draw new technical directions to make the network of tomorrow more sustainable.

Comparison of 5G waveform candidates in high speed scenario

  • Chen X.
  • Liu Y.
  • Miao D.
  • Wang F.
  • Zhao Z.
  • Zheng Q.

Summary form only given. Strong light-matter coupling has been recently successfully explored in the GHz and THz [1] range with on-chip platforms. New and intriguing quantum optical phenomena have been predicted in the ultrastrong coupling regime [2], when the coupling strength Ω becomes comparable to the unperturbed frequency of the ...

Packet segmentation for contention-based transmission in 5G

  • Tuo X.
  • Wang F.
  • Wang D.
  • Zhang Y.
  • Zhao Z.

Summary form only given. Strong light-matter coupling has been recently successfully explored in the GHz and THz [1] range with on-chip platforms. New and intriguing quantum optical phenomena have been predicted in the ultrastrong coupling regime [2], when the coupling strength Ω becomes comparable to the unperturbed frequency of the ...

Non-orthogonal waveforms for machine type communication

  • Chen X.
  • He X.
  • Miao D.
  • Wang F.
  • Zhao Z.

Summary form only given. Strong light-matter coupling has been recently successfully explored in the GHz and THz [1] range with on-chip platforms. New and intriguing quantum optical phenomena have been predicted in the ultrastrong coupling regime [2], when the coupling strength Ω becomes comparable to the unperturbed frequency of the ...

Passive Chaos Bandwidth Enhancement Under Dual-Optical Feedback with Hybrid IIIâ?"V/Si DFB Laser

  • Duan G.
  • Gallet A.
  • Gomez S.
  • Grillot F.
  • Schires K.

The chaotic dynamics of a DFB laser are studied experimentally under a combination of short and long feedbacks. Chaos bandwidth enhancement is demonstrated using a hybrid IIIâ?"V/Si DFB laser with a large relaxation oscillation frequency (ROF) of 14Â GHz. The impact of short feedback on the ROF is studied and ...

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 ...

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. ...