Iterative Spectrum Balancing for Digital Subscriber Lines

Dynamic spectrum management (DSM) is an important technique for mitigating crosstalk in DSL. One of the first DSM algorithms proposed, Iterative waterfilling (IW), has a low complexity and demonstrates the spectacular performance gains that are possible. Unfortunately IW tends to be highly suboptimal in mixed CO/RT deployments and upstream VDSL. Another DSM algorithm, Optimal spectrum balancing (OSB), uses a weighted rate-sum to find the theoretically optimal transmit spectra. Unfortunately its complexity scales exponentially with the number of lines in the binder N. Typical binders contain 25-100 lines, for which OSB is intractable. This paper presents a new iterative algorithm for spectrum management in DSL. The algorithm optimizes the weighted rate-sum in an iterative fashion, which leads to a quadratic, rather than exponential, complexity in N. The algorithm is tractable for large N and can be used to optimize entire binders. Simulations show that the algorithm performs very close to the theoretical optimum achieved by OSB

Autonomous Spectrum Balancing for Digital Subscriber Lines

The main performance bottleneck of modern Digital Subscriber Line (DSL) networks is the crosstalk among different lines (users). By deploying Dynamic Spectrum Management (DSM) techniques and reducing excess crosstalks among users, a network operator can dramatically increase the data rates and service reach of broadband access. However, current DSM algorithms suffer from either substantial suboptimality in typical deployment scenarios or prohibitively high complexity due to centralized computation. This paper develops, analyzes, and simulates a new suite of DSM algorithms for DSL interference channel models called Autonomous Spectrum Balancing (ASB), for both synchronous and asynchronous transmission cases. In the synchronous case, the transmissions over different tones are orthogonal to each other. In the asynchronous case, the transmissions on different tones are coupled together due to intercarrier- interference. In both cases, ASB utilizes the concept of a 'reference line', which mimics a typical victim line in the interference channel. The basic procedure in ASB algorithms is simple: each user optimizes the weighted sum of the achievable rates on its own line and the reference line while assuming the interferences from other users as noise. Users then iterate until the target rate constraints are met. Good choices of reference line parameters are already available in industry standards, and the ASB algorithm makes the intuitions completely rigorous and theoretically sound. ASB is the first set of algorithms that is fully autonomous, has low complexity, and yet achieves near-optimal performance. It effectively solves the nonconvex and coupled optimization problem of DSL spectrum management, and overcomes the bottleneck of all previous DSM algorithms

Adaptive NLMS Partial Crosstalk Cancellation in Digital Subscriber Lines

Crosstalk is a major limitation to achieving high data-rates in next generation VDSL systems. Whilst crosstalk cancellation can be applied to completely remove crosstalk, it is often too complex for application in typical VDSL binders, which can contain up to hundreds of lines. A practical alternative, known as partial cancellation limits the cancellation to crosstalkers that cause severe interference to the other lines within the binder. In real VDSL systems, the crosstalk environment changes rapidly as new lines come online; old lines go offline, and the crosstalk channels change with fluctuations in ambient temperature. Therefore, adaptive crosstalk cancellers are often required. In this paper, we propose a new detection guided adaptive NLMS method for Adaptive Partial Crosstalk Cancellation that detects significant crosstalkers and tracks variations in their crosstalk channels. This exploits the sparse and column-wise diagonal dominant properties of the crosstalk channel matrix and leads to fast convergence, accurate crosstalk channel tracking, with a lower update complexity. The end result is an adaptive Partial Crosstalk Cancellation algorithm that has lower run-time complexity than prior state-of-the-art whilst yielding comparatively high data-rates and reliable service

Optimal Multi-user Spectrum Management for Digital Subscriber Lines

Crosstalk is a major issue in modern DSL systems such as ADSL and VDSL. Static spectrum management, the traditional way of ensuring spectral compatibility, employs spectral masks which can be overly conservative and lead to poor performance. In this paper we present a centralized algorithm for optimal spectrum management (OSM) in DSL. The algorithm uses a dual decomposition to solve the spectrum management problem in an efficient and computationally tractable way. The algorithm shows significant performance gains over existing DSM techniques, e.g. in an upstream VDSL scenario the centralized OSM algorithm can outperform a distributed DSM algorithm such as iterative waterfilling by up to 380%

