On hybrid stack decoding algorithms for block codes

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 398-409

  Aguado, L E ^a   Farrell, P G ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; TRELLIS CODES;

HYBRID STACK DECODING; SOFT DECISION DECODING;

DECODING;

EID: 0031701575     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651071     Document Type: Article

References (25)

1. L.E. Aguado-Bayön and P. G. Farrell, "Reducing the complexity o trellises for block codes," presented at ISIT '95, IEEE Int. Symp. o Information Theory (Whistler, BC, Canada, Sept. 1995).
2. N. Belanger, D. Haccoun, and Y. Savaria, "A multiprocessor architectur for multiple path stack sequential decoders," IEEE Trans. Commun., vol 42, pp. 951-957, Feb./Mar./Apr. 1994.
3. L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decodin of linear block codes for minimizing symbol error rate," IEEE Trans Inform. Theory vol. IT-20, pp. 284-287, 1974.
4. J. Belzile and D. Haccoun, "Bidirectional breadth-first algorithms fo the decoding of convolutional codes," IEEE Trans. Commun, vol. 41 pp. 451-457, Feb. 1993.
5. G. Claire, J. Venturatraveset, M. Hollreiser, and E. Biglieri, "Systoli architecture for the VLSI implementation of high speed staged decoder quantizers,"/ VLSI Signal Processing, vol. 10, no. 2, pp. 152-168, 1995.
6. D. Chase, "A class of algorithms for decoding block codes with channe measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp 170-182, 1972.
7. B.G. Dorsch, "A decoding algorithm for binary block codes and /-ar output channels," IEE Trans. Inform. Theory, vol. IT-20, pp. 391-394 May 1974.
8. J. Eiguren, I. I. Dumer, and P. G. Farrell, "Partitioning algorithms fo soft-decision decoding of block codes," presented at ISIT '94, IEEE Int Symp. on Information Theory, Trondheim, Norway, July 1994.
9. L. Ekroot and S. Dolinar, "Maximum-likelihood soft-decision decodin of block codes using the Aalgorithm," The Telecommunications an Data Acquisition Report 42-117, January-March 1994, Jet Propulsio Lab., pp. 129-144, May 15, 1994.
10. M. Esmaeili, T. A. Gulliver, and N. P. Secord, "Quasi-cyclic structur of Reed Muller codes and their smallest regular trellis diagram," Interna Rep. SCE-95-11 from Carleton University, Ottawa, Ont., Canada.
11. D.G. Forney, "Coset codes-Part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
12. __, "Convolutional codes II: Maximum likelihood decoding," Inform Contr., vol. 25, pp. 222-266, July 1974.
13. R.G. Gallager, Information Theory and Reliable Communication. Ne York: Wiley, 1968
14. Y.S. Han, C. R. P. Hartmann, and C. Chen, "Efficient priorityfirst search maximum-likelihood soft-decision decoding of linear bloc codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523 Sept. 1993.
15. B. Honary, G. Markarian, and P. G. Farrell, "Generalised array code and their trellis structure," Electron. Lett., vol. 29, no. 6, pp. 541-542 1993.
16. F. Jelinek, "A fast sequential decoding algorithm using a stack," IB J. Res. Devel, vol. 13, pp. 675-685, 1969.
17. A.B. Kiely, S. Dolinar, R. J. McEliece, L. Ekroot, and W. Lin, "Trelli decoding complexity of linear block codes," preprint, Dec. 1994.
18. R. McEliece, "On the BCJR trellis for linear block codes," preprint Sept. 1994.
19. J.L. Massey, "Foundations and methods of channel encoding," in Proc Int. Conf. on Information, Theory and Systems (Berlin, Germany, Sept 1978).
20. __, "Variable-length codes and the Fano metric," IEEE Trans. Inform Theory, vol. IT-18, Jan. 1972.
21. D.J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform Theory, vol 34, pp. 1049-1053, Sept. 1988.
22. V. Sorokine, F. R. Kschischang, and V. Durand, "Trellis based decodin of binary linear block codes," in Lecture Notes in Computer Science, vol 793. Berlin, Germany: Springer-Verlag, 1994, pp. 270-286.
23. A.J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol IT-13, pp. 260-269, Apr. 1967.
24. J.K. Wolf, "Efficient maximum likelihood decoding of linear bloc codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80 Jan. 1978.
25. K.S. Zigangirov, "Some sequential decoding procedures," Probl. Pered Inform., vol. 2, pp. 13-25, 1966.