Systems and methods for self tuning target adaptation

Information

  • Patent Grant
  • 8566379
  • Patent Number
    8,566,379
  • Date Filed
    Wednesday, November 17, 2010
    14 years ago
  • Date Issued
    Tuesday, October 22, 2013
    11 years ago
Abstract
Various embodiments of the present invention provide systems and methods for data processing. As an example, a data processing circuit is disclosed that includes an equalizer circuit, a noise predictive filter circuit, a data detector circuit, a data reconstruction circuit, and an adaptation circuit. The equalizer circuit is operable to receive a data input and to provide an equalized output based at least in part on an equalizer coefficient. The noise predictive filter circuit is operable to receive the equalized output and to provide a noise whitened output based at least in part on a noise predictive filter coefficient. The data detector circuit is operable to apply a data detection algorithm to the noise whitened output to yield a detected output. The data reconstruction circuit is operable to receive the detected output and to provide a reconstructed output corresponding to the equalized output based at least in part on a target polynomial. The adaptation circuit is operable to adaptively calculate the equalizer coefficient, the noise predictive filter coefficient and the target polynomial.
Description
BACKGROUND OF THE INVENTION

The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for adaptive data processing.


Various circuits have been developed that provide for identifying synchronization marks within a data stream. As an example, a synchronization mark is identified based upon a threshold comparison. Such a threshold comparison approach depends highly upon determining an appropriate threshold for comparison. Where the selected threshold is too high, sync marks will be missed. Alternatively, where the selected threshold is too low, sync marks may be incorrectly identified. Either case is problematic for proper data processing.


Hence, for at least the aforementioned reasons, there exists a need in the art for advanced systems and methods for sync mark identification.


BRIEF SUMMARY OF THE INVENTION

The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for adaptive data processing.


Various embodiments of the present inventions provide methods for data processing that include: receiving a data input; equalizing the data input based on an equalizer coefficient to yield an equalized output; performing a data detection on a derivative of the equalized output to yield a detected output; reconstructing the detected output based on a target polynomial to yield a reconstructed output; aligning the equalized output with the reconstructed output to yield a delayed output; calculating a difference between the reconstructed output and the delayed output to yield an error value; filtering the error value based at least in part on a filter coefficient to yield a filtered output; and using the filtered output to adapt the filter coefficient, the target polynomial, and the equalizer coefficient.


In some instances of the aforementioned embodiments, the data input is received from an analog to digital converter circuit, and the method further includes receiving an analog input, and converting the analog input signal into a digital output, wherein the digital output is the data input. In various instances of the aforementioned embodiments, the data input is derived from a storage medium or a transfer medium.


In some instances of the aforementioned embodiments, the data input is initially a known data input, and subsequently an unknown data input. In such instances, during processing the unknown data input the target polynomial may be fixed to a value adaptively determined during processing the known data input. In one or more instances of the aforementioned embodiments, using the filter output to adapt the target polynomial is done by minimizing a noise whitened and squared version of the error value, and using the filter output to adapt the equalizer coefficient is done by minimizing a noise whitened and squared version of the error value.


Other embodiments of the present invention provide data processing circuits. Such data processing circuits include: an equalizer circuit, a noise predictive filter circuit, a data detector circuit, a data reconstruction circuit, and an adaptation circuit. The equalizer circuit is operable to receive a data input and to provide an equalized output based at least in part on an equalizer coefficient. The noise predictive filter circuit is operable to receive the equalized output and to provide a noise whitened output based at least in part on a noise predictive filter coefficient. The data detector circuit is operable to apply a data detection algorithm to the noise whitened output to yield a detected output. The data reconstruction circuit is operable to receive the detected output and to provide a reconstructed output corresponding to the equalized output based at least in part on a target polynomial. The adaptation circuit is operable to adaptively calculate the equalizer coefficient, the noise predictive filter coefficient and the target polynomial.


