The present inventions are related to systems and methods for detecting and/or decoding information, and more particularly to systems and methods for performing variance dependent branch metric calculation.
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.
To heighten the possibility of convergence, various existing processes utilize two or more detection and decode iterations. Turning to
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 variance dependent branch metric calculation.
Various embodiments of the present invention provide data processing circuits that include: a noise predictive filter circuit, a scaling factor adaptation circuit, and a scaling factor application circuit. The noise predictive filter circuit is operable to perform a noise predictive filtering process on a data input based on a filter tap to yield a noise filtered output. The scaling factor adaptation circuit is operable to calculate a scaling factor based at least in part on a derivative of the noise filtered output. The scaling factor application circuit is operable to apply the scaling factor to scale the noise filtered output.
In some instances of the aforementioned embodiments, the scaling factor adaptation circuit includes a multiplier circuit operable to multiply the noise filtered output by the scaling factor to yield a scaled noise filtered output. In particular instances of the aforementioned embodiments, the scaling factor adaptation circuit is operable to calculate a variance in the derivative of the noise filtered output to yield a calculated variance, and to calculate the scaling factor based upon a ratio of the calculated variance and a desired variance. In some cases, the scaling factor adaptation circuit calculates the scaling factor in accordance with the following equation:
In other instances of the aforementioned embodiments, the scaling factor adaptation circuit includes a multiplier circuit operable to multiply an unscaled filter tap by the scaling factor to yield the filter tap. In some such instances, the scaling factor adaptation circuit is operable to calculate a variance in the derivative of the noise filtered output to yield a calculated variance, and to receive a desired variance.
In various instances of the aforementioned embodiments, the circuit further includes an edge mean calculation circuit and a summation circuit. The edge mean calculation circuit is operable to calculate an edge mean value based on the derivative of the noise filtered output. The summation circuit operable to sum a derivative of the edge mean value with the noise filtered output to yield the derivative of the noise filtered output. In some cases, the edge mean calculation circuit includes a multiplier circuit operable to multiply the edge mean value by the scaling factor to yield the derivative of the edge mean value.
Some embodiments of the present invention provide methods for variance dependent data normalization. The methods include: performing a noise predictive filtering on a data input based on a filter tap to yield a noise filtered output; calculating a variance of a derivative of the noise filtered output to yield a calculated variance; calculating a scaling factor using the calculated variance and a desired variance; and applying the scaling factor to scale the noise filtered output. In some cases, applying the scaling factor includes multiplying an unscaled filter tap by the scaling factor to yield the filter tap. In other cases, applying the scaling factor includes multiplying the noise filtered output by the scaling factor to yield a scaled noise filtered output.
Yet other embodiments of the present invention provide data storage devices that include: a storage medium, an analog front end circuit, and a data processing circuit. The storage medium maintains a representation of an input data set, and the analog front end circuit is operable to sense the representation of the input data set and to provide the input data set as a data input. The data processing circuit includes: a noise predictive filter circuit, a scaling factor adaptation circuit, and a scaling factor application circuit. The noise predictive filter circuit is operable to perform a noise predictive filtering process on a data input based on a filter tap to yield a noise filtered output. The scaling factor adaptation circuit is operable to calculate a scaling factor based at least in part on a derivative of the noise filtered output. The scaling factor application circuit is operable to apply the scaling factor to scale the noise filtered 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 variance dependent branch metric calculation.
Data detector circuit 800 includes an edge mean calculation circuit 885 and a filter tap adaptation circuit 890. Filter tap adaptation circuit 890 adjusts filter taps 892 provided back to noise predictive filter circuit 810 based upon noise output 835. Edge mean value calculation circuit 885 calculates a condition (i.e., cond) based edge mean value 887 that is provided to a summation circuit 830.
Data detector circuit 800 utilizes a calculated branch metric to determine a most likely value for a given bit position based upon previous conditions (i.e., cond). Where a Gaussian distribution is assumed, the following equation holds:
where cond indicates a particular bit pattern, σ(cond)2 is a variance of the received samples when cond is written, edgeMean(cond) is a value of the noiseless output of a noise predictive filter corresponding to the bit pattern cond, and z(cond) is an equalized sample of the received bit pattern cond.
For fixed point data detector circuit implementations, the
term may be dropped, and the entire equation multiplied by 2σ(cond)2 and divided by a fixed term (fixed) yielding the following equation:
Said another way, the output of noise predictive filter 810 output is scaled by an s(cond) term so that the variance of all bit patterns (cond) is normalized to the variance of a fixed bit pattern (cond0). In some cases, the fixed bit pattern is selected as a zero bit pattern or a Nyquist bit pattern.
The aforementioned approach results in large fixed point losses when low energy targets (e.g., [6 12]) convolved with noise predictive finite impulse response filter taps yield edge mean values in a numeric range. When the edge mean values are divided by the fixed value suitable for higher energy targets (e.g., [8 14]), smaller numeric values for the aforementioned sqnoise term are achieved. Such smaller numeric values yield smaller variance. However, the division by the fixed term results in the loss of significant information.
Some embodiments of the present invention operate to mitigate the loss of information available in a data detection process by normalizing the input to a data detector circuit. Such normalization results in similar variance in the input of the detector circuit across different bit patterns and all channel conditions (i.e., signal to noise ratios). Such embodiments may be applied to read channel circuits used in storage device applications, wireless transmission circuit and other applications. The solutions rely on a data detection approach where an input is normalized so that any received samples exhibit a similar variance across bit patterns and channel conditions (e.g., signal to noise ratios). As just one advantage of such an approach, the data detection approach is substantially independent of the energy level of a received input.
Turning to
noise output=z(cond)−edgeMean(cond).
Again, noise whitened output 215 is indirectly scaled by a scaling factor 294 and scaled edge mean value 299 is an edge mean value 287 that is directly scaled by scaling factor 297. Scaling factor 294 is varied based upon a level of variance in noise output 235 to force the variance in noise output 235 to approach a desired variance 277. In some embodiments, the desired variance is eight. In other embodiments, the desired variance is another power of two. In this way, data losses due to variance in data input 205 are mitigated.
An edge mean calculation circuit 285 receives noise output 235 and calculates edge mean value 287 using an approach known in the art. Edge mean value 287 is provided to a multiplier circuit 298 where it is multiplied by scaling factor 297 to yield scaled edge mean value 299. A filter tap adaptation circuit 290 receives noise output 235 and adaptively calculates pre-scaled filter taps 292 that correspond to filter taps 260, 261, 262, 263. Filter tap adaptation circuit 290 may include, but is not limited to, a least mean squared error generator circuit (not shown) that provides an error output to a loop filter circuit (not shown). It should be noted that the least mean squared error generator circuit is one type of error generator circuit that may be used in relation to different embodiments of the present invention. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other types of error generator circuits that may be used in relation to different embodiments of the present invention. For example, a zero forcing error generator circuit or a hybrid zero forcing error generator circuit may be used in place of the aforementioned least mean squared error generator circuit. Such filter tap adaptation circuits are known in the art. In particular, filter tap adaptation circuit 290 provides filter taps 292 to a multiplier circuit 296 where each of the respective filter taps 292 are multiplied by a scaling factor 294 to yield filter taps 260, 261, 262, 263. This scaling of filter taps 260, 261, 262, 263 by a scaling factor 294 is designed to yield noise whitened output 215 scaled by the same scaling factor (i.e., scaling factor 297) that was applied to yield scaled edge mean value 299. As such, noise output 235 may be represented as:
noise output=[z(cond)−edgeMean(cond)]*scaling factor 297,
where z(cond) and edgeMean(cond) respectively represent the output of noise predictive filter circuit 210 and summation circuit 230 in the absence of any applied scaling factors to either filter taps 260, 261, 262, 263 or edge mean value 287.
Scaling factor adaptation circuit 295 receives noise output 235 and calculates a variance across all outputs. This calculated variance may be computed by setting scaling factor 297 to unity (‘1’) for both z(cond) and edgeMean(cond) based on the formula described herein. The calculated variance may be compared with a desired variance. Alternatively, scaling factor 297 may be recursively calculated to yield a desired variance 277 in accordance with the following equation:
where the old scaling factor is the previous value of scaling factor 297. Scaling factor 294 is calculated to yield filter taps 260, 261, 262, 263 that will result in noise whitened output 215 effectively scaled by scaling factor 297.
Noise output 235 is provided to a data detection circuit 270 where it is further massaged to yield a squared noise output suitable for branch metric calculation. In particular, the squared noise output may be represented by the following equation:
where β equals the square of scaling factor 297 multiplied by 2 var to balance the scaling with that applied to the first part of the equation (i.e., (noise output 235)2). Using the branch metrics calculated based on noise output 235, data detection circuit 270 provides a data output 275
During adaptation of filter taps 260, 261, 262, 263, filter tap adaption circuit 290 fixes filter tap 260 at a zero condition, and adapts filter taps 261, 262, 263 using a standard filter tap adaption approach. The adapted filter taps 260, 261, 262, 263 are used by noise predictive finite impulse response circuit 210 to perform noise predictive filtering. The resulting noise whitened output is combined with edge mean value 287 (i.e., scaling factor 297 is set to unity) and a variance of noise output 235 is calculated by scaling factor adaptation circuit 295. This calculated variance is used to calculate scaling factor 297 and scaling factor 294 that will yield desired variance 277. Using the calculated scaling factors, filter tap 260 is allowed to float (i.e., is no longer fixed to the zero condition) and scaled filter taps 260, 261, 262, 263 result in a scaled noise whitened output 215 that provides for uniform variance.
Turning to
scaled noise output=[z(cond)−edgeMean(cond)]*scaling factor
Scaling factor 397 is varied based upon a level of variance in scaled noise output 335 to force the variance in scaled noise output 335 to approach a desired variance 377. In some embodiments, the desired variance is eight. In other embodiments, the desired variance is another power of two. In this way, data losses due to variance in data input 305 are mitigated.
An edge mean calculation circuit 385 receives scaled noise output 335 and calculates edge mean value 387 using an approach known in the art. Edge mean value 387 is provided to a multiplier circuit 398 where it is multiplied by scaling factor 397 to yield scaled edge mean value 399. A filter tap adaptation circuit 390 receives scaled noise output 335 and adaptively filter taps 360, 361, 362, 363. Filter tap adaptation circuit 390 may include, but is not limited to, a least mean squared error generator circuit (not shown) that provides an error output to a loop filter circuit (not shown). It should be noted that the least mean squared error generator circuit is one type of error generator circuit that may be used in relation to different embodiments of the present invention. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other types of error generator circuits that may be used in relation to different embodiments of the present invention. For example, a zero forcing error generator circuit or a hybrid zero forcing error generator circuit may be used in place of the aforementioned least mean squared error generator circuit. Such filter tap adaptation circuits are known in the art. In particular, filter tap adaptation circuit 390 provides filter taps 360, 361, 362, 363 to noise predictive finite impulse response filter circuit 310.
Scaling factor adaptation circuit 395 receives scaled noise output 335 and calculates a variance across all outputs. This calculated variance may be computed by setting scaling factor 297 to unity (‘1’) for both z(cond) and edgeMean(cond) based on the formula described herein. Alternatively, scaling factor 397 may be recursively calculated to yield a desired variance 377 in accordance with the following equation:
where the old scaling factor is the previous value of scaling factor 397.
Scaled noise output 335 is provided to a data detection circuit 370 where it is further massaged to yield a squared noise output suitable for branch metric calculation. In particular, the squared noise output may be represented by the following equation:
where β equals the square of scaling factor 397 multiplied by 2σ(cond) to balance the scaling with that applied to the first part of the equation (i.e., (scaled noise output 335)2). Using the branch metrics calculated based on noise output 335, data detection circuit 370 provides a data output 375.
Turning to
A scaled edge mean value is subtracted from the noise whitened output (block 415) to yield a difference value in accordance with the following equation:
difference value=z(cond)−edgeMean(cond),
where z(cond) is the noise whitened output that is scaled by modification of the filter taps to govern variance, and edgeMean(cond) is the scaled edge mean value. The difference value is squared to yield a squared difference value (block 455) in accordance with the following equation:
(difference value)=(z(cond)−edgeMean(cond))2.
The difference value is also used to calculate a variance (i.e., calculated variance) across a number of difference values (block 420). This variance is compared with a desired variance to calculate a scaling factor (block 440). The scaling factor is calculated to force an output variance to a defined level. As an example, the scaling factor may be calculated in accordance with the following equation:
where the old scaling factor is a previous version of the scaling factor. A square of the scaling factor (i.e., (scaling factor)2) is multiplied by 2σ(cond)2 to yield the multiplication value β of a scaled natural log term used in the branch metric calculation to yield the following component (block 460):
again, where σ(cond) is a variance of the received samples when cond is written. The scaled natural log term is subtracted from the aforementioned squared difference value to yield a detector metric value (block 465) in accordance with the following equation:
In addition, the aforementioned difference value (block 415) is used to estimate updated filter taps (i.e., the filter taps for the noise predictive filters) (block 425). The updated filter taps are scaled using the previously calculated scaling factor (block 440) such that the variance in the noise whitened output is forced to the desired variance (block 445). Said another way, the scaled filter taps yield an output from the noise predictive filtering process that may be represented as:
noise whitened output=z(cond)*scaling factor,
where z(cond) represent the noise whitened output of noise predictive filter process in the absence of any applied scaling factors to the filter taps. The scaled filter taps are provides as a feedback to the noise predictive filtering process of block 410.
In addition, the aforementioned difference value (block 415) is used to calculate an edge mean value as is known in the art (block 430). This edge mean value is scaled by the previously calculated scaling factor (block 440) to yield a scaled edge mean value (block 450) in accordance with the following equation:
scaled edgemean value=scaling factor*edge mean value.
This scaled edge mean value is used in the summation process of block 415.
Turning to
The noise whitened output is scaled by a scaling factor to yield a scaled noise whitened output (block 515). This scaling may be done in accordance with the following equation:
scaled noise whitened output=noise whitened output*scaling factor.
An edge mean value is scaled by the same scaling factor to yield a scaled edge mean value, and the scaled edge mean value is subtracted from the scaled noise whitened value to yield a difference value (block 520) in accordance with the following equation:
difference value=[noise whitened output−edge mean value]*scaling factor.
The difference value is squared to yield a squared difference value (block 555) in accordance with the following equation:
(difference value)2=([noise whitened output−edge mean value]*scaling factor)2.
The difference value is also used to calculate a variance (i.e., calculated variance) across a number of difference values (block 530). This variance is compared with a desired variance to calculate a scaling factor (block 540). The scaling factor is calculated to force an output variance to a defined level. As an example, the scaling factor may be calculated in accordance with the following equation:
where the old scaling factor is a previous version of the scaling factor. A square of the scaling factor (i.e., (scaling factor)2) is multiplied by 2σ(cond) to yield the multiplication value β of a scaled natural log term used in the branch metric calculation to yield the following component (block 560):
again, where σ(cond) is a variance of the received samples when cond is written. The scaled natural log term is subtracted from the aforementioned squared difference value to yield a detector metric value (block 565) in accordance with the following equation:
In addition, the aforementioned difference value (block 520) is used to estimate updated filter taps (i.e., the filter taps for the noise predictive filters) (block 525). The updated filter taps are provided to use in relation to the noise predictive filtering process. In addition, the an edge mean value is calculated based upon the difference value (block 535). This edge mean value is provided to the edge mean scaling process (block 520).
Turning to
Storage system 700 also includes a preamplifier 770, an interface controller 720, a hard disk controller 766, a motor controller 768, a spindle motor 772, a disk platter 778, and a read/write head assembly 776. Interface controller 720 controls addressing and timing of data to/from disk platter 778. The data on disk platter 778 consists of groups of magnetic signals that may be detected by read/write head assembly 776 when the assembly is properly positioned over disk platter 778. In one embodiment, disk platter 778 includes magnetic signals recorded in accordance with a perpendicular recording scheme. For example, the magnetic signals may be recorded as either longitudinal or perpendicular recorded signals.
In a typical read operation, read/write head assembly 776 is accurately positioned by motor controller 768 over a desired data track on disk platter 778. The appropriate data track is defined by an address received via interface controller 720. Motor controller 768 both positions read/write head assembly 776 in relation to disk platter 778 and drives spindle motor 772 by moving read/write head assembly to the proper data track on disk platter 778 under the direction of hard disk controller 766. Spindle motor 772 spins disk platter 778 at a determined spin rate (RPMs). Once read/write head assembly 778 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 778 are sensed by read/write head assembly 776 as disk platter 778 is rotated by spindle motor 772. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 778. This minute analog signal is transferred from read/write head assembly 776 to read channel 710 via preamplifier 770. Preamplifier 770 is operable to amplify the minute analog signals accessed from disk platter 778. In turn, read channel module 710 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 778. The decoding process may utilize local iterative loops where the output of the decoder circuit is dynamically scaled and provided as an input to the decoder circuit. This input is decoded again. The read data is provided as read data 703. A write operation is substantially the opposite of the preceding read operation with write data 701 being provided to read channel module 710. This data is then encoded and written to disk platter 778.
Turning to
In conclusion, the invention provides novel systems, devices, methods and arrangements for performing data decoding and/or detection. 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 subscribe 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 |
---|---|---|---|
4243935 | McCool et al. | Jan 1981 | A |
4791390 | Harris et al. | Dec 1988 | 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 |
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 |
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 |
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 | Kawatani et al. | Dec 2003 | B1 |
6748034 | Hattori et al. | Jun 2004 | B2 |
6757862 | Marianetti | 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 | Greenberg et al. | Jul 2006 | B2 |
7093179 | Shea | Aug 2006 | B2 |
7113356 | Wu | Sep 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 |
7590168 | Raghavan et al. | Sep 2009 | B2 |
7702989 | Graef et al. | Apr 2010 | B2 |
7712008 | Song et al. | May 2010 | B2 |
7801200 | Tan | Sep 2010 | B2 |
7802163 | Tan | Sep 2010 | B2 |
20030063405 | Jin et al. | Apr 2003 | A1 |
20030081693 | Raghavan et al. | May 2003 | A1 |
20030087634 | Raghavan et al. | May 2003 | A1 |
20030112896 | Raghavan et al. | Jun 2003 | A1 |
20030134607 | Raghavan et al. | Jul 2003 | A1 |
20040071206 | Takatsu | Apr 2004 | A1 |
20040098659 | Bjerke et al. | May 2004 | A1 |
20050010855 | Lusky | Jan 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 |
20060248435 | Haratsch | Nov 2006 | A1 |
20060256670 | Park et al. | Nov 2006 | A1 |
20070011569 | Casado et al. | Jan 2007 | A1 |
20070047635 | Stojanovic et al. | Mar 2007 | A1 |
20070110200 | Mergen et al. | May 2007 | A1 |
20070230407 | Petrie et al. | Oct 2007 | A1 |
20070286270 | Huang 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 |
20080168330 | Graef et al. | Jul 2008 | A1 |
20080182542 | Choi et al. | Jul 2008 | A1 |
20090199071 | Graef | Aug 2009 | A1 |
20090235116 | Tan et al. | Sep 2009 | A1 |
20090235146 | Tan | Sep 2009 | A1 |
20090259915 | Livshitz et al. | Oct 2009 | A1 |
20090273492 | Yang et al. | Nov 2009 | A1 |
20090274247 | Galbraith et al. | Nov 2009 | A1 |
20100002795 | Raghavan et al. | Jan 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 |
Number | Date | Country |
---|---|---|
0522578 | Jan 1993 | EP |
1814108 | Aug 2007 | EP |
WO 2006016751 | Feb 2006 | WO |
WO 2006134527 | Dec 2006 | WO |
WO 2007091797 | Aug 2007 | 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, filed 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, 2101, Liu, 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/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/972,942, filed Dec. 20, 2010, Liao et al. |
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. |
Gunnam, K et al. “Tech. Note on Iterative LDPC Solutions for Turbo Equal.”, K. Gunnam, G. Choi and M. Yeary, TX A&M Tech. Note, Rpt. Dt: Jul. 2006 Avail. online dropzone.tamu.edu. |
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. |
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. |
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. |
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. |
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. |
Unk, “Auto threshold and Auto Local Threshold” [online] [retr. May 28, 2010] Retr. from the Internet www.dentristy.bham.ac.uk/landinig/software/autothreshold/autothreshold.html. |
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 App. to DVB-T” IEEE Transactions on Consumer elect., IEEE Service Center, NY,NY vo. 50, No. 1 Feb. 2004. |
Weon-Cheol L. et al., “Vitierbi Decoding Method Using Channel State Information in COFDM System” IEEE Trans. on Consumer Elect., IEEE Service Center, NY, NY vol. 45 No. 3 Aug. 1999. |
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, “BER Perf. Due to Irreg. of Row-Weoght Distr. of the Parity-Check Matirx in Irregular LDPC Codes for 10-Gb/s Optical Signals” Journal of Lightwave Tech., vol. 23 Sep. 9, 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 | |
---|---|---|---|
20120124118 A1 | May 2012 | US |