Um Algoritmo de Decodificação Iterativa q-ária para Códigos Turbo Produto

Abstract

— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modification of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is verified that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm