Patent Description:
Volatile memory requires power to maintain its data, and includes random-access memory (RAM), dynamic random-access memory (DRAM), or synchronous dynamic random-access memory (SDRAM), among others.

Non-volatile memory can retain stored data when not powered, and includes flash memory, read-only memory (ROM), electrically erasable programmable ROM (EEPROM), static RAM (SRAM), erasable programmable ROM (EPROM), resistance variable memory, such as phase-change random-access memory (PCRAM), resistive random-access memory (RRAM), magnetoresistive random-access memory (MRAM), or 3D XPoint™ memory, among others.

Flash memory is utilized as non-volatile memory for a wide range of electronic applications. Flash memory devices typically include one or more groups of one-transistor, floating gate or charge trap memory cells that allow for high memory densities, high reliability, and low power consumption.

Two common types of flash memory array architectures include NAND and NOR architectures, named after the logic form in which the basic memory cell configuration of each is arranged. The memory cells of the memory array are typically arranged in a matrix. In an example, the gates of each floating gate memory cell in a row of the array are coupled to an access line (e.g., a word line). In a NOR architecture, the drains of each memory cell in a column of the array are coupled to a data line (e.g., a bit line). In a NAND architecture, the drains of each memory cell in a string of the array are coupled together in series, source to drain, between a source line and a bit line.

Both NOR and NAND architecture semiconductor memory arrays are accessed through decoders that activate specific memory cells by selecting the word line coupled to their gates. In a NOR architecture semiconductor memory array, once activated, the selected memory cells place their data values on bit lines, causing different currents to flow depending on the state at which a particular cell is programmed. In a NAND architecture semiconductor memory array, a high bias voltage is applied to a drain-side select gate (SGD) line. Word lines coupled to the gates of the unselected memory cells of each group are driven at a specified pass voltage (e.g., Vpass) to operate the unselected memory cells of each group as pass transistors (e.g., to pass current in a manner that is unrestricted by their stored data values). Current then flows from the source line to the bit line through each series coupled group, restricted only by the selected memory cells of each group, placing current encoded data values of selected memory cells on the bit lines.

Each flash memory cell in a NOR or NAND architecture semiconductor memory array can be programmed individually or collectively to one or a number of programmed states. For example, a single-level cell (SLC) can represent one of two programmed states (e.g., <NUM> or <NUM>), representing one bit of data.

However, flash memory cells can also represent one of more than two programmed states, allowing the manufacture of higher density memories without increasing the number of memory cells, as each cell can represent more than one binary digit (e.g., more than one bit). Such cells can be referred to as multi-state memory cells, multi-digit cells, or multi-level cells (MLCs). In certain examples, MLC can refer to a memory cell that can store two bits of data per cell (e.g., one of four programmed states), a triple-level cell (TLC) can refer to a memory cell that can store three bits of data per cell (e.g., one of eight programmed states), and a quad-level cell (QLC) can store four bits of data per cell. MLC is used herein in its broader context, to can refer to any memory cell that can store more than one bit of data per cell (i.e., that can represent more than two programmed states).

Traditional memory arrays are two-dimensional (2D) structures arranged on a surface of a semiconductor substrate. To increase memory capacity for a given area, and to decrease cost, the size of the individual memory cells has decreased. However, there is a technological limit to the reduction in size of the individual memory cells, and thus, to the memory density of 2D memory arrays. In response, three-dimensional (3D) memory structures, such as 3D NAND architecture semiconductor memory devices, are being developed to further increase memory density and lower memory cost.

Such 3D NAND devices often include strings of storage cells, coupled in series (e.g., drain to source), between one or more source-side select gates (SGSs) proximate a source, and one or more drain-side select gates (SGDs) proximate a bit line. In an example, the SGSs or the SGDs can include one or more field-effect transistors (FETs) or metal-oxide semiconductor (MOS) structure devices, etc. In some examples, the strings will extend vertically, through multiple vertically spaced tiers containing respective word lines. A semiconductor structure (e.g., a polysilicon structure) can extend adjacent a string of storage cells to form a channel for the storages cells of the string. In the example of a vertical string, the polysilicon structure can be in the form of a vertically extending pillar. In some examples the string can be "folded," and thus arranged relative to a U-shaped pillar. In other examples, multiple vertical structures can be stacked upon one another to form stacked arrays of storage cell strings.

Memory arrays or devices can be combined together to form a storage volume of a memory system, such as a solid-state drive (SSD), a Universal Flash Storage (UFS ™) device, a MultiMediaCard (MMC) solid-state storage device, an embedded MMC device (eMMC™), etc. An SSD can be used as, among other things, the main storage device of a computer, having advantages over traditional hard drives with moving parts with respect to, for example, performance, size, weight, ruggedness, operating temperature range, and power consumption. For example, SSDs can have reduced seek time, latency, or other delay associated with magnetic disk drives (e.g., electromechanical, etc.). SSDs use non-volatile memory cells, such as flash memory cells to obviate internal battery supply requirements, thus allowing the drive to be more versatile and compact.

An SSD can include a number of memory devices, including a number of dies or logical units (e.g., logical unit numbers or LUNs), and can include one or more processors or other controllers performing logic functions required to operate the memory devices or interface with external systems. Such SSDs can include one or more flash memory die, including a number of memory arrays and peripheral circuitry thereon. The flash memory arrays can include a number of blocks of memory cells organized into a number of physical pages. In many examples, the SSDs will also include DRAM or SRAM (or other forms of memory die or other memory structures). The SSD can receive commands from a host in association with memory operations, such as read or write operations to transfer data (e.g., user data and associated integrity data, such as error data and address data, etc.) between the memory devices and the host, or erase operations to erase data from the memory devices.

<CIT> discloses a storage device which includes a flash memory storing data; and a controller controlling the flash memory and performing an invalidation operation in response to a trim command of a host, wherein the controller configures a trim sector bitmap using trim information provided from the host at the invalidation operation and manage the trim sector bitmap by a region unit.

