Method for error correction decoding in a magnetoresistive solid-state storage device
    81.
    发明授权
    Method for error correction decoding in a magnetoresistive solid-state storage device 有权
    磁阻固态存储装置中的纠错解码方法

    公开(公告)号:US07149949B2

    公开(公告)日:2006-12-12

    申请号:US10093841

    申请日:2002-03-08

    IPC分类号: G11C29/42 G11C29/40

    CPC分类号: G06F11/1008

    摘要: A magnetoresistive solid-state storage device (MRAM) employs error correction coding (ECC) to form ECC encoded stored data. In a read operation, a set of test cells in a test row are used to predict failures amongst a set of cells of interest storing a block of ECC encoded data. Erasure information is formed from these predictions which identifies potentially unreliable symbols in the block of ECC encoded data, and the ability of a decoder to perform ECC decoding is substantially enhanced.

    摘要翻译: 磁阻固态存储装置(MRAM)采用纠错编码(ECC)来形成ECC编码的存储数据。 在读取操作中,使用测试行中的一组测试单元来预测存储ECC编码数据块的一组感兴趣的单元格中的故障。 擦除信息由这些预测形成,这些预测识别ECC编码数据块中潜在的不可靠符号,并且解码器执行ECC解码的能力被显着提高。

    Method and system for determining an optimal or near optimal set of contexts by constructing a multi-directional context tree
    82.
    发明授权
    Method and system for determining an optimal or near optimal set of contexts by constructing a multi-directional context tree 有权
    通过构建多方向上下文树来确定最佳或接近最佳上下文集合的方法和系统

    公开(公告)号:US07123172B1

    公开(公告)日:2006-10-17

    申请号:US11192559

    申请日:2005-07-29

    IPC分类号: H03M7/34 H03M7/38

    CPC分类号: G06T5/002 G06T2207/20076

    摘要: In various embodiments of the present invention, optimal or near-optimal multidirectional context sets for a particular data-and/or-signal analysis or processing task are determined by selecting a maximum context size, generating a set of leaf nodes corresponding to those maximally sized contexts that occur in the data or signal to be processed or analyzed, and then building up and concurrently pruning, level by level, a multidirectional optimal context tree constructing one of potentially many optimal or near-optimal context trees in which leaf nodes represent the context of a near-optimal or optimal context set that may contain contexts of different sizes and geometries. Pruning is carried out using a problem-domain-related weighting function applicable to nodes and subtrees within the context tree. In one described embodiment, a bi-directional context tree suitable for a signal denoising application is constructed using, as the weighting function, an estimated loss function.

    摘要翻译: 在本发明的各种实施例中,通过选择最大上下文大小来确定用于特定数据和/或信号分析或处理任务的最佳或接近最佳的多向上下文集合,生成对应于那些最大尺寸 发生在待处理或分析的数据或信号中的上下文,然后逐级建立和并行修剪,构建叶节点代表上下文的潜在许多最优或近最优上下文树之一的多向最佳上下文树 可以包含不同尺寸和几何形状的上下文的近似或最佳上下文集合。 使用适用于上下文树中的节点和子树的问题域相关加权函数来执行修剪。 在一个描述的实施例中,使用适用于信号去噪应用的双向上下文树,使用估计的损耗函数作为加权函数。

    Identification of different regions of biopolymer sequences using a denoiser
    83.
    发明申请
    Identification of different regions of biopolymer sequences using a denoiser 审中-公开
    使用去污剂鉴定生物聚合物序列的不同区域

    公开(公告)号:US20060047438A1

    公开(公告)日:2006-03-02

    申请号:US10934221

    申请日:2004-09-02

    IPC分类号: G06F19/00

    CPC分类号: G16B30/00

    摘要: Various embodiments of the present invention are directed to analysis of biopolymer sequences by introducing artificial noise into the sequences and then applying a denoiser to remove the artificial noise, monitoring the denoisability of each portion of the sequence by comparing the product of the denoiser and the original sequence. Portions of biopolymer sequences involved in certain cellular functions, such as genes within DNA sequences, often encode information in codes that are highly resilient to discrete, local corruption, such as DNA sequence mutations. Portions of DNA involved in other types of cellular functions may be less resilient to random errors, or, in other cases, may be so uniformly repetitive in sequence that random errors can be extremely easily identified and corrected. The denoisability of portions of biopolymer sequences into which random errors are introduced may thus rather directly reflect the error tolerance and error recognizability within the portions of biopolymer sequences. Rapid changes in denoisability in a continuous computation of denoisability along a biopolymer sequence may, in turn, indicate boundaries between portions of the biopolymer sequence having different biological functions. Thus, a denoiser may be a computationally efficient tool for analyzing biopolymer sequences in order to differentiate different portions of the biopolymer sequences having different biological functions.

    摘要翻译: 本发明的各种实施方案涉及生物聚合物序列的分析,其通过将人造噪声引入到序列中,然后应用去噪器去除人造噪声,通过比较除垢剂和原始物质的产物来监测序列的每个部分的不合理性 序列。 参与某些细胞功能的生物聚合物序列的部分,例如DNA序列内的基因,通常编码对离散局部破坏(例如DNA序列突变)具有高度抗性的代码中的信息。 涉及其他类型细胞功能的部分DNA可能对随机误差的抵抗力较差,或者在其他情况下可能依次如此均匀地重复,从而可以非常容易地识别和纠正随机误差。 因此,引入随机误差的生物聚合物序列的部分的可分离性可以直接反映生物聚合物序列部分内的误差容限和误差可识别性。 连续计算沿生物聚合物序列的不可避免性的不可避免性的快速变化可以反过来指示具有不同生物学功能的生物聚合物序列的部分之间的边界。 因此,去噪器可以是用于分析生物聚合物序列的计算上有效的工具,以便区分具有不同生物学功能的生物聚合物序列的不同部分。

    FSM closure of generalized tree models
    84.
    发明申请
    FSM closure of generalized tree models 失效
    广义树模型的FSM关闭

    公开(公告)号:US20050168240A1

    公开(公告)日:2005-08-04

    申请号:US10768904

    申请日:2004-01-29

    CPC分类号: H03M7/30

    摘要: Use of Generalized Context Trees, a means for assigning a unique state from a finite set to any string, is provided. The method optionally refines the generalized context tree into a refined generalized context tree having a finite state machine (FSM) property. Refining occurs whenever the generalized context tree does not have the finite state machine property. Alternately, a method for constructing a representation of a source usable within an FSM is provided, comprising evaluating a node comprising a suffix tail and verifying the suffix tail is included in the representation, and inserting at least one node to the representation when the suffix tail is not in the representation.

    摘要翻译: 提供了广义上下文树的使用,一种将有限集中的唯一状态分配给任意字符串的方法。 该方法可选地将广义上下文树细化为具有有限状态机(FSM)属性的精化广义上下文树。 每当广义上下文树不具有有限状态机属性时,就进行精炼。 或者,提供了一种用于构建可用于FSM内的源的表示的方法,包括评估包括后缀尾部和验证后缀尾的节点包括在所述表示中,并且当后缀尾部插入至少一个节点到所述表示时 不在代表中。

    Method for correcting noise errors in a digital signal
    85.
    发明申请
    Method for correcting noise errors in a digital signal 有权
    用于校正数字信号中的噪声误差的方法

    公开(公告)号:US20050097421A1

    公开(公告)日:2005-05-05

    申请号:US10688520

    申请日:2003-10-17

    CPC分类号: H03M13/00

    摘要: An apparatus and method for processing a received signal that has been corrupted by a channel to generate a processed signal having less signal corruption than the received signal is disclosed. The apparatus stores the received signal, information specifying the probability that a symbol having a value I will be converted to a symbol having a value J by the channel, and information specifying a signal degradation function that measures the signal degradation that occurs if a symbol having the value I is replaced by symbol having a value J. The controller replaces each symbol having a value I in a context of that symbol in the received signal with a symbol having a value J that minimizes the overall signal degradation in the processed signal relative to the underlying noise-free signal as estimated via the observed statistics within that context.

    摘要翻译: 公开了一种用于处理由信道破坏的接收信号以产生具有比接收信号更少的信号损坏的处理信号的装置和方法。 该装置存储接收到的信号,指定具有值I的符号将被通道转换为具有值J的符号的概率的信息,以及指定信号劣化功能的信息,该信号降级功能测量如果符号具有 值I由具有值J的符号代替。控制器用具有值J的符号替换接收信号中符号上下文中具有值I的每个符号,该符号使处理信号中的总体信号劣化最小化相对于 通过在该背景下观察到的统计量来估计基础无噪声信号。

    Apparatus and method for multiplication in large finite fields
    86.
    发明授权
    Apparatus and method for multiplication in large finite fields 失效
    在大有限域中乘法的装置和方法

    公开(公告)号:US06178436B1

    公开(公告)日:2001-01-23

    申请号:US09108998

    申请日:1998-07-01

    IPC分类号: G06F700

    CPC分类号: G06F7/724 G06F5/01

    摘要: An apparatus and method are shown for multiplying vectors of length n in a finite field. A first vector is circularly shifted in a first shift register under control of a shift signal. A second vector is circularly shifted in a second shift register also under control of the shift signal. An accumulated result vector is circularly shifted in a third shift register under control of the shift signal. Elements of the second vector are logically combined according to a tensor of the multiplication operation to obtain an intermediate result which is combined with the elements of the accumulated result vector to obtain a combination result vector. However, the combination result vector is only loaded into the third shift register when a logic ‘1’ value is present in a first position of the first shift register. Therefore, the first, second and third shift registers can be circularly shifted until a logic ‘1’ is encountered in the first vector, at which time the combination result vector is loaded into the third shift register. Since a vector will, on average, contain n/2 elements that are logic ‘1’, the number of operations for a multiplication can be reduced, on average, to n/2.

    摘要翻译: 示出了用于在有限域中乘以长度为n的矢量的装置和方法。 在移位信号的控制下,第一矢量在第一移位寄存器中循环移位。 在移位信号的控制下,第二矢量也在第二移位寄存器中循环移位。 在移位信号的控制下,累积结果矢量在第三移位寄存器中循环移位。 根据乘法运算的张量逻辑地组合第二向量的元素,以获得与累积结果向量的元素组合的中间结果,以获得组合结果向量。 然而,当在第一移位寄存器的第一位置存在逻辑“1”值时,组合结果向量仅被加载到第三移位寄存器中,因此,第一,第二和第三移位寄存器可以循环移位直到逻辑 在第一向量中遇到“1”,此时将组合结果向量加载到第三移位寄存器中。 由于向量将平均包含n / 2个逻辑“1”的元素,所以乘法运算的数量平均可以减少到n / 2。

    System and method for lossless image compression having improved
