Hyperimposed convolutional codes
J.-F. Cheng
Abstract
J.-F. Cheng
Abstract
New error control codes using superimposed convolutional codes and suboptimal multistage decoding algorithms are proposed. The coding gains of these codes are shown by simulation to be much higher than those of conventional convolutional codes with comparable decoding complexity. The performances of these codes are in fact comparable to turbo codes with soft-output Viterbi decoding but the complexity required is lower.
OpenAlex reports 10 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.
New error control codes using superimposed convolutional codes and suboptimal multistage decoding algorithms are proposed. The coding gains of these codes are shown by simulation to be much higher than those of conventional convolutional codes with comparable decoding complexity. The performances of these codes are in fact comparable to turbo codes with soft-output Viterbi decoding but the complexity required is lower.
Key concepts: Convolutional code, Serial concatenated convolutional codes, Turbo code, Sequential decoding, Computer science, Concatenated error correction code, Viterbi decoder, BCJR algorithm