Performance of concatenated tree codes in fading channels

This paper presents the performance of concatenated tree codes in AWGN and frequency non-selective fading channels. It has been shown that the performance of these codes is comparable to that of turbo codes in AWGN channel. However when the performance of these codes in fading environments is investigated there is an error floor problem, so some fading compensation techniques should be applied to offset the problem. Simulation results in AWGN and flat Rayleigh fading channels are also presented. In our simulations we assume a rate Ω code with an interleaver length of 65536 bits long. The constituent code considered is M = 4 where M=J′+J″ and the iteration number is It=18. Firstly the simulations are carried out in the AWGN channel. The results are then compared with the turbo codes under same conditions. Later the simulations are performed in the Rayleigh fading channels and results are compared with some of the other codes. In the end the advantages of these codes over other codes will be presented.