In some instances of the aforementioned embodiments, the adaptation circuit includes a summation circuit operable to subtract the reconstructed output from the equalized output to yield an error value. In particular cases, the adaptation circuit further includes an equalizer adaptation circuit operable to minimize the noise whitened and squared version of the error value, and a target adaptation circuit operable to minimize a noise whitened and squared version of the error value.


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.





BRIEF DESCRIPTION OF THE 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.



FIG. 1 depicts a data processing circuit including an adaptive feedback noise processing, equalization and targeting circuit in accordance with some embodiments of the present invention;



FIG. 2
a is a flow diagram showing a process in accordance with some embodiments of the present invention for adaptively adjusting noise processing, equalization and targeting in a data processing circuit to establish a baseline;



FIG. 2
b is a flow diagram showing a process in accordance with some embodiments of the present invention for using the baseline established in the method of FIG. 2a to adaptively adjusting noise processing, equalization and targeting in a data processing circuit;



FIG. 3 shows a storage system including an adaptive feedback noise processing, equalization and targeting circuit in accordance with some embodiments of the present invention; and



FIG. 4 depicts a communication system including an adaptive feedback noise processing, equalization and targeting circuit in accordance with different embodiments of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for adaptive data processing.


Turning to FIG. 1, a data processing circuit 100 including an adaptive feedback noise processing, equalization and targeting circuit is shown in accordance with some embodiments of the present invention. Data processing circuit 100 includes an analog to digital conversion circuit 110 that receives a data input 105. Data input 105 is an analog signal representing information that may be received from a variety of sources including, but not limited to, a storage medium or a data transfer medium in a communication device. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of sources for data input 105. Analog to digital converter circuit 110 samples data input 105 and provides the samples as a series of digital values 112. Digital values 112 are generally referred to herein as y samples.


Digital values 112 are provided to an equalizer circuit 120 that performs a data equalization on the received values in accordance with equalizer coefficients 192 provided from an equalizer adaptation circuit 190 and provides an equalized output 122. Equalized output 122 is generally referred to herein as y samples, and may be described by the following equation:

y=ax,

where a corresponds to equalizer coefficients 192 collectively. In one particular embodiment of the present invention, a ten tap filter length is used to implement equalizer adaptation circuit 190. In such cases, equalizer coefficients (aj) include ten values (j=0, 1, 2, 3 . . . 9). Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of equalizer lengths and implementations that may be used in relation to different embodiments of the present invention.


Equalized output 122 to a noise predictive filter circuit 130 that performs noise predictive filtering in equalized output 122 in accordance with noise predictive coefficients 182 to yield a noise whitened output 132. Noise predictive filter circuit 130 may be any noise predictive filter circuit known in the art. In one particular embodiment of the present invention, noise predictive filter 130 has a three tap filter length that is used to implement noise predictive filter circuit 130. In such cases, noise predictive coefficients include four values (m=0, 1, 2, 3). Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of noise predictive filter lengths and implementations that may be used in relation to different embodiments of the present invention.


Noise whitened output 132 is provided to a data detector circuit 140 that performs a data detection on the received input to yield a data output 142. Data output 142 includes both hard decision data and soft decision data. The soft decision data indicates a likelihood that the corresponding hard decision data is correctly selected. The operation of data detector circuit 140 is governed by a target polynomial 164 (i.e., target coefficients) provided by a filter adaptation circuit 160. Data detector circuit may be any data detector circuit known in the art. In one particular embodiment of the present invention, data detector circuit 140 is a maximum a posteriori data detector circuit as is known in the art. The hard decision portion of data output 142 is provided to both filter adaptation circuit 180 and target adaptation circuit 160.


A data reconstruction circuit 150 operates on the hard decision portion of data output 142 to reconstruct a data set corresponding to equalized output 122 and provide a reconstructed output 152. Data reconstruction circuit 150 may be any circuit known in the art that is capable of regenerating an original input based on a received detected output. Reconstructed output 152 is generally referred to herein as ŷ samples. Reconstructed output 152 is provided to a summation circuit 195 where it is subtracted from a delayed equalized output 172 received from a delay circuit 170. In particular, delay circuit 172 receives equalized output 122 and delays it in time to align with the bit positions of reconstructed output 152 corresponding to equalized output 122. An error value 194 is provided from summation circuit 195 in accordance with the following equation:







