Disk defect management for a data storage device

Information

  • Patent Grant
  • 9361938
  • Patent Number
    9,361,938
  • Date Filed
    Friday, June 12, 2015
    8 years ago
  • Date Issued
    Tuesday, June 7, 2016
    7 years ago
  • CPC
  • Field of Search
    • US
    • 360 031000
    • 360 040000
    • 360 048000
    • 360 053000
    • 369 053100
    • 369 053140
    • 369 053150
    • 369 053170
    • 369 053210
    • 369 053120
    • 369 053240
    • CPC
    • G11B27/3027
    • G11B2220/90
    • G11B2220/30
    • G11B5/012
    • G11B27/36
    • G11B5/09
    • G11B7/007
    • G11B19/04
    • G11B20/1883
  • International Classifications
    • G11B27/36
    • G11B5/09
    • G11B20/18
    • G11B20/12
Abstract
A Data Storage Device (DSD) includes at least one disk surface for storing data and a memory for storing a bitmap buffer. A segment of a disk surface is identified that includes at least one defect region, and a segment bitmap is generated for the segment indicating the at least one defect region within the segment. The segment bitmap is stored in the bitmap buffer.
Description
BACKGROUND

Data Storage Devices (DSDs) are often used to record data onto or to reproduce data from a storage media. One type of storage media includes a rotating magnetic disk where a magnetic head of the DSD can read and write data in tracks on a surface of the disk, such as in a Hard Disk Drive (HDD).


Certain portions of a disk surface may have defects that prevent reliable storage of data in that location on the disk surface. The defects can include primary defects (i.e., P defects) that are identified during a manufacturing process of the DSD or grown defects (i.e., G defects) that appear in the field during operation of the DSD. These defects are typically “mapped out” using a defect map so that the defective locations on the disk surface are no longer available for storing data.


As the storage capacity of DSDs increases, the size of the defect map for the DSD also typically increases, which can reduce the overall storage capacity available to a user of the DSD. In addition, the processing time for larger defect maps is increased.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the embodiments of the present disclosure will become more apparent from the detailed description set forth below when taken in conjunction with the drawings. The drawings and the associated descriptions are provided to illustrate embodiments of the disclosure and not to limit the scope of what is claimed.



FIG. 1 is a block diagram depicting a system with a Data Storage Device (DSD) according to an embodiment.



FIG. 2 illustrates a disk surface of the DSD of FIG. 1 according to an embodiment.



FIG. 3 depicts a bitmap buffer storing segment bitmaps according to an embodiment.



FIG. 4 depicts a doubly linked list with entries corresponding to segments on a disk surface including at least one defect region according to an embodiment.



FIG. 5 is a flowchart for a defect identification process according to an embodiment.



FIG. 6 is a flowchart for another defect identification process according to an embodiment.



FIG. 7 is a flowchart for a new defect identification process according to an embodiment.



FIG. 8 is a flowchart for a defect status process for determining a defect status of a portion of a disk surface according to an embodiment.





DETAILED DESCRIPTION

In the following detailed description, numerous specific details are set forth to provide a full understanding of the present disclosure. It will be apparent, however, to one of ordinary skill in the art that the various embodiments disclosed may be practiced without some of these specific details. In other instances, well-known structures and techniques have not been shown in detail to avoid unnecessarily obscuring the various embodiments.


System Overview


FIG. 1 shows system 100 according to an embodiment which includes host 101 and Data Storage Device (DSD) 106. System 100 can be, for example, a computer system (e.g., server, desktop, mobile/laptop, tablet, smartphone, etc.) or other electronic device such as a Digital Video Recorder (DVR). In this regard, system 100 may be a stand-alone system or part of a network, such as a local or wide area network, or the Internet.


Those of ordinary skill in the art will appreciate that system 100 can include more or less than those elements shown in FIG. 1 and that the disclosed processes can be implemented in other environments


As shown in the example embodiment of FIG. 1, DSD 106 includes Non-Volatile Memory (NVM) in the form of rotating magnetic disks 131 and 133. In other embodiments, DSD 106 may include a different number of disks or a different type of NVM such as a solid-state memory in addition to rotating magnetic disks.


DSD 106 includes controller 120 which includes circuitry such as one or more processors for executing instructions including a microcontroller, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), hard-wired logic, analog circuitry and/or a combination thereof. In one implementation, controller 120 can include a system on a chip (SoC).


Host interface 126 is configured to interface DSD 106 with host 101 and may interface according to a standard such as, for example, Serial Advanced Technology Attachment (SATA), PCI express (PCIe), Small Computer System Interface (SCSI), or Serial Attached SCSI (SAS). As will be appreciated by those of ordinary skill in the art, host interface 126 can be included as part of controller 120. Although FIG. 1 depicts the co-location of host 101 and DSD 106, in other embodiments the two need not be physically co-located. In such embodiments, DSD 106 may be located remotely from host 101 and connected to host 101 via a network interface.


In the example of FIG. 1, disks 131 and 133 form a disk pack that is rotated by a spindle motor (not shown) and heads 154, 156, 158, and 160 are positioned to read and write data on a corresponding disk surface of disks 131 or 133. Each of disk surfaces 134, 136, 138, and 142 includes a number of radially spaced, concentric tracks for storing data. In more detail, heads 154, 156, 158, and 160 are connected to the distal end of actuator 130 which is rotated by Voice Coil Motor (VCM) 132 to position heads 154, 156, 158, and 160 over tracks on disk surfaces 134, 136, 138, and 142, respectively. Controller 120 can include servo control circuitry (not shown) to control the rotation of disks 131 and 133, and control the position of the heads using VCM control signal 30.



FIG. 2 provides an example of disk surface 134 with concentric tracks 202 and servo wedges 204 that are used to control the position of head 154 in relation to disk surface 134. Each servo wedge 204 may include servo information that can be read from disk surface 134 by head 154 to determine the position of head 154 over disk surface 134. For example, each servo wedge may include a pattern of alternating magnetic transitions (a servo burst), which may indicate a particular wedge number on disk surface 134.



FIG. 2 also depicts defect regions 206 and 208 which can include primary defects (i.e., P defects) that are identified during a manufacturing process of DSD 106 and grown defects (i.e., G defects) that appear in the field during operation of DSD 106. As discussed in more detail below, controller 120 can identify segments of a disk surface such as disk surface 134 including defect regions such as defect regions 206 and 208 and generate a segment bitmap for the segment indicating the defect regions within the segment.


