会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明申请
    • SEMICONDUCTOR MEMORY DEVICE
    • 半导体存储器件
    • WO2009044904A3
    • 2009-06-18
    • PCT/JP2008068125
    • 2008-09-30
    • TOSHIBA KKNAGADOMI YASUSHITAKASHIMA DAISABUROHATSUDA KOSUKE
    • NAGADOMI YASUSHITAKASHIMA DAISABUROHATSUDA KOSUKE
    • G11C16/34G06F11/10G11C11/406
    • G11C16/349G06F11/1068G11C11/005G11C16/3431
    • This disclosure concerns a memory including: a first memory region including memory groups including a plurality of memory cells, addresses being respectively allocated for the memory groups, the memory groups respectively being units of data erase operations; a second memory region temporarily storing therein data read from the first memory region or temporarily storing therein data to be written to the first memory region; a read counter storing therein a data read count for each memory group; an error-correcting circuit calculating an error bit count of the read data; and a controller performing a refresh operation, in which the read data stored in one of the memory groups is temporarily stored in the second memory region and is written back the read data to the same memory group, when the error bit count exceeds a first threshold or when the data read count exceeds a second threshold.
    • 本发明涉及一种存储器,包括:第一存储器区域,包括包含多个存储器单元的存储器组,地址分别被分配给所述存储器组,所述存储器组分别是数据擦除操作的单元; 第二存储区域,用于暂时存储从第一存储区域读取的数据或暂时存储要写入第一存储区域的数据; 读取计数器,其中存储每个存储器组的数据读取计数; 错误校正电路,用于计算读取数据的错误位计数; 和执行刷新操作的控制器,其中,当错误位计数超过第一阈值时,存储在一个存储器组中的读取数据临时存储在第二存储器区域中,并将读取数据写回到同一存储器组 或者当数据读取计数超过第二阈值时。
    • 13. 发明申请
    • A METHOD OF DRIVING A SEMICONDUCTOR MEMORY DEVICE AND A SEMICONDUCTOR MEMORY DEVICE
    • 驱动半导体存储器件和半导体存储器件的方法
    • WO2009005075A3
    • 2009-02-19
    • PCT/JP2008061940
    • 2008-06-25
    • TOSHIBA KKSHINO TOMOAKI
    • SHINO TOMOAKI
    • G11C11/404
    • G11C11/404G11C11/4076G11C11/4094G11C2211/4016H01L27/108H01L27/10802H01L29/7841
    • This disclosure concerns a driving method of a memory having cells of floating body type which comprises executing, during a write operation, a first cycle of applying a first potential to the bit lines corresponding to the first selected cells and of applying a second potential to the selected word line to write first data; executing, during the write operation, a second cycle of applying a third potential to the bit lines corresponding to a second selected cell among the first selected memory cells and of applying a fourth potential to the selected word line to write second data, wherein the second potential is a potential biased to a reversed side against the polarity of the carriers with reference to potentials of the source and the first potential, and the fourth potential is a potential biased to same polarity as the polarity of the carriers with reference to the potentials of the source and the third potential.
    • 本公开涉及具有浮体型单元的存储器的驱动方法,其包括在写操作期间执行将第一电位施加到对应于第一选定单元的位线的第一周期,以及向第 选择的字线写入第一个数据; 在所述写入操作期间执行将第三电位施加到所述第一选定存储单元中与第二所选单元相对应的位线的第二周期,以及向所述选定字线施加第四电位以写入第二数据,其中所述第二 电位是参考源极和第一电位的电位而相对于载流子的极性而偏置到反向电位的电位,并且第四电位是与载流子的极性相关的电位偏置到与载流子极性相同的极性 来源和第三个潜力。
    • 14. 发明申请
    • OPTIMUM ROUTE PLANNING FOR SERVICE VEHICLES
    • 服务车辆的最佳路线规划
    • WO2008137083A3
    • 2008-12-24
    • PCT/US2008005697
    • 2008-05-02
    • TOSHIBA KKTELCORDIA TECH INCYAQUB RAZIQFAJARDO VICTOR
    • YAQUB RAZIQFAJARDO VICTOR
    • G01C21/34
    • G06Q10/047G01C21/343
    • Transportation costs are minimized with a novel system for optimizing a route for a service vehicle, for example, a package delivery van. Based upon static and dynamic information, a computer on board the service vehicle determines an optimum route for the vehicle to travel between multiple locations. The computer on board the service vehicle communicates wirelessly to receive any pertinent dynamic information which has changed (e.g., traffic congestion, the presence of a customer at a deliver location, or a modification of location). The computer then recalculates the optimum route for the vehicle and guides the driver of the vehicle in accordance with the newly determined optimum route. The on board computer continues to check for any updates, and recalculates the optimum route throughout the day. Thus, the optimum route may be selected based upon the latest available information while avoiding heavy signal traffic on the wireless network.
    • 运输成本通过用于优化服务车辆的路线的新颖系统例如包裹运送车而被最小化。 基于静态和动态信息,服务车辆上的计算机确定车辆在多个位置之间行驶的最佳路线。 服务车上的计算机通过无线方式进行通信以接收已经改变的任何相关的动态信息(例如,交通堵塞,交付地点处的客户的存在或者地点的修改)。 计算机然后重新计算车辆的最佳路线并根据新确定的最佳路线引导车辆驾驶员。 车载计算机继续检查是否有更新,并重新计算全天的最佳路线。 因此,可以基于最新的可用信息来选择最佳路由,同时避免无线网络上的重信号业务。
    • 20. 发明申请
    • MEMORY SYSTEM AND METHOD OF WRITING INTO NONVOLATILE SEMICONDUCTOR MEMORY
    • 写入非易失性半导体存储器的存储器系统和方法
    • WO2007037507A9
    • 2007-05-24
    • PCT/JP2006319828
    • 2006-09-27
    • TOSHIBA KKSUDA TAKAYA
    • SUDA TAKAYA
    • G06F12/00
    • G06F12/0246
    • A memory system includes a nonvolatile semiconductor memory which includes a first original block composed of n (n being natural number) write unit areas and a first subblock composed of a plurality of write unit areas. A controller writes data having one of first to p-th (p being natural number smaller than n) addresses into the first original block. The controller writes data which has a first write address of one of the first to p-th addresses into the first subblock when the controller receives request to write data having the first write address and data having the first write address exists in the first original block.
    • 一种存储器系统包括非易失性半导体存储器,该非易失性半导体存储器包括由n(n为自然数)个写单位区域构成的第一原始块和由多个写单位区域构成的第一子块。 控制器将具有第一至第p(p是小于n的自然数)个地址中的一个的数据写入第一原始块中。 当控制器接收到写入具有第一写入地址的数据的请求并且具有第一写入地址的数据存在于第一原始块中时,控制器将具有第一至第p地址中的一个的第一写入地址的数据写入第一子块中 。