![METHODS AND APPARATUS FOR SEARCH SPHERE LINEAR BLOCK DECODING](/abs-image/US/2013/03/28/US20130080855A1/abs.jpg.150x150.jpg)
基本信息:
- 专利标题: METHODS AND APPARATUS FOR SEARCH SPHERE LINEAR BLOCK DECODING
- 专利标题(中):用于搜索球形线性块解码的方法和装置
- 申请号:US13247439 申请日:2011-09-28
- 公开(公告)号:US20130080855A1 公开(公告)日:2013-03-28
- 发明人: Samer Hijazi , Carl Murray , Joseph H. Othmer , Albert Molina , Kameran Azadet
- 申请人: Samer Hijazi , Carl Murray , Joseph H. Othmer , Albert Molina , Kameran Azadet
- 主分类号: H03M13/13
- IPC分类号: H03M13/13 ; G06F11/10
摘要:
A search sphere-based linear block decoder is provided. A received vector, v, is decoded by computing a syndrome vector, S, corresponding to the received vector, v; (S=vH); obtaining a set of all possible error vectors, e, corresponding to the computed syndrome vector, S, wherein the set of all possible error vectors, e, is obtained from a pre-computed error table and has a specified maximum number of bit errors; calculating a set of all possible received vectors, x, based on the received vector, v, and the set of all possible error vectors, e; determining a k-bit code-vector x that is closest to the received vector, v; and determining an n-bit data-vector, d, associated with the k-bit code-vector x. The pre-computed error table can be generated by multiplying all possible error vectors by a Syndrome Matrix, to obtain all possible syndrome vectors associated with all possible error vectors.
摘要(中):
提供基于搜索范围的线性块解码器。 通过计算对应于接收向量v的校正子向量S来解码接收向量v, (S = vH); 获得对应于所计算的校正子向量S的所有可能的误差向量集合,其中所有可能的误差向量集合e从预先计算的误差表获得并且具有指定的最大数量的比特错误; 基于所接收的向量v和所有可能的误差向量的集合e来计算所有可能的接收向量x的集合; 确定最接近接收矢量的k位码矢量,v; 以及确定与所述k位码矢量x相关联的n位数据矢量d。 可以通过将所有可能的误差向量乘以综合征矩阵来产生预计算误差表,以获得与所有可能的误差向量相关联的所有可能的校正子向量。
公开/授权文献:
IPC结构图谱:
H | 电学 |
--H03 | 基本电子电路 |
----H03M | 一般编码、译码或代码转换 |
------H03M13/00 | 用于检错或纠错的编码、译码或代码转换;编码理论基本假设;编码约束;误差概率估计方法;信道模型;代码的模拟或测试 |
--------H03M13/03 | .用数据表示中的冗余项检错或前向纠错,即码字包含比源字更多的位数 |
----------H03M13/05 | ..应用分组码,即与预定信息位编号相连的预定校验位编号 |
------------H03M13/13 | ...线形码 |