Name
Title | ||
|---|---|---|
An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding |
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 |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/18.605601 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
new soft-decision maximum-likelihood,hard-decision bounded-distance decoding,bounded-distance decoding,decoding time complexity,input vector,space complexity,generating method,block codes,linear block codes,management information systems,computational complexity,engineering management,degradation,time complexity,indexing terms,information theory | Discrete mathematics,Combinatorics,Concatenated error correction code,Sequential decoding,Berlekamp–Welch algorithm,Computer science,Serial concatenated convolutional codes,Decoding methods,Time complexity,List decoding,Computational complexity theory | Journal |
Volume | Issue | ISSN |
43 | 4 | 0018-9448 |
Citations | PageRank | References |
14 | 1.33 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Kaneko | 1 | 14 | 1.33 |
| T. Nishijima | 2 | 14 | 1.33 |
| Shigeichi Hirasawa | 3 | 78 | 53.22 |