基于低复杂度哈夫曼编码的自适应空间调制

IF 3.7 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2024-09-24 DOI:10.1109/LCOMM.2024.3467169

Gangfei Hu;Yukun Yang;Pingping Shang;Yuyang Peng;Poongundran Selvaprabhu;Han Hai

{"title":"基于低复杂度哈夫曼编码的自适应空间调制","authors":"Gangfei Hu;Yukun Yang;Pingping Shang;Yuyang Peng;Poongundran Selvaprabhu;Han Hai","doi":"10.1109/LCOMM.2024.3467169","DOIUrl":null,"url":null,"abstract":"Adaptive spatial modulation (ASM) is a novel technology in multiple-input-multiple-output (MIMO) systems, which dynamically adjusts the modulation order of the transmit antenna based on the constantly changing channel state information (CSI). The combination of ASM and Huffman coding, using the Huffman method, allows for flexible spatial symbols to provide different activation probabilities for the transmit antenna. However, the exhaustive search conducted by Huffman-ASM requires a large number of candidate combinations to identify the optimal modulation combination. This results in high computational complexity and a heavy feedback burden. To address the challenge, this letter proposes a low-complexity algorithm based on the Huffman-ASM scheme. This scheme does not include all candidate combinations in the calculation but directly selects several optimal candidate combinations based on channel gain sorting; therefore, it reduces system complexity and alleviates the burden on the feedback path. The simulation results indicate that, compared to the conventional scheme, the proposed scheme exhibits only a slight decrease in performance while significantly reducing computational complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2468-2472"},"PeriodicalIF":3.7000,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low-Complexity Huffman Coding-Based Adaptive Spatial Modulation\",\"authors\":\"Gangfei Hu;Yukun Yang;Pingping Shang;Yuyang Peng;Poongundran Selvaprabhu;Han Hai\",\"doi\":\"10.1109/LCOMM.2024.3467169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Adaptive spatial modulation (ASM) is a novel technology in multiple-input-multiple-output (MIMO) systems, which dynamically adjusts the modulation order of the transmit antenna based on the constantly changing channel state information (CSI). The combination of ASM and Huffman coding, using the Huffman method, allows for flexible spatial symbols to provide different activation probabilities for the transmit antenna. However, the exhaustive search conducted by Huffman-ASM requires a large number of candidate combinations to identify the optimal modulation combination. This results in high computational complexity and a heavy feedback burden. To address the challenge, this letter proposes a low-complexity algorithm based on the Huffman-ASM scheme. This scheme does not include all candidate combinations in the calculation but directly selects several optimal candidate combinations based on channel gain sorting; therefore, it reduces system complexity and alleviates the burden on the feedback path. The simulation results indicate that, compared to the conventional scheme, the proposed scheme exhibits only a slight decrease in performance while significantly reducing computational complexity.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"28 11\",\"pages\":\"2468-2472\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2024-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10689616/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10689616/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

自适应空间调制（ASM）是多输入多输出（MIMO）系统中的一项新技术，可根据不断变化的信道状态信息（CSI）动态调整发射天线的调制顺序。ASM 与哈夫曼编码相结合，使用哈夫曼方法，可以灵活地使用空间符号，为发射天线提供不同的激活概率。然而，Huffman-ASM 进行的穷举搜索需要大量的候选组合来确定最佳调制组合。这导致计算复杂度高，反馈负担重。为应对这一挑战，本文提出了一种基于 Huffman-ASM 方案的低复杂度算法。该方案在计算时不包括所有候选组合，而是根据信道增益排序直接选择几个最佳候选组合，因此降低了系统复杂度，减轻了反馈路径的负担。仿真结果表明，与传统方案相比，拟议方案的性能仅略有下降，而计算复杂度却大大降低。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Low-Complexity Huffman Coding-Based Adaptive Spatial Modulation

Adaptive spatial modulation (ASM) is a novel technology in multiple-input-multiple-output (MIMO) systems, which dynamically adjusts the modulation order of the transmit antenna based on the constantly changing channel state information (CSI). The combination of ASM and Huffman coding, using the Huffman method, allows for flexible spatial symbols to provide different activation probabilities for the transmit antenna. However, the exhaustive search conducted by Huffman-ASM requires a large number of candidate combinations to identify the optimal modulation combination. This results in high computational complexity and a heavy feedback burden. To address the challenge, this letter proposes a low-complexity algorithm based on the Huffman-ASM scheme. This scheme does not include all candidate combinations in the calculation but directly selects several optimal candidate combinations based on channel gain sorting; therefore, it reduces system complexity and alleviates the burden on the feedback path. The simulation results indicate that, compared to the conventional scheme, the proposed scheme exhibits only a slight decrease in performance while significantly reducing computational complexity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.