Professional Documents
Culture Documents
These codes perform better for large interleaver length. However, an interleaver with large length has more time latency as each decoder requires longer delay in interleaving and deinterleaving the received bits.
BER performance of ILCHTC is better than that of LCHTC as error convergence of ILCHTC is better than that of LCHTC.
decoder.
For the interleaver length of N, trellis length for TCC decoder is N times the number of constituent codes. For ILCHTC, maximum trellis
length is N
A. Constituent Encoder
A sequence of information bits is arranged in a
rectangular array of size . Alternatively, an (+((1))) information bit is denoted by (, ). d = {(, )}, 1 1 The Zigzag parity vector z of constituent encoder is, z = { ()}, 1
(m)
(m)
( )
(, ) + ()( 1)]2,
J j 1
where 1
First, L rows of the array of information bits are encoded using a rate-1/2 RSC code. Parity vector of RSC for row of information array in first constituent encoder is,
Random interleaver is used to interleave N information bits. N information bits are arranged in array.
-condition is realized in each of the J rows of array. -condition ensures that the short distance between two errors is
mapped to the long distance by keeping at least distance between the columns of () and () of array. If < Then, () () > , 0 <
Soft In Soft Out A Posteriori Probability (APP) is used for decoding Zigzag-Convolutional codes of first constituent decoder.
A priori values of Log Likelihood Ratio (LLR) of
received information bits are computed. LLRs are arranged in an array of size .
ii. A damping factor, D, is applied to a posteriori LLR found in step (i). This ensures that LLRs are successfully updated in a gradual way.
iii. Decode each column of the array using, output of (ii) as a priori
LLRs for Zigzag decoder.
required by a decoder.
= 8 = [(16 + 2) ] 2
For the interleaver length of N = 1452, BER of 105 is achieved at / = 1.9 dB for ILCHTC which is 0.4 dB more than that for TCC.
Since TCC requires 10% less number of iterations and 50% more
computations/per iteration than ILCHTC the computational complexity of overall ILCHTC decoder is 45% less than that of TCC decoder.