Search

Recently, the problem of optimal spectral balancing (OSB) for digital subscriber lines (DSL) with constrained transmit power has been solved using Lagrange's dual optimization technique and a weighted sum rate maximization (WSRM) approach. In many cases, the total power constraint is not binding. Although, this means a huge computational complexity reduction, the algorithm fails to reach certain points on the rate region (RR). In this paper, an in-depth analytical view of the WSRM approach is provided, and it is shown that when the RR is not strictly convex, the WSRM approach fails to reach certain points on the RR. Moreover, using N-dimensional geometry, a novel iterative facet dividing algorithm (IFDA) capable of reaching any point on the RR is proposed. Analytical and simulation results show that our technique is much more reliable and considerably faster than current algorithms. Moreover, it can be used for a wide range of problems which use WSRM approach, including OSB in the general case. [ABSTRACT FROM AUTHOR]

Dynamic spectrum management (DSM) refers to a wide range of techniques for counteracting crosstalk in digital subscriber line (DSL) networks. DSM is categorized into three levels based on the degree of coordination among users. In this article, we investigate optimal joint level 2 and 3 DSM for upstream DSL. We will discuss the difficulties of finding the universally optimal solution and we propose an optimal algorithm, referred to as IF/MAC-OSB, under some practical and implementation assumptions for this problem. Using computer simulations, we show that IF/MAC-OSB is capable of increasing the user bit rates considerably compared to several other DSM techniques. The proposed algorithm involves using the minimum mean squared error (MMSE)-generalized decision feedback equalizer (GDFE) together with Lagrange dual optimization. We address several aspects of the problem including the optimal decoding order in the GDFE receiver, GDFE error propagation, and the computational complexity of the algorithm. We also study effects of channel model randomness and upstream power back-off utilization on the performance of the algorithm. [ABSTRACT FROM AUTHOR]

Orthogonal spreading codes play an essential role in code-division multiple-access (CDMA) systems by eliminating multiple-access interference (MAI). In this paper, a novel orthogonal spreading code has been proposed for spectrally-encoded (SE) CDMA, a.k.a., spread-time (ST) CDMA with arbitrary pulse shape. It has been shown that it is possible to retain the orthogonality of the code in the presence of tail truncation by time windowing and in a general multipath fading channel in which users experience different frequency selectivity just by modifying the user codewords. Simulation results show that the proposed codes can achieve single user performance when the code length is twice the number of users. [ABSTRACT FROM AUTHOR]