Abstract
Partial crosstalk cancellation has been proposed to reduce the online complexity of crosstalk canceller in xDSL systems. Because the crosstalk profile changes over time, there is additional requirement that partial crosstalk cancellation provide a very low pre-processing complexity. Also, a much lower online complexity can be obtained if the multi-user power control and partial crosstalk cancellation problems are solved jointly. Currently, this joint problem is formulated as a constrained optimization problem. However, it suffers from per-tone exhaustive search. This paper presents a solution for this joint problem. The problem is considered as a mixed binary-non-convex problem. Then it is reformulated as a mixed binary-convex problem via a successive linear convex relaxation. Finally it is solved by an efficient branch and bound method. The complexity analysis of our algorithm shows that it provide much lower pre-processing complexity than currently proposed algorithms, allowing it to work efficiently in time-varying crosstalk environment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
