会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Multi-phase ECC encoding using algebraic codes
    • 使用代数代码的多阶段ECC编码
    • US08645789B2
    • 2014-02-04
    • US13335534
    • 2011-12-22
    • Eran SharonIdan AlrodSimon Litsyn
    • Eran SharonIdan AlrodSimon Litsyn
    • H03M13/00
    • G06F11/1012
    • A method includes a first encoding operation associated with a first algebraic error correcting code generating a first set of first parity bits corresponding to a first set of information bits and a second set of first parity bits corresponding to a second set of information bits. A second encoding operation associated with a second algebraic error correcting code generates a first set of second parity bits corresponding to the first set of information bits and a second set of second parity bits corresponding to the second set of information bits. A third encoding operation generates a set of joint parity bits. The first set of information bits, the second set of information bits, the first set of first parity bits, the second set of first parity bits, and the joint parity bits may be stored in a data storage device as a single codeword.
    • 一种方法包括与第一代数纠错码相关联的第一编码操作,所述第一代数纠错码产生对应于第一组信息比特的第一奇偶校验位的第一组,以及与第二组信息比特对应的第二奇偶校验位组。 与第二代数纠错码相关联的第二编码操作产生对应于第一组信息比特的第一组第二奇偶校验位和对应于第二组信息比特的第二奇偶校验位组。 第三编码操作产生一组联合奇偶校验位。 第一组信息位,第二组信息位,第一组第一奇偶校验位,第二组第一奇偶校验位和联合奇偶校验位可以作为单个码字存储在数据存储设备中。
    • 5. 发明授权
    • Reduced complexity LDPC decoder
    • 降低复杂度的LDPC解码器
    • US08429512B2
    • 2013-04-23
    • US12404308
    • 2009-03-15
    • Eran SharonSimon LitsynIdan Alrod
    • Eran SharonSimon LitsynIdan Alrod
    • G06F11/00
    • H03M13/1131H03M13/1114H03M13/6505H03M13/6588
    • To decode a manifestation of a codeword in which K information bits are encoded as N>K codeword bits, messages are exchanged between N bit nodes and N−K check nodes. During computation, messages are expressed with a full message length greater than two bits. In each iteration, representations of at least some of the exchanged messages are stored. For at least one node, if representations of messages sent from that node are stored, then the representation of one or more of the messages is stored using at least two bits but using fewer bits than the full message length, and the representation of one other message is stored with full message length. Preferably, the messages that are stored using fewer bits than the full message length are messages sent from check nodes.
    • 为了解码其中K个信息比特被编码为N> K个码字比特的码字的表现,在N个比特节点和N-K个校验节点之间交换消息。 在计算期间,消息以大于两位的完整消息长度表示。 在每次迭代中,存储至少一些交换的消息的表示。 对于至少一个节点,如果存储从该节点发送的消息的表示,则使用至少两个比特来存储一个或多个消息的表示,但是使用比全消息长度更少的比特,并且另一个的表示 消息以完整的消息长度存储。 优选地,使用比完整消息长度少的位来存储的消息是从校验节点发送的消息。
    • 6. 发明授权
    • Error correction decoding by trial and error
    • 纠错解码通过反复试验
    • US08042029B2
    • 2011-10-18
    • US11528556
    • 2006-09-28
    • Idan AlrodEran SharonSimon Litsyn
    • Idan AlrodEran SharonSimon Litsyn
    • H03M13/03
    • H03M13/3738H03M13/3707H03M13/6502H03M13/6511
    • A representation of a codeword is decoded by applying a first decoder of the codeword to the representation of the codeword. If applying the first decoder fails to decode the representation of the codeword then a second decoder of the codeword is applied to the representation of the codeword. Preferably, applying the first decoder consumes less power and is faster than applying the second decoder. Data are ported by encoding the data as a codeword, exporting the codeword to a corrupting medium, importing a representation of the codeword, and applying a first decoder to the representation of the codeword. If applying the first decoder fails to decode the representation of the codeword then a second decoder of the codeword is applied to the representation of the codeword.
    • 通过将码字的第一解码器应用于码字的表示来解码码字的表示。 如果应用第一解码器不能解码码字的表示,则码字的第二解码器被应用于码字的表示。 优选地,应用第一解码器消耗较少的功率并且比应用第二解码器更快。 数据通过将数据编码为码字来移植,将码字导出到破坏性介质,导入码字的表示,以及将第一解码器应用于码字的表示。 如果应用第一解码器不能解码码字的表示,则码字的第二解码器被应用于码字的表示。
    • 7. 发明授权
    • Adaptive dynamic reading of flash memories
    • 闪存的自适应动态读取
    • US07903468B2
    • 2011-03-08
    • US11941945
    • 2007-11-18
    • Simon LitsynIdan AlrodEran Sharon
    • Simon LitsynIdan AlrodEran Sharon
    • G11C16/04
    • G11C16/10G11C11/5628G11C11/5642G11C16/28G11C2211/5634
    • Each of a plurality of flash memory cells is programmed to a respective one of L≧2 threshold voltage states within a threshold voltage window. Values of parameters of threshold voltage functions are adjusted in accordance with comparisons of the threshold voltages of some or all of the cells to two or more of m≧2 threshold voltage intervals within the threshold voltage window. Reference voltages for reading the cells are selected based on the values. Alternatively, the m threshold voltage intervals span the threshold voltage window, and respective threshold voltage states are assigned to the cells based on numbers of cells whose threshold voltages are in the intervals, without re-reading the cells.
    • 多个闪存单元中的每一个被编程为阈值电压窗口内的L≥2个阈值电压状态中的相应一个。 根据阈值电压窗口内的一些或所有单元的阈值电压与两个或多个m≥2个阈值电压间隔的比较,来调整阈值电压函数的参数值。 基于这些值来选择用于读取单元的参考电压。 或者,m阈值电压间隔跨越阈值电压窗口,并且基于阈值电压处于间隔中的单元的数量而将各个阈值电压状态分配给单元,而不重新读取单元。
    • 8. 发明授权
    • Soft decoding of hard and soft bits read from a flash memory
    • 从闪存中读取硬和软位的软解码
    • US07814401B2
    • 2010-10-12
    • US11642708
    • 2006-12-21
    • Idan AlrodEran SharonSimon LitsynMenahem Lasser
    • Idan AlrodEran SharonSimon LitsynMenahem Lasser
    • H03M13/00
    • G11C11/5642G06F11/1068G06F11/1072G11C16/26G11C2211/5634
    • To read one or more flash memory cells, the threshold voltage of each cell is compared to at least one integral reference voltage and to at least one fractional reference voltage. Based on the comparisons, a respective estimated probability measure of each bit of an original bit pattern of each cell is calculated. This provides a plurality of estimated probability measures. Based at least in part on at least two of the estimated probability measures, respective original bit patterns of the cells are estimated. Preferably, the estimated probability measures are initial probability measures that are transformed to final probability measures under the constraint that the bit pattern(s) (collectively) is/are a member of a candidate set, e.g. a set of codewords.
    • 为了读取一个或多个闪存单元,将每个单元的阈值电压与至少一个积分参考电压和至少一个分数参考电压进行比较。 基于比较,计算每个单元的原始比特模式的每个比特的相应估计概率测量。 这提供了多个估计的概率度量。 至少部分地基于估计的概率测量中的至少两个,估计小区的各自的原始比特模式。 优选地,估计的概率度量是在比特模式(统称为)是候选集合的成员的约束下被转换为最终概率测量的初始概率测量,例如。 一组码字。
    • 10. 发明申请
    • REDUCED COMPLEXITY LDPC DECODER
    • 降低复杂LDPC解码器
    • US20090319858A1
    • 2009-12-24
    • US12404308
    • 2009-03-15
    • Eran SHARONSimon LitsynIdan Alrod
    • Eran SHARONSimon LitsynIdan Alrod
    • H03M13/05G06F11/10
    • H03M13/1131H03M13/1114H03M13/6505H03M13/6588
    • To decode a manifestation of a codeword in which K information bits are encoded as N>K codeword bits, messages are exchanged between N bit nodes and N−K check nodes. During computation, messages are expressed with a full message length greater than two bits. In each iteration, representations of at least some of the exchanged messages are stored. For at least one node, if representations of messages sent from that node are stored, then the representation of one or more of the messages is stored using at least two bits but using fewer bits than the full message length, and the representation of one other message is stored with full message length. Preferably, the messages that are stored using fewer bits than the full message length are messages sent from check nodes.
    • 为了解码其中K个信息比特被编码为N> K个码字比特的码字的表现,在N个比特节点和N-K个校验节点之间交换消息。 在计算期间,消息以大于两位的完整消息长度表示。 在每次迭代中,存储至少一些交换的消息的表示。 对于至少一个节点,如果存储了从该节点发送的消息的表示,则使用至少两个比特来存储一个或多个消息的表示,但是使用比全消息长度少的比特,并且另一个的表示 消息以完整的消息长度存储。 优选地,使用比完整消息长度少的位来存储的消息是从校验节点发送的消息。