By using segment bitmaps to identify only the segments of the disk surface that actually include defect regions, it is ordinarily possible to reduce the size of a defect mapping for the disk surface or to have a higher resolution for mapping defects. For example, a DSD with only enough memory (e.g., Dynamic Random Access Memory (DRAM)) to indicate whether a track has a defect may be able to increase the resolution of its defect mapping to instead indicate whether certain sectors within a track have a defect while using the same or less memory to store its defect map. In addition to improving the resolution of defect mapping, a smaller segment bitmap representing only a segment of the disk surface can be processed or searched quicker, which may allow for simultaneous defect processing for different disk surfaces. Such parallel processing of defect maps for different disk surfaces may allow for better visibility of defect patterns that can occur on different disk surfaces.


Returning to FIG. 1, memory 140 of DSD 106 is configured to store firmware 14, bitmap buffer 16, and linked list 18. In some implementations, memory 140 can be a volatile memory such as DRAM with copies of firmware 14, bitmap buffer 16, and linked list 18 stored in an NVM such as on disks 131 or 133 or in another NVM of DSD 106.


Firmware 14 includes computer executable instructions for execution by controller 120 in operating DSD 106. As discussed in more detail below with reference to FIG. 3, bitmap buffer 16 can be used by controller 120 to store segment bitmaps that indicate defect regions on a disk surface of DSD 106. Linked list 18 can be a doubly linked list that includes entries with location information for segments of the disk surfaces having at least one defect region and addresses for accessing corresponding segment bitmaps for the segments. As discussed in more detail below, the use of linked list 18 can ordinarily facilitate a more efficient processing of the segment bitmaps to improve defect management and the visibility of defects and defect patterns using location information provided in linked list 18. An example of linked list 18 is discussed below with reference to FIG. 4.


Example Defect Data Structures


FIG. 3 depicts an example of bitmap buffer 16 storing segment bitmaps according to an embodiment. As shown in FIG. 3, bitmap buffer 16 stores three segment bitmaps (i.e., the first, second and third segment bitmaps) mapping defects in three different segments of one or more disk surfaces (e.g., disk surfaces 134, 136, 138, and 142 in FIG. 1) with each segment including at least one defect region (e.g., defect region 206 or 208 in FIG. 2).


The size of each segment may vary based on the size and location of the defect regions in the segment and a resolution used to determine the size of the segments. For example, one segment may include only a single track while another segment may include over ten contiguous tracks such as 60 tracks. The resolution for determining whether to include multiple defect regions into a single segment may depend on factors such as a size allocated to bitmap buffer 16 and/or a resolution for defect mapping. A segment size may be determined, for example, using a track based resolution where a segment would include a track with a defect and any adjacent tracks having a defect. In another implementation, a segment size may be determined using a sector based or wedge based resolution such that a segment would include a sector with a defect or a portion of a track between two servo wedges (i.e., a wedge portion) with a defect plus any adjacent sectors or wedge portions also having a defect. As discussed in more detail below with reference to the defect identification process of FIG. 7, the segment may grow as new defects are identified in adjacent tracks, sectors, or wedge portions.


In the example of FIG. 3, each of the three segment bitmaps provides a binary defect status for a particular portion of the segment. In the example of FIG. 3, a “1” can indicate a defect in the portion of the segment and a “0” can indicate no defect in the portion of the segment. Other implementations may reverse these indications so that a “1” indicates no defect and a “0” indicates a defect.


In some implementations, the portion of the segment can be a portion of a track between two servo wedges (e.g., servo wedges 204 in FIG. 2) such that each “1” or “0” provides a defect status for a different portion of a track in the segment that is between two servo wedges. In other implementations, the portion of the segment can be a particular sector in a track such that each “1” or “0” in the segment bitmap provides a defect status for each sector in the segment. The segment bitmaps are arranged in an order to correspond to or map the physical locality of defect regions in the segment. For example, in the first segment bitmap, each eight bit line can correspond to a track in a first segment of a disk surface with each “1” or “0” in the line corresponding to a defect status for a sector in the track. A first track represented by the eight bit line in the upper left of the first segment bitmap would then have a defect in the first and fifth sectors of the track.


Each group of one or more contiguous defects can be referred to as a defect region in the segment. Since defects tend to occur more frequently in particular segments or portions of a disk surface, the size of a defect map such as a bitmap can usually be reduced by only generating and storing a defect map for the segments of the disk surface that include defect regions.


In addition, each segment bitmap in the example bitmap buffer 16 of FIG. 3 is addressed with a bitmap address indicating a storage location in memory 140 for the segment bitmap. As discussed below with reference to FIG. 4, the bitmap addresses are used in entries of linked list 18 to access the bitmaps.



FIG. 4 depicts an example of linked list 18 with entries associated with the segment bitmaps shown in FIG. 3. Each of the three entries of linked list 18 shown in FIG. 4 corresponds to a segment on a disk surface including at least one defect region. As shown in FIG. 4, each entry has an entry address (e.g., 3A411630, 3A411648, 3A411660) indicating a storage location in memory 140 for the entry. In the example of FIG. 4, linked list 18 is a doubly linked list such that each entry refers to a previous link and a next link in the list. This is shown in each entry of FIG. 4 with an address for a previous entry as a previous link and an address for a next entry as a next link. By including addresses for both a previous entry and a next entry, linked list 18 can be searched in either direction for a particular portion of a disk surface as discussed below in more detail with reference to FIG. 8.


In the example of FIG. 4, each entry of linked list 18 includes location information for a segment indicating a location of the segment and an address for accessing a segment bitmap for the segment. As shown in FIG. 4, a bitmap address is provided for each entry that indicates a location in memory 140 where a corresponding segment bitmap is stored for the segment.


The location information shown in FIG. 4 includes a head number, reference cylinder (i.e., track), a cylinder count, and a wedge count. The head number indicates a disk surface (e.g., one of disk surfaces 134, 136, 138, or 142 in FIG. 1) where the segment is located or similarly a head (e.g., head 154, 156, 158, or 160 in FIG. 1) that accesses data from the segment. A reference cylinder is also provided to indicate a starting track for the segment. Each entry also includes a cylinder count indicating a number of tracks in the segment and a wedge count indicating a number of wedges in the segment. In other implementations, the location information used in linked list 18 may differ.


As discussed in more detail below, the location information of the entries in linked list 18 can be used to determine a defect status for a particular portion of a disk surface or to update the segment bitmaps for the disk surfaces.


Example Defect Management Processes


