Title :
Hyperimposed convolutional codes
Author_Institution :
California Inst. of Technol., Pasadena, CA, USA
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
Keywords :
Viterbi decoding; computational complexity; convolutional codes; error correction codes; coding gains; decoding complexity; error control codes; hyperimposed convolutional codes; simulation; soft-output Viterbi decoding; suboptimal multistage decoding algorithms; superimposed convolutional codes; turbo codes; Additive noise; Bismuth; Computer errors; Convolutional codes; Decoding; Error probability; Gaussian noise; Random variables; Sections; Viterbi algorithm;
Conference_Titel :
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location :
Dallas, TX
Print_ISBN :
0-7803-3250-4
DOI :
10.1109/ICC.1996.541357