Patents by Inventor Efrain Ortuno

Efrain Ortuno has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Fail safe refresh of data stored in NAND memory device
    Patent number: 9329802
    Abstract: Methods, systems and devices provide for refreshing a data image stored on a NAND memory device. Aspects include sequentially copying each of a series of static data partitions into a scrub portion that does not store data image partitions identified in the partition table. The sequential copying begins with a last static data partition and proceeds sequentially to a first static data partition when the scrub portion occupies higher order addresses than the last address of the last static data partition. Alternatively, the sequential copying begins with the first static data partition and proceeds sequentially to the last static data partition when the scrub portion occupies addresses that are lower than the first address of the first static data partition. The partition table may be updated as each static data partition is stored to the scrub portion. Such operations enable fail-safe scrubbing and refreshing of data in a NAND device.
    Type: Grant
    Filed: March 4, 2014
    Date of Patent: May 3, 2016
    Assignee: QUALCOMM Incorporated
    Inventors: William Edward Kimberly, Benish Babu, Richard Patrick, Efrain Ortuno
  • Fail Safe Refresh of Data Stored in NAND Memory Device
    Publication number: 20150134888
    Abstract: Methods, systems and devices provide for refreshing a data image stored on a NAND memory device. Aspects include sequentially copying each of a series of static data partitions into a scrub portion that does not store data image partitions identified in the partition table. The sequential copying begins with a last static data partition and proceeds sequentially to a first static data partition when the scrub portion occupies higher order addresses than the last address of the last static data partition. Alternatively, the sequential copying begins with the first static data partition and proceeds sequentially to the last static data partition when the scrub portion occupies addresses that are lower than the first address of the first static data partition. The partition table may be updated as each static data partition is stored to the scrub portion. Such operations enable fail-safe scrubbing and refreshing of data in a NAND device.
    Type: Application
    Filed: March 4, 2014
    Publication date: May 14, 2015
    Applicant: QUALCOMM Incorporated
    Inventors: William Edward Kimberly, Benish Babu, Richard Patrick, Efrain Ortuno