Adaptive viterbi decoding algorithm for the shortened (38,26) BCH code based on trellis

被引：0
|
作者：
Hou S.-J. [1 ]
Song L.-Y. [1 ]
Sun L. [1 ]
机构：
[1] School of Information and Electronics, Beijing Institute of Technology, Beijing
来源：
| 1600年 / Beijing Institute of Technology卷 / 36期
关键词：
AVA; Discarding threshold; Galileo SAR system; Shortened BCH code;
D O I：
10.15918/j.tbit1001-0645.2016.11.020
中图分类号：
学科分类号：
摘要：
Galileo search and rescue system (Galileo/SAR) adopts the shortened (38,26) BCH code in its physical layer protocol. In this paper, an adaptive Viterbi decoding algorithm (AVA) was proposed. The best trellis for the shortened (38,26) BCH code was first presented. In the AVA, a discarding threshold was designed on the basis of the Viterbi algorithm (VA), only retaining the most likely paths. The discarding threshold could vary with the different SNR and be adjusted adaptively to reduce the decoding complexity as much as possible, with almost the same error performance as the VA. Simulation results show that, the decoding complexity of the AVA reduces greatly compared with the VA, maintaining nearly the same error performance. Especially at high SNR, the decoding complexity decreases more obviously. © 2016, Editorial Department of Transaction of Beijing Institute of Technology. All right reserved.
引用
收藏
页码：1205 / 1210
页数：5
相关论文
共 14 条
  • [1] Cospas-Sarsat Council, Specification for COSPAS-SARSAT 406 MHz distress beacons (Revision 13), (2012)
  • [2] Lin S., Costello D.J., Error Control Coding, (2004)
  • [3] Zhang D.S., An J.P., Fan Y.Y., Improved Berlekamp-Massy algorithm and its software implementation on DSP, Journal of Beijing Institute of Technology (English Edition), 19, 2, pp. 207-210, (2010)
  • [4] Liu X.J., Zhao C.M., Sun X.J., Low complexity Chase-2 decoding of concatenated codes, Chinese Science Bulletin, 55, 26, pp. 3066-3070, (2010)
  • [5] Wolf J.K., Efficient maximum likelihood decoding of linear block codes using a trellis, IEEE Transactions on Information Theory, 24, 1, pp. 76-80, (1978)
  • [6] Forney G.D., Coset codes-part II: binary lattices and related codes, IEEE Transactions on Information Theory, 34, 5, pp. 1152-1187, (1988)
  • [7] Moorthy H.T., Lin S., Uehara G.T., Good trellises for IC implementation of Viterbi decoders for linear block codes, IEEE Transactions on Communications, 45, 1, pp. 52-63, (1997)
  • [8] Forney G.D., Gluesing-Luerssen H., Codes on graphs: observability, controllability, and local reducibility, IEEE Transactions on Information Theory, 59, 1, pp. 223-237, (2013)
  • [9] Gluesing-Luerssen H., Forney G.D., Local irreducibility of tail-biting trellises, IEEE Transactions on Information Theory, 59, 10, pp. 6597-6610, (2013)
  • [10] Naguib A.F., Seshadri N., Calderbank A.R., Increasing data rate over wireless channels, IEEE Signal Processing Magazine, 17, 3, pp. 76-92, (2000)
12