The present inventions are related to systems and methods for detecting and/or decoding information, and more particularly to systems and methods for performing auto scaling in a data processing system.
Various data transfer systems have been developed including storage systems, cellular telephone systems, and radio transmission systems. In each of the systems data is transferred from a sender to a receiver via some medium. For example, in a storage system, data is sent from a sender (i.e., a write function) to a receiver (i.e., a read function) via a storage medium. The effectiveness of any transfer is impacted by any data losses caused by various factors. In some cases, an encoding/decoding process is used to enhance the ability to detect a data error and to correct such data errors. As an example, a simple data detection and decode may be performed, however, such a simple process often lacks the capability to converge on a corrected data stream. In some cases, guidance information developed between data detection processes and data decoding processes saturate. As such, it is difficult to use the information in a meaningful way that will lead to data convergence.
Hence, for at least the aforementioned reasons, there exists a need in the art for advanced systems and methods for data processing.
The present inventions are related to systems and methods for detecting and/or decoding information, and more particularly to systems and methods for performing auto scaling in a data processing system.
Various embodiments of the present invention provide data processing circuits having a data detection circuit. The data detection circuit includes: a scaling circuit, a soft output calculation circuit, and a factor calculation circuit. The scaling circuit is operable to scale a branch metric value by a scaling factor to yield a scaled output. The soft output calculation circuit is operable to calculate a soft output based at least in part on the scaled output. The factor calculation circuit operable to modify the scaling factor based at least in part on the soft output.
In some instances of the aforementioned embodiments, the scaling factor is a first scaling factor, and the data processing circuit further includes: a soft output scaling circuit, and a data decoding circuit. The soft output scaling circuit is operable to scale the soft output by a second scaling factor to yield a scaled soft output. The data decoding circuit is operable to apply a data decoding algorithm to the scaled soft output to yield a decoded output. In some such instances, the data decoding circuit is a low density parity check circuit. In various instances of the aforementioned embodiments, the data processing circuit further includes a decoded output scaling circuit operable to scale the decoded output by a third scaling factor to yield a scaled decoded output. In some such cases, the third scaling factor is the inverse of the second scaling factor. In some such cases, the data processing circuit further includes an auto scalar calculation circuit that is operable to calculate the third scaling factor.
In various instances of the aforementioned embodiments, the scaling circuit is a multiplier circuit that is operable to multiply the branch metric value by the scaling factor to yield the scaled output. In some instances of the aforementioned embodiments, the factor calculation circuit includes a scalar calculation circuit operable to calculate an absolute of a mean value including at least one instance of the soft output to yield a precursor value. In some such instances, the factor calculation circuit further includes a comparator circuit operable to compare the precursor value against a threshold value, and to increment the scaling factor where the precursor factor is less than the threshold value. In other such instances, the factor calculation circuit further includes a comparator circuit operable to compare the precursor value against a threshold value, and to decrement the scaling factor where the precursor factor is greater than the threshold value. In one or more of such instances, the factor calculation circuit further includes a selector circuit operable to select the scaling factor as one of a default scaling factor and a scaling factor based at least in part on the precursor value.
Other embodiments of the present invention provide methods for auto-scaling intrinsic processing values. The methods include performing a data detection on a data input to yield a detected output. The data detection yields a first interim value and a second interim value. The methods further include: combining at least the first interim value and the second interim value to yield a precursor value; comparing the precursor value with a threshold value to yield a comparison result; modifying a scaling factor based at least in part on the comparison result; scaling the first interim value by the scaling factor to yield a scaled interim value; and generating a soft output corresponding to the scaled interim value. The soft output is include in the detected output.
This summary provides only a general outline of some embodiments of the invention. Many other objects, features, advantages and other embodiments of the invention will become more fully apparent from the following detailed description, the appended claims and the accompanying drawings.
A further understanding of the various embodiments of the present invention may be realized by reference to the figures which are described in remaining portions of the specification. In the figures, like reference numerals are used throughout several figures to refer to similar components. In some instances, a sub-label consisting of a lower case letter is associated with a reference numeral to denote one of multiple similar components. When reference is made to a reference numeral without specification to an existing sub-label, it is intended to refer to all such multiple similar components.
The present inventions are related to systems and methods for detecting and/or decoding information, and more particularly to systems and methods for performing auto scaling in a data processing system.
Turning to
Turning to
In a typical read operation, read/write head assembly 176 is accurately positioned by motor controller 168 over a desired data track on disk platter 178. Motor controller 168 both positions read/write head assembly 176 in relation to disk platter 178 and drives spindle motor 172 by moving read/write head assembly to the proper data track on disk platter 178 under the direction of hard disk controller 166. Spindle motor 172 spins disk platter 178 at a determined spin rate (RPMs). Once read/write head assembly 178 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 178 are sensed by read/write head assembly 176 as disk platter 178 is rotated by spindle motor 172. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 178. This minute analog signal is transferred from read/write head assembly 176 to read channel 110 via preamplifier 170. Preamplifier 170 is operable to amplify the minute analog signals accessed from disk platter 178. In turn, read channel circuit 110 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 178. This data is provided as read data 103 to a receiving circuit. As part of processing the received information, read channel circuit 110 performs an auto-scaled data processing. Such an auto-scaled data processing may operate similar to the method described in relation to
It should be noted that storage system 100 may be integrated into a larger storage system such as, for example, a RAID (redundant array of inexpensive disks or redundant array of independent disks) based storage system. It should also be noted that various functions or blocks of storage system 100 may be implemented in either software or firmware, while other functions or blocks are implemented in hardware.
Turning to
Turning to
Analog to digital converter circuit 315 converts processed analog signal 312 into a corresponding series of digital samples 317. Analog to digital converter circuit 315 may be any circuit known in the art that is capable of producing digital samples corresponding to an analog input signal. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of analog to digital converter circuits that may be used in relation to different embodiments of the present invention. Digital samples 317 are provided to an equalization circuit 320 that equalizes the received samples and provides a corresponding equalized output 322. In some embodiments of the present invention, equalization circuit 320 is implemented using digital finite impulse response filter as are known in the art.
Equalized output 322 is stored to a sample buffer 325. The data is provided from the sample buffer to a series of data detector circuits and data decoder circuits that provide for multiple pass processing of a received data input. In particular, a buffered output 327 is provided to an auto scaled data detector circuit 330. Auto scaled data detector circuit 330 may be any data detection circuit including auto-scaling in accordance with one or more embodiments of the present invention. For example, in one particular embodiment of the present invention, auto-scaled data detector circuit 330 is a maximum a posteriori (MAP) detector modified to apply auto-scaling. Auto-scaled data detector circuit 330 performs a data detection process on buffered output 327 and provides a detected output 332. The scaling applied by auto-scaled data detector circuit 330 operates to cause detected output 332 to, on average, be maintained in a range defined as between an upper threshold 301 and a lower threshold 302. In some embodiments of the present invention, auto-scaled data detector circuit 330 is implemented similar to the circuit discussed below in relation to
Detected output 332 is multiplied by a trained scaling factor 348 (α1) using a multiplier circuit 335. A product output 337 from multiplier circuit 335 is provided to a decoder circuit 340. Decoder circuit 340 may be any circuit capable of applying a decoding algorithm to a received input. In some particular embodiments of the present invention, decoder circuit 340 is a low density parity check (LDPC) decoder circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of decoder circuits that may be used in relation to different embodiments of the present invention. Trained scaling factor 348 is calculated by an auto scalar calculation circuit 345 as discussed below. Trained scaling factor 348 is designed to scale detected output 332 to maintain the operation of decoder circuit 340 in an unsaturated region. Data decoder circuit 340 may perform multiple local iterations as indicated by a feedback 343 to yield a decoded output 342.
Decoded output 342 is multiplied by a trained scaling factor 349 (β1) using a multiplier circuit 350. A product output 352 from multiplier circuit 350 is provided to a slave scaled data detector circuit 355 that uses buffered output 327 delayed through a delay circuit 380 to align a delayed output 382 in time with product output 352. Slave scaled data detector circuit 355 may be any data detection circuit including an internal scaling capability. For example, in one particular embodiment of the present invention, slave scaled data detector circuit 355 is a maximum a posteriori (MAP) detector modified to apply slave scaling. Slave scaled data detector circuit 355 performs a data detection process on product output 352 and provides a detected output 357. The scaling applied by slave scaled data detector circuit 355 operates to cause detected output 357 to, on average, be maintained in a range defined as between an upper threshold 301 and a lower threshold 302. In some embodiments of the present invention, slave scaled data detector circuit 355 is implemented similar to the circuit discussed above in relation to
Detected output 357 is multiplied by trained scaling factor 348 (α1) using a multiplier circuit 360. A product output 362 from multiplier circuit 360 is provided to a decoder circuit 370. Decoder circuit 370 may be any circuit capable of applying a decoding algorithm to a received input. In some particular embodiments of the present invention, decoder circuit 370 is a low density parity check (LDPC) decoder circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of decoder circuits that may be used in relation to different embodiments of the present invention. Data decoder circuit 370 may perform multiple local iterations as indicated by a feedback 373 to yield a decoded output 372.
Scaling factor 349 and scaling factor 348 are both auto calculated (i.e., trained) by auto scalar calculation circuit 345 based upon product output 337. Scaling factor 348 is calculated to scale product output 337 to maintain the operation of decoder circuit 340 within a desired range. Scaling factor 349 is the inverse of scaling factor 348. In particular, auto scalar calculation circuit 345 receives product output 337, calculates an absolute value of product output 337, calculates a mean of the absolute values of product output 337, and compares the mean against a threshold value 346 and another threshold value 347. In some embodiments, both threshold value 346 and threshold value 347 are programmable. The values of scaling factor 348 and scaling factor 349 are updated if either the absolute value of the mean of product output 337 is less than threshold value 346 or if the absolute value of the mean is greater than threshold 347. The following pseudocode describes the update condition:
Scaling factor 348 and scaling factor 349 are updated to assure that a mean of product output 337 is maintained in a desired range controlled by threshold value 346 and threshold value 347. Such updating may include, but is not limited to, selecting a next higher or a next lower scaling factor based on the aforementioned comparison. Decoded output 372 is provided to an output buffer 375 where it is prepared for providing as a data output 377.
It should be noted that use of auto-scaled data detector circuits in accordance with various embodiments of the present invention may be applied to different data processing circuit architectures. As examples, such auto-scaled data detector circuits may be applied to a serial architecture such as that discussed in relation to
Turning to
Squared Value 440=[abs(Sample Input 405−Ideal 415)]2.
Squared value 440 is multiplied using a multiplier circuit 450 by a data detector scaling factor 445 to yield a scaled branch metric (e.g., an intrinsic branch metric) 455. Scaled branch metric 455 is provided to a soft output calculation circuit 460 that calculates a soft output 465 (e.g., a log likelihood ratio). Soft output calculation circuit 465 may be any circuit known in the art that is capable of providing a soft output value based upon an input branch metric value. Data detector scaling factor 445 is also provided as a scalar output (η) 461 for use in downstream slave scaled data detector circuits (not shown).
Data detector scaling factor 445 is variable depending upon the value of soft output 465 as controlled by a variable factor calculation circuit 499 (outlined by a dashed line). In particular, a soft output absolute value calculation and mean of the absolute value calculation circuit 470 averages the absolute value of a number of instances of soft output 465 to yield a mean value 475. In some cases, the number of instances of soft output 465 combined in mean 475 is several thousand. In some cases, a running average is maintained. Mean 475 is provided to an auto scalar calculation circuit 490 where it is compared against an upper threshold 492 and a lower threshold 494 to determine if it is within a desired range. Where mean 475 is above upper threshold 492 data detector scaling factor 445 is reduced to a next lower value (e.g., η equal to ½, ¼, ⅛, or 1/16) resulting in a decrease in subsequent instances of soft output 465. Alternatively, where mean 475 is consistently less than lower threshold 494, data detector scaling factor 445 is changed to the next higher value (e.g., η equal to ½, ¼, ⅛, or 1/16) resulting in an increase in subsequent instances of soft output 465. In some cases, upper threshold 492 and lower threshold 494 are programmable.
The following pseudo-code describes the operation of variable factor calculation circuit 499 consistent with the discussion above:
Turning to
Scaling factor 548 and scaling factor 549 are updated to assure that the mean of the absolute values of input 501 is maintained in a desired range controlled by threshold value 502 and threshold value 503.
Turning to
A data equalization process is applied to the digital samples to yield an equalized output (block 725). In some cases, the equalization process is performed using one or more digital finite impulse response filters as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data equalization processes that may be used in relation to different embodiments of the present invention. The equalized output is buffered for use in relation to multiple data detection and data decode processes (block 730).
A data detection process is performed on the buffered, equalized data to yield a soft detection output (block 735). Instances of the soft detection output are averaged together and an absolute value of the average taken to yield a mean of absolute values (block 740). The mean of the absolute values is compared against an upper threshold (block 755). Where it is greater than the upper threshold (block 755), the next lower data detector scaling factor is selected (e.g., η equal to ½, ¼, ⅛, or 1/16) (block 760). Alternatively, where the mean of the absolute values is not greater than the upper threshold (block 755), it is determined whether it is less than a lower threshold (block 765). Where it is less than the lower threshold (block 765), the next higher data detector scaling factor is selected (e.g., η equal to ½, ¼, ⅛, or 1/16) (block 770). Otherwise, where the mean of the absolute values is not less than the lower threshold (block 765), no changes are made to the data detector scaling factor.
Once the adjustments to the data detector scaling factor are completed, the internal branch metric (i.e., y-yideal)2 is multiplied by the data detector scaling factor yields a scaled output. The scaled output is multiplied by an output scaling factor to yield a scaled soft output (block 775). This includes multiplying the scaled output (i.e., the output from the data detection process) by the output scaling factor (e.g., β2) to yield the scaled soft output. A data decoding process is applied to the scaled soft output to yield a decoded output (block 780). It is then determined whether the processing converged (block 785). Where the data processing has converged (block 785) the processing completes and the decoded output is provided as an output. Alternatively, where the data processing failed to converge (block 785), the decoded output is multiplied by an inverse scaling factor (e.g., α2) to yield a scaled decoded output (block 790). A data detection is performed on the scaled decoded output to yield a soft detection output (block 795). The processes of blocks 755 through 795 are repeated using the most recent updated absolute mean value.
The calculation and application of the aforementioned output scaling factor and the inverse scaling factor may be done in accordance with one or more of the methods disclosed in PCT Patent App. No. PCT/US09/41867 entitled “Systems and Methods for Dynamic Scaling in a Read Data Processing System”, and filed Apr. 28, 2009 by Yang et al. The entirety of the aforementioned reference was previously incorporated herein by reference for all purposes. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other architectures into which an auto-scaled data detector circuit may be placed in accordance with different embodiments of the present invention.
It should be noted that the various blocks discussed in the above application may be implemented in integrated circuits along with other functionality. Such integrated circuits may include all of the functions of a given block, system or circuit, or only a subset of the block, system or circuit. Further, elements of the blocks, systems or circuits may be implemented across multiple integrated circuits. Such integrated circuits may be any type of integrated circuit known in the art including, but are not limited to, a monolithic integrated circuit, a flip chip integrated circuit, a multichip module integrated circuit, and/or a mixed signal integrated circuit. It should also be noted that various functions of the blocks, systems or circuits discussed herein may be implemented in either software or firmware. In some such cases, the entire system, block or circuit may be implemented using its software or firmware equivalent. In other cases, the one part of a given system, block or circuit may be implemented in software or firmware, while other parts are implemented in hardware.
In conclusion, the invention provides novel systems, devices, methods and arrangements for performing data processing and/or auto-scaling in a data processing system. While detailed descriptions of one or more embodiments of the invention have been given above, various alternatives, modifications, and equivalents will be apparent to those skilled in the art without varying from the spirit of the invention. For example, one or more embodiments of the present invention may be applied to various data storage systems and digital communication systems, such as, for example, tape recording systems, optical disk drives, wireless systems, and digital subscriber line systems. Therefore, the above description should not be taken as limiting the scope of the invention, which is defined by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5278703 | Rub | Jan 1994 | A |
5278846 | Okayama et al. | Jan 1994 | A |
5317472 | Schweitzer, III | May 1994 | A |
5325402 | Ushirokawa | Jun 1994 | A |
5392299 | Rhines et al. | Feb 1995 | A |
5471500 | Blaker et al. | Nov 1995 | A |
5513192 | Janku et al. | Apr 1996 | A |
5523903 | Hetzler | Jun 1996 | A |
5550870 | Blaker et al. | Aug 1996 | A |
5612964 | Haraszti | Mar 1997 | A |
5701314 | Armstrong et al. | Dec 1997 | A |
5710784 | Kindred et al. | Jan 1998 | A |
5712861 | Inoue et al. | Jan 1998 | A |
5717706 | Ikeda | Feb 1998 | A |
5768044 | Hetzler | Jun 1998 | A |
5802118 | Bliss et al. | Sep 1998 | A |
5844945 | Nam et al. | Dec 1998 | A |
5898710 | Amrany | Apr 1999 | A |
5923713 | Hatakeyama | Jul 1999 | A |
5978414 | Nara | Nov 1999 | A |
5983383 | Wolf | Nov 1999 | A |
6005897 | McCallister et al. | Dec 1999 | A |
6023783 | Divsalar et al. | Feb 2000 | A |
6029264 | Kobayashi et al. | Feb 2000 | A |
6041432 | Ikeda | Mar 2000 | A |
6065149 | Yamanaka | May 2000 | A |
6097764 | McCallister et al. | Aug 2000 | A |
6145110 | Khayrallah | Nov 2000 | A |
6216249 | Bliss et al. | Apr 2001 | B1 |
6216251 | McGinn | Apr 2001 | B1 |
6229467 | Eklund et al. | May 2001 | B1 |
6266795 | Wei | Jul 2001 | B1 |
6317472 | Choi et al. | Nov 2001 | B1 |
6351832 | Wei | Feb 2002 | B1 |
6377610 | Hagenauer et al. | Apr 2002 | B1 |
6381726 | Weng | Apr 2002 | B1 |
6393076 | Dinc et al. | May 2002 | B1 |
6438717 | Butler et al. | Aug 2002 | B1 |
6473878 | Wei | Oct 2002 | B1 |
6476989 | Chainer et al. | Nov 2002 | B1 |
6625775 | Kim | Sep 2003 | B1 |
6657803 | Ling et al. | Dec 2003 | B1 |
6671404 | Katawani et al. | Dec 2003 | B1 |
6748034 | Hattori et al. | Jun 2004 | B2 |
6757862 | Marianetti, II | Jun 2004 | B1 |
6785863 | Blankenship et al. | Aug 2004 | B2 |
6788654 | Hashimoto et al. | Sep 2004 | B1 |
6810502 | Eidson | Oct 2004 | B2 |
6980382 | Hirano et al. | Dec 2005 | B2 |
6986098 | Poeppelman | Jan 2006 | B2 |
7010051 | Murayama et al. | Mar 2006 | B2 |
7047474 | Rhee et al. | May 2006 | B2 |
7058873 | Song et al. | Jun 2006 | B2 |
7073118 | Greeberg et al. | Jul 2006 | B2 |
7093179 | Shea | Aug 2006 | B2 |
7113356 | Wu | Sep 2006 | B1 |
7136244 | Rothbert | Nov 2006 | B1 |
7173783 | McEwen et al. | Feb 2007 | B1 |
7184486 | Wu et al. | Feb 2007 | B1 |
7191378 | Eroz et al. | Mar 2007 | B2 |
7203015 | Sakai et al. | Apr 2007 | B2 |
7203887 | Eroz et al. | Apr 2007 | B2 |
7236757 | Raghavan et al. | Jun 2007 | B2 |
7257764 | Suzuki et al. | Aug 2007 | B2 |
7310768 | Eidson et al. | Dec 2007 | B2 |
7313750 | Feng et al. | Dec 2007 | B1 |
7370258 | Iancu et al. | May 2008 | B2 |
7403752 | Raghavan et al. | Jul 2008 | B2 |
7430256 | Zhidkov | Sep 2008 | B2 |
7502189 | Sawaguchi et al. | Mar 2009 | B2 |
7505537 | Sutardja | Mar 2009 | B1 |
7523375 | Spencer | Apr 2009 | B2 |
7587657 | Haratsch | Sep 2009 | B2 |
7589372 | Shin et al. | Sep 2009 | B2 |
7590168 | Raghaven et al. | Sep 2009 | B2 |
7702989 | Graef et al. | Apr 2010 | B2 |
7712008 | Song et al. | May 2010 | B2 |
7738201 | Jin et al. | Jun 2010 | B2 |
7752523 | Chaichanavong | Jul 2010 | B1 |
7801200 | Tan | Sep 2010 | B2 |
7802163 | Tan | Sep 2010 | B2 |
8149527 | Tan et al. | Apr 2012 | B2 |
8296638 | Derras | Oct 2012 | B2 |
8683306 | Yang et al. | Mar 2014 | B2 |
20030063405 | Jin et al. | Apr 2003 | A1 |
20030081693 | Raghaven et al. | May 2003 | A1 |
20030087634 | Raghaven et al. | May 2003 | A1 |
20030112896 | Raghaven et al. | Jun 2003 | A1 |
20030134607 | Raghaven et al. | Jul 2003 | A1 |
20040071206 | Takatsu | Apr 2004 | A1 |
20040098659 | Bjerke et al. | May 2004 | A1 |
20050010855 | Lusky | Jan 2005 | A1 |
20050025076 | Chaudhuri et al. | Feb 2005 | A1 |
20050078399 | Fung | Apr 2005 | A1 |
20050111540 | Modrie et al. | May 2005 | A1 |
20050157780 | Werner et al. | Jul 2005 | A1 |
20050195749 | Elmasry et al. | Sep 2005 | A1 |
20050216819 | Chugg et al. | Sep 2005 | A1 |
20050273688 | Argon | Dec 2005 | A1 |
20060020872 | Richardson et al. | Jan 2006 | A1 |
20060031737 | Chugg et al. | Feb 2006 | A1 |
20060123285 | De Araujo et al. | Jun 2006 | A1 |
20060140311 | Ashley et al. | Jun 2006 | A1 |
20060168493 | Song et al. | Jul 2006 | A1 |
20060195772 | Graef et al. | Aug 2006 | A1 |
20060210002 | Yang et al. | Sep 2006 | A1 |
20060227903 | Niu et al. | Oct 2006 | A1 |
20060248435 | Haratsch | Nov 2006 | A1 |
20060256670 | Park et al. | Nov 2006 | A1 |
20070011569 | Casado et al. | Jan 2007 | A1 |
20070047121 | Elefeheriou et al. | Mar 2007 | A1 |
20070047635 | Stojanovic et al. | Mar 2007 | A1 |
20070110200 | Mergen et al. | May 2007 | A1 |
20070230407 | Petrie et al. | Oct 2007 | A1 |
20070234178 | Richardson et al. | Oct 2007 | A1 |
20070286270 | Huang et al. | Dec 2007 | A1 |
20070297496 | Park et al. | Dec 2007 | A1 |
20080049825 | Chen et al. | Feb 2008 | A1 |
20080055122 | Tan | Mar 2008 | A1 |
20080065970 | Tan | Mar 2008 | A1 |
20080069373 | Jiang et al. | Mar 2008 | A1 |
20080104486 | Kanaoka | May 2008 | A1 |
20080168330 | Graef et al. | Jul 2008 | A1 |
20080276156 | Gunnam | Nov 2008 | A1 |
20080301521 | Gunnam | Dec 2008 | A1 |
20090185643 | Fitzpatrick | Jul 2009 | A1 |
20090199071 | Graef | Aug 2009 | A1 |
20090235116 | Tan et al. | Sep 2009 | A1 |
20090235146 | Tan et al. | Sep 2009 | A1 |
20090259915 | Livshitz et al. | Oct 2009 | A1 |
20090268575 | Tan et al. | Oct 2009 | A1 |
20090273492 | Yang et al. | Nov 2009 | A1 |
20090274247 | Galbraith et al. | Nov 2009 | A1 |
20100002795 | Raghaven et al. | Jan 2010 | A1 |
20100042877 | Tan | Feb 2010 | A1 |
20100042890 | Gunam | Feb 2010 | A1 |
20100050043 | Savin | Feb 2010 | A1 |
20100061492 | Noeldner | Mar 2010 | A1 |
20100070837 | Xu et al. | Mar 2010 | A1 |
20100164764 | Nayak | Jul 2010 | A1 |
20100185914 | Tan et al. | Jul 2010 | A1 |
20100269023 | Yang et al. | Oct 2010 | A1 |
20110075569 | Marrow et al. | Mar 2011 | A1 |
20110080211 | Yang et al. | Apr 2011 | A1 |
20110167246 | Yang et al. | Jul 2011 | A1 |
Number | Date | Country |
---|---|---|
0522578 | Jan 1993 | EP |
0631277 | Dec 1994 | EP |
1814108 | Aug 2007 | EP |
WO 2006016751 | Feb 2006 | WO |
WO 2006134527 | Dec 2006 | WO |
WO 2007091797 | Aug 2007 | WO |
WO 2010126482 | Apr 2010 | WO |
2010101578 | Sep 2010 | WO |
WO 2010101578 | Sep 2010 | WO |
Entry |
---|
U.S. Appl. No. 11/461,026, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 11/461,198, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 11/461,283, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 12/540,283, filed Aug. 12, 2009, Liu et al. |
U.S. Appl. No. 12/652,201, Jan. 5, 2010, Mathew et al. |
U.S. Appl. No. 12/763,050, filed Apr. 19, 2010, Ivkovic et al. |
U.S. Appl. No. 12/792,555, filed Jun. 2, 2010, Liu et al. |
U.S. Appl. No. 12/887,317, filed Sep. 21, 2010, Xia et al. |
U.S. Appl. No. 12/887,330, filed Sep. 21, 2010, Zhang et al. |
U.S. Appl. No. 12/887,369, filed Sep. 21, 2010, Liu et al. |
U.S. Appl. No. 12/901,816, filed Oct. 11, 2010, Li et al. |
U.S. Appl. No. 12/901,742, filed Oct. 11, 2010, Yang. |
U.S. Appl. No. 12/917,756, filed Nov. 2, 2010, Miladinovic et al. |
U.S. Appl. No. 12/947,931, filed Nov. 17, 2010, Yang, Shaohua. |
U.S. Appl. No. 12/947,947, filed Nov. 17, 2010, Ivkovic et al. |
U.S. Appl. No. 12/972,942, filed Dec. 20, 2010, Liao et al. |
U.S. Appl. No. 12/992,948, filed Nov. 16, 2010, Yang et al. |
U.S. Appl. No. 13/021,814, filed Feb. 7, 2011, Jin, Ming et al. |
U.S. Appl. No. 13/031,818, filed Feb. 22, 2011, Xu, Changyou et al. |
U.S. Appl. No. 13/050,129, filed Mar. 17, 2011, Tan et al. |
U.S. Appl. No. 13/050,765, filed Mar. 17, 2011, Yang et al. |
U.S. Appl. No. 13/088,119, filed Apr. 15, 2011, Zhang et al. |
U.S. Appl. No. 13/088,146, filed Apr. 15, 2011, Li et al. |
U.S. Appl. No. 13/088,178, filed Apr. 15, 2011, Sun et al. |
U.S. Appl. No. 13/126,748, filed Apr. 28, 2011, Tan. |
U.S. Appl. No. 13/167,764, filed Jun. 24, 2011, Li, Zongwang et al. |
U.S. Appl. No. 13/167,771, filed Jun. 24, 2011, Li, Zongwang et al. |
U.S. Appl. No. 13/167,775, filed Jun. 24, 2011, Li, Zongwang. |
U.S. Appl. No. 13/186,146, filed Jul. 19, 2011, Mathew et al. |
U.S. Appl. No. 13/186,213, filed Jul. 19, 2011, Mathew et al. |
U.S. Appl. No. 13/186,234, filed Jul. 19, 2011, Xia, Haitao et al. |
U.S. Appl. No. 13/186,251, filed Jul. 19, 2011, Haitao et al. |
U.S. Appl. No. 13/186,174, filed Jul. 19, 2011, Mathew et al. |
U.S. Appl. No. 13/186,197, filed Jul. 19, 2011, Mathew, George et al. |
U.S. Appl. No. 13/213,751, filed Aug. 19, 2011, Zhang, Fan et al. |
U.S. Appl. No. 13/213,808, filed Aug. 19, 2011, Jin, Ming. |
U.S. Appl. No. 13/220,142, filed Aug. 29, 2011, Chang, Wu et al. |
U.S. Appl. No. 13/227,538, filed Sep. 8, 2011, Yang, Shaohua et al. |
U.S. Appl. No. 13/227,544, filed Sep. 8, 2011, Yang, Shaohua et al. |
U.S. Appl. No. 13/239,683, filed Sep. 22, 2011, Xu, Changyou. |
U.S. Appl. No. 13/239,719, filed Sep. 22, 2011, Xia, Haitao et al. |
U.S. Appl. No. 13/251,342, filed Oct. 2, 2011, Xia, Haitao et al. |
U.S. Appl. No. 13/269,832, filed Oct. 10, 2011, Xia, Haitao et al. |
U.S. Appl. No. 13/269,852, filed Oct. 10, 2011, Xia, Haitao et al. |
U.S. Appl. No. 13/284,819, filed Oct. 28, 2011, Tan, Weijun et al. |
U.S. Appl. No. 13/284,730, filed Oct. 28, 2011, Zhang, Fan et al. |
U.S. Appl. No. 13/284,754, filed Oct. 28, 2011, Zhang, Fan et al. |
U.S. Appl. No. 13/284,767, filed Oct. 28, 2011, Zhang, Fan et al. |
U.S. Appl. No. 13/284,826, filed Oct. 28, 2011, Tan, Weijun et al. |
U.S. Appl. No. 13/295,150, filed Nov. 14, 2011, Li, Zongwang et al. |
U.S. Appl. No. 13/295,160, filed Nov. 14, 2011, Li, Zongwang et al. |
U.S. Appl. No. 13/251,340, filed Oct. 3, 2011, Xia, Haitao et al. |
Amer et al “Design Issues for a Shingled Write Disk System” MSST IEEE 26th Symposium May 2010. |
Bahl, et al “Optimal decoding of linear codes for Minimizing symbol error rate”, IEEE Trans. Inform. Theory, vol. 20, pp. 284-287, Mar. 1974. |
Casado et al., Multiple-rate low- denstiy parity-check codes with constant blocklength, IEEE Transations on communications, Jan. 2009, vol. 57, pp. 75-83. |
Collins and Hizlan, “Determinate State Convolutional Codes” IEEE Transactions on Communications, Dec. 1993. |
Eleftheriou, E. et al., “Low Density Parity-Check Codes for Digital Subscriber Lines”, Proc ICC 2002, pp. 1752-1757. |
Fisher, R et al., “Adaptive Thresholding”[online] 2003 [retrieved on May 28, 2010] Retrieved from the Internet <URL:http://homepages.inf.ed.ac.uk/rbf/HIPR2/adpthrsh.htm. |
Fossnorier, Marc P.C. “Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Maricies” IEEE Transactions on Information Theory, vol. 50, No. 8 Aug. 8, 2004. |
Gibson et al “Directions for Shingled-Write and Two-Dimensional Magnetic Recording System” Architectures: Synergies with Solid-State Disks, Carnegie Mellon Univ. May 1, 2009. |
K. Gunnam et al., “Next Generation iterative LDPC solutions for magnetic recording storage”, invited paper. The Asilomar Conference on Signals, Systems, and Computers, Nov. 2008. |
K. Gunnam et al., “Value-Reuse Properties of Min-Sum for GF(q)” (dated Oct. 2006) Dept. of ECE, Texas A&M University Technical Note, published about Aug. 2010. |
K. Gunnam et al., “Value-Reuse Properties of Min-Sum for GF(q)”(dated Jul. 2008) Dept. of ECE, Texas A&M University Technical Note, published about Aug. 2010. |
K. Gunnam “Area and Energy Efficient VLSI Architectures for Low-Density Parity-Check Decoders Using an On-The-Fly Computation” dissertation at Texas A&M University, Dec. 2006. |
Han and Ryan, “Pinning Techniques for Low-Floor Detection/Decoding of LDPC-Coded Partial Response Channels”, 5th International Symposium on Turbo Codes &Related Topics, 2008. |
Hagenauer, J. et al A Viterbi Algorithm with Soft-Decision Outputs and its Applications in Proc. IEEE Globecom, pp. 47. 11-47 Dallas, TX Nov. 1989. |
Lee et al., “Partial Zero-Forcing Adaptive MMSE Receiver for DS-CDMA Uplink in Multicell Environments” IEEE Transactions on Vehicular Tech. vol. 51, No. 5, Sep. 2002. |
Lin et al “An efficient VLSI Architecture for non binary LDPC decoders”—IEEE Transaction on Circuits and Systems II vol. 57, Issue 1 (Jan. 2010) pp. 51-55. |
Mohsenin et al., “Split Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture”, pp. 1-6, printed from www.ece.ucdavis.edu on Jul. 9, 2007. |
Moon et al, “Pattern-dependent noise prediction in signal-dependent Noise,” IEEE JSAC, vol. 19, No. 4 pp. 730-743, Apr. 2001. |
Perisa et al “Frequency Offset Estimation Based on Phase Offsets Between Sample Correlations” Dept. of Info. Tech. University of Ulm 2005. |
Sari H et al., “Transmission Techniques for Digital Terrestrial TV Broadcasting” IEEE Communications Magazine, IEEE Service Center Ny, NY vol. 33, No. 2 Feb. 1995. |
Selvarathinam, A.: “Low Density Parity-Check Decoder Architecture for High Throughput Optical Fiber Channels ” IEEE International Conference on Computer Design (ICCD '03) 2003. |
Shu Lin, Ryan, “Channel Codes, Classical and Modern” 2009, Cambridge University Press, pp. 213-222. |
Unknown, “Auto threshold and Auto Local Threshold” [online] [retrieved May 28, 2010] Retrieved from the Internet: <URL:http://www.dentristy.bham.ac.uk/landinig/software/autoth. |
Vasic, B., “High-Rate Low-Density Parity-Check Codes Based on Anti-Pasch Affine Geometries,” Proc ICC 2002, pp. 1332-1336. |
Vasic, B., “High-Rate Girth-Eight Codes on Rectangular Integer Lattices”, IEEE Trans. Communications, vol. 52, Aug. 2004, pp. 1248-1252. |
Wang Y et al., “A Soft Decision Decoding Scheme for Wireless COFDM With Application to DVB-T” IEEE Trans. on Consumer elec., IEEE Service Center, NY,NY vo. 50, No. 1 Feb. 2004. |
Weon-Cheol Lee et al., “Vitierbi Decoding Method Using Channel State Info. in COFDM System” IEEE Trans. on Consumer Elect., IEEE Service Center, NY, NY vol. 45, No. 3 Aug. 1999. |
Xia et al, “A Chase-GMD algorithm of Reed-Solomon codes on perpendicular channels”, IEEE Transactions on Magnetics, vol. 42 pp. 2603-2605, Oct. 2006. |
Xia et al, “Reliability-based Reed-Solomon decoding for magnetic recording channels”, IEEE International Conference on Communication pp. 1977-1981, May 2008. |
Yeo et al., “VLSI Architecture for Iterative Decoders in Magnetic Storage Channels”, Mar. 2001, pp. 748-755, IEEE trans. Magnetics, vol. 37, No. 2. |
Youn, et al. “BER Perform. Due to Irrreg. of Row-Weight Distrib. of the Parity-Chk. Matirx in Irreg. LDPC Codes for 10-Gb/s Opt. Signls” Jrnl of Lightwave Tech., vol. 23, Sep. 2005. |
Zhong et al., “Area-Efficient Min-Sum Decoder VLSI Architecture for High-Rate QC-LDPC Codes in Magnetic Recording”, pp. 1-15, Submitted 2006, not yet published. |
Zhong, “Block-LDPC: A Practical LDPC Coding System Design Approach”, IEEE Trans. on Circuits, Regular Papers, vol. 5, No. 4, pp. 766-775, Apr. 2005. |
Zhong et al., “Design of VLSI Implementation-Oriented LDPC Codes”, IEEE, pp. 670-673, 2003. |
Zhong et al., “High-Rate Quasi-Cyclic LDPC Codes for Magnetic Recording Channel with Low Error Floor”, ISCAS, IEEE pp. 3546-3549, May 2006. |
Zhong et al., “Iterative MAX-LOG-MAP and LDPC Detector/Decoder Hardware Implementation for Magnetic Read Channel”, SRC TECHRON, pp. 1-4, Oct. 2005. |
Zhong et al., “Joint Code-Encoder Design for LDPC Coding System VLSI Implementation”, ISCAS, IEEE pp. 389-392, May 2004. |
Zhong et al., “Quasi Cyclic LDPC Codes for the Magnetic Recording Channel: Code Design and VSLI Implementation”, IEEE Transactions on Magnetics, v. 43, pp. 1118-1123, Mar. 2007. |
Zhong, “VLSI Architecture of LDPC Based Signal Detection and Coding System for Magnetic Recording Channel”, Thesis, RPI, Troy, NY, pp. 1-95, May 2006. |
Number | Date | Country | |
---|---|---|---|
20120236430 A1 | Sep 2012 | US |