Error





Value

=





j
=
0

z








a
j



x


[

k
-
j

]




-



y
^



[
k
]


.







where j indicates one of the equalizer coefficients. In one embodiment of the present invention, the equalizer circuit is a ten tap equalizer filter in which case the value of z is nine. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other equalizer circuits lengths that may be used in accordance with different embodiments of the present invention. Of note, the aforementioned is an ideal equation that may be modified to account for mis-equalization (μ[cond]) that may be considered as part of the target adaptation process discussed below. The modified equation accounting for mis-equalization is as follows:







Error





Value

=





j
=
0

z








a
j



x


[

k
-
j

]




-

μ


[
cond
]


-



y
^



[
k
]


.







Error value 194 is provided to equalizer adaptation circuit 190, filter adaptation circuit 180 and target adaptation circuit 160.


Filter adaptation circuit 180 adaptively calculates noise predictive coefficients 182 using any adaptive calculation process known in the art. In particular, filter adaptation circuit 180 adaptively calculates noise predictive coefficients 182 based on error value 194, equalized output 122 and a target feedback value 162.


Equalization adaptation circuit 190 adaptively calculates equalizer coefficients 192 to minimize a noise whitened and squared version of the error value as set forth in the following equation:

Squared Error=(ErrorTerm)2,

where the ErrorTerm is defined by the following equation:








Error





Term

=




m
=
0

t








(





j
=
0

z








a
j



x


[

k
-
m
-
j

]




-


μ


[
cond
]




[
m
]


-


y
^



[

k
-
m

]



)




f


[
cond
]




[
m
]





,





where m represents each filter tap on a noise predictive filter that performs the f[cond][m] processing. In one particular embodiment of the present invention, the noise predictive filter is a three tap filter length in which case t is equal to three. Minimizing noise whitened and squared version of the error value by changing the equalizer coefficients 192 (an) to drive the following gradient (i.e.,









η




a
n



)





of the Squared Error to zero for each coefficient:







Gradient
=

2


(




m
=
0

t




(


e


[

k
-
m

]


-


μ


[
cond
]




[
m
]



)




f


[
cond
]




[
m
]




)



(




m
=
0

t




(

x


[

k
-
m
-
n

]


)




f


[
cond
]




[
m
]




)



,





where e[k−m] is short for the difference between the reconstructed output and the target error shown in the following equation:







e


[

k
-
m

]


=





j
=
0

z




a
j



x


[

k
-
j

]




-



y
^



[
k
]


.






Target adaptation circuit 160 adaptively calculates target polynomial 164 to minimize a noise whitened and squared version of the error value. Minimizing noise whitened and squared version of the error value by changing target polynomial 164 to drive the following gradient the following gradient of the squared error (i.e.,









η





μ


[
cond
]




[
m
]




)





is set equal to zero to determine an optimal value for the target which accounts for the mis-equalization term:






Gradient
=

2


(




m
=
0

t




(


e


[

k
-
m

]


-


μ


[
cond
]




[
m
]



)




f


[
cond
]




[
m
]




)




(

-


f


[
cond
]




[
m
]



)

.







Again, e[k−m] is short for the difference between the reconstructed output and the target error shown in the following equation:







e


[

k
-
m

]


=





j
=
0

z




a
j



x


[

k
-
j

]




-



y
^



[
k
]


.