Statistical Analysis of VoDSL Technology for the Efficiency of Listening Quality of 640k/640k

Next-generation Internet technology will offer high performance and high capacity traffic aggregation and scalability. Voice over Digital Subscriber Line (VoDSL) technology allows service providers to offer multiple telephone lines over a single subscriber line in addition to high speed data transmission services. This article provides a baseline test for the Listening Quality (LQ) using VoDSL access technology by using Voice/Listening Quality (V/LQ) transmission with voice compression while countinously downloading files. The result will be to enable the efficiency of the LQ and its statistical analysis based on a Digital Subscriber Line (DSL) service at level 640K/640K for each American National Standards Institute (ANSI) and Carrier Serving Area (CSA) loops

Optimal multi-user spectrum balancing for digital subscriber lines

Crosstalk is a major issue in modern digital subscriber line (DSL) systems such as ADSL and VDSL. Static spectrum management, which is the traditional way of ensuring spectral compatibility, employs spectral masks that can be overly conservative and lead to poor performance. This paper presents a centralized algorithm for optimal spectrum balancing in DSL. The algorithm uses the dual decomposition method to optimize spectra in an efficient and computationally tractable way. The algorithm shows significant performance gains over existing dynamic spectrum management (DSM) techniques, e.g., in one of the cases studied, the proposed centralized algorithm leads to a factor-of-four increase in data rate over the distributed DSM algorithm iterative waterfilling

Modelling of data stream time characteristics for use of inverse multiplexer

Today, increasing of the transmission rate in a telecommunications network is possible in various ways. One of them is inverse multiplexing. The inverse multiplexer divides a data stream to multiple parallel channels. This principle not only allows to increase the total available transmission rate, but also allows to reduce the error rate and interruption in data stream. The digital subscriber line may be used for the implementation of the inverse multiplex. Accurate knowledge of the transmission parameters of a digital subscriber line and the entire infrastructure of the network provider is necessary for the effective functioning of the terminal device with inverse multiplexing. It is necessary to know not only the parameters related to the transmission rate, but above all the parameters relevant to the time characteristics of data transmission. This paper describes how to obtain the transmission parameters of real digital subscriber lines and their modelling

Selection of digital subscriber lines ready for next generation access

Nowadays, in the EU a lot of project concerning broadband access to the Internet for end users is being developed. The aim of those projects is to support the creation of access communication networks that can meet defined performance criteria for providing the broadband services. Such networks are in general called Next Generation Access. One of the first tasks is to identify appropriate transmission technologies that could meet the required performance criteria. For each transmission technology, it is necessary to carry out a detailed performance analysis of the transmission depending on certain transmission conditions. To perform a detailed analysis means to carry out modelling of transmission’s specific conditions for each technology. This article, specifically, discusses hybrid optical networks, which in conjunction with digital subscriber lines are one of the possible solutions for Next Generation Access. In the access network topology that combines copper and optical cables, it is necessary to optimize the mutual ratio of both infrastructure’s length. Therefore, the article also describes this issue that refers to a certain technology for the Next Generation Access. Specific performance criteria of transmission for access network in the Czech Republic are considered and the optimized location of the external node digital line access multiplexer is discussed

A Reduced-Complexity Fast Algorithm for Software Implementation of the IFFT/FFT in DMT Systems

The discrete multitone (DMT) modulation/demodulation scheme is the standard transmission technique in the application of asymmetric digital subscriber lines (ADSL) and very-high-speed digital subscriber lines (VDSL). Although the DMT can achieve higher data rate compared with other modulation/demodulation schemes, its computational complexity is too high for cost-efficient implementations. For example, it requires 512-point IFFT/FFT as the modulation/demodulation kernel in the ADSL systems and even higher in the VDSL systems. The large block size results in heavy computational load in running programmable digital signal processors (DSPs). In this paper, we derive computationally efficient fast algorithm for the IFFT/FFT. The proposed algorithm can avoid complex-domain operations that are inevitable in conventional IFFT/FFT computation. The resulting software function requires less computational complexity. We show that it acquires only 17% number of multiplications to compute the IFFT and FFT compared with the Cooly-Tukey algorithm. Hence, the proposed fast algorithm is very suitable for firmware development in reducing the MIPS count in programmable DSPs