Lossy Joint Source-Channel Coding Using Raptor Codes

Figure 12

Relative overhead 𝑁^𝑝(𝑖)/𝑁^𝑝(0) versus PSNR^(𝑖)=−10log₁₀𝐷^(𝑖) produced by the greedy allocation algorithm for the case 𝐵=3. We notice that the bitplane coding overheads are incremented one at a time, in sequence.