FIG. 5 is a flowchart for a defect identification process that can be performed by controller 120 executing firmware 14 according to an embodiment. In block 502, controller 120 identifies a segment of a disk surface (e.g., one of disk surfaces 134, 136, 138, and 142) including at least one defect region. The identification of the segment may be made during a factory testing process and/or during operation of DSD 106 in the field. A defect region such as one or more sectors in a track or one or more portions of a track between servo wedges 204 can be identified when attempting to write or read data in the defect region. In the case of a primary or P defect identified during a factory test process, controller 120 may scan the disk surface for errors to identify defect regions. In the case of a grown or G defect identified during operation in the field, controller 120 may encounter repeated read or write errors for a particular sector or portion of a disk surface and then identify the sector or portion as a defect region.


In block 504, controller 120 generates a segment bitmap (e.g., the segment bitmaps shown in FIG. 3) for the segment identified in block 502. The segment bitmap indicates the at least one defect region within the segment. As discussed above, the segment bitmap can identify a location of one or more defective sectors or wedge portions that are defective.


In block 506, controller 120 stores the segment bitmap in bitmap buffer 16 in memory 140. As discussed in more detail below, the segment bitmap can be used to update the defect mapping for the disk surfaces or to determine a defect status of a particular portion of a disk surface.



FIG. 6 is a flowchart for another defect identification process that can be performed by controller 120 executing firmware 14 according to an embodiment. In block 602, controller 120 identifies a plurality of segments that each has at least one defect region. As discussed above with reference to block 502 of FIG. 5, the identification of the segments including defect regions may be made during a factory testing process (for P defects) and/or during operation of DSD 106 in the field (for G defects).


In block 604, controller 120 generates a segment bitmap (e.g., the segment bitmaps shown in FIG. 3) for each of the plurality of segments to indicate a location for the defect regions in the segments. As discussed above with reference to FIG. 3, the segment bitmaps may indicate a defect in a particular sector or wedge portion with a “1” and no defect in a particular sector or wedge portion with a “0.”


In block 606, the segment bitmaps generated in block 604 are stored in bitmap buffer 16. In block 608, controller 120 creates linked list 18 with an entry for each segment including location information for the segment and an address for accessing a segment bitmap for the segment in bitmap buffer 16. Linked list 18 can be used by controller 120 to access a segment bitmap for a portion of a disk surface.



FIG. 7 is a flowchart for a new defect identification process that can be performed by controller 120 executing firmware 14 according to an embodiment. The process of FIG. 7 can be performed after an initial set of segments with defect regions have been identified, and a defect identification process such as the process of FIG. 6 has been performed to generate segment bitmaps and create linked list 18.


In block 702, a new defect region is identified such as through repeated attempts to read or write data in a particular sector or sectors on a disk surface. In block 704, controller 120 determines whether the new defect region is adjacent to or within an existing segment. Controller 120 can use linked list 18 to search for an existing segment that includes the new defect region or is adjacent to the defect region. For example, controller 120 may compare location information for the new defect region such as a head, cylinder, and sector number for the new defect region to location information for the entries of linked list 18.


If it is determined that the new defect region is not within or adjacent to an existing segment, controller 120 identifies a new segment for the new defect region in block 706. A new segment bitmap is generated in block 708 indicating the new defect region. In block 710, controller 120 stores the new segment bitmap in bitmap buffer 16, and in block 712, a new entry is created in linked list 18 for the new segment. The new entry includes location information for locating the new segment such as a head or disk surface number, a reference cylinder or track, a cylinder count, and a wedge count. The new entry also includes an address for accessing the new segment bitmap for the new segment in bitmap buffer 16.


If the new defect region is determined to be within or adjacent to an existing segment in block 704, the process determines whether the new defect region is adjacent to an existing segment. If not, the new defect region is determined to be within an existing segment and controller 120 in block 716 updates an existing segment bitmap to indicate the new defect region within the existing segment. The updating performed in block 716 can include, for example, changing the defect status from “0” to “1” in the existing segment bitmap for sectors or wedge portions in the new defect region.


On the other hand, if it is determined that the new defect region is adjacent to an existing segment in block 714, controller 120 in block 718 expands one or more existing segment bitmaps to include the new defect region. In more detail, if the new defect region is determined to be within a particular resolution for a segment size such as within an adjacent track, sector, or wedge portion, the size of the existing segment bitmap is expanded to include the adjacent track, sector, or wedge portion including the new defect region. In some cases, the expansion of the existing segment bitmap can result in the merging of two existing segment bitmaps into a single larger segment covering both of the existing segments. This can occur when the new defect region is adjacent to two existing segments.


In block 720, controller 120 updates the existing entries or entry in linked list 18 so that the location information for the updated entry includes the new defect region. This can include, for example, increasing the cylinder and wedge counts in the entry to indicate a larger size for the segment. In another example, the reference cylinder may be decreased to include a defect region adjacent to a beginning of the existing segment. In the case where the new defect region is adjacent to two existing segments, the two entries for the existing segments can be combined into one entry for the new larger segment including the old segments and the new defect region between them.


By allowing for the expansion and merging of segment bitmaps and entries, it is ordinarily possible to use less segment bitmaps in bitmap buffer 16 and less entries in linked list 18 as new defect regions are discovered.



FIG. 8 is a flowchart for a defect status process for determining a defect status of a portion of a disk surface according to an embodiment. The process of FIG. 8 can be performed by controller 120 executing firmware 14.


In some cases, controller 120 may check a defect status of a particular portion of a disk as a background activity to identify segments of a disk surface that are suspected to have a defect region. In one example, controller 120 may look for segments having a defect region that are located the same radial or circumferential location as another segment with a defect region that has already been identified on a different disk surface. In this regard, some defects may have a pattern where each disk surface in a disk pack will have a defect region at the same radial or circumferential location. In such cases, controller 120 can identify such segments using linked list 18 instead of discovering them through write errors or read errors that occur while trying to perform a read or write operation in the defect region. This can ordinarily improve performance by not having to waste time with performing multiple read or write retries or performing other error recovery operations. In addition, controller 120 may attempt to find segments with defect regions on the same disk surface as a previously identified segment based on a defect pattern such as a spiral defect pattern or a diagonal defect pattern that might be caused by a scratch on the disk surface.


The defect status process of FIG. 8 can also be used by controller 120 as part of a process for handling a new defect region as in FIG. 7 where linked list 18 is checked in blocks 704 or 714 to determine whether a new defect region is within or adjacent to an existing segment. If controller 120 is trying to determine if a new defect region is adjacent to an existing segment, the portion of the disk that is checked for a matching segment in linked list 18 may be expanded by a track, sector or wedge portion on both sides of the new defect region to determine if there is an entry for a matching segment that is adjacent to the new defect region.


