Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/9991
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zafaruddin, S.M. | - |
dc.date.accessioned | 2023-03-28T05:45:20Z | - |
dc.date.available | 2023-03-28T05:45:20Z | - |
dc.date.issued | 2018-08 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/abstract/document/8373710 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9991 | - |
dc.description.abstract | We propose an iterative crosstalk cancellation scheme based on the generalized minimal residual (GMRES) algorithm for large-scale digital subscriber line (DSL) systems. The proposed scheme does not require channel inversion and stores fewer vectors for crosstalk cancellation. We analyze the convergence of the GMRES algorithm and derive computable bounds on the residual error and signal-to-noise ratio in terms of system parameters at each iteration for upstream DSL systems. We show that the GMRES algorithm typically requires a single iteration for very large vectored systems to achieve crosstalk-free performance for the very high-speed DSL (VDSL) frequencies and only a few more in the highest frequency bands of the G.fast spectrum. This yields significant complexity savings and reduction in memory storage, compared to the zero forcing scheme under certain conditions. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | EEE | en_US |
dc.subject | Crosstalk | en_US |
dc.subject | Digital subscriber line (DSL) | en_US |
dc.subject | Generalized minimal residual (GMRES) | en_US |
dc.subject | Iterative processing | en_US |
dc.subject | Zero forcing (ZF) | en_US |
dc.title | GMRES Algorithm for Large-Scale Vectoring in DSL Systems | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Electrical and Electronics Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.