首页 | 本学科首页   官方微博 | 高级检索  
     

带禁止符号的算术码序列译码算法
引用本文:徐向明,彭坦,崔慧娟,唐昆.带禁止符号的算术码序列译码算法[J].通信技术,2009,42(4):154-155.
作者姓名:徐向明  彭坦  崔慧娟  唐昆
作者单位:清华大学,电子工程系,微波与数字通信国家重点实验室,北京,100084
摘    要:如何有效检测错误以及如何构造编码树型结构是算术码抗误码性能研究的两个关键性问题。文章利用多禁止符号实现快速、高效检错,并结合删减编码树型结构分支点的序列译码算法,在降低序列译码复杂度的同时提高了算术码的抗误码性能。仿真结果表明,在同样误包率的条件下,多禁止符号的抗误码性能优于单禁止符号0.5dB。而且在数据包长固定的条件下,禁止符号冗余度的选择和序列译码堆栈空间大小密切相关,联合优化后可以达到性能最优。

关 键 词:算术编码  单禁止符号  多禁止符号  序列译码

Sequential Decoding Algorithm of Arithmetic Code with Forbidden Symbols
XU Xiang-ming,PENG Tan,CUI Hui-juan,TANG Kun.Sequential Decoding Algorithm of Arithmetic Code with Forbidden Symbols[J].Communications Technology,2009,42(4):154-155.
Authors:XU Xiang-ming  PENG Tan  CUI Hui-juan  TANG Kun
Affiliation:(State Key Laboratory of Microwave and Digital Communications, Department of Electronic Engineering Tsinghua University, Beijing 100084, China)
Abstract:How to detect error efficiently and how to construct decoding tree are two key problems in the study of error correction of arithmetic code. In this paper, multiple forbidden symbols are used in arithmetic code to provide quick and efficient error detection capability. Thecombination of sequential decoding with reduced branch points of decoding tree is a significant method to improve the error correction performance of arithmetic code while reducing the complexity of sequential decoding. The simulation result shows that, under the same packet error rate, the multiple forbidden symbols outperforms 0.5 dB than single forbidden symbol in error correction. And under the fixed length of data packet, how to select the redundancy of forbidden symbol is highly related to the size of stack of sequential decoding, so the joint optimization is the best way to achieve the best performance.
Keywords:arithmetic code  error detection  single forbidden symbol  multiple forbidden symbols  sequential decoding
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号