会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Minimized Half-Select Current in Multi-State Memories
    • 在多状态记忆中最小化半选择电流
    • US20130262759A1
    • 2013-10-03
    • US13438438
    • 2012-04-03
    • Erik OrdentlichRon M. RothGadiel Seroussi
    • Erik OrdentlichRon M. RothGadiel Seroussi
    • G06F12/08
    • G11C16/10G06F11/1008G11C7/1006G11C11/56G11C11/5678G11C11/5685G11C13/0004G11C13/0007
    • 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.
    • 具有最小化半选择电流的编码的多状态存储器系统。 该系统包括具有多个存储单元的行和列导体的阵列,每个存储单元能够被置于三个或更多个物理状态中的任何一个中。 连接编码器以接收用于存储的数据位,并将激活信号施加到行和列导体以将信息写入存储单元。 编码器被编程为将数据位编码为具有与每行导体相对应的一行的阵列中的条目和与每个列导体相对应的一列; 根据存储单元的半选择电流选择阵列中的条目; 应用增加阵列中至多一个条目的值以获得映射数组的预定一维映射; 并将映射的阵列的条目写入存储单元。
    • 9. 发明申请
    • APPROXIMATE ENUMERATIVE CODING METHOD AND APPARATUS
    • 近似的编码方法和装置
    • US20120087381A1
    • 2012-04-12
    • US13258394
    • 2009-06-26
    • Erik OrdentlichRon M. Roth
    • Erik OrdentlichRon M. Roth
    • H04J3/00
    • H03M5/145
    • An approximate enumerative coding method (100, 200) and apparatus (300) employ a cardinality-approximating (C-A) lower bound in mapping a message M to a 2-dimensional (2-D) codeword array that satisfies a 2-D constraint. The method (100) includes encoding the message M as a codeword array X using an encoder apparatus. The encoding determines entries in a codeword array X using the C-A lower bound. The C-A lower bound is a function of several terms, namely a memory term k, a cardinality of a set of sequences satisfying a horizontal constraint, a columnar extension probability of the 2-D constraint, and a non-negative constant that is a function of the columnar extension probability. The apparatus (300) includes an encoder processor (310), memory (320) and a computer program (330) stored in the memory (320) and executed by the encoder processor (310).
    • 近似枚举编码方法(100,200)和装置(300)在将消息M映射到满足2-D约束的二维(2-D)码字阵列时采用基数近似(C-A)下限。 方法(100)包括使用编码器装置将消息M编码为码字阵列X. 编码使用C-A下限确定码字阵列X中的条目。 CA下限是几个项的函数,即存储项k,满足水平约束的一组序列的基数,2-D约束的列扩展概率和作为函数的非负常数 的柱状扩展概率。 装置(300)包括编码器处理器(310),存储器(320)和存储在存储器(320)中并由编码器处理器(310)执行的计算机程序(330)。
    • 10. 发明授权
    • Two-dimensional DC-free encoder and decoder
    • 二维无DC编码器和解码器
    • US06175317B1
    • 2001-01-16
    • US09360855
    • 1999-07-24
    • Erik OrdentlichRon M. Roth
    • Erik OrdentlichRon M. Roth
    • H03M500
    • G11C7/1006G11B20/1803G11C7/02H03M13/31
    • A message is encoded into an array, which is an element of a constrained array set. The message is encoded by considering candidates for each entry (e.g., column, bit) of the array. The candidates have a predetermined ordering. For each candidate that is considered, a lower bound is determined. The lower bound indicates a number of set elements including both the candidate being considered and previously selected candidates of the array. An entry is filled with a candidate based upon the value of the lower bound relative to an intermediate message. The intermediate message is initially equal to the message being encoded, and is updated after each column of the array has been filled.
    • 消息被编码为数组,它是受限阵列集的一个元素。 通过考虑阵列的每个条目(例如,列,位)的候选来编码该消息。 候选人有预定的顺序。 对于所考虑的每个候选人,确定下限。 下限表示包括所考虑的候选者和阵列的先前选择的候选者的设定元素的数量。 基于相对于中间消息的下限的值来填充条目。 中间消息最初等于正被编码的消息,并且在数组的每一列已被填充之后被更新。