IP Library Granted Patent US 9,582,435
Granted Patent B2
US 9,582,435 · App. 14/665,893 · Granted Feb 28, 2017

Memory system and method for efficient padding of memory pages

Inventors: Vimal Jain (Bangalore, IN); Abhijeet Manohar (Bangalore, IN); Aaron Lee (Mountain View, CA); Anne Pao-Ling Koh (Fremont, CA)
Assignee: SanDisk Technologies LLC
G06F13/00G06F13/1668G06F3/064G06F12/14G06F12/1408
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,582,435
App. No.
14/665,893
Granted
Feb 28, 2017
Kind
B2
Abstract

In one embodiment, a memory system is provided comprising a memory die and a controller. The memory die comprises a non-volatile memory, a data latch, and an on-chip randomizer. The controller is configured to send a command to the memory die to cause the on-chip randomizer to store random data in the data latch and send data to the memory die to overwrite some, but not all, of the random data in the data latch, wherein the memory die is configured to transfer the data and random data stored in the data latch to the non-volatile memory. Other embodiments are provided.

Claims (35)

1. A memory system comprising:

a memory die comprising:

a non-volatile memory;

a data latch; and

an on-chip randomizer; and

a controller in communication with the memory die, wherein the controller is configured to:

send a command to the memory die to cause the on-chip randomizer to store random data in the data latch; and

send data to the memory die to overwrite some, but not all, of the random data in the data latch;

wherein the memory die is configured to transfer, from the data latch to the non-volatile memory, the data and the random data that has not been overwritten by the data.

2. The memory system of claim 1 , wherein data latch is large enough to store a page of data, and wherein the data sent to the memory die is less than a page of data.

3. The memory system of claim 1 , wherein the controller is further configured to send a scramble seed to the memory die.

4. The memory system of claim 1 , wherein the non-volatile memory is a three-dimensional memory.

5. The memory system of claim 1 , wherein the memory system is embedded in a host.

6. The memory system of claim 1 , wherein the memory system that is removably connected to a host.

7. A method for storing data in a memory die, the method comprising:

performing the following in a memory die comprising a data latch and non-volatile memory:

storing random data in the data latch;

receiving data be stored in the data latch, wherein an amount of data received is less than a capacity of the data latch;

storing the data in the data latch; and

transferring, from the data latch to the non-volatile memory, the data and the random data that has not been overwritten by the data.

8. The method of claim 7 , wherein data latch is large enough to store a page of data, and wherein the data sent to the memory die is less than a page of data.

9. The method of claim 7 further comprising receiving a scramble seed.

10. The method of claim 7 , wherein the non-volatile memory is a three-dimensional memory.

11. The method of claim 7 , wherein the memory die is embedded in a host.

12. The method of claim 7 , wherein the memory die is part of a memory system that is removably connected to a host.

13. A method for storing less than a page of data in a memory die, the method comprising:

performing the following in a controller in communication with a memory die comprising a non-volatile memory, a data latch configured to store a page of data, and a randomizer:

storing data in a volatile memory, wherein the data is less than a page; and

instead of padding the data in the volatile memory to create a full page:

sending a command to the memory die to cause the randomizer to store a page of random data in the data latch; and

sending the data from the volatile memory to the memory die to overwrite some, but not all, of the random data in the data latch.

14. The method of claim 13 further comprising sending a scramble seed to the memory die.

15. The method of claim 13 , wherein the non-volatile memory is a three-dimensional memory.

16. The method of claim 13 , wherein the memory die is embedded in a host.

17. The method of claim 13 , wherein the memory die is part of a memory system that is removably connected to a host.

Assignments (2)
CHANGE OF NAME Recorded May 25, 2016
From: SANDISK TECHNOLOGIES INC
To: SANDISK TECHNOLOGIES LLC
Reel/Frame 038812/0954 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 24, 2015
From: JAIN, VIMAL; MANOHAR, ABHIJEET; LEE, AARON; KOH, ANNE PAO-LING
To: SANDISK TECHNOLOGIES INC.
Reel/Frame 035239/0282 →
Continuity (1)
Related Publication 20160283110A1 · Sep 29, 2016