空间耦合提升信号图中的多址解调
Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling
摘要:
在随机多址信道中的解调被认为是均匀随机选择的信号与单位能量,一个模型适用于几个现代传输系统。它示出,通过提升(复制)该系统的图形和随机化的图形连接,可以构造一个简单的迭代消除解调器,它实现了相同的性能作为一个最佳的符号检测器的原始系统。迭代检测器的复杂度与用户数量呈线性关系,而直接最佳方法已知是NP难的。然而,该提升图的最大系统负载被限制为α<2.07,即使信噪比变为无穷大-系统是干扰受限的。然后,我们表明,通过引入空间耦合之间的后续解除图形,锚定的初始图形,可以避免这种限制和任意的系统负载是可以实现的。我们的研究结果适用于几个有据可查的系统建议,如IDMA,分区扩展,和某些形式的MIMO通信。
英文摘要:
Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. However, the maximal system load of this lifted graph is limited to α<2.07, even for signal-to-noise ratios going to infinity - the system is interference limited. We then show that by introducing spatial coupling between subsequent lifted graphs, and anchoring the initial graphs, this limitation can be avoided and arbitrary system loads are achievable. Our results apply to several well-documented system proposals, such as IDMA, partitioned spreading, and certain forms of MIMO communications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。