DocumentCode :
2385553
Title :
Optimum slope convolutional codes
Author :
Jordan, R. ; Freudenberger, J. ; Pavlouchkov, V. ; Bossert, M. ; Zyablov, V.
Author_Institution :
Dept. of Inf. Technol., Ulm Univ., Germany
fYear :
2000
fDate :
2000
Firstpage :
95
Abstract :
A new family of binary convolutional codes is introduced: the maximum slope (MS) code family. MS codes are defined such, that there exist no other rate R=b/c binary convolutional code with the same free distance df and overall constraint length v, whose lower bounds on the active distance family exhibit a larger slope. Tables for the rate R=1/2 maximum slope code family with memory m=1, 2,…,5 are given. Furthermore, tables for new rate R=(c-1)/c, c=2, 3,…, 5, punctured convolutional codes with optimum free distance codes and MS mother codes are given. Simulation results for woven convolutional codes with MS component codes are presented. It is shown, that the component code choice makes a tradeoff between df and α
Keywords :
binary codes; convolutional codes; BER performance; MS component codes; active distance family; binary convolutional codes; constraint length; free distance; lower bounds; maximum slope code family; maximum slope mother codes; optimum free distance codes; optimum slope convolutional codes; punctured convolutional codes; simulation results; woven convolutional codes; Bit error rate; Concatenated codes; Convolutional codes; Decoding; Encoding; Error correction codes; Hamming weight; Information technology; Transfer functions; Turbo codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
Type :
conf
DOI :
10.1109/ISIT.2000.866385
Filename :
866385
Link To Document :
بازگشت