Search arXivSearch

arXiv · 1006.1210

Full vectoring optimal power allocation in xDSL channels under per-modem power constraints and spectral mask constraints

Abstract

In xDSL systems, crosstalk can be separated into two categories, namely in-domain crosstalk and out-of-domain crosstalk. In-domain crosstalk is also refered to as self crosstalk. Out-of-domain crosstalk is crosstalk originating from outside the multi-pair system and is also denoted as external noise (alien crosstalk, radio frequency interference,...). While self crosstalk in itself can easily be canceled by a linear detector like the ZF detector, the presence of external noise requires a more advanced processing. Coordination between transmitters and receivers enables the self crosstalk and the external noise to be mitigated using MIMO signal processing, usually by means of a whitening filter and SVD. In this paper, we investigate the problem of finding the optimal power allocation in MIMO xDSL systems in the presence of self crosstalk and external noise. Optimal Tx/Rx structures and power allocation algorithms will be devised under practical limitations from xDSL systems, namely per-modem total power constraints and/or spectral mask constraints, leading to a generalized SVD-based transmission. Simulation results are given for bonded VDSL2 systems with external noise coming from ADSL2+ or VDSL2 disturbing lines, along with a comparison between algorithms with one-sided signal coordination either only at the transmit side or the receive side.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun Guenach. 2010-06-07. Full vectoring optimal power allocation in xDSL channels under per-modem power constraints and spectral mask constraints. https://arxiv.org/abs/1006.1210

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

KEEP EXPLORING

Related papers

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

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

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