In the example process of FIG. 8, controller 120 in block 802 searches location information in linked list 18 for an entry corresponding to a matching segment that includes a particular portion of a disk surface. As discussed above, the portion of the disk surface may be suspected to have a defect region based on a defect pattern or the portion may have already been identified as having a defect region and controller 120 is checking to see if the defect region is adjacent or within an existing segment. In the example of linked list 18 shown in FIG. 4, controller 120 may search using a head number and a sector or wedge number for the portion of the disk surface.


If an entry is found in block 804, controller 120 can use the bitmap address provided in the matching entry to read a segment bitmap in block 808 for the matching segment. The segment bitmap can indicate whether the particular portion (e.g., one or more sectors or wedge portions) within the matching segment has been identified as having a defect.


If no entry is found in block 804, controller 120 determines in block 806 that there is no defect in the portion since a segment including the portion has not been previously identified. In the case where controller 120 is checking linked list 18 to determine if a new defect region is within or adjacent an existing segment, controller 120 may then identify a new segment for the new defect region, generate a new segment bitmap, and create a new entry in linked list 18. In the case where controller 120 is looking for a new defect region based on a defect pattern, controller 120 in block 806 may determine that there is not a defect pattern or that the defect pattern has not reached a particular disk surface.


OTHER EMBODIMENTS

Those of ordinary skill in the art will appreciate that the various illustrative logical blocks, modules, and processes described in connection with the examples disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. Furthermore, the foregoing processes can be embodied on a computer readable medium which causes a processor or computer to perform or execute certain functions.


To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, and modules have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Those of ordinary skill in the art may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.


The various illustrative logical blocks, units, modules, and controllers described in connection with the examples disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.


The activities of a method or process described in connection with the examples disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The steps of the method or algorithm may also be performed in an alternate order from those provided in the examples. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable media, an optical media, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuit (ASIC).


The foregoing description of the disclosed example embodiments is provided to enable any person of ordinary skill in the art to make or use the embodiments in the present disclosure. Various modifications to these examples will be readily apparent to those of ordinary skill in the art, and the principles disclosed herein may be applied to other examples without departing from the spirit or scope of the present disclosure. The described embodiments are to be considered in all respects only as illustrative and not restrictive and the scope of the disclosure is, therefore, indicated by the following claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A Data Storage Device (DSD), comprising: at least one disk surface for storing data;a memory for storing a bitmap buffer; anda controller configured to: identify a plurality of segments on the at least one disk surface with each segment including at least one defect region;generate a segment bitmap for each of the plurality of segments indicating the at least one defect region within the segment;store the generated segment bitmaps for the plurality of segments in the bitmap buffer; andcreate a linked list with a plurality of entries corresponding to the plurality of segments, wherein each entry of the plurality of entries includes location information for a segment of the plurality of segments indicating a location of the segment on the at least one disk surface and an address for accessing a segment bitmap for the segment in the bitmap buffer.
  • 2. The DSD of claim 1, wherein the controller is further configured to: identify a new defect region during operation of the DSD;determine whether the new defect region is within an existing segment of the plurality of segments; andif the new defect region is within the existing segment, update the segment bitmap for the existing segment to indicate the new defect region within the existing segment.
  • 3. The DSD of claim 1, wherein the controller is further configured to: identify a new defect region during operation of the DSD;determine whether the new defect region is within or adjacent to an existing segment of the plurality of segments on the at least one disk surface; andif the new defect region is not within or adjacent to an existing segment of the plurality of segments: identify a new segment including the new defect region;generate a new segment bitmap indicating the new defect region within the new segment;store the new segment bitmap in the bitmap buffer; andcreate a new entry in the linked list for the new segment including location information for the new segment indicating a location of the new segment on the at least one disk surface and an address for accessing the new segment bitmap in the bitmap buffer.
  • 4. The DSD of claim 1, wherein the controller is further configured to: identify a new defect region during operation of the DSD;determine whether the new defect region is adjacent to an existing segment of the plurality of segments on the at least one disk surface; andif the new defect region is adjacent to an existing segment: expand a segment bitmap for the existing segment to indicate the new defect region; andupdate an existing entry in the linked list for the existing segment so that the location information for the existing segment indicates a location on the at least one disk surface that includes the new defect region.
  • 5. The DSD of claim 1, wherein the controller is further configured to: identify a new defect region during operation of the DSD; anduse the linked list to determine whether the new defect region is within or adjacent to an existing segment of the plurality of segments.
  • 6. The DSD of claim 1, wherein the at least one disk surface includes a plurality of disk surfaces that are circumferentially aligned with each other, and wherein the controller is further configured to use the linked list to identify segments of the plurality of segments that are on different disk surfaces of the plurality of disk surfaces and are located at the same radial or circumferential location.
  • 7. The DSD of claim 1, wherein the controller is further configured to use the linked list to identify a defect pattern on a disk surface of the plurality of disk surfaces.
  • 8. The DSD of claim 1, wherein the controller is further configured to determine a defect status for a portion of the at least one disk surface by searching the linked list for an entry corresponding to a matching segment including the portion of the at least one disk surface.
  • 9. The DSD of claim 8, wherein if an entry corresponding to the matching segment is found in the linked list, the controller is further configured to read a corresponding segment bitmap for the matching segment in the bitmap buffer to determine the defect status for the portion of the at least one disk surface.
  • 10. The DSD of claim 1, wherein the at least one disk surface includes a plurality of tracks for storing data in sectors in each track of the plurality of tracks, and wherein the segment bitmap indicates whether each sector in the segment has a defect.
  • 11. The DSD of claim 1, wherein the at least one disk surface includes a plurality of tracks for storing data and a plurality of servo wedges along the plurality of tracks to indicate a position on a disk surface of the at least one disk surface, and wherein the segment bitmap indicates whether a portion of a track between two servo wedges in the segment has a defect.
  • 12. A method for operating a Data Storage Device (DSD) including at least one disk surface for storing data and a memory for storing a bitmap buffer, the method comprising: identifying a plurality of segments on the at least one disk surface with each segment including at least one defect region;generating a segment bitmap for each of the plurality of segments indicating the at least one defect region within the segment;storing the generated segment bitmaps for the plurality of segments in the bitmap buffer; andcreating a linked list with a plurality of entries corresponding to the plurality of segments, wherein each entry of the plurality of entries includes location information for a segment of the plurality of segments indicating a location of the segment on the at least one disk surface and an address for accessing a segment bitmap for the segment in the bitmap buffer.
  • 13. The method of claim 12, further comprising: identifying a new defect region during operation of the DSD;determining whether the new defect region is within an existing segment of the plurality of segments; andif the new defect region is within the existing segment, updating the segment bitmap to indicate the new defect region within the existing segment.
  • 14. The method of claim 12, further comprising: identifying a new defect region during operation of the DSD;determining whether the new defect region is within or adjacent to an existing segment of the plurality of segments on the at least one disk surface; andif the new defect region is not within or adjacent to an existing segment of the plurality of segments: identifying a new segment including the new defect region;generating a new segment bitmap indicating the new defect region within the new segment;storing the new segment bitmap in the bitmap buffer; andcreating a new entry in the linked list for the new segment including location information for the new segment indicating a location of the new segment on the at least one disk surface and an address for accessing the new segment bitmap in the bitmap buffer.
  • 15. The method of claim 12, further comprising: identifying a new defect region during operation of the DSD;determining whether the new defect region is adjacent to an existing segment of the plurality of segments on the at least one disk surface; andif the new defect region is adjacent to an existing segment: expanding a segment bitmap for the existing segment to indicate the new defect region; andupdating an existing entry in the linked list for the existing segment so that the location information for the existing segment indicates a location on the at least one disk surface that includes the new defect region.
  • 16. The method of claim 12, further comprising: identifying a new defect region during operation of the DSD; andusing the linked list to determine whether the new defect region is within or adjacent to an existing segment of the plurality of segments.
  • 17. The method of claim 12, wherein the at least one disk surface includes a plurality of disk surfaces that are circumferentially aligned with each other, and wherein the method further comprises using the linked list to identify segments of the plurality of segments that are on different disk surfaces of the plurality of disk surfaces and are located at the same radial or circumferential location.
  • 18. The method of claim 12, further comprising using the linked list to identify a defect pattern on a disk surface of the plurality of disk surfaces.
  • 19. The method of claim 12, further comprising determining a defect status for a portion of the at least one disk surface by searching the linked list for an entry corresponding to a matching segment including the portion of the at least one disk surface.
  • 20. The method of claim 19, wherein if an entry corresponding to the matching segment is found in the linked list, the method further comprises reading a corresponding segment bitmap for the matching segment in the bitmap buffer to determine the defect status for the portion of the at least one disk surface.
  • 21. The method of claim 12, wherein the at least one disk surface includes a plurality of tracks for storing data in sectors in each track of the plurality of tracks, and wherein the segment bitmap indicates whether each sector in the segment has a defect.
  • 22. The method of claim 12, wherein the at least one disk surface includes a plurality of tracks for storing data and a plurality of servo wedges along the plurality of tracks to indicate a position on a disk surface of the at least one disk surface, and wherein the segment bitmap indicates whether a portion of a track between two servo wedges in the segment has a defect.
  • 23. A non-transitory computer readable medium storing computer executable instructions for operating a Data Storage Device (DSD) including at least one disk surface for storing data and a memory for storing a bitmap buffer, wherein when the computer executable instructions are executed by a controller of the DSD, the computer executable instructions cause the controller to: identify a plurality of segments on the at least one disk surface with each segment including at least one defect region;generate a segment bitmap for each of the plurality of segments indicating the at least one defect region within the segment; andstore the generated segment bitmaps for the plurality of segments in the bitmap buffer; andcreate a linked list with a plurality of entries corresponding to the plurality of segments, wherein each entry of the plurality of entries includes location information for a segment of the plurality of segments indicating a location of the segment on the at least one disk surface and an address for accessing a segment bitmap for the segment in the bitmap buffer.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to provisional U.S. Patent Application Ser. No. 62/148,683, filed on Apr. 16, 2015, which is hereby incorporated by reference in its entirety.

