Pith. sign in

REVIEW

Distributed Raptor Coding for Erasure Channels: Partially and Fully Coded Cooperation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1307.4463 v2 pith:S3TOTXIJ submitted 2013-07-17 cs.IT math.IT

classification cs.ITmath.IT
keywords cooperationcodederasureschemechannelsdegreesystemthroughput
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific erasure probabilities and transmitters have no channel state information. A fully coded cooperation (FCC) and a partially coded cooperation (PCC) strategy are developed to maximize the average system throughput. Both PCC and FCC schemes have been analyzed through AND-OR tree analysis and a linear programming optimization problem is then formulated to find the optimum degree distribution for each scheme. Simulation results show that optimized degree distributions can bring considerable throughput gains compared to existing degree distributions which are designed for point-to-point binary erasure channels. It is also shown that the PCC scheme outperforms the FCC scheme in terms of average system throughput.

Discussion (0). Continue with ORCID to comment.

Pith tools