<NPL> discloses NAND flash memory is being widely adopted as a storage medium for embedded devices. FTL (Flash Translation Layer) is one of the most essential software components in NAND flash-based embedded devices as it allows to use legacy files systems by emulating the traditional block device interface on top of NAND flash memory. This paper propose a FTL, called ,u-FTL. The main design goal of ,u-FTL is to reduce the memory footprint as small as possible, while providing the best performance by supporting multiple mapping granularities based on variable-sized extents. The mapping information is managed by ,u-Tree, which offers an efficient index structure for NAND flash memory.

<NPL>hotstorage17-paper-jeong. pdf discloses NAND flash memory based storage devices use Flash Translation Layer (FTL) to translate logical addresses of I/O requests to corresponding flash memory addresses. Mobile storage devices typically have RAM with constrained size, thus lack in memory to keep the whole mapping table. Therefore, mapping tables are partially retrieved from NAND flash on demand, causing random- read performance degradation. In order to improve random read performance, it is proposed HPB (Host Performance Booster) which uses host system memory as a cache for FTL mapping table. By using HPB, FTL data can be read from host memory faster than from NAND flash memory. Transactional protocols is defined between host device driver and storage device to manage the host side mapping cache. HPB is implemented on Galaxy S7 smartphone with UFS device.

<CIT> discloses a method of operation of a storage control system including: providing a memory controller; accessing a volatile memory table by the memory controller; writing a non-volatile semiconductor memory for persisting changes in the volatile memory table; and restoring a logical-to-physical table in the volatile memory table, after a power cycle, by restoring a random access memory with a logical-to-physical partition from a most recently used list.

<CIT> discloses a device for storing mapping information for mapping a logical block address identifying a block being accessed by a host to a physical block address, identifying a free area of nonvolatile memory, the block being selectively erasable and having one or more sectors that may be individually moved. The mapping information including a virtual physical block address for identifying an "original" location, within the nonvolatile memory, wherein a block is stored and a moved virtual physical block address for identifying a "moved" location, within the nonvolatile memory, wherein one or more sectors of the stored block are moved. The mapping information further including status information for use of the "original" physical block address and the "moved" physical block address and for providing information regarding "moved" sectors within the block being accessed.

<CIT> discloses an optimization method for creating an FAT file system on an NAND Flash storage. A plurality of physical blocks which are mapped to the same logical block in the NAND Flash storage file system are represented by adopting a doubly linked list mode; wherein, the head node of the doubly linked list represents one logical block; the node of the physical block represents one physical block; a plurality of physical blocks are mapped to the same logical block; the physical block nodes corresponding to the physical blocks are linked to the nodes of the logical block so as to form the doubly linked list; a plurality of nodes of the logical block are also linked in the doubly linked list mode so as to form a two-level doubly linked list; and a data structure brokering object with the doubly linked list is created in a memory. As the plurality of physical blocks which are mapped to the same logical block in the NAND Flash storage file system are represented by adopting the doubly linked list mode, only a plurality of pages needing to be written need to be written for each write request and not all the pages of the whole block need to be written, thus improving the speed of file writing.

<CIT> discloses mapping table forming and loading methods and an electronic device. The forming method comprises: mapping a logic page from a host into a physical page of NAND on a solid state memory by using page-level mapping to form a secondary mapping table; obtaining a first physical address, wherein the first physical address is a physical memory address of a first block in the secondary mapping table; and forming a mapping relationship between the first physical address and corresponding first identification information in a mapping unit of a primary mapping table, wherein the first identification information is identification information of the first block, each mapping unit in the primary mapping table contains Q flag bits, and the flag bits are used for indicating historical access information of the block.

<CIT> discloses a data storage device and a flash memory control method thereof. In a disclosed data storage device, the controller updates a logical-to-physical address mapping table between a host and the FLASH memory in accordance with a group count of a buffer block of the FLASH memory. The group count reflects a logical address distribution of write data buffered in the buffer block and with non-updated logical-to-physical address mapping information. The higher the group count, the more dispersed the logical address distribution. In this manner, each update of the logical-to-physical address mapping table just takes a short time.

<CIT> disclosed A data storage device includes a nonvolatile memory device including a main map table, the main map table including a plurality of map segments; and a controller comprising a sub map table including only some of the plurality of map segments of the main map table, the controller is suitable for updating access frequencies for the respective map segments of the main map table; and for determining whether to erase a map segment of the sub map table based on the updated access frequencies for the respective map segments.

<CIT> discloses a method and system to facilitate paging of one or more segments of a logical-to-physical (LTP) address mapping structure to a non-volatile memory. The LTP address mapping structure is part of an indirection system map associated with the non-volatile memory in one embodiment of the invention. By allowing one or more segments of the LTP address mapping structure to be paged to the non-volatile memory, the amount of volatile memory required to store the LTP address mapping structure is reduced while maintaining the benefits of the LTP address mapping structure in one embodiment of the invention.

<CIT> generally relates to a storage device including a non-volatile memory, a cache memory and a memory controller. The non-volatile memory stores a logical-to-physical address translation table for managing partitioned data and storage locations thereof. The cache memory stores a data cache and a logical-to-physical address translation table cache which holds a portion of the logical-to-physical address translation table. When the memory controller receives a data read-out request from outside, in the case no empty entry is found in the data cache, among the partitioned data in the data cache, it creates an empty entry to read out the data thereto by evacuating partitioned data of which entries in the logical-to-physical address translation table exist in the logical-to-physical address translation table cache into the non-volatile memory prior to other partitioned data.

In the drawings, which are not necessarily drawn to scale, like numerals can describe similar components in different views. Like numerals having different letter suffixes can represent different instances of similar components.

