PLC信道中自适应循环前缀长度OFDM的位加载算法

S. D'Alessandro, A. Tonello, L. Lampe
{"title":"PLC信道中自适应循环前缀长度OFDM的位加载算法","authors":"S. D'Alessandro, A. Tonello, L. Lampe","doi":"10.1109/ISPLC.2009.4913425","DOIUrl":null,"url":null,"abstract":"The achievable rate of OFDM systems is not necessarily maximized when deploying a cyclic prefix (CP) as long as the channel impulse response. Even though for shorter CP lengths both inter-symbol and inter-carrier interference do occur, the rate gain offered by a shortened CP may exceed the losses due to interference. In this paper we address the problem of CP length adaptation and we propose practical bit-loading algorithms that include the CP adaptation.","PeriodicalId":321296,"journal":{"name":"2009 IEEE International Symposium on Power Line Communications and Its Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Bit-loading algorithms for OFDM with adaptive cyclic prefix length in PLC channels\",\"authors\":\"S. D'Alessandro, A. Tonello, L. Lampe\",\"doi\":\"10.1109/ISPLC.2009.4913425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The achievable rate of OFDM systems is not necessarily maximized when deploying a cyclic prefix (CP) as long as the channel impulse response. Even though for shorter CP lengths both inter-symbol and inter-carrier interference do occur, the rate gain offered by a shortened CP may exceed the losses due to interference. In this paper we address the problem of CP length adaptation and we propose practical bit-loading algorithms that include the CP adaptation.\",\"PeriodicalId\":321296,\"journal\":{\"name\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Power Line Communications and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPLC.2009.4913425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Power Line Communications and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPLC.2009.4913425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

当部署循环前缀(CP)时,OFDM系统的可实现速率不一定是最大的,只要信道脉冲响应。即使对于较短的CP长度,也会发生符号间和载波间的干扰,缩短的CP提供的速率增益可能超过干扰造成的损失。在本文中,我们解决了CP长度自适应的问题,并提出了实用的包含CP自适应的比特加载算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bit-loading algorithms for OFDM with adaptive cyclic prefix length in PLC channels
The achievable rate of OFDM systems is not necessarily maximized when deploying a cyclic prefix (CP) as long as the channel impulse response. Even though for shorter CP lengths both inter-symbol and inter-carrier interference do occur, the rate gain offered by a shortened CP may exceed the losses due to interference. In this paper we address the problem of CP length adaptation and we propose practical bit-loading algorithms that include the CP adaptation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信