A final-year undergraduate project in error-control coding is discussed. The project consists of the study, software implementation and computer simulation of turbo codes using two different decoding approaches, the Maximum a Posteriori (MAP) and Soft-Output Viterbi Algorithm (SOVA). It combines theory with computer-aided design and provides hands-on experience in the field of channel coding.
BahlL. R.CockeJ.JelinekF. and RavivJ., ‘Optimal decoding of linear codes for minimizing symbol error rate’, IEEE Trans. Information Theory, 20 (1974), 284.
2.
BerrouC.GlavieuxA. and ThitimajshimaP., ‘Near-Shannon limit error-correcting coding and decoding: Turbo codes (1)’, Proc. IEEE Int. Conf. Commun., May (1993), 1064.
3.
CCSDS, ‘Telemetry channel coding’, CCSDS 101.0-B-3 Blue Book, Issue 3, May 1992.
4.
HagenauerJ. and PapkeL., ‘Decoding “Turbo”-Codes with the Soft Output Viterbi Algorithm (SOVA)’, IEEE Int. Symposium on Information Theory, 1994.
5.
BarbulescuS. A. and PietrobonS. S., ‘Terminating the trellis of turbo-codes in the same state’, Electronics Lett., 31 (1995), 22.
6.
JungP. and NaßhanM., ‘Performance evaluation of turbo codes for short frame transmission systems’, Electronics Lett., 30 (1994), 111.
7.
BerrouC. and GlavieuxA., ‘Near optimum error-correcting coding and decoding: Turbo codes’, IEEE Trans. Commun., 44 (1996), 1261.
8.
PietrobonS. S. and BarbulescuS. A., ‘A simplification of the modified Bahl decoding algorithm for systematic convolutional codes’, Int. Symp. Information Theory and Its Applications, Sydney, Australia, 1994, pp. 1073–1077.