sequential determination of golomb parameter
    87.
    发明授权
    System and method for lossless image compression having improved sequential determination of golomb parameter 失效
    用于无损图像压缩的系统和方法具有改进的递增参数的顺序确定

    公开(公告)号:US5764374A

    公开(公告)日:1998-06-09

    申请号:US706010

    申请日:1996-08-30

    摘要: A lossless image compression encoder/decoder system having a context determination circuit and a code generator. The image compressor uses the context of a pixel to be encoded to predict the value of the pixel and determines a prediction error and maps the prediction error to a mapped value having a distribution suitable for Golomb encoding. The image compressor contains a context quantizer that quantizes the context of pixels. The image compressor determines a Golomb parameter based on the context and historical information gathered during the coding of an image. To avoid systematic prediction biases in an image, the image compressor adjusts the distribution of prediction residuals to a distribution suitable for Golomb coding. As it encodes a particular pixel, the encoder uses the Golomb parameter to determine a Golomb code for the prediction error and encodes that value. To decompress an image, the decompressor determines and quantizes the context of each pixel being decoded. The decompressor uses the same pixels as the compressor to determine the context. The decompressor uses the context and historical information gathered during the decompression of the image to determine a Golomb parameter for the context in which the pixel occured. The decompressor retrieves from the compressed image the code for the pixel. Using the Golomb parameter and the retrieved code, the decompressor determines the mapped value of the code. The decompressor then uses the inverse mapping to determine the error value. The decompressor uses a predictor to predict the value of the pixel based on the context and adds the error value to determine the actual value of the pixel. In one embodiment the image compressor uses an alphabet extension, embedded in its context model, in specific low gradient contexts to reduce the redundancy of the encoding. Other systems and methods are disclosed.

    摘要翻译: 一种具有上下文确定电路和代码发生器的无损图像压缩编码器/解码器系统。 图像压缩器使用要编码的像素的上下文来预测像素的值并确定预测误差,并且将预测误差映射到具有适于Golomb编码的分布的映射值。 图像压缩器包含量化像素上下文的上下文量化器。 图像压缩器基于在图像的编码期间收集的上下文和历史信息来确定Golomb参数。 为了避免图像中的系统预测偏差,图像压缩器将预测残差的分布调整为适于Golomb编码的分布。 在编码特定像素时,编码器使用Golomb参数来确定预测误差的Golomb码并对该值进行编码。 为了解压缩图像,解压缩器确定并量化正在解码的每个像素的上下文。 解压缩器使用与压缩器相同的像素来确定上下文。 解压缩器使用在图像解压缩期间收集的上下文和历史信息来确定出现像素的上下文的Golomb参数。 解压缩器从压缩图像中检索像素的代码。 使用Golomb参数和检索到的代码,解压缩器确定代码的映射值。 解压缩器然后使用逆映射来确定错误值。 解压缩器使用预测器根据上下文预测像素的值,并添加误差值以确定像素的实际值。 在一个实施例中,图像压缩器在特定的低梯度上下文中使用嵌入其上下文模型中的字母扩展,以减少编码的冗余度。 公开了其它系统和方法。

    Apparatus and methods for Lempel Ziv data compression with improved
