Abstract
An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's Algorithm was proposed by Han, Hartmann, and Chen. We propose an even more efficient new version of this algorithm. An upper bound on the number of nodes searched by this new decoding algorithm is derived and a suboptimal decoding algorithm is also proposed.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
| Publisher | IEEE Computer Society |
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering