二进制同步重载CDMA中的准最优签名矩阵
Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA
摘要：
无线通信网络中持续存在的带宽限制使得研究者们将目光转向了分析过载码分多址（CDMA）的前景。本文提出了一种用遗传算法搜索二进制输入同步码分多址系统的最佳特征矩阵的方法。在本文中考虑的最优性的主要措施，是每个用户的信道容量的整个多址系统。我们得到的矩阵不同于著名的Welch边界相等（WBE）代码，关于我们的注意力是专门针对二进制，而不是高斯，输入分布。由于设计的基础上信道容量是计算昂贵的，我们集中在引入一组替代标准，不仅加快矩阵形成过程，但也保持最优性。比特出错率（BER）和星座度量是我们的主要标准命题。仿真结果也验证了我们的分析理由。
英文摘要：
The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is computationally expensive, we have focused on introducing a set of alternative criteria that not only speed up the matrix formation procedure, but also maintain optimality. The Bit Error Rate (BER) and Constellation measures are our main criteria propositions. Simulation results also verify our analytical justifications.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
