An improved Fischer-Huber loading algorithm for reliable applications on access power line communications

Linyu Wang, E. V. Van Lil, Geert Deconinck
{"title":"An improved Fischer-Huber loading algorithm for reliable applications on access power line communications","authors":"Linyu Wang, E. V. Van Lil, Geert Deconinck","doi":"10.4108/CHINACOM.2010.74","DOIUrl":null,"url":null,"abstract":"The original Fischer-Huber loading algorithm attempts to minimize the probability of bit error by maximizing the signal to noise ratio. Bits are allocated to achieve the same error probability in each of the used subcarriers. However, in channels with a high difference in attenuation like access Power Line Communications (PLC) channels, this could result in overallocation for parts of the subcarriers, which is unreasonable in practice but is neglected during the bit allocation in the algorithm. Furthermore, after defining the upper boundary of constellation, the bit allocation is changed and then the method of flat power allocation generates a bad error probability. In this paper, we present an improved Fischer-Huber loading algorithm for access PLC channels with high attenuation variability. By adding constellation limitations and adjusting the power allocation policy, the improved algorithm appears more flexible. Simulation results show the improved performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International ICST Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/CHINACOM.2010.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The original Fischer-Huber loading algorithm attempts to minimize the probability of bit error by maximizing the signal to noise ratio. Bits are allocated to achieve the same error probability in each of the used subcarriers. However, in channels with a high difference in attenuation like access Power Line Communications (PLC) channels, this could result in overallocation for parts of the subcarriers, which is unreasonable in practice but is neglected during the bit allocation in the algorithm. Furthermore, after defining the upper boundary of constellation, the bit allocation is changed and then the method of flat power allocation generates a bad error probability. In this paper, we present an improved Fischer-Huber loading algorithm for access PLC channels with high attenuation variability. By adding constellation limitations and adjusting the power allocation policy, the improved algorithm appears more flexible. Simulation results show the improved performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种改进的fisher - huber加载算法在接入电力线通信中的可靠应用
原始的fisher - huber加载算法试图通过最大化信噪比来最小化误码概率。分配比特以在每个使用的子载波中实现相同的错误概率。然而,在像接入电力线通信(PLC)信道这样衰减差较大的信道中,这可能会导致部分子载波的过度分配,这在实际中是不合理的,但在算法的比特分配中被忽略了。另外,在确定了星座的上界后,改变了比特的分配方式,使得功率的平坦分配方法产生了较大的错误概率。在本文中,我们提出了一种改进的fisher - huber加载算法,用于访问具有高衰减可变性的PLC信道。通过加入星座限制和调整功率分配策略,改进后的算法更加灵活。仿真结果表明了改进后的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Adaptive QoS mechanism for multimedia applications over next generation vehicular network Improving performance of MPEG-based stream by SCTP multi-streaming mechanism A mobicast routing protocol with carry-and-forward in vehicular ad-hoc networks Application of cyclostationarity to joint signal detection, classification, and blind parameter estimation The capacity region of a product Gaussian broadcast channel with degraded message sets
×
引用
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