Abstract
We present a new soft-decision decoding algorithm, modified A* (MA*), that conducts heuristic search through a code tree for a binary (n, k) linear code. MA* improves on the results obtained earlier using Algorithm A*. We also describe the application of the simulated annealing (SA) algorithm to the decoding problem, transformed into a continuous optimization problem.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
| Publisher | IEEE Computer Society |
| Pages | 414 |
| Number of pages | 1 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995 |
Other
| Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
|---|---|
| City | Whistler, BC, Can |
| Period | 9/17/95 → 9/22/95 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems