Design of majority-logic decoders for the shortened Reed-Muller code in TETRA

  • Peng Zhang*
  • , Siliang Wu
  • , Dongping Yao
  • , Zhenhui Tan
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

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 modifled 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.

Original languageEnglish
Title of host publication2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Pages705-708
Number of pages4
DOIs
Publication statusPublished - 2007
Event2007 IEEE Wireless Communications and Networking Conference, WCNC 2007 - Kowloon, China
Duration: 11 Mar 200715 Mar 2007

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

Conference2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Country/TerritoryChina
CityKowloon
Period11/03/0715/03/07

Keywords

  • Hard-decision and soft-decision
  • Majority-logic decoding
  • Reed-Muller code
  • TETRA

Fingerprint

Dive into the research topics of 'Design of majority-logic decoders for the shortened Reed-Muller code in TETRA'. Together they form a unique fingerprint.

Cite this