会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • MEMORY-EFFICIENT LDPC DECODING
    • 存储器高效的LDPC解码
    • WO2008142683A3
    • 2009-02-12
    • PCT/IL2008000685
    • 2008-05-20
    • UNIV RAMOTSHARON ERANLITSYN SIMONALROD IDAN
    • SHARON ERANLITSYN SIMONALROD IDAN
    • H03M13/11
    • H03M13/114H03M13/6505
    • To decode a representation of a codeword that encodes K information bits as N>K codeword bits, messages are exchanged between N bit nodes and N-K check nodes of a graph in which E edges connect the bit nodes and the check nodes. While messages are exchanged, fewer than E of the messages are stored, and/or fewer than N soft estimates of the codeword bits are stored. In some embodiments, the messages are exchanged only within sub-graphs and between the sub-graphs and one or more external check nodes. While messages are exchanged, the largest number of stored messages is the number of edges in the sub-graph with the most edges plus the number of edges that connect the sub-graphs to the external check node(s), and/or the largest number of stored soft estimates is the number of bit nodes in the sub-graph with the most bit nodes.
    • 为了将编码K个信息比特的码字的表示解码为N个K个码字比特,消息在其中E个边缘连接比特节点和校验节点的图的N个比特节点和N-K个校验节点之间进行交换。 当消息被交换时,存储少于E个消息,和/或存储少于N个码字比特的软估计。 在一些实施例中,消息仅在子图中以及子图和一个或多个外部校验节点之间交换。 当消息被交换时,最大数量的存储消息是具有最多边缘的子图中的边数加上将子图连接到外部校验节点的边数,和/或最大 存储的软估计数是具有最多位节点的子图中的比特节点的数量。
    • 4. 发明申请
    • AVOIDING ERRORS IN A FLASH MEMORY BY USING SUBSTITUTION TRANSFORMATIONS
    • 通过使用替代变换避免闪存中的错误
    • WO2008081426B1
    • 2008-08-14
    • PCT/IL2007001567
    • 2007-12-19
    • UNIV RAMOTALROD IDANSHARON ERANLITSYN SIMON
    • ALROD IDANSHARON ERANLITSYN SIMON
    • G06F11/10G11C7/10G11C11/56
    • G11C11/5628G06F11/1072G11C7/1006G11C29/00
    • Memory circuitry, or a memory device controller, or a host of a memory device, store an input string of M N-tuples of bits by selecting a substitution transformation in accordance with the input string and by applying the transformation to the input string to provide a transformed string of M N-tuples of bits. M or more memory cells are programmed to represent the transformed string and preferably also to represent a key of the transformation. Alternatively, the circuitry selectively programs each of M or more cells to a respective one of 2N states. The circuitry or the controller selects a mapping that maps the binary numbers in [0,2N-1] into respective states in accordance with the input string and the circuitry uses the mapping to program M cells to represent the input string. Preferably, a key of the mapping is stored in the memory in association with the M cells.
    • 存储器电路或存储器件控制器或存储器件的主机通过根据输入字符串选择替换变换并通过将变换应用于输入字符串来存储M个N元组的输入串,以提供 一个M位元组的变换字符串。 M个或更多个存储器单元被编程以表示变换的字符串,并且优选地也表示转换的关键字。 或者,电路选择性地将M个或更多个单元中的每一个编程为2N个状态中的相应的一个。 电路或控制器根据输入字符串选择将[0,2N-1]中的二进制数映射到各自状态的映射,并且电路使用映射来编程M个单元来表示输入字符串。 优选地,映射的密钥与M个单元相关联地存储在存储器中。
    • 6. 发明申请
    • ERROR-CORRECTION DECODING WITH REDUCED MEMORY AND POWER REQUIREMENTS
    • 具有减少内存和电源要求的错误修正解码
    • WO2013018080A1
    • 2013-02-07
    • PCT/IL2011/000617
    • 2011-07-31
    • SANDISK TECHNOLOGIES, INC., A TEXAS CORPORATIONSHARON, EranALROD, IdanFAINZILBER, OmerLITSYN, Simon
    • SHARON, EranALROD, IdanFAINZILBER, OmerLITSYN, Simon
    • H03M13/00
    • H03M13/1105H03M13/1117H03M13/3715H03M13/6502
    • An example method is provided that includes receiving a representation of a codeword that includes a plurality of bits, and associating the bits with a respective plurality of one-bit hard-bit values representing the bits and multiple-bit soft-bit values representing measures of reliability of respective hard-bit values. The method includes for each of a plurality of iterations, updating a hard-bit/soft-bit value of one or more bits of a respective subset of the bits as a function of current hard-bit values of the subset's bits, and the current hard-bit and soft-bit values of the respective bit. For two iterations in which the current hard-bit and soft-bit values for each bit of a subset for both iterations is the same, the hard-bit/soft-bit value updated for any bit of the subset during one of the two iterations is the same as that computed for the respective bit during the other of the two iterations.
    • 提供了一种示例性方法,其包括接收包括多个比特的码字的表示,并且将比特与表示比特的相应多个一比特硬比特值和表示多个比特的度量的多比特软比特值相关联 各个硬比特值的可靠性。 该方法包括用于多个迭代中的每一个,作为该子集的比特的当前硬比特值的函数来更新比特的相应子集的一个或多个比特的硬比特/软比特值,以及当前 相应位的硬比特和软比特值。 对于两次迭代,其中对于两次迭代的子集的每个位的当前硬比特和软比特值是相同的,则在两次迭代之一期间为子集的任何比特更新的硬比特/软比特值 与在两次迭代中的另一个中相应位计算的相同。
    • 7. 发明申请
    • MULTIPLE PROGRAMMING OF FLASH MEMORY WITHOUT ERASE
    • 无擦除的闪存存储器的多个编程
    • WO2011128867A1
    • 2011-10-20
    • PCT/IB2011/051613
    • 2011-04-14
    • RAMOT AT TEL AVIV UNIVERSITY LTD.SHARON, EranALROD, IdanLITSYN, SimonILANI, Ishai
    • SHARON, EranALROD, IdanLITSYN, SimonILANI, Ishai
    • G11C16/10G11C16/34G11C11/56
    • G11C16/102G06F12/02G11C11/5628G11C16/349
    • To store, successively, in a plurality of memory cells, first and second pluralities of input bits that are equal in number, a first transformation transforms the first input bits into a first plurality of transformed bits. A first portion of the cells is programmed to store the first transformed bits according to a mapping of bit sequences to cell levels, but, if the first transformation has a variable output length, only if there are few enough first transformed bits to fit in the first cell portion. Then, without erasing a second cell portion that includes the first portion, if respective levels of the cells of the second portion, that represent a second plurality of transformed bits obtained by a second transformation of the second input bits, according to the mapping, are accessible from the current cell levels, the second portion is so programmed to store the second transformed bits.
    • 为了顺次地在多个存储单元中存储数量相等的第一和第二多个输入位,第一变换将第一输入位变换为第一多个变换位。 单元的第一部分被编程为根据位序列到单元级别的映射来存储第一变换的位,但是如果第一变换具有可变的输出长度,则只有当足够少的第一变换位适合于 第一细胞部分。 然后,在不擦除包括第一部分的第二单元部分的情况下,如果根据映射通过第二输入位的第二变换获得的表示第二多个变换位的第二部分的单元的各个级别是 从当前单元级可访问,第二部分被编程为存储第二转换位。