-
公开(公告)号:US09143166B1
公开(公告)日:2015-09-22
申请号:US13405331
申请日:2012-02-26
申请人: Xiangyu Tang , Yu Kou , Lingqi Zeng
发明人: Xiangyu Tang , Yu Kou , Lingqi Zeng
CPC分类号: H03M13/09 , H03M13/1111 , H03M13/1128 , H03M13/2957 , H03M13/2975 , H03M13/3753 , H03M13/41 , H03M13/6331
摘要: Turbo equalization is performing by using a soft output detector to perform decoding. At least a portion of a local iteration of decoding is performed using a soft output decoder. A metric associated with decoding progress is generated and it is determined whether to perform another local iteration of decoding based at least in part on the metric.
摘要翻译: Turbo均衡通过使用软输出检测器进行解码。 使用软输出解码器执行解码的局部迭代的至少一部分。 生成与解码进度相关联的度量,并且至少部分地基于度量来确定是否执行另一次本地迭代迭代。
-
公开(公告)号:US08898546B1
公开(公告)日:2014-11-25
申请号:US13607302
申请日:2012-09-07
申请人: Yu Kou , Xiangyu Tang
发明人: Yu Kou , Xiangyu Tang
CPC分类号: G06F11/1068 , G06F11/1012 , G11C29/52 , G11C2029/0411 , H03M13/1105 , H03M13/152 , H03M13/373 , H03M13/3738 , H03M13/3746 , H03M13/455
摘要: Data is processed by selecting one or more bits in a codeword to replace with an erasure. The selected bits in the codeword are replaced with the erasure and error correction decoding is performed on the codeword with the erasure in place for the selected bits.
摘要翻译: 通过选择代码字中的一个或多个位来替换数据来进行擦除。 码字中所选择的比特被擦除代替,并且对于所选择的比特,针对码字执行了纠错解码,而擦除就位。
-
公开(公告)号:US08843812B1
公开(公告)日:2014-09-23
申请号:US13489122
申请日:2012-06-05
申请人: Xiangyu Tang , Yu Kou , Lingqi Zeng
发明人: Xiangyu Tang , Yu Kou , Lingqi Zeng
CPC分类号: H03M13/2963 , G06F11/10 , H03M13/1111 , H03M13/1125 , H03M13/1128 , H03M13/2957 , H03M13/413 , H03M13/4138 , H03M13/6331
摘要: A plurality of metrics associated with a plurality of partially decoded codewords is obtained. The plurality of partially decoded codewords has been processed at least once by a first soft output decoder and a second soft output decoder and the plurality of partially decoded codewords is stored in a memory. At least one of the plurality of partially decoded codewords is selected based at least in part on the plurality of metrics; the memory is instructed to vacate the at least one selected codeword.
摘要翻译: 获得与多个部分解码的码字相关联的多个度量。 多个部分解码的码字已被第一软输出解码器和第二软输出解码器处理至少一次,并且多个部分解码的码字被存储在存储器中。 至少部分地基于所述多个度量来选择所述多个部分解码的码字中的至少一个; 指示存储器腾出至少一个所选择的码字。
-
4.
公开(公告)号:US08214172B2
公开(公告)日:2012-07-03
申请号:US12393533
申请日:2009-02-26
申请人: Seongmoon Wang , Xiangyu Tang
发明人: Seongmoon Wang , Xiangyu Tang
IPC分类号: G01R31/00
CPC分类号: G01R31/318547
摘要: According to exemplary methods and systems of the present principles, the location of defective field repairable units (FRUS) of a circuit that have varying sizes or varying numbers of scan cells may be identified by employing tiles including scan cells from different FRUS. A set of test patterns may be scanned through the scan cells such that cells belonging to FRUs within a tile may be concealed while analyzing the response of scan cells in the tile contributed by a different FRU. Further, defective tiles are discoverable at any tile location and in any quantity within a maximal capacity using a compressed signature. In addition, signature registers that process data at a rate that is faster than the scan shift rate of the circuit may be employed during compression to multiply a circuit response by a plurality of components of a compression matrix during one scan shift cycle.
摘要翻译: 根据本原理的示例性方法和系统,可以通过使用包括来自不同FRUS的扫描单元的瓦片来识别具有不同大小或不同数目的扫描单元的电路的缺陷现场修复单元(FRUS)的位置。 可以通过扫描单元扫描一组测试图案,使得属于瓦片内的FRU的单元可以被隐藏,同时分析由不同FRU贡献的瓦片中的扫描单元的响应。 此外,在任何瓦片位置和使用压缩签名的最大容量内的任何数量中都可以发现有缺陷的瓦片。 此外,在压缩期间可以采用以比电路的扫描偏移速率更快的速率处理数据的签名寄存器,以在一个扫描移位周期期间乘以压缩矩阵的多个分量的电路响应。
-
公开(公告)号:US08671326B1
公开(公告)日:2014-03-11
申请号:US13471747
申请日:2012-05-15
申请人: Xiangyu Tang , Yu Kou , Lingqi Zeng
发明人: Xiangyu Tang , Yu Kou , Lingqi Zeng
IPC分类号: H03M13/00
CPC分类号: H03M13/6343 , H03M13/1102 , H03M13/2909 , H03M13/2918 , H03M13/2942 , H03M13/2957 , H03M13/4138 , H03M13/6325
摘要: A method of encoding user data into a first set of codewords using a first code, generating a first set of parity information based at least in part on the first set of codewords and at least a second code, and writing at least parity information associated with the first set of parity information to shingled magnetic recording storage. A method of performing decoding on a first set of read-back signal data read back from shingled magnetic recording storage and associated with a first set of codewords, and if decoding of at least one read-back signal in the first set of read-back signal data fails, performing decoding on at least some of a second set of read-back signal data associated with a set of parity information.
摘要翻译: 一种使用第一代码将用户数据编码到第一组码字中的方法,至少部分地基于第一组码字和至少第二码产生第一组奇偶校验信息,以及至少写入与 第一套奇偶校验信息用于带磁记录存储。 对从第一组码字读取并与第一组码字相关联的第一组回读信号数据执行解码的方法,以及如果在第一组回读中解码至少一个回读信号 信号数据失败,对与一组奇偶校验信息相关联的第二组回读信号数据中的至少一些进行解码。
-
6.
公开(公告)号:US20100121585A1
公开(公告)日:2010-05-13
申请号:US12393533
申请日:2009-02-26
申请人: Seongmoon Wang , Xiangyu Tang
发明人: Seongmoon Wang , Xiangyu Tang
CPC分类号: G01R31/318547
摘要: According to exemplary methods and systems of the present principles, the location of defective field repairable units (FRUS) of a circuit that have varying sizes or varying numbers of scan cells may be identified by employing tiles including scan cells from different FRUS. A set of test patterns may be scanned through the scan cells such that cells belonging to FRUs within a tile may be concealed while analyzing the response of scan cells in the tile contributed by a different FRU. Further, defective tiles are discoverable at any tile location and in any quantity within a maximal capacity using a compressed signature. In addition, signature registers that process data at a rate that is faster than the scan shift rate of the circuit may be employed during compression to multiply a circuit response by a plurality of components of a compression matrix during one scan shift cycle.
摘要翻译: 根据本原理的示例性方法和系统,可以通过使用包括来自不同FRUS的扫描单元的瓦片来识别具有不同大小或不同数目的扫描单元的电路的缺陷现场修复单元(FRUS)的位置。 可以通过扫描单元扫描一组测试图案,使得属于瓦片内的FRU的单元可以被隐藏,同时分析由不同FRU贡献的瓦片中的扫描单元的响应。 此外,在任何瓦片位置和使用压缩签名的最大容量内的任何数量中都可以发现有缺陷的瓦片。 此外,在压缩期间可以采用以比电路的扫描偏移速率更快的速率处理数据的签名寄存器,以在一个扫描移位周期期间乘以压缩矩阵的多个分量的电路响应。
-
-
-
-
-