Graph configurations and decoding performance

0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The performance of a new method for decoding binary error correcting codes is presented, and compared with established hard and soft decision decoding methods. The new method uses a modified form of the maxsum algorithm, which is applied to a split (partially disconnected) modification of the Tanner graph of the code. Most useful codes have Tanner graphs that contain cycles, so the aim of the split is to convert the graph into a tree graph. Various split graph configurations have been investigated, the best of which have decoding performances close to maximum likelihood.

Cite

CITATION STYLE

APA

Paire, J. T., Coulton, P., & Farrell, P. G. (2001). Graph configurations and decoding performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 158–165). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free