Sort-and-match algorithm for soft-decision decoding

IEEE Transactions on Information Theory

Volumn 45, Issue 7, 1999, Pages 2333-2338

  Dumer, Ilya ^a,b  

^a IEEE

^b University of California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBABILITY; SORTING; SPURIOUS SIGNAL NOISE; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN); BINARY LINEAR CODES; MAXIMUM-LIKELIHOOD DECODING; SOFT-DECISION DECODING;

DECODING;

EID: 0033316797     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796373     Document Type: Article

References (12)

1. M. Ajtai, J. Komlós, and E. Szemeredi, "An O(n log n) sorting network," in Proc. 15th Annu. ACM Symp. Theory of Computing, 1983, pp. 1-9.
2. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, 1974.
3. n," Probl. Pered. Inform., vol. 23, no. 2, pp. 50-53, 1987.
4. I. Dumer, "Suboptimal decoding of linear codes. Partition technique," IEEE Trans. Inform. Theory, vol. 42, pp. 1971-1986, 1996.
5. _, "Ellipsoidal lists and maximum likelihood decoding," IEEE Trans. Inform. Theory, submitted for publication.
6. _, "Two algorithms for decoding linear codes," Probl. Pered. Inform., vol. 25, no. 1, pp. 24-32, 1989.
7. G. S. Evseev, "On the complexity of decoding linear codes," Probl. Pered. Inform., vol. 19, no. 1, pp. 3-8, 1983.
8. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
9. D. E. Knuth, The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969.
10. A. Lafourcade and A. Vardy, "Lower bounds on trellis complexity of block codes "IEEE Trans. Inform. Theory, vol.41, pp. 1938-1952, 1995.
11. J. K. Wolf, "Efficient maximum likelihood decoding of linear codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.
12. V. V. Zyablov and V. R. Sidorenko, "Bounds on complexity of trellis decoding of linear codes," Probl. Pered. Inform., vol. 29, no. 3, pp. 3-9, 1993.