| Summary: | 碩士 === 長庚大學 === 電機工程研究所 === 96 === A new fast soft-decision decoding algorithm for binary linear block codes is proposed in this thesis. Different than other algorithms using the threshold base on the signal-to-noise ratio to stop the decoding process, the proposed algorithm utilizes the flip of the least reliable bit according to the error weights to reduce the computational complexity. This reduces the computational complexity compared to the Chase algorithm which needs to test large amount of error patterns.
The purpose of the thesis is to present a new approach to reduce a significant amount of decoding complexity by sacrificing less coding gain.
Furthermore, in terms of test patterns, decoding complexity is reduced to 20% on average, compared to that of Chase algorithm with dmin-1 tested positions. At the block-error rate=10-5, the coding gain just reduced at the expense of about 0.1dB to 0.5dB.
|
|---|