US Referenced Citations (461)
Number Name Date Kind
5088081 Farr Feb 1992 A
6018789 Sokolov et al. Jan 2000 A
6065095 Sokolov et al. May 2000 A
6078452 Kittilson et al. Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6092149 Hicken et al. Jul 2000 A
6092150 Sokolov et al. Jul 2000 A
6094707 Sokolov et al. Jul 2000 A
6105104 Guttmann et al. Aug 2000 A
6111717 Cloke et al. Aug 2000 A
6145052 Howe et al. Nov 2000 A
6175893 D'Souza et al. Jan 2001 B1
6178056 Cloke et al. Jan 2001 B1
6191909 Cloke et al. Feb 2001 B1
6195218 Guttmann et al. Feb 2001 B1
6205494 Williams Mar 2001 B1
6208477 Cloke et al. Mar 2001 B1
6223303 Billings et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6246346 Cloke et al. Jun 2001 B1
6249393 Billings et al. Jun 2001 B1
6256695 Williams Jul 2001 B1
6262857 Hull et al. Jul 2001 B1
6263459 Schibilla Jul 2001 B1
6272694 Weaver et al. Aug 2001 B1
6278568 Cloke et al. Aug 2001 B1
6279089 Schibilla et al. Aug 2001 B1
6289484 Rothberg et al. Sep 2001 B1
6292912 Cloke et al. Sep 2001 B1
6310740 Dunbar et al. Oct 2001 B1
6317850 Rothberg Nov 2001 B1
6327106 Rothberg Dec 2001 B1
6337778 Gagne Jan 2002 B1
6369969 Christiansen et al. Apr 2002 B1
6384999 Schibilla May 2002 B1
6388833 Golowka et al. May 2002 B1
6405342 Lee Jun 2002 B1
6408357 Hanmann et al. Jun 2002 B1
6408406 Parris Jun 2002 B1
6411452 Cloke Jun 2002 B1
6411458 Billings et al. Jun 2002 B1
6412083 Rothberg et al. Jun 2002 B1
6415349 Hull et al. Jul 2002 B1
6425128 Krapf et al. Jul 2002 B1
6441981 Cloke et al. Aug 2002 B1
6442328 Elliott et al. Aug 2002 B1
6445524 Nazarian et al. Sep 2002 B1
6449767 Krapf et al. Sep 2002 B1
6453115 Boyle Sep 2002 B1
6470420 Hospodor Oct 2002 B1
6480020 Jung et al. Nov 2002 B1
6480349 Kim et al. Nov 2002 B1
6480932 Vallis et al. Nov 2002 B1
6483986 Krapf Nov 2002 B1
6487032 Cloke et al. Nov 2002 B1
6490635 Holmes Dec 2002 B1
6493173 Kim et al. Dec 2002 B1
6499083 Hamlin Dec 2002 B1
6519104 Cloke et al. Feb 2003 B1
6525892 Dunbar et al. Feb 2003 B1
6545830 Briggs et al. Apr 2003 B1
6546489 Frank, Jr. et al. Apr 2003 B1
6550021 Dalphy et al. Apr 2003 B1
6552880 Dunbar et al. Apr 2003 B1
6553457 Wilkins et al. Apr 2003 B1
6578106 Price Jun 2003 B1
6580573 Hull et al. Jun 2003 B1
6594183 Lofgren et al. Jul 2003 B1
6600620 Krounbi et al. Jul 2003 B1
6601137 Castro et al. Jul 2003 B1
6603622 Christiansen et al. Aug 2003 B1
6603625 Hospodor et al. Aug 2003 B1
6604220 Lee Aug 2003 B1
6606682 Dang et al. Aug 2003 B1
6606714 Thelin Aug 2003 B1
6606717 Yu et al. Aug 2003 B1
6611393 Nguyen et al. Aug 2003 B1
6615312 Hamlin et al. Sep 2003 B1
6639748 Christiansen et al. Oct 2003 B1
6647481 Luu et al. Nov 2003 B1
6654193 Thelin Nov 2003 B1
6657810 Kupferman Dec 2003 B1
6661591 Rothberg Dec 2003 B1
6665772 Hamlin Dec 2003 B1
6687073 Kupferman Feb 2004 B1
6687078 Kim Feb 2004 B1
6687850 Rothberg Feb 2004 B1
6690523 Nguyen et al. Feb 2004 B1
6690882 Hanmann et al. Feb 2004 B1
6691198 Hamlin Feb 2004 B1
6691213 Luu et al. Feb 2004 B1
6691255 Rothberg et al. Feb 2004 B1
6693760 Krounbi et al. Feb 2004 B1
6694477 Lee Feb 2004 B1
6697914 Hospodor et al. Feb 2004 B1
6704153 Rothberg et al. Mar 2004 B1
6708251 Boyle et al. Mar 2004 B1
6710951 Cloke Mar 2004 B1
6711628 Thelin Mar 2004 B1
6711635 Wang Mar 2004 B1
6711660 Milne et al. Mar 2004 B1
6715044 Lofgren et al. Mar 2004 B2
6724982 Hamlin Apr 2004 B1
6725329 Ng et al. Apr 2004 B1
6735650 Rothberg May 2004 B1
6735693 Hamlin May 2004 B1
6744772 Eneboe et al. Jun 2004 B1
6745283 Dang Jun 2004 B1
6751402 Elliott et al. Jun 2004 B1
6757481 Nazarian et al. Jun 2004 B1
6772281 Hamlin Aug 2004 B2
6781826 Goldstone et al. Aug 2004 B1
6782449 Codilian et al. Aug 2004 B1
6791779 Singh et al. Sep 2004 B1
6792486 Hanan et al. Sep 2004 B1
6799274 Hamlin Sep 2004 B1
6811427 Garrett et al. Nov 2004 B2
6826003 Subrahmanyam Nov 2004 B1
6826614 Hanmann et al. Nov 2004 B1
6832041 Boyle Dec 2004 B1
6832929 Garrett et al. Dec 2004 B2
6845405 Thelin Jan 2005 B1
6845427 Atai-Azimi Jan 2005 B1
6850443 Lofgren et al. Feb 2005 B2
6851055 Boyle et al. Feb 2005 B1
6851063 Boyle et al. Feb 2005 B1
6853731 Boyle et al. Feb 2005 B1
6854022 Thelin Feb 2005 B1
6862660 Wilkins et al. Mar 2005 B1
6880043 Castro et al. Apr 2005 B1
6882486 Kupferman Apr 2005 B1
6884085 Goldstone Apr 2005 B1
6888831 Hospodor et al. May 2005 B1
6892217 Hanmann et al. May 2005 B1
6892249 Codilian et al. May 2005 B1
6892313 Codilian et al. May 2005 B1
6895455 Rothberg May 2005 B1
6895500 Rothberg May 2005 B1
6898730 Hanan May 2005 B1
6910099 Wang et al. Jun 2005 B1
6928470 Hamlin Aug 2005 B1
6931439 Hanmann et al. Aug 2005 B1
6934104 Kupferman Aug 2005 B1
6934713 Schwartz et al. Aug 2005 B2
6940873 Boyle et al. Sep 2005 B2
6943978 Lee Sep 2005 B1
6948165 Luu et al. Sep 2005 B1
6950265 Hetzler et al. Sep 2005 B2
6950267 Liu et al. Sep 2005 B1
6954733 Ellis et al. Oct 2005 B1
6961814 Thelin et al. Nov 2005 B1
6965489 Lee et al. Nov 2005 B1
6965563 Hospodor et al. Nov 2005 B1
6965966 Rothberg et al. Nov 2005 B1
6967799 Lee Nov 2005 B1
6968422 Codilian et al. Nov 2005 B1
6968450 Rothberg et al. Nov 2005 B1
6973495 Milne et al. Dec 2005 B1
6973570 Hamlin Dec 2005 B1
6976190 Goldstone Dec 2005 B1
6983316 Milne et al. Jan 2006 B1
6986007 Procyk et al. Jan 2006 B1
6986154 Price et al. Jan 2006 B1
6995933 Codilian et al. Feb 2006 B1
6996501 Rothberg Feb 2006 B1
6996669 Dang et al. Feb 2006 B1
7002926 Eneboe et al. Feb 2006 B1
7003674 Hamlin Feb 2006 B1
7006316 Sargenti, Jr. et al. Feb 2006 B1
7009820 Hogg Mar 2006 B1
7023639 Kupferman Apr 2006 B1
7024491 Hanmann et al. Apr 2006 B1
7024549 Luu et al. Apr 2006 B1
7024614 Thelin et al. Apr 2006 B1
7027716 Boyle et al. Apr 2006 B1
7028174 Atai-Azimi et al. Apr 2006 B1
7031902 Catiller Apr 2006 B1
7046465 Kupferman May 2006 B1
7046488 Hogg May 2006 B1
7050252 Vallis May 2006 B1
7054937 Milne et al. May 2006 B1
7055000 Severtson May 2006 B1
7055167 Masters May 2006 B1
7057836 Kupferman Jun 2006 B1
7062398 Rothberg Jun 2006 B1
7075746 Kupferman Jul 2006 B1
7076604 Thelin Jul 2006 B1
7082494 Thelin et al. Jul 2006 B1
7088538 Codilian et al. Aug 2006 B1
7088545 Singh et al. Aug 2006 B1
7092186 Hogg Aug 2006 B1
7095577 Codilian et al. Aug 2006 B1
7099095 Subrahmanyam et al. Aug 2006 B1
7106537 Bennett Sep 2006 B1
7106947 Boyle et al. Sep 2006 B2
7110202 Vasquez Sep 2006 B1
7111116 Boyle et al. Sep 2006 B1
7114029 Thelin Sep 2006 B1
7120737 Thelin Oct 2006 B1
7120806 Codilian et al. Oct 2006 B1
7126776 Warren, Jr. et al. Oct 2006 B1
7129763 Bennett et al. Oct 2006 B1
7133600 Boyle Nov 2006 B1
7136244 Rothberg Nov 2006 B1
7146094 Boyle Dec 2006 B1
7149046 Coker et al. Dec 2006 B1
7150036 Milne et al. Dec 2006 B1
7155616 Hamlin Dec 2006 B1
7171108 Masters et al. Jan 2007 B1
7171110 Wilshire Jan 2007 B1
7194576 Boyle Mar 2007 B1
7200698 Rothberg Apr 2007 B1
7203139 Terada Apr 2007 B2
7205805 Bennett Apr 2007 B1
7206497 Boyle et al. Apr 2007 B1
7215496 Kupferman et al. May 2007 B1
7215771 Hamlin May 2007 B1
7237054 Cain et al. Jun 2007 B1
7240161 Boyle Jul 2007 B1
7249365 Price et al. Jul 2007 B1
7263709 Krapf Aug 2007 B1
7274639 Codilian et al. Sep 2007 B1
7274659 Hospodor Sep 2007 B2
7275116 Hanmann et al. Sep 2007 B1
7280302 Masiewicz Oct 2007 B1
7292774 Masters et al. Nov 2007 B1
7292775 Boyle et al. Nov 2007 B1
7296284 Price et al. Nov 2007 B1
7302501 Cain et al. Nov 2007 B1
7302579 Cain et al. Nov 2007 B1
7318088 Mann Jan 2008 B1
7319806 Willner et al. Jan 2008 B1
7325244 Boyle et al. Jan 2008 B2
7330323 Singh et al. Feb 2008 B1
7346790 Klein Mar 2008 B1
7366641 Masiewicz et al. Apr 2008 B1
7369340 Dang et al. May 2008 B1
7369343 Yeo et al. May 2008 B1
7372650 Kupferman May 2008 B1
7380147 Sun May 2008 B1
7392340 Dang et al. Jun 2008 B1
7404013 Masiewicz Jul 2008 B1
7406545 Rothberg et al. Jul 2008 B1
7415571 Hanan Aug 2008 B1
7436610 Thelin Oct 2008 B1
7437502 Coker Oct 2008 B1
7440214 Ell et al. Oct 2008 B1
7451344 Rothberg Nov 2008 B1
7471483 Ferris et al. Dec 2008 B1
7471486 Coker et al. Dec 2008 B1
7486060 Bennett Feb 2009 B1
7496493 Stevens Feb 2009 B1
7502284 Ihde Mar 2009 B2
7518819 Yu et al. Apr 2009 B1
7526184 Parkinen et al. Apr 2009 B1
7539924 Vasquez et al. May 2009 B1
7543117 Hanan Jun 2009 B1
7551383 Kupferman Jun 2009 B1
7562282 Rothberg Jul 2009 B1
7577973 Kapner, III et al. Aug 2009 B1
7596797 Kapner, III et al. Sep 2009 B1
7599139 Bombet et al. Oct 2009 B1
7619841 Kupferman Nov 2009 B1
7647544 Masiewicz Jan 2010 B1
7649704 Bombet et al. Jan 2010 B1
7653927 Kapner, III et al. Jan 2010 B1
7656603 Xing Feb 2010 B1
7656763 Jin et al. Feb 2010 B1
7657149 Boyle Feb 2010 B2
7672072 Boyle et al. Mar 2010 B1
7673075 Masiewicz Mar 2010 B1
7688540 Mei et al. Mar 2010 B1
7724461 McFadyen et al. May 2010 B1
7725584 Hanmann et al. May 2010 B1
7730295 Lee Jun 2010 B1
7760458 Trinh Jul 2010 B1
7768776 Szeremeta et al. Aug 2010 B1
7804657 Hogg et al. Sep 2010 B1
7813954 Price et al. Oct 2010 B1
7827320 Stevens Nov 2010 B1
7839588 Dang et al. Nov 2010 B1
7843660 Yeo Nov 2010 B1
7852596 Boyle et al. Dec 2010 B2
7859782 Lee Dec 2010 B1
7872822 Rothberg Jan 2011 B1
7898756 Wang Mar 2011 B1
7898762 Guo et al. Mar 2011 B1
7900037 Fallone et al. Mar 2011 B1
7907364 Boyle et al. Mar 2011 B2
7929234 Boyle et al. Apr 2011 B1
7933087 Tsai et al. Apr 2011 B1
7933090 Jung et al. Apr 2011 B1
7934030 Sargenti, Jr. et al. Apr 2011 B1
7940491 Szeremeta et al. May 2011 B2
7944639 Wang May 2011 B1
7945727 Rothberg et al. May 2011 B2
7949564 Hughes et al. May 2011 B1
7974029 Tsai et al. Jul 2011 B2
7974039 Xu et al. Jul 2011 B1
7982993 Tsai et al. Jul 2011 B1
7984200 Bombet et al. Jul 2011 B1
7990648 Wang Aug 2011 B1
7991949 Gabryjelski Aug 2011 B2
7992179 Kapner, III et al. Aug 2011 B1
8004785 Tsai et al. Aug 2011 B1
8006027 Stevens et al. Aug 2011 B1
8014094 Jin Sep 2011 B1
8014977 Masiewicz et al. Sep 2011 B1
8019914 Vasquez et al. Sep 2011 B1
8040625 Boyle et al. Oct 2011 B1
8078943 Lee Dec 2011 B1
8079045 Krapf et al. Dec 2011 B2
8082433 Fallone et al. Dec 2011 B1
8085487 Jung et al. Dec 2011 B1
8089719 Dakroub Jan 2012 B1
8090902 Bennett et al. Jan 2012 B1
8090906 Blaha et al. Jan 2012 B1
8091112 Elliott et al. Jan 2012 B1
8094396 Zhang et al. Jan 2012 B1
8094401 Peng et al. Jan 2012 B1
8116020 Lee Feb 2012 B1
8116025 Chan et al. Feb 2012 B1
8134793 Vasquez et al. Mar 2012 B1
8134798 Thelin et al. Mar 2012 B1
8139301 Li et al. Mar 2012 B1
8139310 Hogg Mar 2012 B1
8144419 Liu Mar 2012 B1
8145452 Masiewicz et al. Mar 2012 B1
8149528 Suratman et al. Apr 2012 B1
8154812 Boyle et al. Apr 2012 B1
8159768 Miyamura Apr 2012 B1
8161328 Wilshire Apr 2012 B1
8164849 Szeremeta et al. Apr 2012 B1
8174780 Tsai et al. May 2012 B1
8190575 Ong et al. May 2012 B1
8194338 Zhang Jun 2012 B1
8194340 Boyle et al. Jun 2012 B1
8194341 Boyle Jun 2012 B1
8201066 Wang Jun 2012 B1
8271692 Dinh et al. Sep 2012 B1
8279550 Hogg Oct 2012 B1
8281218 Ybarra et al. Oct 2012 B1
8285923 Stevens Oct 2012 B2
8289656 Huber Oct 2012 B1
8305705 Roohr Nov 2012 B1
8307156 Codilian et al. Nov 2012 B1
8310775 Boguslawski et al. Nov 2012 B1
8315006 Chahwan et al. Nov 2012 B1
8316263 Gough et al. Nov 2012 B1
8320067 Tsai et al. Nov 2012 B1
8324974 Bennett Dec 2012 B1
8332695 Dalphy et al. Dec 2012 B2
8339919 Lee Dec 2012 B1
8341337 Ong et al. Dec 2012 B1
8350628 Bennett Jan 2013 B1
8356184 Meyer et al. Jan 2013 B1
8370683 Ryan et al. Feb 2013 B1
8375225 Ybarra Feb 2013 B1
8375274 Bonke Feb 2013 B1
8380922 DeForest et al. Feb 2013 B1
8390948 Hogg Mar 2013 B2
8390952 Szeremeta Mar 2013 B1
8392689 Lott Mar 2013 B1
8407393 Yolar et al. Mar 2013 B1
8413010 Vasquez et al. Apr 2013 B1
8417566 Price et al. Apr 2013 B2
8421663 Bennett Apr 2013 B1
8422172 Dakroub et al. Apr 2013 B1
8427770 O'Dell et al. Apr 2013 B1
8427771 Tsai Apr 2013 B1
8429343 Tsai Apr 2013 B1
8433937 Wheelock et al. Apr 2013 B1
8433977 Vasquez et al. Apr 2013 B1
8441909 Thayamballi et al. May 2013 B1
8456980 Thayamballi Jun 2013 B1
8458526 Dalphy et al. Jun 2013 B2
8462466 Huber Jun 2013 B2
8467151 Huber Jun 2013 B1
8483027 Mak et al. Jul 2013 B1
8489841 Strecke et al. Jul 2013 B1
8493679 Boguslawski et al. Jul 2013 B1
8499198 Messenger et al. Jul 2013 B1
8514506 Li et al. Aug 2013 B1
8554741 Malina Oct 2013 B1
8560759 Boyle et al. Oct 2013 B1
8576509 Hogg Nov 2013 B1
8576511 Coker et al. Nov 2013 B1
8578100 Huynh et al. Nov 2013 B1
8578242 Burton et al. Nov 2013 B1
8582223 Garani et al. Nov 2013 B1
8582231 Kermiche et al. Nov 2013 B1
8589773 Wang et al. Nov 2013 B1
8593753 Anderson Nov 2013 B1
8599512 Hogg Dec 2013 B2
8605379 Sun Dec 2013 B1
8611031 Tan et al. Dec 2013 B1
8611032 Champion et al. Dec 2013 B2
8612798 Tsai Dec 2013 B1
8619383 Jung et al. Dec 2013 B1
8619508 Krichevsky et al. Dec 2013 B1
8619529 Liew et al. Dec 2013 B1
8621115 Bombet et al. Dec 2013 B1
8621133 Boyle Dec 2013 B1
8625224 Lin et al. Jan 2014 B1
8625225 Wang Jan 2014 B1
8626463 Stevens et al. Jan 2014 B2
8630052 Jung et al. Jan 2014 B1
8631188 Heath et al. Jan 2014 B1
8635412 Wilshire Jan 2014 B1
8661193 Cobos et al. Feb 2014 B1
8665547 Yeo et al. Mar 2014 B1
8667248 Neppalli Mar 2014 B1
8670205 Malina et al. Mar 2014 B1
8671250 Lee Mar 2014 B2
8681442 Hogg Mar 2014 B2
8681445 Kermiche et al. Mar 2014 B1
8683295 Syu et al. Mar 2014 B1
8687306 Coker et al. Apr 2014 B1
8687307 Patton, III Apr 2014 B1
8687313 Selvaraj Apr 2014 B2
8693133 Lee et al. Apr 2014 B1
8698492 Mak et al. Apr 2014 B1
8699171 Boyle Apr 2014 B1
8699172 Gunderson et al. Apr 2014 B1
8711500 Fong et al. Apr 2014 B1
8711506 Giovenzana et al. Apr 2014 B1
8711665 Abdul Hamid Apr 2014 B1
8717694 Liew et al. May 2014 B1
8717695 Lin et al. May 2014 B1
8730612 Haralson May 2014 B1
8743502 Bonke et al. Jun 2014 B1
8749911 Sun et al. Jun 2014 B1
8753146 Szeremeta et al. Jun 2014 B1
8755136 Ng et al. Jun 2014 B1
8756361 Carlson et al. Jun 2014 B1
8760782 Garani et al. Jun 2014 B1
8760792 Tam Jun 2014 B1
8769593 Schwartz et al. Jul 2014 B1
8773793 McFadyen Jul 2014 B1
8773802 Anderson et al. Jul 2014 B1
8773807 Chia et al. Jul 2014 B1
8773957 Champion et al. Jul 2014 B1
8780470 Wang et al. Jul 2014 B1
8782334 Boyle et al. Jul 2014 B1
8786976 Kang et al. Jul 2014 B1
8787125 Lee Jul 2014 B1
8792196 Lee Jul 2014 B1
8792200 Tam et al. Jul 2014 B1
8797667 Barlow et al. Aug 2014 B1
8799977 Kapner, III et al. Aug 2014 B1
8817413 Knigge et al. Aug 2014 B1
8817584 Selvaraj Aug 2014 B1
8825976 Jones Sep 2014 B1
8825977 Syu et al. Sep 2014 B1
20090113702 Hogg May 2009 A1
20100306551 Meyer et al. Dec 2010 A1
20110226729 Hogg Sep 2011 A1
20120159042 Lott et al. Jun 2012 A1
20120275050 Wilson et al. Nov 2012 A1
20120281963 Krapf et al. Nov 2012 A1
20120324980 Nguyen et al. Dec 2012 A1
Provisional Applications (1)
Number Date Country
62148683 Apr 2015 US