management of multiple dictionaries in content addressable memory
    88.
    发明授权
    Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory 失效
    用于Lempel Ziv数据压缩的装置和方法,改进了内容可寻址存储器中多个字典的管理

    公开(公告)号:US5455576A

    公开(公告)日:1995-10-03

    申请号:US192878

    申请日:1994-02-07

    摘要: A class of lossless data compression algorithms use a memory-based dictionary of finite size to facilitate the compression and decompression of data. To reduce the loss in data compression caused by dictionary resets, a standby dictionary is used to store a subset of encoded data entries previously stored in a current dictionary. In a second aspect of the invention, data is compressed/decompressed according to the address location of data entries contained within a dictionary built in a content addressable memory (CAM). In a third aspect of the invention, the minimum memory/high compression capacity of the standby dictionary scheme is combined with the fast single-cycle per character encoding/decoding capacity of the CAM circuit. In a fourth aspect of the invention, a selective overwrite dictionary swapping technique is used to allow all data entries to be used at all times for encoding character strings.

    摘要翻译: 一类无损数据压缩算法使用有限大小的基于存储器的字典来促进数据的压缩和解压缩。 为了减少字典复位引起的数据压缩丢失,使用备用字典来存储先前存储在当前字典中的编码数据条目的子集。 在本发明的第二方面中,根据包含在内容可寻址存储器(CAM)中的字典内的数据条目的地址位置对数据进行压缩/解压缩。 在本发明的第三方面中,备用字典方案的最小存储器/高压缩容量与CAM电路的每个字符编码/解码能力的快速单周期组合。 在本发明的第四方面中,使用选择性覆盖字典交换技术来允许所有数据条目始终用于编码字符串。

    Compression using small dictionaries with applications to network packets
    89.
    发明授权
    Compression using small dictionaries with applications to network packets 失效
    压缩使用小字典与应用程序的网络数据包

    公开(公告)号:US5389922A

    公开(公告)日:1995-02-14

    申请号:US46548

    申请日:1993-04-13

    摘要: The invention is a dictionary initialization scheme adaptive to changes in the type and structure of input data. The compression ratio is increased by minimizing the number of data entries used to represent single characters in the input data. By using fewer codes than what is normally used to represent characters in an array of input data, the dictionary can have fewer entries than the alphabet size. A further aspect of the invention implements a type of run-length encoding in the LZ methodology which exploits the redundant structure existing in the compressed stream in the presence of a long run. Some of the codewords in the compressed stream are deleted but can be recovered at the decompression site. The foregoing LZE method is used alone, or used in combination with other methods to form a compression scheme that is especially useful for transmitting network packets.

    摘要翻译: 本发明是适应输入数据类型和结构变化的字典初始化方案。 通过最小化用于表示输入数据中的单个字符的数据条目的数量来增加压缩比。 通过使用比通常用于表示输入数据数组中的字符更少的代码,字典可以具有比字母大小更少的条目。 本发明的另一方面实现了LZ方法中的一种游程长度编码,其利用存在于长时间存在的压缩流中的冗余结构。 压缩流中的一些码字被删除,但可以在解压缩站点恢复。 上述LZE方法单独使用或与其他方法组合使用以形成对于传输网络分组特别有用的压缩方案。

    Minimized half-select current in multi-state memories
    90.
    发明授权
    Minimized half-select current in multi-state memories 有权
    在多状态存储器中最小化半选择电流

    公开(公告)号:US08938575B2

    公开(公告)日:2015-01-20

    申请号:US13438438

    申请日:2012-04-03

    IPC分类号: G06F12/00

    摘要: A multi-state memory system with encoding that minimizes half-select currents. The system includes an array of row and column conductors with a plurality of storage cells each capable of being placed into any of three or more physical states. An encoder is connected to receive data bits for storage and to apply activation signals to the row and column conductors to write information to the storage cells. The encoder is programmed to encode the data bits into entries in an array having one row corresponding with each row conductor and one column corresponding with each column conductor; select entries in the array according to half-select currents of the storage cells; apply a predetermined one-dimensional mapping that increases the value of at most one entry in the array to obtain a mapped array; and write entries of the mapped array into the storage cells.

    摘要翻译: 具有最小化半选择电流的编码的多状态存储器系统。 该系统包括具有多个存储单元的行和列导体的阵列,每个存储单元能够被置于三个或更多个物理状态中的任何一个中。 连接编码器以接收用于存储的数据位,并将激活信号施加到行和列导体以将信息写入存储单元。 编码器被编程为将数据位编码为具有与每行导体相对应的一行的阵列中的条目和与每个列导体相对应的一列; 根据存储单元的半选择电流选择阵列中的条目; 应用增加阵列中至多一个条目的值以获得映射数组的预定一维映射; 并将映射的阵列的条目写入存储单元。