RECORD
Deep-LMS for gigabit transmission over unshielded twisted pair cables
Information Theory · Submitted 30 May 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Simulation results support our analysis and show significant reduction in convergence time compared to existing LMS variants.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
In this paper we propose a rapidly converging LMS algorithm for crosstalk cancellation. The architecture is similar to deep neural networks, where multiple layers are adapted sequentially. The application motivating this approach is gigabit rate transmission over unshielded twisted pairs using a vectored system. The crosstalk cancellation algorithm uses an adaptive non-diagonal preprocessing matrix prior to a conventional LMS crosstalk canceler. The update of the preprocessing matrix is inspired by deep neural networks. However, since most the operations in the Deep-LMS algorithm are linear, we are capable of providing an exact convergence speed analysis. The role of the preprocessing matrix is to speed up the convergence of the conventional LMS crosstalk canceler and hence the convergence of the overall system. The Deep-LMS is important for crosstalk cancellation in the novel G.fast standard, where traditional LMS converges very slowly due to the ill-conditioned covariance matrix of the received signal at the extended bandwidth. Simulation results support our analysis and show significant reduction in convergence time compared to existing LMS variants.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | In this paper we propose a rapidly converging LMS algorithm for crosstalk cancellation. | contribution 1.00 | 0.84 | 0.25 | asserted 0.99 |
| s1 | The architecture is similar to deep neural networks, where multiple layers are adapted sequentially. | method 0.95 | 0.47 | 0.04 | asserted 1.00 |
| s2 | The application motivating this approach is gigabit rate transmission over unshielded twisted pairs using a vectored system. | background 0.96 | 0.17 | 0.05 | asserted 0.99 |
| s3 | The crosstalk cancellation algorithm uses an adaptive non-diagonal preprocessing matrix prior to a conventional LMS crosstalk canceler. | method 0.98 | 0.73 | 0.06 | asserted 1.00 |
| s4 | The update of the preprocessing matrix is inspired by deep neural networks. | method 0.98 | 0.54 | 0.04 | asserted 1.00 |
| s5 | However, since most the operations in the Deep-LMS algorithm are linear, we are capable of providing an exact convergence speed analysis. | contribution 0.52 | 0.84 | 0.12 | asserted 0.88 |
| s6 | The role of the preprocessing matrix is to speed up the convergence of the conventional LMS crosstalk canceler and hence the convergence of the overall system. | method 0.69 | 0.52 | 0.20 | asserted 1.00 |
| s7 | The Deep-LMS is important for crosstalk cancellation in the novel G.fast standard, where traditional LMS converges very slowly due to the ill-conditioned covariance matrix of the received signal at the extended bandwidth. | background 0.73 | 0.17 | 0.20 | asserted 1.00 |
| s8 | Simulation results support our analysis and show significant reduction in convergence time compared to existing LMS variants. | result 1.00 | 0.95 | 0.48 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
In this paper we propose a rapidly converging LMS algorithm for crosstalk cancellation. The architecture is similar to deep neural networks, where multiple layers are adapted sequentially. The application motivating this approach is gigabit rate transmission over unshielded twisted pairs using a vectored system. The crosstalk cancellation algorithm uses an adaptive non-diagonal preprocessing matrix prior to a conventional LMS crosstalk canceler. The update of the preprocessing matrix is inspired by deep neural networks. However, since most the operations in the Deep-LMS algorithm are linear, we are capable of providing an exact convergence speed analysis. The role of the preprocessing matrix is to speed up the convergence of the conventional LMS crosstalk canceler and hence the convergence of the overall system. The Deep-LMS is important for crosstalk cancellation in the novel G.fast standard, where traditional LMS converges very slowly due to the ill-conditioned covariance matrix of the received signal at the extended bandwidth. Simulation results support our analysis and show significant reduction in convergence time compared to existing LMS variants.
Human review
How the literature uses it
1 arXiv paper cite this in 1 sentence
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.