Method and system for dynamically allocating read and write sequence randomizer
Summary by NHIP
Dynamic Randomizer Seed Allocation
The hard disk drive compares input data streams against multiple predefined randomizer seeds stored in lookup tables to identify marginal data. It then dynamically encodes either the first or another seed into the preamble field of a data sector to prevent adjacent track mis-writes and mis-reads.
Claim Score by NHIP
Abstract
A data formatting system and method to improve data efficiency and integrity in a hard disk are disclosed. One embodiment provides a disk drive system having a plurality of lookup tables which store a plurality of randomizer seeds which may be dynamically encoded into the preamble field of a customer data block if the customer data is deemed marginal. Encoding the randomizer seed into the preamble field prevents adjacent data track mis-writes and mis-reads.

Term
Projected expiry 15 August 2030.
- Priority and filed
- Granted
- Today
- Projected expiry
5 claims: 1 independent, 4 dependent
- 1Broadest claimClaim Score 57, broad(NHIP)A hard disk drive, comprising:a dynamic data sequence randomizer;a plurality of lookup tables coupled to the dynamic data sequence randomizer;predictive code for looking up a first of a plurality of predefined randomizer seeds defined in the plurality of lookup tables;compare logic for comparing data of an input data stream written to the hard disk drive according to said first randomizer seed to said data of said input data stream written to said hard disk drive according to another of said plurality of predefined randomizer seeds to determine whether said data of said input data stream is marginal;and a data encoder for dynamically encoding either said first randomizer seed or said another randomizer seed of the lookup tables into a preamble field of a data sector of the data of the input data stream based on said comparing.
50 paragraphs in 5 sections, as filed
TECHNICAL FIELD
The present invention relates to the field of hard disk drive development and manufacturing, and more particularly to a method and system for dynamically allocating write sequence randomizers.
BACKGROUND ART
Hard disk drives (HDD) are used in almost all computer system operations. In fact, most computing systems are not operational without some type of hard disk drive to store the most basic computing information such as the boot operation, the operating system, the applications, and the like. In general, the hard disk drive is a device which may or may not be removable, but without which the computing system will generally not operate.
The basic hard disk drive model includes a storage disk or hard disk that spins at a designed rotational speed. An actuator arm with a suspended slider is utilized to reach out over the disk. The slider is coupled with a suspension that supports both the body of the slider and a head assembly that has a magnetic read/write transducer or head or heads for reading/writing information to or from a location on the disk. The complete head assembly, e.g., the suspension, slider, and head, is called a head gimbal assembly (HGA).
The basic hard drive also typically includes a magnetic medium for storing data in magnetic form and the magnetic transducers are used to read and write magnetic data respectively off read and write tracks on the disks in the hard disk drive. A typical hard disk drive includes one or more disks which are mounted on a spindle motor. The spindle motor rotates the disks during read and write operations.
Information on the disks are typically stored in the form of magnetic transitions on a series of concentric spaced tracks, as shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, formatted on the surface of the magnetic disks. The tracks are severally divided into a number of sectors with each sector comprising a number of information fields including fields for storing customer data, sector identification and synchronization information.
An actuator assembly typically including a number of arms with one or more transducers and sliders that fly over the surface of the disks as the rotation of the spindle motor increases causing the head to hover above the disk in an air bearing produced by the high speed disk rotation to read and write to and from the tracks.
In conventional hard disk drives, the data section include predefined customer data and a number of fields that store specific types of information that are both unique to the customer and to the drive. Such fields may include one or more synchronization fields, an error correction code (ECC) field, a cyclic redundancy code field (CRC), a seed randomizer field and a pad field. <figref idrefs="DRAWINGS">FIG. 2</figref> illustrates a conventional data block that is written to each sector in the tracks. The data block shown in <figref idrefs="DRAWINGS">FIG. 2</figref> is encoded for storage in the disk.
As shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, each data block includes a preamble field <b>210</b>, a block marker field <b>220</b>, a randomizer seed field <b>220</b>, a cyclical redundancy field <b>230</b>, a data field <b>240</b>, an error correction field <b>250</b> and a data pad <b>260</b>. As shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, each data block includes a preamble field, a block maker field, a randomizer seed, a data portion, a cyclical redundancy check (RC), a pad and an error correction field. The preamble bit sequence is selected to produce a read head response during a subsequent read process that is easy for the read channel to acquire phase lock with in preparation for decoding that data that follows. In the data block shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the randomizer seed is used to randomize the data portion and typically consists of a three byte sequence which is selected for each data field.
The pseudo random data sequence based randomizer is generally used to improve the reliability of the write and retrieval process. The randomizer is generally used to avoid worst-case data pattern sequence from being written or read to adjacent track thereby reducing interference between tracks. In the conventional data sector shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the randomizer seed is typically hard-coded with a fixed seed value in the randomizer field. To reduce the presence of errors in the customer data, the randomizer seed is typically hard-coded with a fixed seed.
Unfortunately hard-coding the seed code may result in the random data sequencer generating worst case data patterns to be written to sectors in the tracks. Thus, if a customer uses or prefers for some reason such a pattern, the drive may be initialized with a problematic randomizer seed.
In the conventional data block shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the assignment of the randomizer seed for each cylinder of the data tracks are hard-coded (fixed) thereby restricting the flexibility for a user to change the code in the event of errors or misreads. In addition to the above short comings, the conventional data sector lends itself to low signal to noise ratio between tracks and therefore often results in the wrong tracks written or read when a worst-case data pattern is initialized.
There is therefore a need for an improved data formatting approach which provides for efficient and flexible data decoding that allows for a dynamic allocation of randomizer seeds to reduce adjacent track interference and improve data integrity.
SUMMARY
In accordance with certain aspects of the present invention, manufactured disk drives in the manufacturing environment are encoded with a dynamic sequence randomizer allocation mechanism for dynamically allocating sequence randomizers for customer data being read or written to a disk drive. One embodiment provides a dynamic read and write allocation sequence randomizer which advantageously encodes randomizer seed in the sync field of data sectors of data pattern being read or written to a storage disk.
In one embodiment, a plurality of lookup tables are generated to store randomizer codes which may be dynamically encoded into the data pattern of customer data being written or read. A predictive code provided in the dynamic sequence randomizers of the present invention monitors data patterns being read or written to determine when a worst-case data pattern is present in the disk drive and allows for the dynamic switching of the randomizer seeds using the pre-stored randomizer seed in the lookup table to read or write the data. In one embodiment a histogram of the lookup table is kept to enable the disk drive to detect worst-case data pattern to aid in the reassignment of the randomizer seed.
BRIEF DESCRIPTION OF THE DRAWINGS
<figref idrefs="DRAWINGS">FIG. 1</figref> is top perspective view of a disk with concentric tracks of the conventional data storage device.
<figref idrefs="DRAWINGS">FIG. 2</figref> is an exemplary block diagram of a conventional data block with a randomizer seed field of disk of a conventional data storage device.
<figref idrefs="DRAWINGS">FIG. 3</figref> is a top perspective view of a disk drive system with its upper housing cover removed, in accordance with one embodiment of the present invention.
<figref idrefs="DRAWINGS">FIG. 4</figref> is a block diagram illustration of one embodiment of a disk file system for implementing one embodiment of the present invention in a hard disk drive.
<figref idrefs="DRAWINGS">FIG. 5</figref> illustrates various fields of a data sector including a seed randomizer field advantageously incorporated into the preamble field in accordance with the teachings of one embodiment of the present invention.
<figref idrefs="DRAWINGS">FIG. 6</figref> illustrates various fields of a data sector including a seed randomizer field advantageously incorporated into the preamble field and an embodiment of look-up tables utilized by the randomizer seed field in accordance with the teachings of one embodiment of the present invention.
<figref idrefs="DRAWINGS">FIG. 7</figref> illustrates various operations associated with performing a write operation in accordance to one embodiment of the present invention.
<figref idrefs="DRAWINGS">FIG. 8</figref> illustrates various operations associated with performing a read operation in accordance to one embodiment of the present invention.
While the invention is amenable to various modification and alternative forms, specifics thereof have been shown by way of example in the drawings and will be described in detail herein below.
DETAILED DESCRIPTION OF VARIOUS EMBODIMENTS
Reference will now be made in detail to the alternative embodiment(s) of the present invention. While the invention will be described in conjunction with the alternative embodiment(s), it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the invention as defined by the appended claims.
Furthermore, in the following detailed description of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be recognized by one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the present invention.
The discussion will begin with an overview of a hard disk drive and components connected therewith. The discussion will then focus on embodiments of a method and system for dynamically allocating randomizer seeds for sequencing data patterns in a data storage system.
Overview
In general, the HDD comb (also referred to as an E-block) serves as a platform on which the suspensions (compliant members containing sliders with recording heads) are mounted. The recording heads fly at a constant height (on the order of nanometers) above the disk surface tracking pre-written servo information. An HDD carriage assembly forms the primary motive mechanical system that enables a disk-drive to randomly access data to be written or recorded on the disk surfaces.
<figref idrefs="DRAWINGS">FIG. 3</figref> illustrates one embodiment of a data storage system <b>300</b> in accordance with the teachings of an embodiment of the present invention. As shown in <figref idrefs="DRAWINGS">FIG. 3</figref>, each disk <b>324</b> is typically magnetically formatted to include a number of spaced concentric tracks similar to those shown in <figref idrefs="DRAWINGS">FIG. 1</figref>. Digital information is typically stored in the form of magnetic transitions along the tracks <b>350</b>. The tracks <b>350</b> are generally divided into a number of information fields, including fields for storing data and synchronization information including randomizer seed information according to the teachings of the present invention.
Writing data to a magnetic storage disk <b>324</b> generally involves passing a current through the write element of the transducer assembly <b>327</b> to produce magnetic lines of flux which magnetizes a specific location of the disk surface <b>324</b>. Reading data from a specified disk location is normally accomplished by a read element of the transducer assembly <b>327</b> sensing the magnetic field or flux lines emanating from the magnetized locations of the disk surface <b>324</b>.
The disk storage system <b>300</b> shown in <figref idrefs="DRAWINGS">FIG. 3</figref> preferably employs a closed-loop servo control system for positioning the read/write transducers <b>327</b> to specified storage locations on the data storage disk <b>324</b>. During normal data storage system operation, a servo transducer is employed to read information for the purpose of following a specified track and locating specified track and data sector location on the disk surface <b>324</b>. In one embodiment of the present invention, the signal to noise ratio (SNR) between tracks is made big enough to prevent the inadvertent reading or writing of adjacent tracks. Making SNR large enough ensures that in the event the head reads or writes to the wrong track, that write or read operation will fail. In one embodiment of the present invention, alternating use of randomizer seeds for adjacent tracks prevents the inadvertent reading of adjacent tracks.
In one embodiment of the present invention, the randomizer seed implementation of the present invention provides for improved track format efficiency in a direct access storage device by incorporating the randomizer seed code in the sync field required to complete a write operation. Incorporating the randomizer seed in the sync field allows the system to be able to dynamically allocate the randomizer seed code and thereby reduce the data corruption and track mis-reads associated with the conventional art.
With reference now to <figref idrefs="DRAWINGS">FIG. 4</figref>, an illustration of one embodiment of a disk file system for implementing an embodiment of the present invention is shown. The disk file system <b>400</b> shown in <figref idrefs="DRAWINGS">FIG. 4</figref> includes hard disk controller <b>410</b>, data channel <b>420</b>, preamplifier <b>430</b> and head <b>440</b>. In one embodiment of the present invention, the dynamic sequence randomizer <b>412</b> is implemented in the hard disk controller <b>410</b>. Implementing the dynamic sequence randomizer <b>412</b> in the hard disk controller <b>410</b> enables the present invention, unlike the conventional art, to have the randomizer on the disk drive to allow for the dynamic allocation of the randomizer seed as data is written or read.
In one embodiment of the present invention, the dynamic allocation of randomizer seed is implemented by verifying customer data. The data channel <b>420</b> uses sampling techniques for detecting readback signals from the disk surfaces that contain the customer data. The disk controller <b>410</b> performs all the memory management running firmware to the actuator to the disk.
In one embodiment, the dynamic sequence randomizer includes predictive code which monitors the customer data pattern being written or read to determine if a marginal data pattern matches that presented by the customer data <b>450</b>. During a data readback, if the hard disk controller <b>410</b> detects a marginal data stream (worst case data) the data channel <b>420</b> assigns the correct seed setting provided by the dynamic sequence randomizer <b>412</b> from the sync field to ensure that the integrity of the data is preserved.
The invention encodes the randomizer seed into the sync field because the sync field with bit information indicates which look-up table to choose to dynamically assign the appropriate randomizer seed for a particular read/write operation. In one embodiment, the signal to noise ratio between adjacent tracks is made large enough to prevent mis-reads or mis-writes between tracks. In one embodiment, alternating randomizer sequences are assigned to alternating tracks so that even if the tracks have the same information, a marginal pattern is avoided from being read or written.
In an alternative implementation, the drive monitors the Bit Error Ratio performance for the variously used randomizers in the form of a histogram. In one embodiment, the histogram may be the same for all seeds generated by the dynamic sequence randomizer <b>412</b>
With reference now to <figref idrefs="DRAWINGS">FIG. 5</figref> an illustration of one embodiment of a data sector of a data track in accordance with one embodiment of the present invention is shown. The data block shown in <figref idrefs="DRAWINGS">FIG. 5</figref> advantageously eliminates the separate randomizer seed field of the conventional art and incorporates the randomizer seed into the preamble field <b>510</b> in accordance with the teachings of the present invention.
Data is written to a data storage disk according to a sequential format. The data sector <b>500</b> shown in <figref idrefs="DRAWINGS">FIG. 5</figref> includes a sync field <b>510</b> which includes synchronization patterns that allow the data channel to acquire the clock frequency, and a sync word <b>511</b> which includes a pattern that identifies the start of the encoded customer data. The sync field <b>510</b> also includes the randomizer seed or code <b>512</b> which is dynamically encoded according to the teachings of the present invention.
In one embodiment of the present invention, the randomizer seed <b>512</b> is advantageously incorporated into the sync field <b>510</b> thereby eliminating the need for a separate randomizer seed field. Incorporating the randomizer seed code <b>512</b> into the sync field <b>510</b> improves format efficiency and allows for more customer data to be stored on the media per unit area. Encoding the randomizer seed <b>512</b> into the sync field <b>510</b> also minimizes error propagation, thereby reducing the reading and writing to the wrong tracks in the disk. In one embodiment, the randomizer seed code is about 4 bits of information.
In a typical conventional disk drive, the randomizer seed allows a marginal data pattern (worst case) which is typically a sequence of zeros pattern. Thus, if the disk drive control code encounters the zero pattern, the randomizer seed allocation could be dynamically switched to a different setting which removes the exposure to the marginal data pattern. In one embodiment, the data channel assigns the correct seed setting from the sync (preamble) field <b>510</b> to the correct pattern to protect the integrity of the data. Customer data is stored in a customer data field <b>520</b>.
The customer data to be written to the HDD is applied to an encoder which encodes the customer data according to pre-established coding schemes. For example, the customer data may be encoded to include timing information to enable the efficient readback processing in the HDD.Error correction code (ECC) is stored in the ECC field <b>530</b> toward the end of the data sector <b>500</b> to provide the capability to correct certain errors that occur within the sector <b>500</b>.
With reference now to <figref idrefs="DRAWINGS">FIG. 6</figref> an illustration of one embodiment of a data sector of a data track in accordance with one embodiment of the present invention is shown. The data block shown in <figref idrefs="DRAWINGS">FIG. 6</figref> advantageously eliminates the separate randomizer seed field of the conventional art and incorporates the randomizer seed into the preamble field in accordance with the teachings of the present invention. Data is written to a data storage disk according to a sequential format.
The data sector <b>600</b> shown in <figref idrefs="DRAWINGS">FIG. 6</figref> includes a sync field <b>610</b> which includes synchronization patterns that allow the data channel to acquire the clock frequency, and a sync word <b>611</b> which includes a pattern that identifies the start of the encoded customer data. The sync field <b>610</b> also includes the randomizer seed or code <b>612</b>.
In one embodiment, the randomizer seed code <b>612</b> is an encoding block size of 4 bits which indicates which look-up tables <b>620</b>-<b>630</b> to search to retrieve the appropriate randomizer code for a particular data sequence pattern. The 4 bits are dynamically written data to represent the randomizer seed code.
In one embodiment, look-up tables <b>620</b>-<b>630</b> store data sequences for even and odd tracks on the disk. Using the look-up tables <b>620</b>-<b>630</b>, the present randomizer implementation of the present invention is able to generate a large signal to noise ratio between adjacent tracks to avoid the reading or writing to the wrong track. In one embodiment, the lookup tables <b>620</b>-<b>630</b> are generated by merging good and bad patterns and may be changed depending on the environmental conditions of the disk drive.
Referring now to <figref idrefs="DRAWINGS">FIG. 7</figref> is a depiction of one embodiment of a write operation of the present invention. A write operation is initiated <b>710</b> when the dynamic sequence randomizer <b>412</b> generates <b>620</b> a number of look-up tables with a sequence of randomizer seeds. An incoming customer data sequence <b>630</b> is received for decoding to determine whether the incoming data pattern to be written is marginal (worst-case).
During the decoding of the incoming customer data pattern, the randomizer seed code of the preamble field is compared <b>640</b> with the look-up table to determine whether the incoming data pattern to be written is marginal <b>650</b> (worst-case). If the incoming data pattern is marginal, an appropriate randomizer seed from the look-up tables is written <b>660</b> to the sync field of the data.
Referring now to <figref idrefs="DRAWINGS">FIG. 8</figref> is a depiction of one embodiment of a read operation of the present invention. As depicted in <figref idrefs="DRAWINGS">FIG. 8</figref>, a read operation is initiated <b>810</b> by ensuring that a chosen randomizer seed is added to the preamble <b>830</b> associated with a particular data pattern being read. The preamble is then read and the randomizer is decoded <b>840</b>. The data channel then communicates with the hard disk controller to let the hard disk controller know of which lookup table should be used for the decoded randomizer. The randomizer is decoded to retrieve the associating seed from the preamble.
Example embodiments of the present technology are thus described. Although the subject matter has been described in a language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Contents5
9 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9
Every citation, both waysCites: the store holds 21 of 22
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US12283971B2 | Cited by | United States of America | Applicant |
| US2015077876A1 | Cited by | United States of America | Pre-grant |
| US9384779B2 | Cited by | United States of America | Search report |
| TWI877059B | Cited by | Taiwan Province of China | Examiner |
| US2011149432A1 | Cited by | United States of America | Pre-grant |
| US9268531B1 | Cited by | United States of America | Applicant |
| US12197285B2 | Cited by | United States of America | Applicant |
| US8988807B1 | Cited by | United States of America | Search report |
| TWI855978B | Cited by | Taiwan Province of China | Examiner |
| TWI841391B | Cited by | Taiwan Province of China | Examiner |
| US11916569B2 | Cited by | United States of America | Applicant |
| US8982491B1 | Cited by | United States of America | Applicant |
| US2002046359A1 | Cites | United States of America | Applicant |
| US2004258398A1 | Cites | United States of America | Applicant |
| US2005270855A1 | Cites | United States of America | Applicant |
| US2006085644A1 | Cites | United States of America | Applicant |
| US2006203367A1 | Cites | United States of America | Applicant |
| US2006248427A1 | Cites | United States of America | Applicant |
| US2006294331A1 | Cites | United States of America | Applicant |
| US4993029A | Cites | United States of America | Applicant |
| US5889796A | Cites | United States of America | Applicant |
| US6052815A | Cites | United States of America | Applicant |
| US6167550A | Cites | United States of America | Applicant |
| US6177890B1 | Cites | United States of America | Applicant |
| US6195732B1 | Cites | United States of America | Applicant |
| US6208477B1 | Cites | United States of America | Applicant |
| US6392829B1 | Cites | United States of America | Search report |
| US6687375B1 | Cites | United States of America | Applicant |
| US6757845B2 | Cites | United States of America | Applicant |
| US6898038B1 | Cites | United States of America | Applicant |
| US7124305B2 | Cites | United States of America | Applicant |
| US7167330B2 | Cites | United States of America | Applicant |
| US7181641B2 | Cites | United States of America | Applicant |
| Fu, Kevin E., "Group Sharing and Random Access in Cryptographic Storage File Systems", Massachusetts Institute of Technology, (Jun. 1999),1-85. | Non-patent | – | Applicant |
| Ben-Asher, et al., "Overcomming Malicious Read/ Write Requests in Internet File", Computer Science Dept. Haifa University, (Aug. 4, 2004),1-22. | Non-patent | – | Applicant |
| Damgard, et al., "Universally Composable Disk Encryption Schemes", Dept. of Computer Science, Aarhus University, (2005),1-15. | Non-patent | – | Applicant |
2 members in 1 office
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 99993307 | United States of America | A | |
| US20070999933 | – | – | – |
Members2
| Document | Office | Kind | |
|---|---|---|---|
| US2009150637A1 | United States of America | A1 | |
| US8131920B2This record | United States of America | B2 |
55 transactions on the USPTO file
Allowed after 1 non-final rejection, 1 final rejection and 1 RCE.
- Non-final rejections
- 1
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Examiner's Amendment CommunicationEX.A | EX.A | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response to Election / Restriction FiledELC. | ELC. | |
| Mail Restriction RequirementMCTRS | MCTRS | |
| Restriction/Election RequirementCTRS | CTRS | |
| Request Classification Panel DecisionTI10XY | TI10XY | |
| Request for Classification Division DecisionTI1054 | TI1054 | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Transfer Inquiry to GAUTI1050 | TI1050 | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Sent to Classification ContractorPGPC | PGPC | |
| Receipt of all Acknowledgement LettersL130 | L130 | |
| Receipt of Acknowledgment LetterL197 | L197 | |
| Agency Referral Letter MailedML196 | ML196 | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Referred by L&R for Third-Level Security Review. Agency Referral Letter GeneratedL196 | L196 | |
| Referred to Level 2 (LARS) by OIPE CSRL198 | L198 | |
| Waiting LR clearancePGPW | PGPW | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS |
12 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 08131920
- Publication, DOCDB
- 8131920
- Publication, EPODOC
- US8131920
- Application
- 11999933
- Application, DOCDB
- 99993307
- Application, EPODOC
- US20070999933
Titles
- English
- Method and system for dynamically allocating read and write sequence randomizer
Patent term adjustment
- A delay
- +699 daysthe office missed an examination deadline
- B delay
- +315 dayspendency past three years
- Overlap
- −31 daysdelays counted once
- Net adjustment
- 983 days
Classification
- CPC, 7
- G11B20/22
- G06F3/0619
- G06F3/064
- G06F3/0676
- G11B20/10009
- G11B2020/1843
- G11B2220/2516
- IPC, 1
- G06F12 00
- USPC, 3
- 711112000
- 711E12004
- 714702000