Implementation and performance of a turbo/map decoder

International Journal of Satellite Communications

Volumn 16, Issue 1, 1998, Pages 23-46

  Pietrobon, Steven S ^a  

^a Small World Communications   (Australia)

Author keywords

MAP decoding; Synchronization; Turbo coding

Indexed keywords

BIT ERROR RATE; CODES (SYMBOLS); DECODING; DIGITAL COMMUNICATION SYSTEMS; SYNCHRONIZATION;

TURBO DECODING;

SATELLITE COMMUNICATION SYSTEMS;

EID: 0031651832     PISSN: 07372884     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1247(199801/02)16:1<23::AID-SAT590>3.0.CO;2-W     Document Type: Article

References (54)

1. C. E. Shannon, 'A mathematical theory of communications', Bell Syst. Tech. J., 27, 379-423, 623-656 (1948).
2. P. E. McIllree, 'Channel capacity calculations for M-ary N-dimensional signal sets', MEng Thesis, University of South Australia, 1995.
3. J. P. Odenwalder, 'Optimal decoding of convolutional codes', PhD Dissertation, University of California, Los Angeles, CA, 1970.
4. E. C. Posner, L. L. Rauch and B. D. Madsen, 'Voyager mission telecommunication firsts', IEEE Commun. Mag., 28, 22-27 (1990).
5. S. Dolinar and M. Belongie, 'Enhanced decoding for the Galileo low-gain antenna mission: Viterbi redecoding with four decoding stages', JPL TDA Prog. Rep., 42(121), 96-109 (1995).
6. C. Berrou, A. Glavieux and P. Thitimajshima, 'Near Shannon limit error-correcting coding and decoding: turbo-codes', IEEE Int. Conf. on Communications, Geneva, May 1993, pp. 1064-1070.
7. L. Bahl, J. Cocke, F. Jelinek and J. Raviv, 'Optimal decoding of linear codes for minimizing symbol error rate', IEEE Trans. Info. Theory, IT-20, 284-287 (1974).
8. R. G. Gallager, 'Low'density parity check codes', IRE Trans. Info. Theory, IT-8, 21-28 (1962).
9. A. J. Viterbi, 'Error bounds for convolutional codes and an asymptotically optimum decoding algorithm', IEEE Trans. Info. Theory, IT-13, 260-269 (1967).
10. S. A. Barbulescu, W. Farrell, P. Gray and M. Rice, 'Bandwidth efficient turbo coding for high speed mobile satellite communications', Int. Symp. on Turbo Codes, Brest, September 1997, pp. 119-126.
11. G. Battail, 'Pondération des symbols décodés par l'algorithm de Viterbi', Ann. Télécommun., 42, 1/1-1/8 (1987).
12. J. Hagenauer and P. Hoeher, 'A Viterbi algorithm with soft-decision outputs and its applications', GLOBECOM '89, Dallas TX, November 1989, pp. 47.1.1-47.1.7.
13. J. Huber and A. Rüppel, 'Zuverlässigkeitsabschätzung für die Ausgangssymbole von Trellis decodern', AEÜ (Electron. Commun.), 44, 8-21 (1990).
14. C. Berrou, P. Adde, E. Angui and S. Faudeil, 'A low complexity soft-output Viterbi decoder architecture', IEEE Int. Conf. on Communications, Geneva, May 1993, pp. 737-740.
15. J. Hagenauer, P. Robertson and L. Papke, 'Iterative (turbo) decoding of systematic convolutional codes with the MAP and SOVA algorithms', ITC Tagung, Codierung für Quelle, Kanal und Übertragung, Frankfurt, October 1994, pp. 21-29.
16. C. Berrou and G. Lochon, 'CAS 5093 turbo-code codec', Data Sheet, COMATLAS, Chateaubourg, 1993.
17. M. Jézéquel, C. Berrou, J. R. Inisan and Y. Sichez, 'Test of a turbo-encoder/decoder', Turbo Coding Seminar, Lund, August 1996, pp. 35-42.
18. S. S. Pietrobon and S. A. Barbulescu, 'A simplification of the modified Bahl decoding algorithm for systematic convolutional codes', Int. Symp. on Information Theory and Its Applications, Sydney, November 1994, pp. 1073-1077.
19. P. Robertson, E. Villebrun and P. Hoeher, 'A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain', ICC '95 Seattle, WA, June 1995, pp. 1009-1013.
20. R. W. Chang and J. C. Hancock, 'On receiver structures for channels having memory', IEEE Trans. Info. Theory, IT-12, 463-468 (1966).
21. L. Bahl, J. Cocke, F. Jelinek and J. Raviv, 'Optimal decoding of linear codes for minimizing symbol error rate', IEEE Int. Symp. on Information Theory, Asilomar, CA, May 1972, p. 90.
22. P. L. McAdam, L. R. Welch and C. L. Weber, 'M.A.P. bit decoding of convolutional codes', IEEE Int. Symp. on Information Theory, Asilomar, CA, May 1972, p. 91.
23. P. Robertson, 'Improving decoder and code structure of parallel concatenated recursive systematic (turbo) codes', Int. Conf. on Universal Personal Communications, San Diego, CA, September-October 1994, pp. 183-187.
24. C. Berrou and A. Glavieux, 'Near optimum error correcting coding and decoding: turbo-codes', IEEE Trans. Commun., COM-44, 1261-1271 (1996).
25. J. Erfanian, S. Pasupathy and G. Gulak, 'Reduced complexity symbol detectors with parallel structures for ISI channels', IEEE Trans. Commun., COM-42, 1661-1671 (1994).
26. W. Koch and A. Baier, 'Optimum and sub-optimum detection of coded data disturbed by time varying intersymbol interference', GLOBECOM '90, San Diego, CA, December 1990, pp. 1679-1684.
27. S. S. Pietrobon, 'Implementation and performance of a serial MAP decoder for use in an iterative turbo decoder', IEEE Int. Symp. on Information Theory, Whistler, BC, September 1995, p. 471.
28. E. Villebrun, 'Turbo-decoding with close-to-optimal MAP algorithms', Diploma Thesis, TU Munich, 1994.
29. S. Benedetto, G. Montorsi, D. Divsalar and F. Pollara, 'Soft-output decoding algorithms in iterative decoding of turbo codes', JPL TDA Prog. Rep. 42(124), 63-87 (1996).
30. J. Petersen, 'Implementierungsaspekte zur Symbol-by-Symbol MAP Decodieurung von Faltungscodes', ITG Tagung, Codierung für Quelle, Kanal und Übertragung, Frankfurt, October 1994, pp. 41-48.
31. S. S. Pietrobon, 'Discrete implementation of a NASA planetary standard Viterbi decoder', IREE Int. Electronics Conv. Exhib., Sydney, September 1987, pp. 249-252.
32. S. S. Pietrobon and D. J. Costello Jr., 'A bandwidth efficient coding scheme for the Hubble Space Telescope', J. Elec. Electron. Engng., Aust. 13, 275-282 (1993).
33. The Programmable Logic Data Book, Xilinx, San Jose, CA, 1996.
34. O. M. Collins, 'The subtleties and intricacies of building a constraint length. 15 convolutional decoder', IEEE Trans. Commun., COM-40, 1810-1819 (1992).
35. I. M. Onyszchuk, K.-M. Cheung and O. Collins, 'Quantization loss in convolutional decoding', IEEE Trans. Commun., COM-41, 261-265 (1993).
36. T. A. Summers and S. G. Wilson, 'SNR mismatch and online estimation in turbo decoding', IEEE Trans. Commun., 46, 421-423 (1998).
37. S. S. Pietrobon, J. J. Kasparian and P. K. Gray, 'A multi-D trellis decoder for a 155 Mbit/s concatenated codec', Int. J. Satell. Commun., 12, 539-553 (1994).
38. S. K. Park and K. W. Miller. 'Random number generators: good ones are hard to find', Commun. ACM, 31, 1192-1201 (1988).
39. W. H. Press, B. P. Flannery, S. A. Teukolsky and W. T. Vetterling, Numerical Recipies in C: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1988.
40. P. L'Ecuyer, 'Efficient and portable combined random number generators', Commun. ACM, 31, 742-749, 774 (1988).
41. P. J. Lee, 'Further results on rate 1/N convolutional code constructions with minimum required SNR criterion', IEEE Trans. Commun., COM-34, 395-399 (1986).
42. J. Y. Couleaud, 'High gain coding schemes for space communications', ENSICA Final Year Report, University of South Australia, 1995.
43. S. Benedetto and G. Montorsi, 'Design of parallel concatenated convolutional codes', IEEE Trans. Commun., COM-44, 591-600 (1996).
44. D. Divsalar and F. Pollara, 'Multiple turbo codes for deep-space communications', JPL TDA Prog. Rep. 42(121), 66-77 (1995).
45. S. Benedetto and G. Montorsi, 'Unveiling turbo codes: some results on parallel concatenated coding schemes', IEEE Trans Info. Theory, IT-42, 409-428 (1996).
46. D. Divsalar and F. Pollara, 'On the design of turbo codes', JPL TDA Prog. Rep. 42(123), 99-121 (1995).
47. K. Abend and B. D. Fritchman, 'Statistical detection for communication channels with intersymbol interference', Proc. IEEE, 58, 779-785 (1970).
48. L.-N. Lee, 'Real-time minimal-bit-error probability decoding of convolutional codes', IEEE Trans. Commun., COM-22, 146-151 (1974).
49. K.-H. Tzou and J. G. Dunham, 'Sliding block decoding of convolutional codes', IEEE Trans. Commun., COM-29, 1401-1403 (1981).
50. X. Wang and S. B. Wicker, 'A soft-output decoding algorithm for concatenated codes', IEEE Trans. Info. Theory, IT-42, 543-553 (1996).
51. Y. Li, B. Vucetic and Y. Sato, 'Optimum soft-output detection for channels with intersymbol interference', IEEE Trans. Info. Theory, IT-41, 704-713 (1995).
52. S. A. Barbulescu, 'Iterative decoding of turbo codes and other concatenated codes', PhD Dissertation, University of South Australia, 1996, pp. 23-24.
53. S. S. Pietrobon, 'Efficient implementation of continuous MAP decoders and a synchronisation technique for turbo decoders', Int. Symp. on Information Theory and Its Applications, Victoria, BC, September 1996, pp. 586-589.
54. A. J. Viterbi, 'An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes', IEEE J. Select. Areas Commun., Submitted.