An efficient decoding algorithm for concatenated RS-convolutional codes
Yueqian Li, Masoud Salehi
Abstract
Yueqian Li, Masoud Salehi
Abstract
In this paper an efficient decoding algorithm is proposed for concatenated coding schemes that use a Reed-Solomon (RS) code as the outer code and a convolutional code as the inner code. We compare the proposed decoding algorithm with Pyndiah's algorithm in terms of both computational complexity and performance. The proposed decoding algorithm reduces the decoding complexity by adopting Kaneko's decoding algorithm without suffering a performance loss. Simulation results are provided to demonstrate the effectiveness of the proposed decoding algorithm.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper an efficient decoding algorithm is proposed for concatenated coding schemes that use a Reed-Solomon (RS) code as the outer code and a convolutional code as the inner code. We compare the proposed decoding algorithm with Pyndiah's algorithm in terms of both computational complexity and performance. The proposed decoding algorithm reduces the decoding complexity by adopting Kaneko's decoding algorithm without suffering a performance loss. Simulation results are provided to demonstrate the effectiveness of the proposed decoding algorithm.
Key concepts: Decoding methods, Sequential decoding, List decoding, Convolutional code, Algorithm, Computer science, Concatenated error correction code, Berlekamp–Welch algorithm