Efficient Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes Using Algorithm A
Gespeichert in:
| Titel: | Efficient Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes Using Algorithm A |
|---|---|
| Autoren: | Han, Yunghsiang S., Hartmann, Carlos R.P., Chen, Chih-Chieh |
| Quelle: | Electrical Engineering and Computer Science - Technical Reports |
| Verlagsinformationen: | SURFACE at Syracuse University |
| Publikationsjahr: | 1991 |
| Bestand: | Syracuse University Research Facility And Collaborative Environment (SUrface) |
| Schlagwörter: | Linear Block Codes, Computer Sciences |
| Beschreibung: | In this report we present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This search is guided by an evaluation function f defined to take advantage of the information provided by the received vector and the inherent properties of the transmitted code. This function f is used to drastically reduce the search space and to make the decoding efforts of this decoding algorithm adaptable to the noise level. Simulation results for the ( 48, 24) and the (72, 36) binary extended quadratic residue codes and the (128, 64) binary extended BCH code are given to substantiate the above claim. |
| Publikationsart: | text |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| Relation: | https://surface.syr.edu/eecs_techreports/134; https://surface.syr.edu/context/eecs_techreports/article/1132/viewcontent/SU_CIS_91_42.pdf |
| Verfügbarkeit: | https://surface.syr.edu/eecs_techreports/134 https://surface.syr.edu/context/eecs_techreports/article/1132/viewcontent/SU_CIS_91_42.pdf |
| Dokumentencode: | edsbas.DA0E689D |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | In this report we present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This search is guided by an evaluation function f defined to take advantage of the information provided by the received vector and the inherent properties of the transmitted code. This function f is used to drastically reduce the search space and to make the decoding efforts of this decoding algorithm adaptable to the noise level. Simulation results for the ( 48, 24) and the (72, 36) binary extended quadratic residue codes and the (128, 64) binary extended BCH code are given to substantiate the above claim. |
|---|