Turbo-like codes: Design for high speed decoding

Turbo-like Codes: Design for High Speed Decoding

Volumn , Issue , 2007, Pages 1-84

  Abbasfar, Aliazam ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891458366     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4020-6391-6     Document Type: Book

References (34)

1. A. Abbasfar and K. Yao, An efficient and practical architecture for high speed turbo decoders, Vol. 1, Proceedings of VTC, October 2003, pp. 337-341.
2. A. Abbasfar and K. Yao, Interleaver design for high speed turbo decoders, Vol. 5205, Proceedings of SPIE, August 2003, pp. 282-290.
3. A. Abbasfar and K. Yao, An efficient architecture for high-speed turbo decoders, Proceedings of ICASSP 2003, April 2003, pp. IV-521-IV-524.
4. S. Aji and R. J. McEliece, The generalized distributed law, IEEE Trans. Inform. Theory, March 2000, 32(1), 325-343.
5. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimum symbol error rate, IEEE Trans. Inform. Theory, March 1974, 284-287.
6. S. Bennedetto, D. Divsalar, G. Montorsi, and F. Pollara, Soft-input soft-output APP module for iterative decoding of concatenated codes, IEEE Commun. Lett., January 1997, 22-24.
7. S. Bennedetto, D. Divsalar, G. Montorsi, and F. Pollara, Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding, IEEE Trans. Inform. Theory, May 1998, 44(3), 909-926.
8. S. Bennedetto and G. Montorsi, Unveiling turbo codes: some results on parallel concatenated codes, IEEE Trans. Inform. Theory, March 1996, 42(2), 409-428.
9. C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error correcting coding and decoding: turbo codes, Proceedings of the 1993 IEEE International Conference on Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
10. D. Divsalar, A simple tight bound on error probability of block codes with application to turbo codes, JPL TMO Progress Report 42-139, November 1999, pp. 1-35.
11. D. Divsalar, S. Dolinar, and F. Pollara, Iterative turbo decoder analysis based on Gaussian density evolution, IEEE J. Select. Areas Commun., May 2001, 19(5), pp. 891-907.
12. D. Divsalar, H. Jin, and R. J. McEliece, Coding theorems for turbo-like codes, Proceedings of the 36th Allerton Conference on Communication, Control and Computing, September 1998, Allerton House, Monticello, IL, pp. 201-210.
13. B. J. Frey, F. R. Kschischang, and P. G. Gulak, Concurrent turbo-decoding, Proceedings of the IEEE International Symposium on Information Theory, July 1997, Ulm, Germany, p. 431.
14. R. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
15. J. Hsu and C. H. Wang, A parallel decoding scheme for turbo codes, Vol. 4, IEEE Symposium on Circuits and Systems, Monterey, June 1998, pp. 445-448.
16. H. Jin, Analysis and Design of Turbo-like Codes. Ph. D. thesis, California Institute of Technology, Pasadena, 2001.
17. H. Jin, A. Khandekar, and R. McEliece, Irregular repeat-accumulate codes, in: Proceedings of the 2nd International Symposium on Turbo Codes, Brest, France, 2000, pp. 1-8.
18. F. R. Kschischang and B. J. Frey, Iterative decoding of compound codes by probability propagation in graphical models, IEEE J. Select. Areas Commun., February 1998, 16(2), 219-230.
19. S. L. Lauritzen and D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their applications in expert systems, J. R. Stat. Soc. B., 1988, 50, 157-224.
20. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, Practical low-resilient codes, Proceedings of 29th Symposium on Theory of Computing, 1997, pp. 150-157.
21. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, Improved low-density parity-check codes using irregular graphs, IEEE Trans. Inform. Theory, 2001, 47, 585-598.
22. D. J. C. MacKay and R. M. Neal, Good codes based on very sparse matrices, in: C. Boyd (ed.). Cryptography and Coding, 5th IMA Conference, No. 1025 in Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 100-111.
23. D. J. C. MacKay, Good error correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory, 1999, 45(2), 399-431.
24. R. J. McEliece, D. J. C. MacKay, and J. F. Cheng, Turbo decoding as an instance of Pearl's belief propagation algorithm, IEEE J. Select. Areas Commun., February 1998, 16(2), 140-152.
25. J. Pearl, Fusion, propagation, and structuring in belief networks, Artif. Intell., 1986, 29, 242-288.
26. G. Poltyrev, Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Trans. Inform. Theory, 40(10), 1261-1271.
27. T. Richardson and R. Urbanke, The capacity of low density parity check codes under message passing decoding, IEEE Trans. Inform. Theory, February 2001, 47(2), 599-618.
28. T. Richardson, M. A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans. Inform. Theory, February 2001, 47(2), 619-637.
29. Richardson et al., Methods and apparatus for decoding LDPC codes, United States Patent 6, 633, 856, October 14, 2003.
30. C. E. Shannon, A mathematical theory of communications, Bell Syst. Tech. J., 1948, 27, 379-423.
31. R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, 1981, IT-27, 533-547.
32. Jeremy Thorpe, Low Density Parity Check (LDPC) Codes Constructed from Protograhs, JPL INP Progress Report 42-154, August 15, 2003.
33. A. J. Viterbi and A. M. Viterbi, An improved union bound for binary input linear codes on AWGN channel, with applications to turbo decoding, Proceedings of IEEE Information Theory Workshop, February 1998.
34. N. Wiberg, Codes and Decoding on General Graphs. Linköping Studies in Science and Technology. Dissertation no. 440. Linköping University, Linköping, Sweden, 1996.