A novel technique to reduce Near-Far problem in multi-user VDSL network

IF 1.8 4区 计算机科学 Q3 TELECOMMUNICATIONS Annals of Telecommunications Pub Date : 2023-12-06 DOI:10.1007/s12243-023-01001-5
Sunil Sharma, Minakshi Sharma
{"title":"A novel technique to reduce Near-Far problem in multi-user VDSL network","authors":"Sunil Sharma,&nbsp;Minakshi Sharma","doi":"10.1007/s12243-023-01001-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, the proposed algorithm based on a novel technique for lowering the Near-Far problem in very high-speed digital subscriber line (VDSL) networks is presented. Through graphical results, it is demonstrated that the proposed technique performs better in terms of data rate for multi-user VDSL networks than the conventional IWF algorithm and comes close to the extremely complex OSB algorithm. The suggested algorithm’s complexity is comparable to that of the standard iterative water filling (IWF) algorithm and significantly less than that of the centralized optimal spectrum balancing (OSB) algorithm.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 7-8","pages":"577 - 584"},"PeriodicalIF":1.8000,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Telecommunications","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s12243-023-01001-5","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the proposed algorithm based on a novel technique for lowering the Near-Far problem in very high-speed digital subscriber line (VDSL) networks is presented. Through graphical results, it is demonstrated that the proposed technique performs better in terms of data rate for multi-user VDSL networks than the conventional IWF algorithm and comes close to the extremely complex OSB algorithm. The suggested algorithm’s complexity is comparable to that of the standard iterative water filling (IWF) algorithm and significantly less than that of the centralized optimal spectrum balancing (OSB) algorithm.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种减少多用户VDSL网络近远问题的新技术
本文提出了一种新的算法来降低超高速数字用户线路(VDSL)网络中的近远问题。图形结果表明,在多用户VDSL网络中,该算法的数据速率优于传统的IWF算法,接近于极其复杂的OSB算法。该算法的复杂度与标准迭代充水(IWF)算法相当,显著低于集中式最优谱平衡(OSB)算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Telecommunications
Annals of Telecommunications 工程技术-电信学
CiteScore
5.20
自引率
5.30%
发文量
37
审稿时长
4.5 months
期刊介绍: Annals of Telecommunications is an international journal publishing original peer-reviewed papers in the field of telecommunications. It covers all the essential branches of modern telecommunications, ranging from digital communications to communication networks and the internet, to software, protocols and services, uses and economics. This large spectrum of topics accounts for the rapid convergence through telecommunications of the underlying technologies in computers, communications, content management towards the emergence of the information and knowledge society. As a consequence, the Journal provides a medium for exchanging research results and technological achievements accomplished by the European and international scientific community from academia and industry.
期刊最新文献
Editorial of 6GNet 2023 special issue On the (in)efficiency of fuzzing network protocols Investigation of LDPC codes with interleaving for 5G wireless networks Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism Joint MEC selection and wireless resource allocation in 5G RAN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1