DocumentCode
3476296
Title
An upper bound on turbo code free distance
Author
Blackert, W.J. ; Hall, E.E. ; Wilson, S.G.
Author_Institution
Commun. Syst. Lab., Virginia Univ., Charlottesville, VA, USA
Volume
2
fYear
1996
fDate
23-27 Jun 1996
Firstpage
957
Abstract
An upper bound on the free distance of turbo codes is developed by treating the codes as linear block codes and exploiting properties of the resulting generator matrix. The free distance upper bound is then used to lower bound the performance of turbo codes
Keywords
block codes; convolutional codes; linear codes; matrix algebra; bit error probability; free distance; generator matrix; linear block codes; lower bound; punctured codes; recursive systematic convolutional encoder; turbo codes; upper bound; Automata; Block codes; Convolutional codes; Interleaved codes; Laboratories; Maximum likelihood decoding; Turbo codes; Upper bound;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ICC.1996.541353
Filename
541353
Link To Document