On blind estimation with reduced complexity in CSS-OFDM systems

Takahiro Kitazawa, K. Ohuchi
{"title":"On blind estimation with reduced complexity in CSS-OFDM systems","authors":"Takahiro Kitazawa, K. Ohuchi","doi":"10.1109/ISSPIT.2016.7886020","DOIUrl":null,"url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) signals suffer from high PAPR (Peak to Average Power Ratio). Cyclic shifted sequences (CSS) was proposed as a solution to high PAPR. CSS reduces PAPR stochastically by giving some independent cyclic shifts to the time-domain signals of clusters. In CSS, however, we must transmit side information (SI) regarding the cyclic shift. Although a blind method to estimate SI at the receiver was also proposed, its computational complexity increases as not only the number of subcarriers but also the degree of multi-level modulation increases. In the present paper, to conquer this drawback, we consider decreasing the number of subcarriers used for estimating SI. This paper shows that we achieve almost the same bit error rate as the conventional scheme with half the number of subcarriers under a certain condition. We also study the relationship between the number of subcarriers per cluster and estimation accuracy.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2016.7886020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Orthogonal Frequency Division Multiplexing (OFDM) signals suffer from high PAPR (Peak to Average Power Ratio). Cyclic shifted sequences (CSS) was proposed as a solution to high PAPR. CSS reduces PAPR stochastically by giving some independent cyclic shifts to the time-domain signals of clusters. In CSS, however, we must transmit side information (SI) regarding the cyclic shift. Although a blind method to estimate SI at the receiver was also proposed, its computational complexity increases as not only the number of subcarriers but also the degree of multi-level modulation increases. In the present paper, to conquer this drawback, we consider decreasing the number of subcarriers used for estimating SI. This paper shows that we achieve almost the same bit error rate as the conventional scheme with half the number of subcarriers under a certain condition. We also study the relationship between the number of subcarriers per cluster and estimation accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CSS-OFDM系统中降低复杂度的盲估计
正交频分复用(OFDM)信号的峰值平均功率比(PAPR)较高。为了解决高PAPR的问题,提出了循环移位序列(CSS)。CSS通过对簇的时域信号进行一些独立的循环移位来随机降低PAPR。然而,在CSS中,我们必须传输关于循环移位的侧信息(SI)。虽然也提出了一种盲估计接收端SI的方法,但随着子载波数量和多级调制程度的增加,该方法的计算复杂度也随之增加。在本文中,为了克服这个缺点,我们考虑减少用于估计SI的子载波的数量。本文表明,在一定条件下,该方案的误码率几乎与传统方案相同,而子载波数量为传统方案的一半。我们还研究了每个聚类的子载波数与估计精度之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Informed Split Gradient Non-negative Matrix factorization using Huber cost function for source apportionment An Identity and Access Management approach for SOA Extracting dispersion information from Optical Coherence Tomography images LOS millimeter-wave communication with quadrature spatial modulation An FPGA design for the Two-Band Fast Discrete Hartley Transform
×
引用
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