Inner and Outer Decoding Performance of Convolutional Codes: Melinda
Inner and Outer Decoding Performance of Convolutional Codes: Melinda
Inner and Outer Decoding Performance of Convolutional Codes: Melinda
A. Convoluitional Codes
Theoretically, a Convolutional code can be classified as
systematic and non-systematic codes [9]. The systematic code
is defined that the encoded codewords consist of the original
inputs bits. While, the non-systematic code expresses reversely
as the systematic scheme.
INTRODUCTION
159
state and also it shows all the state transition with the output
bits.
2) BCJR Process
First of all, the BCJR is begun by taking the a priori LLR
frame L a ( u ) = { L a ( u i ) }I . There is a gamma value (T) ,
i =1
(T ) = P (T fr (T )).Pa ( u i = b T )
(4)
equation (3)
In the forward recursion, alpha value ( ( S(i ,n) ) ) is introduced
by the state S(0,0) [10], which is set to specific by using a priori
LLRs:
(
i ,n) )
(T ).[ fr(T )]
(5)
(S
(
i , n )
[ S ( i , n ) ] =
( S ( i , n ) )
S ( I ,0 )
is
T f r (( S ( i , n ) )
( T ) . [ to ( T ) ]
(6)
(7)
Pp (ui = b ) =
1) BCJR Algorithm
BCJR stands for Bahl, Cocke, Jelinek and Raviv which was the
name of its inventors. It was known as MAP (Maximum A
posteriori) algorithm as well that was discovered by Bahl,
Cocke, Jelinek and raviv in 1974.
P ( b it = 0 )
L ( b its ) = ln
P ( b it = 1)
1
.[ fr (T ))]. (T ). [t 0(T )]
C1
iT =i
bT =b
Pp (T )
(3)
160
(8)
1) EXIT Analysis
The Extrinsic Information Transfer (EXIT) chart was
introduced firstly by Stephan ten Brink [11]. It is applied to
analyse the behaviour of iterative, which is known as Turbo
technique.
2) EXIT Function
By implementing the BCJR algorithm, there will be some a
priori information and a posteriori information which can be
applied here. Basically, the extrinsic information generation
structure is started by encountering an a priori information in
to BCJR decoder, while an a posteriori goes directly to a
modulo-2 adder. At the end of the structure, extrinsic
information is obtained by subtracting a posteriori information
with a priori information. This process can be illustrated by:
Aouter Ainner
Here,
(9)
should be multiplied by both of side,
DECODING PROCESS
Aouter xRinner xNt x log2 (m) Ainner xRinner xNt x log2 (m)
(10)
161
A. Introduction of Parameters
The parameters of Convolutional codes which are used in
this work will be shown in the table below and also the four
types classification of Convolutional codes will be figure out
in the figure below as well.
Table 1. Parameters of Convolutional codes used in the simulation
No.
1
2
3
4
Types of Convolutionalcodes
162
Figure 13. The inverted EXIT function for three type of Convolutional code
Figure 15. The EXIT function for four types parameters of Convolutional
code
(11)
163
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
Figure 16. the channel capacity measurement of Inner Convolutional code
using BPSK modulation over AWGN channel
[10]
[11]
V.
CONCLUSION
[12]
[13]
[14]
[15]
[16]
164