Related papers: Counting solutions for the CDMA multiuser MAP demo…
We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and…
Spatially coupled (SC) interleaving is proposed to improve the performance of iterative multiuser detection and decoding (MUDD) for quasi-static fading multiple-input multiple-output systems. The linear minimum mean-squared error (LMMSE)…
We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve…
We propose a new iterative construction of solutions of the classical TAP equations for the Sherrington-Kirkpatrick model, i.e. with finite-size Onsager correction. The algorithm can be started in an arbitrary point, and converges up to the…
The paper deals with orthogonal space-time block coded MC-CDMA systems in outdoor realistic downlink scenarios with up to two transmit and receive antennas. Assuming no channel state information at the transmitter, we compare several linear…
We consider an invariant random matrix model where the standard Gaussian potential is distorted by an additional single pole of order $m$. We compute the average or macroscopic spectral density in the limit of large matrix size, solving the…
Dynamic Mode Decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of non-linear systems from experimental datasets. Recently, several attempts have extended DMD to the context of low-rank approximations. This…
This paper introduces a novel compact mixed integer linear programming (MILP) formulation and a discretization discovery-based solution approach for the Vehicle Routing Problem with Time Windows (VRPTW). We aim to solve the optimization…
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be…
In massive multiple-input multiple-output (MIMO) downlink systems, the physical implementation of the base stations (BSs) requires the use of cheap and power-efficient power amplifiers (PAs) to avoid high hardware cost and high power…
In 1977, Thouless, Anderson, and Palmer (TAP) derived a system of consistent equations in terms of the effective magnetization in order to study the free energy in the Sherrington-Kirkpatrick (SK) spin glass model. The solutions to their…
Using Monte Carlo simulations, we study in detail the overlap distribution for individual samples for several spin-glass models including the infinite-range Sherrington-Kirkpatrick model, short-range Edwards-Anderson models in three and…
A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. The method is based on a rigorous approach to spin…
Ising formulations are widely utilized to solve combinatorial optimization problems, and a variety of quantum or semiconductor-based hardware has recently been made available. In combinatorial optimization problems, the existence of local…
Minimal area surfaces in AdS$_3$ ending on a given curve at the boundary are dual to planar Wilson loops in N=4 SYM. In previous work it was shown that the problem of finding such surfaces can be recast as the one of finding an appropriate…
We present a technique for the approximation of a class of Hilbert space-valued maps which arise within the framework of Model Order Reduction for parametric partial differential equations, whose solution map has a meromorphic structure.…
We solve the Sherrington-Kirkpatrick (SK) model in a transverse field \Gamma deep in its quantum glass phase at zero temperature. We show that the glass phase is critical everywhere, exhibiting collective excitations with a gapless Ohmic…
A $K$-user pseudo-orthogonal (PO) randomly spread CDMA system, equivalent to transmission over a subset of $K'\leq K$ single-user Gaussian channels, is introduced. The high signal-to-noise ratio performance of the PO-CDMA is analyzed by…
We study solution methods for (strongly-)convex-(strongly)-concave Saddle-Point Problems (SPPs) over networks of two type - master/workers (thus centralized) architectures and meshed (thus decentralized) networks. The local functions at…
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In Part I, the fundamental limits of asynchronous CDMA systems are analyzed in terms of spectral efficiency and SINR at the output of the optimum linear…