Cart (Loading....) | Create Account
Close category search window
 

Joint Level 2 and 3 Dynamic Spectrum Management for Downstream DSL

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
$31 $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

4 Author(s)
Forouzan, A.R. ; Dept. of Electr. Eng., Univ. of Isfahan, Isfahan, Iran ; Moonen, M. ; Maes, J. ; Guenach, M.

In this paper, we investigate joint level 2 and 3 dynamic spectrum management (joint DSM 2/3) for downstream (DS) DSL. We consider a DS scenario in which users are divided into a few separate groups, where vector encoding based signal coordination can be applied in each group and spectrum coordination is possible for all users. This can be seen as a mixed interference/broadcast channel (IF/BC) scenario. In order to obtain the optimal transmitter structure, we develop a generalized duality between the vector broadcast and multiple-access channel (MAC) for scenarios in which partial signal coordination is available among users. This theory together with optimal spectrum balancing (OSB) is exploited to calculate the jointly optimal filters and transmit powers for non-linear vector dirty paper coding structures (in the form of Tomlinson-Harashima precoder (THP)) in the groups. The proposed scheme is compared to several other joint DSM 2/3 algorithms for DS DSL. Simulation results show that the proposed scheme (referred to as the IF/BC-OSB algorithm) achieves considerably higher bit rates than the other schemes. IF/BC-OSB encompasses the earlier developed BC-OSB algorithm as a special case. A simplified version of IF/BC-OSB avoiding exhaustive search with near-optimal performance is also proposed.

Published in:

Communications, IEEE Transactions on  (Volume:60 ,  Issue: 10 )

Date of Publication:

October 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.