A SOVA decoding algorithm with better performance for Turbo codes
Han X
Abstract
Han X
Abstract
The performance of MAP decoding algorithm is optimal, but its complexity is very high, which affects its implementation in fact. This paper introduces a new decoding algorithm with the performances similar to that of MAP algorithm and with lower complexity, and makes it more perfect .The simulation results show that the new SOVA algorithm performs very close to the MAP algorithm for binary turbo codes.
A significance statement is not available in the OpenAlex record.
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.
The performance of MAP decoding algorithm is optimal, but its complexity is very high, which affects its implementation in fact. This paper introduces a new decoding algorithm with the performances similar to that of MAP algorithm and with lower complexity, and makes it more perfect .The simulation results show that the new SOVA algorithm performs very close to the MAP algorithm for binary turbo codes.
Key concepts: Decoding methods, Computer science, Algorithm, Turbo code, BCJR algorithm, Turbo equalizer, Serial concatenated convolutional codes, Sequential decoding