NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Bit Error Probability for Maximum Likelihood Decoding of Linear Block CodesIn this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear codes is investigated. The contribution of each information bit to P(sub b) is considered. For randomly generated codes, it is shown that the conventional approximation at high SNR P(sub b) is approximately equal to (d(sub H)/N)P(sub s), where P(sub s) represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum P(sub b) when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for decoding methods which require a generator matrix with a particular structure such as trellis decoding or algebraic-based soft decision decoding, equivalent schemes that reduce the bit error probability are discussed.
Document ID
19960051321
Acquisition Source
Goddard Space Flight Center
Document Type
Other
Authors
Lin, Shu
(Hawaii Univ. Honolulu, HI United States)
Fossorier, Marc P. C.
(Hawaii Univ. Honolulu, HI United States)
Rhee, Dojun
(LSI Logic Corp. Milpitas, CA United States)
Date Acquired
September 6, 2013
Publication Date
July 10, 1996
Publication Information
Publication: Soft-decision decoding techniques for linear block codes and their error performance analysis
Subject Category
Computer Programming And Software
Accession Number
96N34971
Funding Number(s)
CONTRACT_GRANT: NSF NCR-9415374
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
No Preview Available