{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# summary - Summary of schemes with and without...

This preview shows pages 1–2. Sign up to view the full content.

Summary of schemes with and without retransmission No retransmission Given a code with correction capability = 2 1 min d t we have correct reception when there are up to t errors, and incorrect reception when there are more than t errors. P(C)=P(correct block)=P(up to t errors)= t n t n n j n j p p t n p p n p p n p p C P = + + + = = ) 1 ( ... ) 1 ( 1 ) 1 ( 0 ) 1 ( j n ) ( 1 1 0 0 t 0 j If p<<1 we can approximate with the first term: n n p p p n C P ) 1 ( ) 1 ( 0 ) ( 0 0 = j n j p p P P E P + = = = = ) 1 ( j n errors) t than more ( error) block ( ) ( n 1 t j If p<<1 we can approximate with the first term: 1 1 1 1 ) 1 ( 1 ) 1 ( 1 ) ( + + + + t n t t n t p p t n p p t n E P It must be P(E)+P(C)=1 With retransmission

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}