Zero-forcing precoding using generalized inverses for G.fast DSL systems

Andreas Barthelme, M. Joham, Rainer Strobel, W. Utschick
{"title":"Zero-forcing precoding using generalized inverses for G.fast DSL systems","authors":"Andreas Barthelme, M. Joham, Rainer Strobel, W. Utschick","doi":"10.1109/ACSSC.2017.8335652","DOIUrl":null,"url":null,"abstract":"Previous work on precoding for G.fast systems focused on linear and non-linear precoding techniques to maximize the overall throughput. It has been shown that the existing algorithms almost achieve the sum capacity. However, the rate region does no longer feature a rectangular shape as for VDSL systems, that motivates the utilization of operating points suboptimal w.r.t. sum rate to meet the individual users demands. In these points, the gap between existing zero-forcing techniques and the corresponding weighted sum capacity is significantly larger. Therefore, we propose to improve the linear zero-forcing precoding by employing generalized inverses, for which we present methods that enable us to cope with the large system size of G.fast systems. Our simulations show that our proposed precoding scheme outperforms linear ZF solutions based on the Moore-Penrose pseudoinverse significantly in scenarios with greatly varying user demands.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Previous work on precoding for G.fast systems focused on linear and non-linear precoding techniques to maximize the overall throughput. It has been shown that the existing algorithms almost achieve the sum capacity. However, the rate region does no longer feature a rectangular shape as for VDSL systems, that motivates the utilization of operating points suboptimal w.r.t. sum rate to meet the individual users demands. In these points, the gap between existing zero-forcing techniques and the corresponding weighted sum capacity is significantly larger. Therefore, we propose to improve the linear zero-forcing precoding by employing generalized inverses, for which we present methods that enable us to cope with the large system size of G.fast systems. Our simulations show that our proposed precoding scheme outperforms linear ZF solutions based on the Moore-Penrose pseudoinverse significantly in scenarios with greatly varying user demands.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于广义逆的G.fast DSL系统强制零预编码
以前关于G.fast系统预编码的工作主要集中在线性和非线性预编码技术上,以最大限度地提高总体吞吐量。研究表明,现有的算法几乎达到了和容量。然而,速率区域不再像VDSL系统那样具有矩形形状,这促使利用工作点的次优w.r.t.总和速率来满足单个用户的需求。在这些点上,现有的零强迫技术与相应的加权和能力之间的差距明显更大。因此,我们提出了利用广义逆来改进线性强制零预编码的方法,从而使我们能够应对G.fast系统的大系统规模。我们的仿真表明,在用户需求变化很大的情况下,我们提出的预编码方案明显优于基于Moore-Penrose伪逆的线性ZF方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
milliProxy: A TCP proxy architecture for 5G mmWave cellular systems Joint user scheduling and power optimization in full-duplex cells with successive interference cancellation Deep neural network architectures for modulation classification Towards provably invisible network flow fingerprints Seeded graph matching: Efficient algorithms and theoretical guarantees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1