Many storage devices, such as flash devices, use translation tables to map logical elements (e.g., pages or blocks) to the physical equivalents of the logical elements. This allows the controller of the device to perform a variety of technique to increase the performance of, or longevity of, the storage elements of the device. For example, NAND flash cells experience physical wear with write or erase cycles. Further, these devices require many elements to be erased at one time (e.g., block erasure). To address these issues, the controller generally spreads writes around available cells (e.g., to reduce wearing out of these cells) and migrates good pages from blocks to erase the block and thus free additional space. In both cases, a host address for a given page or block can be constant even though the data to which it refers is moved to different physical pages or blocks by virtue of the translation table.

Translation tables are generally loaded into an internal memory of the controller (e.g., a working memory). If the table size is greater than the working memory (e.g., in random access memory (RAM), such as dynamic RAM (DRAM) or static RAM (SRAM) of the controller, a portion of the table is loaded into the working memory and the remainder of the table is stored in other storage (such as NAND flash array elements). If a translation request (e.g., a logical-to-physical (L2P) mapping) is not in the working memory, the controller replaces the internal memory portion of the table with the appropriate portion from other storage. This process can increase latencies when performing operations such as reading or writing to the storage device. Although increased working memory can reduce these occurrences, this comes at a manufacturing and power cost that can be unacceptable for a given application.

When performing certain maintenance tasks, such as garbage collection (GC), the fragmented nature of L2P tables may become an issue. For example, NAND devices typically allow single page writes but erasure is performed at the block level (e.g., a block is the smallest unit of the NAND device that can be individually erased). Garbage collection is designed to recover free space when the free physical space in the NAND devices gets low. Garbage collection generally involves copying logical valid pages from a source block to a destination block and then erasing the source block to free the space. To accomplish the copying, the L2P table is traditionally searched to identify valid pages of the source block by looking for physical addresses that refer to the source block.

The traditional approach to garbage collection when the complete L2P table cannot fit within working memory has some problems. For example, the search can be time consuming because each L2P region is retrieved from the slower NAND storage and placed into working memory to conduct the search. When an L2P region contains no physical pages in the block, the entire load and search time is wasted. This results in high latencies while the device waits for the garbage collection process to complete.

A data structure is maintained for a block to increase the speed with which garbage collection proceeds. The data structure indicates which L2P table regions are pertinent to a given block. For example, when a page is written to a block, the corresponding data structure is modified to indicate the L2P region that maps the logical page to that physical page. When garbage collection is initiated on the block, the device then loads the data structure and searches the indicated L2P table regions. This process limits the L2P regions loaded into working memory to only those regions that are likely to include references to the block.

An implementation of the data structure can include a bitmap (e.g., a binary array) in which an index corresponds to an L2P table region and the value (e.g., a binary '<NUM>' versus a binary '<NUM>') at the index indicates whether the L2P region holds (or held) a reference to a physical page of the block. In this example, when a block is erased, the related bitmap is fully reset (e.g., all values are set to binary '<NUM>'). When a page belonging to a L2P region is written to the block (e.g., for either host write or garbage collection procedure), the related bit in the bitmap is set (e.g., to binary '<NUM>'). In an example, after the block is fully written-that is, there are no more free pages-the bitmap for the block is not changed until the block is erased.

The data structure use described above provides several advantages to traditional block management. For example, fewer L2P regions are loaded into working memory, reducing the time to perform valid page searches within the block. Further, the efficiency of the search is increased as each L2P region loaded into working memory is likely to yield a valid page that will be moved during the operation. Additionally, because the data structure is updated as part of a write to a block, there is very little maintenance overhead in maintaining the structure.

Devices employing the translation table modifications discussed herein can fit in many applications. Electronic devices, such as mobile electronic devices (e.g., smart phones, tablets, etc.), electronic devices for use in automotive applications (e.g., automotive sensors, control units, driver-assistance systems, passenger safety or comfort systems, etc.), and internet-connected appliances or devices (e.g., internet-of-things (IoT) devices, etc.), have varying storage needs depending on, among other things, the type of electronic device, use environment, performance expectations, etc..

Electronic devices can be broken down into several main components: a processor (e.g., a central processing unit (CPU) or other main processor); memory (e.g., one or more volatile or non-volatile RAM memory device, such as DRAM, mobile or low-power double-data-rate synchronous DRAM (DDR SDRAM), etc.); and a storage device (e.g., non-volatile memory (NVM) device, such as flash memory, read-only memory (ROM), an SSD, an MMC, or other memory card structure or assembly, etc.). In certain examples, electronic devices can include a user interface (e.g., a display, touch-screen, keyboard, one or more buttons, etc.), a graphics processing unit (GPU), a power management circuit, a baseband processor or one or more transceiver circuits, etc..

<FIG> illustrates an example of an environment <NUM> including a host device <NUM> and a memory device <NUM> configured to communicate over a communication interface. The host device <NUM> or the memory device <NUM> can be included in a variety of products <NUM>, such as Internet of Things (IoT) devices (e.g., a refrigerator or other appliance, sensor, motor or actuator, mobile communication device, automobile, drone, etc.) to support processing, communications, or control of the product <NUM>.

The memory device <NUM> includes a memory controller <NUM> and a memory array <NUM> including, for example, a number of individual memory die (e.g., a stack of three-dimensional (3D) NAND die). In 3D architecture semiconductor memory technology, vertical structures are stacked, increasing the number of tiers, physical pages, and accordingly, the density of a memory device (e.g., a storage device). In an example, the memory device <NUM> can be a discrete memory or storage device component of the host device <NUM>. In other examples, the memory device <NUM> can be a portion of an integrated circuit (e.g., system on a chip (SOC), etc.), stacked or otherwise included with one or more other components of the host device <NUM>.

One or more communication interfaces can be used to transfer data between the memory device <NUM> and one or more other components of the host device <NUM>, such as a Serial Advanced Technology Attachment (SATA) interface, a Peripheral Component Interconnect Express (PCIe) interface, a Universal Serial Bus (USB) interface, a Universal Flash Storage (UFS) interface, an eMMC™ interface, or one or more other connectors or interfaces. The host device <NUM> can include a host system, an electronic device, a processor, a memory card reader, or one or more other electronic devices external to the memory device <NUM>. In some examples, the host <NUM> can be a machine having some portion, or all, of the components discussed in reference to the machine <NUM> of <FIG>.

The memory controller <NUM> can receive instructions from the host <NUM>, and can communicate with the memory array <NUM>, such as to transfer data to (e.g., write or erase) or from (e.g., read) one or more of the memory cells, planes, sub-blocks, blocks, or pages of the memory array <NUM>. The memory controller <NUM> can include, among other things, circuitry or firmware, including one or more components or integrated circuits. For example, the memory controller <NUM> can include one or more memory control units, circuits, or components configured to control access across the memory array <NUM> and to provide a translation layer between the host <NUM> and the memory device <NUM>.

The memory manager <NUM> can include, among other things, circuitry or firmware, such as a number of components or integrated circuits associated with various memory management functions. For purposes of the present description example memory operation and management functions will be described in the context of NAND memory. Persons skilled in the art will recognize that other forms of non-volatile memory can have analogous memory operations or management functions. Such NAND management functions include wear leveling (e.g., garbage collection or reclamation), error detection or correction, block retirement, or one or more other memory management functions. The memory manager <NUM> can parse or format host commands (e.g., commands received from a host) into device commands (e.g., commands associated with operation of a memory array, etc.), or generate device commands (e.g., to accomplish various memory management functions) for the array controller <NUM> or one or more other components of the memory device <NUM>.

The memory manager <NUM> can include a set of management tables <NUM> configured to maintain various information associated with one or more component of the memory device <NUM> (e.g., various information associated with a memory array or one or more memory cells coupled to the memory controller <NUM>). For example, the management tables <NUM> can include information regarding block age, block erase count, error history, or one or more error counts (e.g., a write operation error count, a read bit error count, a read operation error count, an erase error count, etc.) for one or more blocks of memory cells coupled to the memory controller <NUM>. In certain examples, if the number of detected errors for one or more of the error counts is above a threshold, the bit error can be referred to as an uncorrectable bit error. The management tables <NUM> can maintain a count of correctable or uncorrectable bit errors, among other things. In an example, the management tables <NUM> may include translation tables or a L2P mapping.

The memory manager <NUM> can implement and use data structures to reduce memory device <NUM> latency in operations that involve searching L2P tables for valid pages, such as garbage collection. To this end, the memory manager <NUM> is arranged to maintain a data structure (e.g., table region data structure, tracking data structure, etc.) for a physical block. The data structure includes indications of L2P mapping table regions, of the L2P table. In an example, the L2P table is larger than a working memory for the memory manager <NUM>, which may be shared with the memory controller <NUM> or other components of the memory device <NUM>. The L2P table regions are, however, not larger than the working memory, permitting the L2P regions to be loaded into the working memory and operated upon.

To efficiently manage the data structure, the memory manager <NUM> performs maintenance operations on the data structure when data is written. Thus, the memory controller <NUM> is arranged to receive a write request (e.g., from the host <NUM>) that includes a logical page and data to be written at the logical page. The memory manager <NUM> is arranged to establish (e.g., update or create) an entry in the L2P table between the logical page and a physical page of a physical block of the NAND device to which the data is written. Here, when the L2P table is greater than working memory, the entry is within a region, of multiple regions that span (e.g., completely cover) the L2P table.

The memory manager <NUM> is arranged to write an indication of the region to the data structure corresponding to the physical block of the write request. In an example, the data structure is written in the physical block. In an example, the data structure is written to a maintenance area of the array <NUM> that is separate from the block. Although it is efficient to have the memory manager <NUM> write the indication because the memory manager also selected the L2P table region for the write, other entities, such as the memory controller <NUM>, can also perform the write.

In an example, the data structure is a bitmap (e.g., a binary array). In an example, the bitmap includes a bit for each region of multiple, mutually exclusive, regions that span the L2P table. Thus, L2P table regions do not overlap with each other and the combination of all L2P table regions span the entire L2P table. The bitmap includes a bit for each of these regions. In an example, L2P table regions are ordered and an index of the bit corresponds to an order of a given L2P table region. For example, if there are two L2P table regions for the L2P table, one covering the first half of the L2P table and one covering a second half of the L2P table, then index '<NUM>' of the bitmap corresponds to the first region and index '<NUM>' of the bitmap corresponds to the second region. There is no requirement, however, that the regions cover contiguous portions of the L2P table (e.g., region A may not be next to region B in the table), nor that they have a particular order. However, whatever criteria used to assign a given L2P table region to a given index of the bitmap must be consistent (e.g., region 'Y' always maps to the same index). In an example, the L2P table region indications in the bitmap (e.g., to indicate that a given L2P table region has, at one time, a physical page in the block) are a logical one (e.g., binary '<NUM>') in a respective bit of that region.

In an example, the memory manager <NUM> is arranged to read the data structure during a garbage collection operation of the physical block to load a limited set of regions of the L2P table into a working memory. The memory manager <NUM> searches this limited set of regions to find and move valid pages from the block to another block. Once the valid pages are moved, the block is erased to complete the garbage collection. In an example, no regions of the multiple regions that are not in the limited set of regions are used in the garbage collection.

In an example, the memory manager <NUM> is arranged to initialize the data structure in response to erasing the physical block. Thus, once the garbage collection is complete, the data structure for the block is set to a known, empty, state. In an example, where the data structure is a bitmap, the data structure is initialized by writing logical zeros (e.g., binary '<NUM>') in each bit of the bitmap. In an example, the indication is unset only with the initializing. This restriction helps to reduce maintenance requirements and increase predictability for other components. Thus, when a block is fully written, the data structure will not change until the block is erased and the data structure is initialized. Also, once an L2P region is indicated in the data structure, it may not be "un-indicated" until the initialization.

The array controller <NUM> can include, among other things, circuitry or components configured to control memory operations associated with writing data to, reading data from, or erasing one or more memory cells of the memory device <NUM> coupled to the memory controller <NUM>. The memory operations can be based on, for example, host commands received from the host <NUM>, or internally generated by the memory manager <NUM> (e.g., in association with wear leveling, error detection or correction, etc.).

The array controller <NUM> can include an error correction code (ECC) component <NUM>, which can include, among other things, an ECC engine or other circuitry configured to detect or correct errors associated with writing data to or reading data from one or more memory cells of the memory device <NUM> coupled to the memory controller <NUM>. The memory controller <NUM> can be configured to actively detect and recover from error occurrences (e.g., bit errors, operation errors, etc.) associated with various operations or storage of data, while maintaining integrity of the data transferred between the host <NUM> and the memory device <NUM>, or maintaining integrity of stored data (e.g., using redundant RAID storage, etc.), and can remove (e.g., retire) failing memory resources (e.g., memory cells, memory arrays, pages, blocks, etc.) to prevent future errors.

The memory array <NUM> can include several memory cells arranged in, for example, a number of devices, planes, sub-blocks, blocks, or pages. As one example, a <NUM> GB TLC NAND memory device can include <NUM>,<NUM> bytes (B) of data per page (<NUM>,<NUM> + <NUM> bytes), <NUM> pages per block, <NUM> blocks per plane, and <NUM> or more planes per device. As another example, a <NUM> GB MLC memory device (storing two bits of data per cell (i.e., <NUM> programmable states)) can include <NUM>,<NUM> bytes (B) of data per page (<NUM>,<NUM> + <NUM> bytes), <NUM> pages per block, <NUM> blocks per plane, and <NUM> planes per device, but with half the required write time and twice the program/erase (P/E) cycles as a corresponding TLC memory device. Other examples can include other numbers or arrangements. In some examples, a memory device, or a portion thereof, can be selectively operated in SLC mode, or in a desired MLC mode (such as TLC, QLC, etc.).

In operation, data is typically written to or read from the NAND memory device <NUM> in pages, and erased in blocks. However, one or more memory operations (e.g., read, write, erase, etc.) can be performed on larger or smaller groups of memory cells, as desired. The data transfer size of a NAND memory device <NUM> is typically referred to as a page, whereas the data transfer size of a host is typically referred to as a sector.

Although a page of data can include a number of bytes of user data (e.g., a data payload including a number of sectors of data) and its corresponding metadata, the size of the page often refers only to the number of bytes used to store the user data. As an example, a page of data having a page size of <NUM> KB can include <NUM> KB of user data (e.g., <NUM> sectors assuming a sector size of <NUM> B) as well as a number of bytes (e.g., <NUM> B, <NUM> B, <NUM> B, etc.) of metadata corresponding to the user data, such as integrity data (e.g., error detecting or correcting code data), address data (e.g., logical address data, etc.), or other metadata associated with the user data.

Different types of memory cells or memory arrays <NUM> can provide for different page sizes, or can require different amounts of metadata associated therewith. For example, different memory device types can have different bit error rates, which can lead to different amounts of metadata necessary to ensure integrity of the page of data (e.g., a memory device with a higher bit error rate can require more bytes of error correction code data than a memory device with a lower bit error rate). As an example, a multi-level cell (MLC) NAND flash device can have a higher bit error rate than a corresponding single-level cell (SLC) NAND flash device. As such, the MLC device can require more metadata bytes for error data than the corresponding SLC device.

<FIG> illustrates an example of a logical-to-physical table region <NUM> in working memory <NUM>. The complete L2P table <NUM> is stored in the NAND array <NUM>. The complete L2P table, however, does not fit within the working memory <NUM>. Thus, when searching the L2P table <NUM>, processing circuitry <NUM> (e.g., a memory manager, memory controller, etc.) loads the L2P table region <NUM> from the array <NUM> into the working memory.

<FIG> illustrates an example of a relationship between a logical-to-physical region <NUM>, a physical block <NUM>, and a tracking data structure <NUM>. Here, the tracking data structure is organized as a binary array with indices beginning at zero. Thus, the element of the array corresponding to a given table region (e.g., region two) is the region minus one (e.g., index one of the tracking data structure <NUM> corresponds to region two). Each index in the data structure <NUM> uniquely corresponds to a single table region in the L2P table <NUM>. Although the bitmap or binary array structure is offered as a possible implementation of the tracking data structure, other structures may be used, such as a structured data file (e.g., extensible markup language (XML) or the like), a database, etc. Moreover, the indications may include characters or other symbols.

The relationship between these entities can be established during a host (or other) write to the block <NUM>. The L2P table <NUM> is segmented into regions, including region N <NUM>. The logical to physical page relationship is stored in region N <NUM>. The physical page <NUM> in the block <NUM> is used to store the data for the write. The index N-<NUM><NUM> corresponds to the region N <NUM>. Thus, the array element <NUM> is updated to a binary '<NUM>' to indicate that the region N <NUM> has a relationship that pertains to the block <NUM>; a binary '<NUM>' indicates that a corresponding region does not have a relationship that pertains to the block <NUM>. If the block <NUM> fills (e.g., there are no more free pages in which to write a new request), the data structure <NUM> is no longer updated.

<FIG> illustrates an example of a relationship between a logical-to-physical region <NUM>, a physical block X <NUM>, and a tracking data structure <NUM> for block X.

Here, the tracking data structure <NUM> is populated with indications of L2P table regions that pertain to block X <NUM>. During garbage collection for block X <NUM>, the tracking data structure <NUM> is read to determine which L2P table regions to load into working memory to complete the garbage collection. Here, the tracking data structure indicates that region N <NUM> has entries pertaining to block X <NUM>. Thus, region N may be loaded into non-volatile storage.

Once loaded into working memory, the region N <NUM> is searched for entries that point to block X <NUM>, such as LBA <NUM> and LBA <NUM>, among others. These pages are then written to a different block and marked invalid with respect to block X <NUM>. This process is repeated until all valid pages in block X <NUM> are moved, leaving block X <NUM> with no valid data. Block X <NUM> can then be erased, completing the garbage collection of block X. As noted above, the tracking data structure <NUM> reduces the number of L2P table regions that need to be loaded into working memory to complete the garbage collection process over traditional approaches.

<FIG> illustrate storage configurations for a verification component in a block. <FIG> illustrates an organization where a dedicated portion of the block is set-aside for controller metadata. Thus, the block is divided in the user data portion <NUM> and the auxiliary portion <NUM>. The data structure for table region tracking can be stored in the auxiliary portion, such as in the segment marked "INFO. " In contrast, <FIG> illustrates an alternative organization in which the auxiliary portions are interspersed throughout the user data segments, resulting in a heterogeneous portion <NUM>. However, the "INFO" auxiliary portions <NUM> are still located on the block and can store the data structure of the block when it was last written. Other locations that may be used to store data structures include areas of the memory device reserved for device management.

<FIG> illustrates a flowchart of a method <NUM> for NAND logical-to-physical table region tracking. Operations of the method <NUM> are performed by electronic hardware, such as that described herein (e.g., circuitry).

At operation <NUM>, a write request is received at a NAND device controller. Here, the write request includes a logical page and data to be written at the logical page.

At operation <NUM>, an entry in a logical-to-physical mapping table is established (e.g., created or updated) between the logical page and a physical page of a physical block of the NAND device to which the data is written. The entry is within a region, of multiple regions, of the logical-to-physical mapping table. In an example, the NAND device includes a working memory, the logical-to-physical mapping table is larger than the working memory, and a region of the multiple regions is not larger than the working memory.

At operation <NUM>, an indication of the region is written in a data structure corresponding to the physical block. In an example, the data structure is written in the physical block.

In an example, the data structure is a bit map. In an example, the bit map includes a bit for each region of the multiple regions. In an example, writing the indication of the region includes writing a logical one in a bit corresponding to the region in the bit map. In an example, the regions of the multiple regions are ordered, and an index of the bit corresponds to an order of a region.

In an example, the method <NUM> can optionally include erasing the physical block, and initializing the data structure in response to erasing the physical block. In an example, the indication is unset only with the initializing. In an example, when the data structure is a bitmap, initializing the data structure includes writing logical zeros in each bit of the bitmap.

In an example, the method <NUM> can optionally include reading the data structure during a garbage collection operation of the physical block, loading a limited set of regions of the logical-to-physical mapping table into a working memory of the NAND device-the limited set of regions identified as only those regions in the multiple regions that have an indication in the data structure-and retrieving entries from the limited set of regions to perform the garbage collection. In an example, no regions of the multiple regions that are not in the limited set of regions are used in the garbage collection.

<FIG> illustrates a block diagram of an example machine <NUM> upon which any one or more of the techniques (e.g., methodologies) discussed herein can perform. In alternative embodiments, the machine <NUM> can operate as a standalone device or can be connected (e.g., networked) to other machines. In a networked deployment, the machine <NUM> can operate in the capacity of a server machine, a client machine, or both in server-client network environments. In an example, the machine <NUM> can act as a peer machine in peer-to-peer (P2P) (or other distributed) network environment. The machine <NUM> can be a personal computer (PC), a tablet PC, a set-top box (STB), a personal digital assistant (PDA), a mobile telephone, a web appliance, an loT device, automotive system, or any machine capable of executing instructions (sequential or otherwise) that specify actions to be taken by that machine.

Examples, as described herein, can include, or can operate by, logic, components, devices, packages, or mechanisms. Circuitry is a collection (e.g., set) of circuits implemented in tangible entities that include hardware (e.g., simple circuits, gates, logic, etc.). Circuitry membership can be flexible over time and underlying hardware variability. Circuitries include members that can, alone or in combination, perform specific tasks when operating. In an example, hardware of the circuitry can be immutably designed to carry out a specific operation (e.g., hardwired). In an example, the hardware of the circuitry can include variably connected physical components (e.g., execution units, transistors, simple circuits, etc.) including a computer readable medium physically modified (e.g., magnetically, electrically, moveable placement of invariant massed particles, etc.) to encode instructions of the specific operation. In connecting the physical components, the underlying electrical properties of a hardware constituent are changed, for example, from an insulator to a conductor or vice versa. The instructions enable participating hardware (e.g., the execution units or a loading mechanism) to create members of the circuitry in hardware via the variable connections to carry out portions of the specific tasks when in operation. Accordingly, the computer readable medium is communicatively coupled to the other components of the circuitry when the device is operating. In an example, any of the physical components can be used in more than one member of more than one circuitry. For example, under operation, execution units can be used in a first circuit of a first circuitry at one point in time and reused by a second circuit in the first circuitry, or by a third circuit in a second circuitry at a different time.

The machine (e.g., computer system) <NUM> (e.g., the host device <NUM>, the memory device <NUM>, etc.) can include a hardware processor <NUM> (e.g., a central processing unit (CPU), a graphics processing unit (GPU), a hardware processor core, or any combination thereof, such as the memory controller <NUM>, etc.), a main memory <NUM> and a static memory <NUM>, some or all of which can communicate with each other via an interlink (e.g., bus) <NUM>. The machine <NUM> can further include a display unit <NUM>, an alphanumeric input device <NUM> (e.g., a keyboard), and a user interface (Ul) navigation device <NUM> (e.g., a mouse). In an example, the display unit <NUM>, input device <NUM> and UI navigation device <NUM> can be a touch screen display. The machine <NUM> can additionally include a storage device (e.g., drive unit) <NUM>, a signal generation device <NUM> (e.g., a speaker), a network interface device <NUM>, and one or more sensors <NUM>, such as a global positioning system (GPS) sensor, compass, accelerometer, or other sensor. The machine <NUM> can include an output controller <NUM>, such as a serial (e.g., universal serial bus (USB), parallel, or other wired or wireless (e.g., infrared (IR), near field communication (NFC), etc.) connection to communicate or control one or more peripheral devices (e.g., a printer, card reader, etc.).

The storage device <NUM> can include a machine readable medium <NUM> on which is stored one or more sets of data structures or instructions <NUM> (e.g., software) embodying or utilized by any one or more of the techniques or functions described herein. The instructions <NUM> can also reside, completely or at least partially, within the main memory <NUM>, within static memory <NUM>, or within the hardware processor <NUM> during execution thereof by the machine <NUM>. In an example, one or any combination of the hardware processor <NUM>, the main memory <NUM>, the static memory <NUM>, or the storage device <NUM> can constitute the machine readable medium <NUM>.

While the machine readable medium <NUM> is illustrated as a single medium, the term "machine readable medium" can include a single medium or multiple media (e.g., a centralized or distributed database, or associated caches and servers) configured to store the one or more instructions <NUM>.

The term "machine readable medium" can include any medium that is capable of storing, encoding, or carrying instructions for execution by the machine <NUM> and that cause the machine <NUM> to perform any one or more of the techniques of the present disclosure, or that is capable of storing, encoding or carrying data structures used by or associated with such instructions. Non-limiting machine readable medium examples can include solid-state memories, and optical and magnetic media. In an example, a massed machine readable medium comprises a machine-readable medium with a plurality of particles having invariant (e.g., rest) mass. Accordingly, massed machine-readable media are not transitory propagating signals. Specific examples of massed machine readable media can include: non-volatile memory, such as semiconductor memory devices (e.g., Electrically Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM)) and flash memory devices; magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.

The instructions <NUM> (e.g., software, programs, an operating system (OS), etc.) or other data are stored on the storage device <NUM>, can be accessed by the memory <NUM> for use by the processor <NUM>. The memory <NUM> (e.g., DRAM) is typically fast, but volatile, and thus a different type of storage than the storage device <NUM> (e.g., an SSD), which is suitable for long-term storage, including while in an "off" condition. The instructions <NUM> or data in use by a user or the machine <NUM> are typically loaded in the memory <NUM> for use by the processor <NUM>. When the memory <NUM> is full, virtual space from the storage device <NUM> can be allocated to supplement the memory <NUM>; however, because the storage <NUM> device is typically slower than the memory <NUM>, and write speeds are typically at least twice as slow as read speeds, use of virtual memory can greatly reduce user experience due to storage device latency (in contrast to the memory <NUM>, e.g., DRAM). Further, use of the storage device <NUM> for virtual memory can greatly reduce the usable lifespan of the storage device <NUM>.

In contrast to virtual memory, virtual memory compression (e.g., the Linux® kernel feature "ZRAM") uses part of the memory as compressed block storage to avoid paging to the storage device <NUM>. Paging takes place in the compressed block until it is necessary to write such data to the storage device <NUM>. Virtual memory compression increases the usable size of memory <NUM>, while reducing wear on the storage device <NUM>.

Storage devices optimized for mobile electronic devices, or mobile storage, traditionally include MMC solid-state storage devices (e.g., micro Secure Digital (microSD™) cards, etc.). MMC devices include a number of parallel interfaces (e.g., an <NUM>-bit parallel interface) with a host device, and are often removable and separate components from the host device. In contrast, eMMC™ devices are attached to a circuit board and considered a component of the host device, with read speeds that rival serial ATA™ (Serial AT (Advanced Technology) Attachment, or SATA) based SSD devices. However, demand for mobile device performance continues to increase, such as to fully enable virtual or augmented-reality devices, utilize increasing networks speeds, etc. In response to this demand, storage devices have shifted from parallel to serial communication interfaces. Universal Flash Storage (UFS) devices, including controllers and firmware, communicate with a host device using a low-voltage differential signaling (LVDS) serial interface with dedicated read/write paths, further advancing greater read/write speeds.

The instructions <NUM> can further be transmitted or received over a communications network <NUM> using a transmission medium via the network interface device <NUM> utilizing any one of a number of transfer protocols (e.g., frame relay, internet protocol (IP), transmission control protocol (TCP), user datagram protocol (UDP), hypertext transfer protocol (HTTP), etc.). Example communication networks can include a local area network (LAN), a wide area network (WAN), a packet data network (e.g., the Internet), mobile telephone networks (e.g., cellular networks), Plain Old Telephone (POTS) networks, and wireless data networks (e.g., Institute of Electrical and Electronics Engineers (IEEE) <NUM> family of standards known as Wi-Fi®, IEEE <NUM> family of standards known as WiMax®), IEEE <NUM>. <NUM> family of standards, peer-to-peer (P2P) networks, among others. In an example, the network interface device <NUM> can include one or more physical jacks (e.g., Ethernet, coaxial, or phone jacks) or one or more antennas to connect to the communications network <NUM>. In an example, the network interface device <NUM> can include a plurality of antennas to wirelessly communicate using at least one of single-input multiple-output (SIMO), multiple-input multiple-output (MIMO), or multiple-input single-output (MISO) techniques. The term "transmission medium" shall be taken to include any intangible medium that is capable of storing, encoding or carrying instructions for execution by the machine <NUM>, and includes digital or analog communications signals or other intangible medium to facilitate communication of such software.

These embodiments are also referred to herein as "examples". Such examples can include elements in addition to those shown or described.

" In this document, the term "or" is used to refer to a nonexclusive or, such that "A or B" can include "A but not B," "B but not A," and "A and B," unless otherwise indicated. In the appended claims, the terms "including" and "in which" are used as the plain-English equivalents of the respective terms "comprising" and "wherein". Also, in the following claims, the terms "including" and "comprising" are open-ended, that is, a system, device, article, or process that includes elements in addition to those listed after such a term in a claim are still deemed to fall within the scope of that claim.

In various examples, the components, controllers, processors, units, engines, or tables described herein can include, among other things, physical circuitry or firmware stored on a physical device. As used herein, "processor" means any type of computational circuit such as, but not limited to, a microprocessor, a microcontroller, a graphics processor, a digital signal processor (DSP), or any other type of processor or processing circuit, including a group of processors or multi-core devices.

The term "horizontal" as used in this document is defined as a plane parallel to the conventional plane or surface of a substrate, such as that underlying a wafer or die, regardless of the actual orientation of the substrate at any point in time. The term "vertical" refers to a direction perpendicular to the horizontal as defined above. Prepositions, such as "on," "over," and "under" are defined with respect to the conventional plane or surface being on the top or exposed surface of the substrate, regardless of the orientation of the substrate; and while "on" is intended to suggest a direct contact of one structure relative to another structure which it lies "on"(in the absence of an express indication to the contrary); the terms "over" and "under" are expressly intended to identify a relative placement of structures (or layers, features, etc.), which expressly includes--but is not limited to--direct contact between the identified structures unless specifically identified as such. Similarly, the terms "over" and "under" are not limited to horizontal orientations, as a structure can be "over" a referenced structure if it is, at some point in time, an outermost portion of the construction under discussion, even if such structure extends vertically relative to the referenced structure, rather than in a horizontal orientation.

The terms "wafer" and "substrate" are used herein to refer generally to any structure on which integrated circuits are formed, and also to such structures during various stages of integrated circuit fabrication. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the various embodiments is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.

Various embodiments according to the present disclosure and described herein include memory utilizing a vertical structure of memory cells (e.g., NAND strings of memory cells). As used herein, directional adjectives will be taken relative a surface of a substrate upon which the memory cells are formed (i.e., a vertical structure will be taken as extending away from the substrate surface, a bottom end of the vertical structure will be taken as the end nearest the substrate surface and a top end of the vertical structure will be taken as the end farthest from the substrate surface).

As used herein, directional adjectives, such as horizontal, vertical, normal, parallel, perpendicular, etc., can refer to relative orientations, and are not intended to require strict adherence to specific geometric properties, unless otherwise noted. For example, as used herein, a vertical structure need not be strictly perpendicular to a surface of a substrate, but can instead be generally perpendicular to the surface of the substrate, and can form an acute angle with the surface of the substrate (e.g., between <NUM> and <NUM> degrees, etc.).

In some embodiments described herein, different doping configurations can be applied to a source-side select gate (SGS), a control gate (CG), and a drain-side select gate (SGD), each of which, in this example, can be formed of or at least include polysilicon, with the result such that these tiers (e.g., polysilicon, etc.) can have different etch rates when exposed to an etching solution. For example, in a process of forming a monolithic pillar in a 3D semiconductor device, the SGS and the CG can form recesses, while the SGD can remain less recessed or even not recessed. These doping configurations can thus enable selective etching into the distinct tiers (e.g., SGS, CG, and SGD) in the 3D semiconductor device by using an etching solution (e.g., tetramethylammonium hydroxide (TMCH)).

Operating a memory cell, as used herein, includes reading from, writing to, or erasing the memory cell. The operation of placing a memory cell in an intended state is referred to herein as "programming," and can include both writing to or erasing from the memory cell (e.g., the memory cell can be programmed to an erased state).

According to one or more embodiments of the present disclosure, a memory controller (e.g., a processor, controller, firmware, etc.) located internal or external to a memory device, is capable of determining (e.g., selecting, setting, adjusting, computing, changing, clearing, communicating, adapting, deriving, defining, utilizing, modifying, applying, etc.) a quantity of wear cycles, or a wear state (e.g., recording wear cycles, counting operations of the memory device as they occur, tracking the operations of the memory device it initiates, evaluating the memory device characteristics corresponding to a wear state, etc.).

According to one or more embodiments of the present disclosure, a memory access device can be configured to provide wear cycle information to the memory device with each memory operation. The memory device control circuitry (e.g., control logic) can be programmed to compensate for memory device performance changes corresponding to the wear cycle information. The memory device can receive the wear cycle information and determine one or more operating parameters (e.g., a value, characteristic) in response to the wear cycle information.

It will be understood that when an element is referred to as being "on," "connected to" or "coupled with" another element, it can be directly on, connected, or coupled with the other element or intervening elements can be present. In contrast, when an element is referred to as being "directly on," "directly connected to" or "directly coupled with" another element, there are no intervening elements or layers present. If two elements are shown in the drawings with a line connecting them, the two elements can be either be coupled, or directly coupled, unless otherwise indicated.

The code can form portions of computer program products. Further, the code can be tangibly stored on one or more volatile or non-volatile tangible computer-readable media, such as during execution or at other times. Examples of these tangible computer-readable media can include, but are not limited to, hard disks, removable magnetic disks, removable optical disks (e.g., compact discs and digital video disks), magnetic cassettes, memory cards or sticks, random access memories (RAMs), read only memories (ROMs), solid state drives (SSDs), Universal Flash Storage (UFS) device, embedded MMC (eMMC) device, and the like.

Claim 1:
A method for NAND logical-to-physical table region tracking, the method comprising:
receiving a write request at a controller (<NUM>) of a NAND device (<NUM>), the write request including a logical page and data to be written at the logical page;
establishing, by the NAND controller (<NUM>), an entry in a logical-to-physical mapping table (<NUM>) between the logical page and a physical page (<NUM>) of a physical block (<NUM>) of the NAND device (<NUM>) to which the data is written, the entry being in a region (<NUM>) of the logical-to-physical mapping table (<NUM>), the region (<NUM>) being one of multiple regions (<NUM>); and
characterised by:
writing, by the NAND controller (<NUM>), an indication of the region (<NUM>) in a data structure (<NUM>), said data structure uniquely corresponding to the physical block (<NUM>).