Related papers: Proximity Factors of Lattice Reduction-Aided Preco…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
The performance of pilot-aided joint-channel carrier-phase estimation (CPE) in space-division multiplexed multicore fiber (MCF) transmission with correlated phase noise is studied. To that end, a system model describing uncoded MCF…
Finding sparse vectors is a fundamental problem that arises in several contexts including codes, subspaces, and lattices. In this work, we prove strong inapproximability results for all these variants using a novel approach that even…
In this paper, a distributed convex optimization algorithm, termed \emph{distributed coordinate dual averaging} (DCDA) algorithm, is proposed. The DCDA algorithm addresses the scenario of a large distributed optimization problem with…
Light emitting diode (LED) based visible light positioning (VLP) networks can provide accurate location information in indoor environments. In this manuscript, we propose to employ cooperative localization for visible light networks by…
In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting…
We introduce an iterative optimization scheme for convex objectives consisting of a linear loss and a non-separable penalty, based on the expectation-consistent approximation and the vector approximate message-passing (VAMP) algorithm.…
Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for channels with interference known only at the transmitter, where the known interference is treated as side-information (SI). As a special case of LA-GPC, dirty…
A multistatic radar set-up is considered in which distributed receive antennas are connected to a Fusion Center (FC) via limited-capacity backhaul links. Similar to cloud radio access networks in communications, the receive antennas…
Antenna arrays will be an important ingredient in millimeter wave (mmWave) cellular systems. A natural application of antenna arrays is simultaneous transmission to multiple users. Unfortunately, the hardware constraints in mmWave systems…
Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal…
Quantized constant envelope (QCE) precoding, a new transmission scheme that only discrete QCE transmit signals are allowed at each antenna, has gained growing research interests due to its ability of reducing the hardware cost and the…
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…
Large-scale MIMO systems have been considered as one of the possible candidates for the next-generation wireless communication technique, due to their potential to provide significant higher throughput than conventional wireless systems.…
This paper proposes a joint optimization framework for energy-efficient linear precoding and feeder-link-beam matching design in a multi-gateway multi-beam bent-pipe satellite communication system. The proposed scheme jointly optimizes the…
We study the multi-terminal remote estimation problem under a rate constraint, in which the goal of the encoder is to help each decoder estimate a function over a certain distribution -- while the distribution is known only to the encoder,…
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any message they do not have. An approach,…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…