Proceedings of the Korean Institute of Information and Commucation Sciences Conference (한국정보통신학회:학술대회논문집)
- 2010.10a
- /
- Pages.162-164
- /
- 2010
Decoding Performance and Complexity of Reed-Muller Codes in TETRA
TETRA RM 부호의 복호 알고리즘 비교
- Park, Gi-Yoon (High-speed MODEM research team, ETRI) ;
- Kim, Dae-Ho (High-speed MODEM research team, ETRI) ;
- Oh, Wang-Rok (Division of Electrical and Computer Engineering, CNU)
- Published : 2010.10.27
Abstract
Terrestrial trunked radio (TETRA) standard specifies shortened Reed-Muller (RM) codes as forward error correction means for control signals. In this paper, we compare decoding algorithms for RM codes in TETRA, in terms of performance and complexity trade-off. Belief propagation and majority logic decoding algorithms are selected for comparison.
TETRA (Terrestrial trunked radio) 표준은 제어정보의 오류정정을 위해 RM (Reed-Muller) 부호를 채택하고 있다. 본 논문에서는 BP (belief propagation), MJ (majority logic decoding) 등과 같이 잘 알려진 복호 알고리즘들을 적용하였을 경우 기대되는 비트 및 블록 오류율을 평가하고 복호 복잡도를 분석하고자 한다.
Keywords
- Terrestrial trunked radio;
- Reed-Muller code;
- belief propagation;
- four-cycles;
- forward error correction