Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
复制标题
DOI：
10.1109/access.2022.3170491
复制
发表时间：
2018-06
期刊：
影响因子：
3.9
通讯作者：
Michel Kulhandjian;Hovannes Kulhandjian;C. D’amours;H. Yanikomeroglu;D. Pados;G. Khachatrian
中科院分区：
文献类型：
--
作者：
Michel Kulhandjian;Hovannes Kulhandjian;C. D’amours;H. Yanikomeroglu;D. Pados;G. Khachatrian
我们考虑的问题，设计一个低复杂度的解码器的对映唯一可解码（UD）/无错码集的过载同步码分多址（CDMA）系统，其中的信号数Ka max是最大的已知给定的码长L。在我们的复杂性分析中，我们说明，相比最大似然（ML）解码器，它具有指数的计算复杂度，即使是中等的代码长度，建议的解码器具有准二次计算复杂度。仿真结果表明，在误码率为10-3时，该译码器的信噪比与ML译码器相比仅下降1 - 2 dB。此外，我们推导出的最小曼哈顿距离的UD码，我们提供的证明命题，这些证明构成的最大用户数Ka max L = 8的形式证明的基础。
We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Ka max is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity. Simulation results in terms of bit-error-rate (BER) demonstrate that the performance of the proposed decoder has only a 1 - 2 dB degradation in signal-to-noise ratio (SNR) at a BER of 10-3 when compared to ML. Moreover, we derive the proof of the minimum Manhattan distance of such UD codes and we provide the proofs for the propositions; these proofs constitute the foundation of the formal proof for the maximum number users Ka max for L = 8.