Computationally efficient turbo decoding with the bi-directional Viterbi algorithm (BIVA)
M.B. Shoemake, C. Heegard
Abstract
M.B. Shoemake, C. Heegard
Abstract
An algorithm for decoding parallel concatenated codes (turbo codes) that replaces the BCJR algorithm with a new Viterbi type algorithm is presented. Replacement of the BCJR algorithm with the new algorithm results in a gain in computational efficiency with only a slight loss in BER performance.
OpenAlex reports 1 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.
An algorithm for decoding parallel concatenated codes (turbo codes) that replaces the BCJR algorithm with a new Viterbi type algorithm is presented. Replacement of the BCJR algorithm with the new algorithm results in a gain in computational efficiency with only a slight loss in BER performance.
Key concepts: BCJR algorithm, Iterative Viterbi decoding, Soft output Viterbi algorithm, Turbo code, Computer science, Algorithm, Viterbi algorithm, Serial concatenated convolutional codes