In operation, data processing circuit 100 receives a known data set as data input 105 for processing. As the canned input is being processed, filter adaptation circuit 180 adaptively calculates noise predictive coefficients 182 using a standard adaptive calculation process known in the art. While processing the known data input, equalization adaptation circuit 190 adaptively calculates equalizer coefficients 192 to minimize a noise whitened and squared version of the error value, and target adaptation circuit 160 adaptively calculates target polynomial 164 to minimize a noise whitened and squared version of the error value. Once a minimum occurs, target polynomial is fixed and stored for use during regular data processing.


At this juncture a regular data input (i.e., an unknown data input) is provided as data input 105. Target polynomial 164, equalizer coefficients 192, and noise predictive coefficients 182 are initially applied. While processing the regular data input, filter adaptation circuit 180 adaptively calculates noise predictive coefficients 182 using a standard adaptive calculation process known in the art, and equalization adaptation circuit 190 adaptively calculates equalizer coefficients 192 to minimize a noise whitened and squared version of the error value.


Turning to FIG. 2a, a flow diagram 200 shows a process in accordance with some embodiments of the present invention for adaptively adjusting noise processing, equalization and targeting in a data processing circuit to establish a baseline. Following flow diagram 200, a known data input is received (block 205). The data input is a defined, known analog signal representing informational bits at various times or bit locations. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of sources of the known data input.


An analog to digital conversion is applied to the data input to yield a series of digital samples corresponding to respective sample periods (block 210). The resulting digital samples are generally referred to herein as x samples. The analog to digital conversion may be applied using any analog to digital conversion approach known in the art. The resulting series of digital samples are provided to an equalization circuit where they are equalized to an equalization target (block 215). The equalizer circuit is initialized with coefficients that are expected to be close to the final adapted equalizer coefficients. The resulting digital samples are generally referred to herein as y samples, and may be described by the following equation:

y=ax,

where a corresponds to the equalization target. The equalization may be done using any equalization process known in the art. For example, in one embodiment of the present invention, the equalization is done using a finite impulse response filter with operation governed by one or more filter taps as is known in the art. The resulting equalized data samples are provided to a noise predictive filter circuit that performs noise predictive filtering to yield a noise whitened output (block 225). The noise predictive filtering may be done using any noise predictive filtering circuit governed based on one or more filter taps as is known in the art.


The noise whitened output is provided to a data detector circuit where a data detection algorithm is applied to the received sample in an effort to recover the originally written data (block 230). This data detection process may be any data detection process known in the art. For example, the data detection process may be a maximum a posteriori data detection process as is known in the art.


In addition, the resulting detected output is used to reconstruct the data input for comparison purposes (block 235). The resulting reconstructed output is generally referred to herein as ŷ samples. The equalized output (block 215) is delayed in time to align it with the corresponding reconstructed data (block 220). The delayed equalized output and the reconstructed output are combined to calculate a target error (block 245) in accordance with the following equation:







Error
=





j
=
0

z




a
j



x


[

k
-
j

]




-


y
^



[
k
]




,





where j indicates one of the equalizer coefficients. In one embodiment of the present invention, the equalizer circuit is a ten tap equalizer filter in which case the value of z is nine. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other equalizer circuits lengths that may be used in accordance with different embodiments of the present invention. Of note, the aforementioned is an ideal equation that may be modified to account for mis-equalization (μ[cond]) that may be considered as part of the target adaptation process discussed below. The modified equation accounting for mis-equalization is as follows:






Error
=





j
=
0

z








a
j



x


[

k
-
j

]




-

μ


[
cond
]


-



y
^



[
k
]


.






The determined error is then noise whitened to yield a whitened error term (block 250) in accordance with the following equation:








Error





Term

=




m
=
0

t








(





j
=
0

z








a
j



x


[

k
-
m
-
j

]




-


μ


[
cond
]




[
m
]


-


y
^



[

k
-
m

]



)




f


[
cond
]




[
m
]





,





where m represents each filter tap on a noise predictive filter that performs the f[cond][m] processing. In one particular embodiment of the present invention, the noise predictive filter is a three tap filter length in which case t is equal to two. The error term is then squared (block 255) in accordance with the following equation:

