IST-4-027756 WINNER II D6.13.12 v1.0 Final CG “local area ...

WINNER II D6.13.12 v1.0⎡11⎤⎢ ⎥⎢0 0P = ⎥(5.3)⎢0 0⎥⎢ ⎥⎣11⎦Figure 5.1: BER and CWER vs. SNR results of R = 1/4 (ODS), R = 1/3 (MFD) and R = 1/2 (ODS,punctured) convolutional codes for K = 25 inf. bits (BPSK, AWGN, tail biting)Figure 5.2: BER and CWER vs. E b /N 0 results of R = 1/4 (ODS), R = 1/3 (MFD) and R = 1/2 (ODS,punctured) convolutional codes for K = 25 inf. bits (BPSK, AWGN, tail biting)There is one issue related to the tail-biting Viterbi decoding, which needs to be taken into account –k ( L−1)complexity. The “brute-force” tail-biting algorithm is 2 times more complex than a standard Viterbidecoding with a known tail, where k represents the number of inputs of the convolutional code (R = k/n)Page 21 (86)