arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.2516cs.ITmath.IT
收藏

基于图上编码的高吞吐量随机接入:编码时隙ALOHA

High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA

Enrico Paolini, Gianluigi Liva, Marco Chiani

摘要:

在本文中,编码时隙ALOHA(CSA)被引入作为一个强大的随机接入方案的MAC帧。在CSA中,一般用户希望在MAC帧中发送的突发首先被分成段,然后在发送之前通过本地面向分组的代码对这些段进行编码。在接收机侧,执行与本地码的解码相结合的迭代干扰消除以从冲突中恢复。新方案推广了以前提出的不规则重复时隙ALOHA(IRSA)技术,基于一个简单的重复用户的突发。的CSA干扰消除过程的解释作为一个迭代擦除解码过程中的稀疏二分图被确定,并推导出相应的密度演化方程。基于这些方程,渐近最优CSA计划的几个速率和有限数量的用户通过模拟和IRSA的竞争对手相比,他们的性能进行了研究。最高可达0.8。新方案在需要功率效率的情况下被证明是一个很好的候选方案。

英文摘要:

In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then encoded through a local a packet-oriented code prior to transmission. On the receiver side, iterative interference cancellation combined with decoding of the local code is performed to recover from collisions. The new scheme generalizes the previously proposed irregular repetition slotted ALOHA (IRSA) technique, based on a simple repetition of the users' bursts. An interpretation of the CSA interference cancellation process as an iterative erasure decoding process over a sparse bipartite graph is identified, and the corresponding density evolution equations derived. Based on these equations, asymptotically optimal CSA schemes are designed for several rates and their performance for a finite number of users investigated through simulation and compared to IRSA competitors. Throughputs as high as 0.8 are demonstrated. The new scheme turns out to be a good candidate in contexts where power efficiency is required.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