Squared Error=(ErrorTerm)2.


The existing noise predictive filter coefficients, equalization coefficients and target coefficients are modified to adaptively minimize the squared error term (block 270). The resulting adapted values are used in processing a newly received data input. The adapted values are calculated using any approach known in the art for optimizing noise predictive coefficients (i.e., f[cond][m]). Using the aforementioned f[cond][m], the following gradient of the squared error (i.e.,









η




a
n



)





is set equal to zero to determine an optimal value for the equalizer coefficients (an) for each coefficient:







Gradient
=

2


(




m
=
0

t








(


e


[

k
-
m

]


-


μ


[
cond
]




[
m
]



)




f


[
cond
]




[
m
]




)



(




m
=
0

t








(

x


[

k
-
m
-
n

]


)




f


[
cond
]




[
m
]




)



,





where e[k−m] is short for the difference between the reconstructed output and the target error shown in the following equation:







e


[

k
-
m

]


=





j
=
0

z








a
j



x


[

k
-
j

]




-



y
^



[
k
]


.







Similarly, using the aforementioned f[cond][m], the following gradient of the squared error (i.e.,









η





μ


[
cond
]




[
m
]




)





is set equal to zero to determine an optimal value for the target which accounts for the mis-equalization term:






Gradient
=

2


(




m
=
0

t








(


e


[

k
-
m

]


-


μ


[
cond
]




[
m
]



)




f


[
cond
]




[
m
]




)




(

-


f


[
cond
]




[
m
]



)

.







Again, e[k−m] is short for the difference between the reconstructed output and the target error shown in the following equation:







e


[

k
-
m

]


=





j
=
0

z








a
j



x


[

k
-
j

]




-



y
^



[
k
]


.






Turning to FIG. 2b, a flow diagram 203 shows a process in accordance with some embodiments of the present invention for using the baseline established using the process of flow diagram 200 of FIG. 2a to adaptively adjust noise processing, equalization and targeting in a data processing circuit. In particular, prior to operating on actual data inputs, the baseline (i.e., the value established for the target which accounts for the mis-equalization term) is fixed for the specific zone over which it was calculated and stored to a table.


Following flow diagram 203, a known data input is received (block 208). The process of flow diagram 203 is used to process unknown data inputs. Such data inputs are an analog signals representing informational bits at various times or bit locations. The data input may be received from a variety of sources including, but not limited to, a storage medium or a data transfer medium in a communication device. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of sources for such data inputs.


An analog to digital conversion is applied to the data input to yield a series of digital samples corresponding to respective sample periods (block 211). The resulting digital samples are generally referred to herein as x samples. The analog to digital conversion may be applied using any analog to digital conversion approach known in the art. The resulting series of digital samples are provided to an equalization circuit where they are equalized to an equalization target (block 214). The equalizer circuit is initialized with the equalizer coefficients developed in the process of flow diagram 200. The resulting digital samples are generally referred to herein as y samples, and may be described by the following equation:

y=ax,

where a corresponds to the equalization target. The equalization may be done using any equalization process known in the art. For example, in one embodiment of the present invention, the equalization is done using a finite impulse response filter with operation governed by one or more filter taps as is known in the art. The resulting equalized data samples are provided to a noise predictive filter circuit that performs noise predictive filtering to yield a noise whitened output (block 223). The noise predictive filtering may be done using any noise predictive filtering circuit governed based on one or more filter taps as is known in the art.


The noise whitened output is provided to a data detector circuit where a data detection algorithm is applied to the received sample in an effort to recover the originally written data (block 226). This data detection process may be any data detection process known in the art. For example, the data detection process may be a maximum a posteriori data detection process as is known in the art. The resulting detected output is provided as a circuit output (block 232). This detected output may be provided, for example, to a down stream data decoding circuit. Based upon the disclosure provided herein, one of ordinary skill in the art will appreciate a variety of uses for the resulting detected output.


