Decoding linear block codes using optimization techniques

Ching Cheng Shih, Christopher R. Wulff, Carlos R P Hartmann, Chilukuri K Mohan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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 languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE Computer Society
Pages414
Number of pages1
StatePublished - 1995
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: Sep 17 1995Sep 22 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period9/17/959/22/95

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Fingerprint Dive into the research topics of 'Decoding linear block codes using optimization techniques'. Together they form a unique fingerprint.

Cite this