Performance Comparison for Serial Concatenated Block Convolutional Codes when Sequentially and Iteratively Decoded

摘要

In this paper, we study the performance of powerful linear block codes such as Hamming and BCH codes when replacing a Reed_Solomon code in a serial concatenated code. We perform simulations for three models with and without an interleaver and for different block lengths. The results show that both Hamming and BCH codes give similar Bit Error Rate (BER) performances, but a Reed_Solomon model gives a better performance. Next, we consider other ways of serial concatenations whereby the decoder is changed from a sequential decoder into an iterative one. The new iterative decoder consists of an outer soft-in soft-out (SISO) decoder, and an inner block decoder that corresponds to the used block encoder. Simulation results showed a degraded BER performance. Then we connect a block encoder serially to a Serial Concatenated Convolutional Code (SCCC), and we connect a block decoder serially to an iterative decoder. The simulation results showed that both Hamming and BCH codes give approximately the same performance that is obtained by the equivalent SCCC. But when using the Reed_Solomon code, a very good performance was achieved when compared to all other models, even the SCCC.