In addition, the resulting detected output is used to reconstruct the data input for comparison purposes (block 229). The resulting reconstructed output is generally referred to herein as ŷ samples. The equalized output (block 214) is delayed in time to align it with the corresponding reconstructed data (block 217). The delayed equalized output and the reconstructed output are combined to calculate a target error (block 238) in accordance with the following equation:







Error
=





j
=
0

z








a
j



x


[

k
-
j

]




-


y
^



[
k
]




,





where j indicates one of the equalizer coefficients. In one embodiment of the present invention, the equalizer circuit is a ten tap equalizer filter in which case the value of z is nine. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other equalizer circuits lengths that may be used in accordance with different embodiments of the present invention. Of note, the aforementioned is an ideal equation that may be modified to account for mis-equalization (μ[cond]) that may be considered as part of the target adaptation process discussed below. The modified equation accounting for mis-equalization is as follows:






Error
=





j
=
0

z








a
j



x


[

k
-
j

]




-

μ


[
cond
]


-



y
^



[
k
]


.






The determined error is then noise whitened to yield a whitened error term (block 241) in accordance with the following equation:








Error





Term

=




m
=
0

t




(





j
=
0

z








a
j



x


[

k
-
m
-
j

]




-


μ


[
cond
]




[
m
]


-


y
^



[

k
-
m

]



)




f


[
cond
]




[
m
]





,





where m represents each filter tap on a noise predictive filter that performs the f[cond][m] processing. In one particular embodiment of the present invention, the noise predictive filter is a three tap filter length in which case t is equal to two. The error term is then squared (block 244) in accordance with the following equation:

Squared Error=(ErrorTerm)2.


The existing noise predictive filter coefficients, equalization coefficients are modified to adaptively minimize the squared error term (block 263). The resulting adapted values are used in processing a newly received data input. The adapted values are calculated using any approach known in the art for optimizing noise predictive coefficients (i.e., f[cond][m]). Using the aforementioned f[cond] [m], the following gradient of the squared error (i.e.,









η




a
n



)





is set equal to zero to determine an optimal value for the equalizer coefficients (an) for each coefficient:







Gradient
=

2


(




m
=
0

t








(


e


[

k
-
m

]


-


μ


[
cond
]




[
m
]



)




f


[
cond
]




[
m
]




)



(




m
=
0

t








(

x


[

k
-
m
-
n

]


)




f


[
cond
]




[
m
]




)



,





where e[k−m] is short for the difference between the reconstructed output and the target error shown in the following equation:







e


[

k
-
m

]


=





j
=
0

z








a
j



x


[

k
-
j

]




-



y
^



[
k
]


.






Turning to FIG. 3, a storage system 300 including a read channel circuit 310 with an adaptive feedback noise processing, equalization and targeting circuit is shown in accordance with various embodiments of the present invention. Storage system 300 may be, for example, a hard disk drive. Storage system 300 also includes a preamplifier 370, an interface controller 320, a hard disk controller 366, a motor controller 368, a spindle motor 372, a disk platter 378, and a read/write head 376. Interface controller 320 controls addressing and timing of data to/from disk platter 378. The data on disk platter 378 consists of groups of magnetic signals that may be detected by read/write head assembly 376 when the assembly is properly positioned over disk platter 378. In one embodiment, disk platter 378 includes magnetic signals recorded in accordance with either a longitudinal or a perpendicular recording scheme.


