Discreteness-Aware Decoding for Overloaded Non-Orthogonal STBCs via Convex Optimization

Discreteness-Aware Decoding for Overloaded Non-Orthogonal STBCs via Convex Optimization
复制标题

通过凸优化对重载非正交 STBC 进行离散感知解码

DOI:
10.1109/lcomm.2018.2866446
复制
发表时间:
2018
期刊:
IEEE Communications Letters
影响因子:
--
通讯作者:
R. Hayakawa and K. Hayashi
R. Hayakawa and K. Hayashi
中科院分区:
--
文献类型:
--
作者:
I. Maruyama;T. Ohkubo;T. Haji;R. Kurihara;徳永夏樹・内山雄介・津旨大輔・山田正俊・立田 穣・石丸 隆・伊藤友加里・渡邉 豊・池原 研・福田美保;R. Hayakawa and K. Hayashi

文献摘要

相似文献

本文提出了一种在多输入多输出系统中,当不同发送流的数目大于接收天线的数目时,非正交空时分组码(NO-STBC)的译码方案。对于欠定解码问题,我们迭代地解决一个凸优化问题的目标函数中的参数的更新,这利用了传输符号的离散性。对于基于循环除代数的NO-STBC,我们可以利用码的结构来降低算法的计算复杂度。仿真结果表明,该算法在大规模过载的NO-STBC中的译码性能优于传统的译码方案。
This letter proposes a decoding scheme for non-orthogonal space-time block codes (NO-STBCs) in overloaded multiple-input multiple-output systems, where the number of different transmitted streams is greater than that of receive antennas. For the underdetermined decoding problem, we iteratively solve a convex optimization problem with the update of the parameters in the objective function, which utilizes the discreteness of the transmitted symbols. For the NO-STBC based on cyclic division algebra, we can reduce the order of computational complexity of the algorithm by taking advantage of the structure of the code. Simulation results show that the proposed algorithm outperforms conventional schemes in the decoding of large-scale overloaded NO-STBCs.