Half-Chase Algorithm of Non-soft Decision Decoding Based on Majority
A non-soft decision decoding algorithm for binary linear block codes transmitted over AWGN channel is presented. Unlike soft decision decoding algorithms, the proposed algorithm does not computing weighted Hamming distances. Based on the majority of code word candidates from the hard decision decodi...
Saved in:
Published in | The 9th International Conference on Advanced Communication Technology Vol. 1; pp. 619 - 621 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.02.2007
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A non-soft decision decoding algorithm for binary linear block codes transmitted over AWGN channel is presented. Unlike soft decision decoding algorithms, the proposed algorithm does not computing weighted Hamming distances. Based on the majority of code word candidates from the hard decision decoding output, the proposed algorithm improves error-correcting performance by 1 dB of coding gain compared to that of hard decision decoding algorithms. Also, a schematic block diagram for finding the codeword of majority is developed. Furthermore, a comparison of hardware complexity is made between the computation of weighted Hamming distances and the finding of majority code word. |
---|---|
ISBN: | 8955191316 9788955191318 |
ISSN: | 1738-9445 |
DOI: | 10.1109/ICACT.2007.358432 |