TABLE OF CONTENTS In this chapter, we present some results of BTCs from the literatures and the applications of BTCs or TPCs, in particular. Performance of BTCs using trellis-based and algebraic-based decoding methods are presented. Different constituent codes for BTCs, e.g. BCH, Hamming and single parity check codes are used. BTCs show excellent performance as TCCs do. Thus, the actual power is in the iterative decoding algorithm rather than the codes. BTCs have the benefits of being simple, performing well in high code rate systems and showing less error floor effects due to their large minimum distance. Some results are investigated for AWGN channel, ftat Rician and flat Rayleigh fading channels which mimic the real satellite and wireless communication links. In the next generation communication systems, coding schemes sought are not only for operating at low SNR but also for providing high spectral efficiency. Therefore, the BTCs with different modulation schemes are presented. Moreover, different information lengths, i.e. interleaver size of BTCs are investigated Comparison of TCCs and TPCs are also shown. Finally, the applications of BTCs, focusing on the wireless and satellite communication are presented.
Simulation results of BTCs using BCH and RS codes as constituent codes have been presented in Section 5.3.3.6. The decoding algorithm used is based on modified Chase algorithm. More results from the literatures will be presented in this section.
Performance of Hamming-BTCs is shown in Figure 7.1. This result was presented in [7]. The trellis-based iterative decoding algorithm...
