Title :
Search procedures for very low rate quasi-optimal convolutional codes
Author :
Lefrançois, Stéphan ; Haccoun, David
Author_Institution :
Dept. de Genie Electr. et Inf., Ecole Polytech., Montreal, Que., Canada
fDate :
27 Jun-1 Jul 1994
Abstract :
The applications of low rate convolutional codes in code division multiple access (CDMA) and high error rate channels is well known. Unfortunately, in searching for optimal long constraint length and very low rate codes the computational effort is prohibitive. A method for generating quasi-optimum new very low rate(1/10⩽R⩽1/3) and moderately long constraint length (K⩽14) codes is presented. These codes have the interesting characteristics of being rate compatible and easy to generate. The codes presented in this paper provide superior performances to the known low rate codes of the same rates and constraint lengths
Keywords :
channel capacity; channel coding; code division multiple access; coding errors; convolutional codes; error statistics; optimisation; search problems; telecommunication channels; CDMA; code division multiple access; error performance; high error rate channels; nested convolutional codes; optimal long constraint length codes; quasi-optimal convolutional codes; rate compatible codes; search procedures; very low rate codes; Character generation; Computational complexity; Computer architecture; Convolutional codes; Error analysis; Multiaccess communication; Performance analysis;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.395018
