Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.00453

PLC-to-DSL Interference: Statistical Model and Impact on DSL

Stefano Galli·Kenneth Kerpez·Hubert Mariotte·Fabienne Moulin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Newly available standards for broadband access using Digital Subscriber Lines (DSL) have a high degree of spectrum overlap with home networking technologies using broadband Power Line Communications (BB-PLC) and this overlap leads to Electromagnetic Compatibility issues that may cause performance degradation in DSL systems. This paper studies the characteristics of measured PLC-to-DSL interference and presents novel results on its statistical characterization. The frequency-dependent couplings between power line cables and twisted-pairs are estimated from measurements and a statistical model based on a mixture of two truncated Gaussian distributions is set forth. The proposed statistical model allows the accurate evaluation of the impact of BB-PLC interference on various DSL technologies, in terms of both average and worst-case impacts on data rate. This paper further provides an extensive assessment of the impact of PLC-to-DSL interference at various loop lengths and for multiple profiles of Very-high rate Digital Subscriber Lines (VDSL2), Vectored VDSL2 (V-VDSL2), and G.fast. The results of this paper confirm that the impact of PLC interference varies with loop length and whether vectoring is used or not. Furthermore, the average impact is found to be generally small but worst-case couplings can lead to substantial degradation of DSL.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefano Galli, Kenneth Kerpez, Hubert Mariotte, Fabienne Moulin. 2015-12-05. PLC-to-DSL Interference: Statistical Model and Impact on DSL. https://arxiv.org/abs/1509.00453

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

KEEP EXPLORING

Related papers

arXiv2026

Efficient and rate-optimal list-decoding in the presence of minimal feedback

Given a channel with length-$n$ inputs and outputs over the alphabet $\{0,1,\ldots,q-1\}$, and of which a fraction $\varrho \in (0,1-1/q)$ of symbols can be arbitrarily corrupted by an adversary, a fundamental problem is that of communicating at rates close to the information-theoretically optimal values, while ensuring the receiver can infer that the transmitter's message is from a ``small" set. While the existence of such codes is known, and constructions with computationally tractable encoding/decoding procedures are known for large $q$, we provide the first schemes that attain this performance for any $q \geq 2$, as long as low-rate feedback (asymptotically negligible relative to the number of transmissions) from the receiver to the transmitter is available. For any sufficiently small $\varepsilon > 0$ and $\varrho \in (1-{1}/{q}-Θ(\sqrt{\varepsilon}))$ our minimal feedback scheme has the following parameters: Rate $1-H_q(\varrho) - \varepsilon$ (i.e., $\varepsilon$-close to information-theoretically optimal -- here $H_q(\varrho)$ is the $q$-ary entropy function), list-size $\exp\left(\mathcal{O}\left(\varepsilon^{-3/2}\log^2(1/\varepsilon)\right)\right)$, computational complexity of encoding/decoding $n^{\mathcal{O}(\varepsilon^{-1}\log(1/\varepsilon))}$, storage complexity $\mathcal{O}(n^{η+1}\log n)$ for a code design parameter $η>1$ that trades off storage complexity with the probability of error. The error probability is $\mathcal{O}(n^{-η})$, and the (vanishing) feedback rate is $\mathcal{O}({1}/{\sqrt{\log(n)}})$. Our full-feedback scheme has zero probability of error and minimal storage complexity, while the other parameters are the same as the vanishing rate feedback scheme.

cs.IT↗
arXiv2026

On Cost-Aware Designs for Sequential Hypothesis Testing

We introduce Cost-Aware (CA) Sequential Hypothesis Testing (CASHT), in which an active decision-maker selects sensing actions with different, random costs to identify the true hypothesis under an average-error constraint $δ$, while minimizing the expected total cost (rather than the number of samples). For fixed costs, we prove that the optimal expected total cost scales as $Θ(\log(1/δ))$, and is achievable by Multihypothesis Sequential Probability Ratio Test-based procedures. We show that the CA design principle is to maximize the ratio of expected information gain to expected cost under the policy-induced action distribution. Guided by this principle, we adapt two classic policies to the CA setting and establish their asymptotic optimality. We then treat random costs under two revelation models: ex-post, where costs are disclosed only after a sample is obtained, and the cost-error tradeoff coincides with the fixed-cost case, and ex-ante, where costs accrue before acquisition, and the decision maker may cancel an action mid-operation. For the ex-ante model, we characterize when cancellation lowers the total cost and analyze several cost distributions in detail. Simulations confirm our findings that the CA variants consistently reduce total cost relative to their classic counterparts, and when action cancellation helps or hurts.

cs.IT↗
arXiv2026

Construction of Multi-sequences With High Nonlinear Complexity via Narrow Ray Class Fields

Nonlinear complexity is a fundamental criterion in the evaluation of pseudorandom sequences. The construction of multi-sequences with high nonlinear complexity is both theoretically and practically important in cryptography. Motivated by prior constructions of multi-sequences with high nonlinear complexity in [IEEE Trans. Inf. Theory, 60(10), 2014] and [IEEE Trans. Inf. Theory, 63(12), 2017], we provide a unified framework via narrow ray class fields and the cyclic descent introduced by Guruswami and Xing in [J. Combin. Theory Ser. A 129 (2015) ]. Then we can generate new multi-sequences with high nonlinear complexity over function fields with arbitrary genera.

cs.IT↗