Design of Majority-Logic Decoders for the Shortened Reed-Muller Code in TETRA

The attractiveness of majority-logic decoding is its simple implementation. However, it provides a modest amount of coding gain. A modified Massey's majority-logic decoding algorithm is proposed to improve error-correcting performance. With hard-decision and soft-decision, the modified algorith...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2007 IEEE Wireless Communications and Networking Conference s. 704 - 707
Hlavní autoři: Peng Zhang, Siliang Wu, Dongping Yao, Zhenhui Tan
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2007
Témata:
Block codes
Communications Society
Decoding
Error correction codes
Linear code
Parity check codes
Performance gain
Table lookup
Telecommunication standards
Vectors
ISBN:1424406587, 9781424406586
ISSN:1525-3511
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The attractiveness of majority-logic decoding is its simple implementation. However, it provides a modest amount of coding gain. A modified Massey's majority-logic decoding algorithm is proposed to improve error-correcting performance. With hard-decision and soft-decision, the modified algorithm is applied to decode the (30,14) shortened Reed-Muller (RM) code in TETRA as well as syndrome algorithm, Massey's majority-logic algorithm, and Rudolph's majority-logic algorithm. Simulation results show that, the proposed modified algorithm can provide more coding gain than the original Massey's algorithm, the modified scheme has the best performance of error correction among four hard-decision schemes, and the Rudolph's scheme outperforms the other three schemes in the case of soft-decision.
ISBN:1424406587
9781424406586
ISSN:1525-3511
DOI:10.1109/WCNC.2007.135