A Joint MLSD Receiver for Meteor Burst Communication

Zan Li, Jiangbo Si, Feng Lan, Xiaojun Chen
{"title":"A Joint MLSD Receiver for Meteor Burst Communication","authors":"Zan Li, Jiangbo Si, Feng Lan, Xiaojun Chen","doi":"10.1109/WCNC.2009.4917509","DOIUrl":null,"url":null,"abstract":"According to the characteristics of meteor burst channels, variable rate data transmission is often employed to improve the average system throughput, and the time-varying meteor channel in the presence of multi-path rays brings difficulties in both data detection and channel estimation at the receiver. As we know, per-survivor processing (PSP) based on the joint data and channel estimation of maximum likelihood sequence detection (MLSD) is often considered to obtain the optimal detection performance for time-varying channels. However, the great computational complexity of PSP is the major problem in practice. In this paper we propose an adaptive state reduction of PSP (ASRP) algorithm with few states in the trellis diagram for exponential decay of meteor channels. Based on the estimation of the meteor channel parameters, the adaptive threshold is derived to select the states close to the right one in the trellis to reduce the complexity of PSP. Theoretical analysis and computer simulations results show that the ASRP we proposed provides suboptimal performance and makes good tradeoff between the performance and the computational complexity, so that the reliable data transmission can be realized for MBC systems with adaptive modulation and coding (AMC).","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2009.4917509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

According to the characteristics of meteor burst channels, variable rate data transmission is often employed to improve the average system throughput, and the time-varying meteor channel in the presence of multi-path rays brings difficulties in both data detection and channel estimation at the receiver. As we know, per-survivor processing (PSP) based on the joint data and channel estimation of maximum likelihood sequence detection (MLSD) is often considered to obtain the optimal detection performance for time-varying channels. However, the great computational complexity of PSP is the major problem in practice. In this paper we propose an adaptive state reduction of PSP (ASRP) algorithm with few states in the trellis diagram for exponential decay of meteor channels. Based on the estimation of the meteor channel parameters, the adaptive threshold is derived to select the states close to the right one in the trellis to reduce the complexity of PSP. Theoretical analysis and computer simulations results show that the ASRP we proposed provides suboptimal performance and makes good tradeoff between the performance and the computational complexity, so that the reliable data transmission can be realized for MBC systems with adaptive modulation and coding (AMC).
用于流星突发通信的联合MLSD接收机
根据流星突发信道的特点,通常采用变速数据传输来提高系统的平均吞吐量,而时变流星信道在多径射线存在下,给接收机的数据检测和信道估计带来了困难。众所周知,基于最大似然序列检测(MLSD)的联合数据和信道估计的每幸存者处理(PSP)通常被认为是获得时变信道最优检测性能的一种方法。然而,在实际应用中,PSP的计算复杂度是主要问题。本文针对流星信道的指数衰减,提出了一种网格图中状态少的自适应状态约简算法。在对流星信道参数估计的基础上,导出自适应阈值,在网格中选择最接近正确的状态,以降低PSP的复杂度。理论分析和计算机仿真结果表明,本文提出的ASRP算法在性能和计算复杂度之间取得了较好的平衡,能够在自适应调制编码(AMC)的MBC系统中实现可靠的数据传输。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信