In a typical read operation, read/write head assembly 376 is accurately positioned by motor controller 368 over a desired data track on disk platter 378. Motor controller 368 both positions read/write head assembly 376 in relation to disk platter 378 and drives spindle motor 372 by moving read/write head assembly to the proper data track on disk platter 378 under the direction of hard disk controller 366. Spindle motor 372 spins disk platter 378 at a determined spin rate (RPMs). Once read/write head assembly 378 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 378 are sensed by read/write head assembly 376 as disk platter 378 is rotated by spindle motor 372. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 378. This minute analog signal is transferred from read/write head assembly 376 to read channel module 364 via preamplifier 370. Preamplifier 370 is operable to amplify the minute analog signals accessed from disk platter 378. In turn, read channel circuit 310 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 378. This data is provided as read data 303 to a receiving circuit. As part of decoding the received information, read channel circuit 310 performs an adaptive feedback noise processing, equalization and targeting circuit. Such an adaptive circuit may be implemented similar to that described above in relation to FIG. 1, and/or may operate similar to the method discussed above in relation to FIG. 2. A write operation is substantially the opposite of the preceding read operation with write data 301 being provided to read channel circuit 310. This data is then encoded and written to disk platter 378.


It should be noted that storage system 300 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 300 may be implemented in either software or firmware, while other functions or blocks are implemented in hardware.


Turning to FIG. 4, a communication system 400 including a receiver 420 with an adaptive feedback noise processing, equalization and targeting circuit is shown in accordance with different embodiments of the present invention. Communication system 400 includes a transmitter 410 that is operable to transmit encoded information via a transfer medium 430 as is known in the art. The encoded data is received from transfer medium 430 by receiver 420. Receiver 420 incorporates an adaptive feedback noise processing, equalization and targeting circuit. Such an adaptive circuit may be implemented similar to that described above in relation to FIG. 1, and/or may operate similar to the method discussed above in relation to FIG. 2.


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 data processing. 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. Therefore, the above description should not be taken as limiting the scope of the invention, which is defined by the appended claims.

Claims
  • 1. A method for data processing, the method comprising: receiving a data input;equalizing the data input based on an equalizer coefficient to yield an equalized output;performing a data detection on a derivative of the equalized output to yield a detected output;reconstructing the detected output based on a target polynomial to yield a reconstructed output;aligning the equalized output with the reconstructed output to yield a delayed output;calculating a difference between the reconstructed output and the delayed output to yield an error value;filtering the error value based at least in part on a filter coefficient to yield a filtered output; andusing the filtered output to adapt the filter coefficient, the target polynomial, and the equalizer coefficient.
  • 2. The method of claim 1, wherein the data input is received from an analog to digital converter circuit, and wherein the method further comprises: receiving an analog input; andconverting the analog input signal into a digital output, wherein the digital output is the data input.
  • 3. The method of claim 1, wherein the data input is initially a known data input.
  • 4. The method of claim 3, wherein the data input is subsequently an unknown data input, and wherein during processing the unknown data input the target polynomial is fixed to a value adaptively determined during processing the known data input.
  • 5. The method of claim 1, wherein the data input is derived from a storage medium.
  • 6. The method of claim 1, wherein the data input is derived from a transfer medium.
  • 7. The method of claim 1, wherein using the filter output to adapt the target polynomial is done by minimizing a noise whitened and squared version of the error value.
  • 8. The method of claim 7, wherein the noise whitened and squared version of the error value corresponds to the following equation:
  • 9. The method of claim 1, wherein using the filter output to adapt the equalizer coefficient is done by minimizing a noise whitened and squared version of the error value.
  • 10. A data processing circuit, the circuit comprising: an equalizer circuit operable to receive a data input and to provide an equalized output based at least in part on an equalizer coefficient;a noise predictive filter circuit operable to receive the equalized output and to provide a noise whitened output based at least in part on a noise predictive filter coefficient;a data detector circuit operable to apply a data detection algorithm to the noise whitened output to yield a detected output;a data reconstruction circuit operable to receive the detected output and to provide a reconstructed output corresponding to the equalized output based at least in part on a target polynomial; andan adaptation circuit operable to adaptively calculate the equalizer coefficient, the noise predictive filter coefficient and the target polynomial.
  • 11. The data processing circuit of claim 10, wherein the adaptation circuit includes a summation circuit operable to subtract the reconstructed output from the equalized output to yield an error value.
  • 12. The data processing circuit of claim 11, wherein the adaptation circuit includes: an equalizer adaptation circuit operable to minimize a noise whitened and squared version of the error value.
  • 13. The data processing circuit of claim 12, wherein the noise whitened and squared version of the error value corresponds to the following equation:
  • 14. The data processing circuit of claim 11, wherein the adaptation circuit includes: a target adaptation circuit operable to minimize a noise whitened and squared version of the error value.
  • 15. The data processing circuit of claim 10, wherein the circuit is implemented as part of an integrated circuit.
  • 16. The data processing circuit of claim 10, wherein the circuit is implemented as part of a device selected from a group consisting of: a storage device and a wireless communication device.
  • 17. The data processing circuit of claim 10, wherein the circuit further comprises: an analog to digital converter circuit, wherein the data input is an output of the analog to digital converter circuit.
  • 18. A data storage device, the storage device comprising: a storage medium maintaining a representation of an input data set;an analog front end circuit operable to sense the representation of the input data set and to provide the input data set as a data input; anda data processing circuit including: an equalizer circuit operable to receive a data input and to provide an equalized output based at least in part on an equalizer coefficient;a noise predictive filter circuit operable to receive the equalized output and to provide a noise whitened output based at least in part on a noise predictive filter coefficient;a data detector circuit operable to apply a data detection algorithm to the noise whitened output to yield a detected output;a data reconstruction circuit operable to receive the detected output and to provide a reconstructed output corresponding to the equalized output based at least in part on a target polynomial; andan adaptation circuit operable to adaptively calculate the equalizer coefficient, the noise predictive filter coefficient and the target polynomial.
  • 19. The storage device of claim 18, wherein the adaptation circuit includes: an equalizer adaptation circuit operable to minimize a noise whitened and squared version of the error value; anda target adaptation circuit operable to minimize the noise whitened and squared version of the error value.
  • 20. The storage device of claim 19, wherein the noise whitened and squared version of the error value corresponds to the following equation:
