Low-Complexity Symbol Level MMSE Detection for OTFS in Underwater Acoustic Channels

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Lianyou Jing;Qingsong Wang;Wentao Shi;Chengbing He;Nan Zhao;Kunde Yang;Zhunga Liu
{"title":"Low-Complexity Symbol Level MMSE Detection for OTFS in Underwater Acoustic Channels","authors":"Lianyou Jing;Qingsong Wang;Wentao Shi;Chengbing He;Nan Zhao;Kunde Yang;Zhunga Liu","doi":"10.1109/JIOT.2024.3510599","DOIUrl":null,"url":null,"abstract":"Orthogonal time frequency space (OTFS) modulation has garnered significant interest for its robust performance in fast time-varying channels, making it suitable for mobile underwater acoustic (UWA) communication system. This article introduces OTFS modulation to the UWA system and proposes a low-complexity minimum mean-squared error (MMSE) turbo equalization method. Leveraging the characteristics of UWA channels in the delay-Doppler (DD) domain, the method employs symbol-level MMSE equalization. By focusing processing on signals within the DD domain’s interference range, it reduces the channel matrix size, thereby lowering complexity. Given the long delay spread and large Doppler shift of UWA channels, symbol-level MMSE equalization inherently involves high complexity. To mitigate this, we propose two methods to further reduce the computational load associated with matrix inversion. First, we utilize common blocks in the channel matrix and employ a block iterative matrix inversion algorithm to retain computational results, thereby avoiding repeated inversions of the large dimensional matrix. Additionally, we enhance the diagonal dominance property of the channel matrix using the discrete Fourier transform (DFT) matrix. Subsequently, we approximate the inversion using the second-order Neumann series decomposition, further lowering computational complexity. Simulation results and experimental validations at Danjiangkou Lake demonstrate the efficacy of the proposed low-complexity iterative equalization algorithm.","PeriodicalId":54347,"journal":{"name":"IEEE Internet of Things Journal","volume":"12 8","pages":"9954-9964"},"PeriodicalIF":8.9000,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Internet of Things Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10772563/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Orthogonal time frequency space (OTFS) modulation has garnered significant interest for its robust performance in fast time-varying channels, making it suitable for mobile underwater acoustic (UWA) communication system. This article introduces OTFS modulation to the UWA system and proposes a low-complexity minimum mean-squared error (MMSE) turbo equalization method. Leveraging the characteristics of UWA channels in the delay-Doppler (DD) domain, the method employs symbol-level MMSE equalization. By focusing processing on signals within the DD domain’s interference range, it reduces the channel matrix size, thereby lowering complexity. Given the long delay spread and large Doppler shift of UWA channels, symbol-level MMSE equalization inherently involves high complexity. To mitigate this, we propose two methods to further reduce the computational load associated with matrix inversion. First, we utilize common blocks in the channel matrix and employ a block iterative matrix inversion algorithm to retain computational results, thereby avoiding repeated inversions of the large dimensional matrix. Additionally, we enhance the diagonal dominance property of the channel matrix using the discrete Fourier transform (DFT) matrix. Subsequently, we approximate the inversion using the second-order Neumann series decomposition, further lowering computational complexity. Simulation results and experimental validations at Danjiangkou Lake demonstrate the efficacy of the proposed low-complexity iterative equalization algorithm.
水声信道OTFS的低复杂度符号级MMSE检测
正交时频空间(OTFS)调制因其在快速时变信道中的鲁棒性而受到广泛关注,适用于移动水声(UWA)通信系统。本文将OTFS调制引入到UWA系统中,提出了一种低复杂度的最小均方误差(MMSE) turbo均衡方法。该方法利用UWA信道在延迟多普勒(DD)域的特性,采用符号级MMSE均衡。通过集中处理DD域干扰范围内的信号,减小了信道矩阵的尺寸,从而降低了复杂度。考虑到UWA信道的长时延扩展和大多普勒频移,符号级MMSE均衡本身就具有很高的复杂性。为了缓解这一问题,我们提出了两种方法来进一步减少与矩阵反演相关的计算负荷。首先,我们利用通道矩阵中的公共块,并采用块迭代矩阵反演算法来保留计算结果,从而避免了对大维矩阵的重复反演。此外,我们利用离散傅里叶变换(DFT)矩阵增强了信道矩阵的对角优势特性。随后,我们使用二阶诺伊曼级数分解近似反演,进一步降低了计算复杂度。仿真结果和丹江口湖的实验验证验证了所提出的低复杂度迭代均衡算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Internet of Things Journal
IEEE Internet of Things Journal Computer Science-Information Systems
CiteScore
17.60
自引率
13.20%
发文量
1982
期刊介绍: The EEE Internet of Things (IoT) Journal publishes articles and review articles covering various aspects of IoT, including IoT system architecture, IoT enabling technologies, IoT communication and networking protocols such as network coding, and IoT services and applications. Topics encompass IoT's impacts on sensor technologies, big data management, and future internet design for applications like smart cities and smart homes. Fields of interest include IoT architecture such as things-centric, data-centric, service-oriented IoT architecture; IoT enabling technologies and systematic integration such as sensor technologies, big sensor data management, and future Internet design for IoT; IoT services, applications, and test-beds such as IoT service middleware, IoT application programming interface (API), IoT application design, and IoT trials/experiments; IoT standardization activities and technology development in different standard development organizations (SDO) such as IEEE, IETF, ITU, 3GPP, ETSI, etc.
×
引用
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学术官方微信