同步CDMA系统中唯一可译码的三进制码
Uniquely Decodable Ternary Codes for Synchronous CDMA Systems
摘要：
在本文中，我们考虑的问题，递归设计唯一可解码的三元码集的高过载同步码分多址（CDMA）系统。所提出的代码集实现了更大数量的用户$K < K_{max}^t$比任何其他已知的国家的最先进的三进制码，提供低复杂度的解码器在有噪声的传输。此外，我们提出了一个简单的解码器，只使用了几个比较，可以让用户唯一恢复的信息位。最大似然（ML）解码器，即使是中等的代码长度，具有高的计算复杂性相比，提出的解码器具有低得多的计算复杂性。我们还推导了所提出的递归解码器的计算复杂性解析。仿真结果表明，该译码器的性能与ML译码器相当。
英文摘要：
In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K < K_{max}^t$ than any other known state-of-the-art ternary codes that offer low-complexity decoders in the noisy transmission. Moreover, we propose a simple decoder that uses only a few comparisons and can allow the user to uniquely recover the information bits. Compared to maximum likelihood (ML) decoder, which has a high computational complexity for even moderate code length, the proposed decoder has much lower computational complexity. We also derived the computational complexity of the proposed recursive decoder analytically. Simulation results show that the performance of the proposed decoder is almost as good as the ML decoder.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
