An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

Author

Kaneko, Toshimitsu ; Nishijima, Toshihisa ; Hirasawa, Shigeichi

Author_Institution

Inf. & Commun. Syst. Lab., Toshiba Corp., Kawasaki, Japan

Volume

43

Issue

4

fYear

1997

fDate

7/1/1997 12:00:00 AM

Firstpage

1314

Lastpage

1319

Abstract

A new soft-decision maximum-likelihood decoding algorithm is proposed, which generates a set of candidate codewords using hard-decision bounded-distance decoding. By improving the generating method of input vectors for the bounded-distance decoding due to Kaneko et al. (see ibid., vol.40, no.3, p.320-27, 1994), the decoding time complexity is reduced without degradation of the performance. The space complexity is dependent on the bounded-distance decoding

Keywords

block codes; computational complexity; linear codes; maximum likelihood decoding; codewords; decoding time complexity reduction; hard decision bounded distance decoding; input vectors generation; linear block codes; soft decision maximum likelihood decoding algorithm; space complexity; Block codes; Degradation; Engineering management; Information theory; Laboratories; Management information systems; Maximum likelihood decoding; Performance loss; Research and development; Systems engineering and theory;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.605601

Filename

605601