Skip to main content

Table 1 The implementation complexity of the OSD and the POSD

From: Ordered statistics-based list decoding techniques for linear binary block codes

Operation

Complexity

OSD(I1) and OSD(I1,I2)

 

r

2N FLOPS

r ~

N log 2 (N) FLOPS

Gauss el. G

Nmin ( K , N K ) 2 BOPS

r ~ ′′

K + K (NK) BOPS

POSD(I1)≡ISD(I1)

 

r

2N FLOPS

r ~

0 BOPS

POSD(I1,I2)

 

r

2N FLOPS

r ~

K log 2 (K) FLOPS