US Referenced Citations (136)
Number Name Date Kind
5278703 Rub Jan 1994 A
5278846 Okayama et al. Jan 1994 A
5325402 Ushirokawa Jun 1994 A
5392299 Rhines et al. Feb 1995 A
5471500 Blaker et al. Nov 1995 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
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 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
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 Raghaven et al. Jun 2007 B2
7257764 Suzuki et al. Aug 2007 B2
7298570 Han Nov 2007 B1
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
7511910 Han Mar 2009 B1
7523375 Spencer Apr 2009 B2
7509927 Shin et al. Sep 2009 B2
7587657 Haratsch 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
7982985 Chaichanavong Jul 2011 B1
8416520 Song Apr 2013 B1
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
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
20060248435 Haratsch Nov 2006 A1
20060256670 Park Nov 2006 A1
20070011569 Vila 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
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
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 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 Raghaven et al. Jan 2010 A1
20100042877 Tan Feb 2010 A1
20100042890 Gunam Feb 2010 A1
20100050043 Savin Feb 2010 A1
20100061492 Noelder Mar 2010 A1
20100070837 Xu et al. Mar 2010 A1
20100164764 Nayak Jul 2010 A1
20100185914 Tan et al. Jul 2010 A1
20110075569 Marrow et al. Mar 2011 A1
20110080211 Yang et al. Apr 2011 A1
20110167246 Yang et al. Jul 2011 A1
Foreign Referenced Citations (9)
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 2010101578 Apr 2009 WO
WO 2010126482 Apr 2010 WO
WO 2010101578 Sep 2010 WO
Non-Patent Literature Citations (56)
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. 13, 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, 2010, Liu, et al.
U.S. Appl. No. 12/887,317, filed Sep. 2, 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/947,942, filed Dec. 20, 2010, Liao et al.
U.S. Appl. No. 12/992,948, filed Nov. 16, 2010, Yang 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. density.bham.ac.uk/landinig/software/autot.
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. Matrix 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 LPDC 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.
Related Publications (1)
Number Date Country
20120124119 A1 May 2012 US