首页> 外文会议>IEEE international conference on computer science and information technology >A Memory Improvement on Decoding of the (41, 21,9) Quadratic Residue Code
【24h】

A Memory Improvement on Decoding of the (41, 21,9) Quadratic Residue Code

机译:(41,21,9)二次残码解码的内存改进

获取原文

摘要

In this paper, an effective table lookup decoding algorithm (TLDA), called the syndrome and syndrome difference decoding algorithm (SSDDA), it developed to decode the binary systematic (41, 21, 9) quadratic residue (QR) code. It is based on the property of the weight of syndrome and the weight of syndrome difference to reduce the memory size of the lookup table. The proposed algorithm requires a lookup table, called the compact lookup table (CLT), which only consists of 231 syndromes and their corresponding error patterns. The advantage of the SSDDA over the previous TLDAs is that the memory size of the proposed CLT is only about 82.2% and 2% of the lookup table needed in the decoding algorithms of Lin et al. and Chen et al., respectively.
机译:本文提出了一种有效的查表解码算法(TLDA),称为校正子和校正子差值解码算法(SSDDA),它可以对二进制的系统(41、21、9)二次残数(QR)码进行解码。它基于校正子权重和校正子差值权重的属性来减小查找表的内存大小。提出的算法需要一个查找表,称为紧凑查找表(CLT),该表仅包含231个校验子及其对应的错误模式。与先前的TLDA相比,SSDDA的优势在于,所提出的CLT的内存大小仅为Lin等人的解码算法所需的查找表的大约82.2%和2%。和Chen等人。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号