摘要
Crosstalk is the main degrading factor in Digital Subscriber Line (DSL) systems which are the result of electromagnetic coupling between two adjacent twisted pairs in a cable. Very-high bit-rate Digital Subscriber Line (VDSL) systems which use higher frequencies for data transmission than the other DSL systems, this effect is more considerable in Bit Error Rate (BER) degradation. This paper considers a complete adaptive iterative water-filling (IWF) algorithm for Resolving Upstream Near-Far Problem in VDSL Systems. The new distributed dynamic spectrum management algorithm is proposed, which improve achievable bit rate of iterative water-filling algorithm. The paper proffers a new power back-off strategy of the spectral mask at the near-end users, in order to protect the far-end users. Simulation of the proposed algorithm indicates that the bit rate is increased considerably rather the IWF and adaptive water-filling (AIWF) algorithms by keeping their low complexity. Furthermore, by adding the number of users in network, the new algorithm achieves performance gains over the AIWF, completely adaptive.
Crosstalk is the main degrading factor in Digital Subscriber Line (DSL) systems which are the result of electromagnetic coupling between two adjacent twisted pairs in a cable. Very-high bit-rate Digital Subscriber Line (VDSL) systems which use higher frequencies for data transmission than the other DSL systems, this effect is more considerable in Bit Error Rate (BER) degradation. This paper considers a complete adaptive iterative water-filling (IWF) algorithm for Resolving Upstream Near-Far Problem in VDSL Systems. The new distributed dynamic spectrum management algorithm is proposed, which improve achievable bit rate of iterative water-filling algorithm. The paper proffers a new power back-off strategy of the spectral mask at the near-end users, in order to protect the far-end users. Simulation of the proposed algorithm indicates that the bit rate is increased considerably rather the IWF and adaptive water-filling (AIWF) algorithms by keeping their low complexity. Furthermore, by adding the number of users in network, the new algorithm achieves performance gains over the AIWF, completely adaptive.
