Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1311.1567

Beamforming Design for Joint Localization and Data Transmission in Distributed Antenna System

Seongah Jeong·Osvaldo Simeone·Alexander Haimovich·Joonhyuk Kang
View original source ↗Read source document ↗Export metadata ↓

Abstract

A distributed antenna system is studied whose goal is to provide data communication and positioning functionalities to Mobile Stations (MSs). Each MS receives data from a number of Base Stations (BSs), and uses the received signal not only to extract the information but also to determine its location. This is done based on Time of Arrival (TOA) or Time Difference of Arrival (TDOA) measurements, depending on the assumed synchronization conditions. The problem of minimizing the overall power expenditure of the BSs under data throughput and localization accuracy requirements is formulated with respect to the beamforming vectors used at the BSs. The analysis covers both frequency-flat and frequency-selective channels, and accounts also for robustness constraints in the presence of parameter uncertainty. The proposed algorithmic solutions are based on rank-relaxation and Difference-of-Convex (DC) programming.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seongah Jeong, Osvaldo Simeone, Alexander Haimovich, Joonhyuk Kang. 2014-04-29. Beamforming Design for Joint Localization and Data Transmission in Distributed Antenna System. https://arxiv.org/abs/1311.1567

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