The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Bit and power allocation remains a challenge in multiuser multicarrier systems though optimal and suboptimal algorithms have been proposed. In this paper, we optimize the multiuser bit removal greedy algorithm by allowing removing bits in parallel, so reducing the computation time of the algorithm and making it attractive for real implementations. It has been proved that the proposed algorithm converges...
Higher levels of Dynamic Spectrum Management (DSM) are strongly desired; however, we still need methods that are compliant with the current spectrum management specifications and DSM-proven, at the same time. Therefore, we propose a simple yet efficient pre-Level-2 DSM algorithm to protect legacy xDSL systems from new technology implementations (e.g. VDSL2). We show by extensive simulations how effective...
Adaptive bit allocation for DMT-based systems is critical for preventing performance degradation due to poor allocation of bits given challenging channel conditions. In this paper, we extend the bit removal greedy algorithm to a multi-user environment. It has been proved that the proposed algorithm converges faster than the traditional multiuser greedy algorithm.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.