By Topic

Efficient low complexity partial crosstalk cancellation algorithm by using successive linear convex relaxation and branch and bound approaches in VDSL networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Maesoumi ; Dept of Elec. Eng., Sciences and Researches Campus, Azad University, Tehran, Iran ; M. A. Masnadi-Shirazi

Partial crosstalk cancellation algorithm has been proposed to reduce the online complexity of crosstalk canceller in xDSL systems. However, it must have a very low pre-processing complexity to allow working efficiently in time-varying crosstalk environment. Also, much lower online complexity can be achieved by joint solution of the multi-user power control and partial crosstalk cancellation problems. Currently, this joint problem has been formulated as a constrained weighted sum rate maximization problem and solved by employing Lagrange dual decomposition method. However, it suffers from applying per-tone exhaustive search for its solution because of non-convexity of the problem. In this paper, the joint problem is reformulated as a mixed binary-convex problem by successive linear convex relaxation technique which can be solved by the efficient branch and bound method. The analytical and simulation results show that the proposed approach provides a solution with extremely low pre-processing complexity and close to the optimal solution.

Published in:

Communications and Electronics, 2008. ICCE 2008. Second International Conference on

Date of Conference:

4-6 June 2008