text:
Synchronous read channel sintegrated circuit employing a fault tolerant sync mark detector and method for recovering an undetectable sync mark
A synchronous read channel is disclosed which samples an analog read signal from a magnetic read head positioned over a magnetic disk medium, filters the sample values according to a desired partial response, extracts timing information from the filtered sample values, and detects an estimated data sequence from the filtered sample values using a discrete time sequence detector. The read channel further employs an error tolerant sync mark detector, as well as a sync mark recovery procedure for synchronizing to the data when the sync mark is destroyed by a defect.
Latest Cirrus Logic, Inc. Patents:
- Combining results from first and second speaker recognition processes
- Systems and methods for providing adaptive playback equalization in an audio device
- Methods and apparatus for processing stereophonic audio content
- Systems and methods for compressing a digital signal in a digital microphone system
- MEMS device and process
In the storage or transmission of digital information, the bits or symbols of the user data are actually transmitted or stored via a physical media or mechanism whose responses are essentially analog in nature. The analog write or transmit signal going into the storage/transmission media or channel is typically modulated by channel bits (typically run-length limited or RLL bits) that are an encoded version of the original user-data bits (non-return-to-zero or NRZ bits). The analog read or receive signal coming from the media is demodulated to detect or extract estimated channel bits, which are then decoded into estimated user-data bits. Ideally, the estimated user-data bits would be an identical copy of the original user-data bits. In practice, they can be corrupted by distortion, timing variations, noise and flaws in the media and in the write/transmit and read/receive channels.
The process of demodulating the analog read signal into a stream of estimated user-data bits can be implemented digitally. Digital demodulation in magnetic mass storage systems requires that the analog read signal be sampled at a rate that is on the order of the channel-bit rate. Maximum-likelihood (ML) demodulation is a process of constructing a best estimate of the channel bits that were written based on digitized samples captured from the analog read signal.
FIG. 1 shows an exemplary read signal 100, which is a positive-going pulse generated by an inductive read head, for example, from a single media transition such as transition 103 from North-South to South-North magnetization of track 104 on a rotating disk. Typically, the write signal modulates a transition in the state of the media to write a channel-bit of 1 and modulates the absence of a media transition to write a 0 channel bit. Thus, transition 103 corresponds to a single channel bit of value 1 in a stream of 0's.
It is common to use run-length-limited (RLL) encoding of the original user data bits, which are arbitrary or unconstrained, into an RLL-encoded stream of channel bits. It may be desirable that there be no less than d zeroes between ones; that is, that the media transitions be spaced by at least d+1 channel bit times. This constraint can help keep to a manageable level the interference effects among the pulses in the analog read signal. On the other hand, because media transitions provide timing information that must be extracted from the read signal to ensure synchronization of the demodulator with the pulses in the read signal, it may be desirable that there be no more than k zeroes between ones; that is, that there be a media transition at least every k'th channel bit time. An RLL(d,k) code is a code that can encode an arbitrary stream of original user-data bits into a stream of channel bits such that the encoded channel bit stream satisfies these two constraints. An RLL code has a theoretical capacity which limits the number of user bits which can be represented in a given number of RLL bits. The capacity is a function of the d and k constraints with d=0 and k=infinite being the limiting (unconstrained) case with a capacity of exactly one. The capacity of an RLL (1,7) code for example is just slightly greater than 2/3 and is exactly 2/3 for any practical implementation, meaning that every pair of user bits will map to exactly three RLL bits.
In FIG. 1, sample set 101 shows the values of four samples in the case of side sampling of read signal 100; i.e. 0.333, 1.0, 1.0, and 0.333. Sample set 101 is equivalent to the set 1, 3, 3, 1; that is, only the ratios among samples are significant. A signal model gives rise to an expected sample sequence for a single or isolated transition in media state. Typically, only a few samples of an isolated media transition are non-zero; in this case, four are non-zero. In a side-sampled signal model such as 1, 3, 3, 1, timing circuitry in the demodulator attempts to maintain a lock on the incoming signal such that two adjacent samples on opposite sides of the peak of an isolated pulse have equal amplitudes and samples are taken at roughly equal time intervals, each a single channel bit time. Synchronization of the samples with the spacing of the bits written on the media is maintained by a timing recovery loop which is in essence a phase-locked loop. Other sample timing arrangements may be useful. In center sampling, the timing circuitry tries to lock the sample times to the read signal pulses such that one sample occurs at the peak of each pulse. Sample set 102 shows the values of four samples in the case of center sampling of a similar read signal 104; i.e., 0.5, 1.0, 0.5, and 0.0 (or 1.0, 2.0, 1.0 and 0.0 depending on the arbitrary normalization used). An expected sample sequence of 1, 2, 1, 0 corresponds to the signal model known in the prior art as Extended Partial-Response Class IV (EPR4). Such sample sequences are samples of a continuous-time analog read-signal waveform such as may be produced in the readback circuitry of a magnetic storage device. For a system that is bandwidth limited to 1/(2T), where T is the sample spacing in time, the sampling theorem declares that the continuous time waveform must be superposition of sinc functions (sinc(x) is defined as sin(x)/x for x<>0, and as 1 for x=0), with one sinc function centered at each sample point and of amplitude equal to that sample value and with zero crossings at all other sample points. As an example, in saturation magnetic recording, the current in an inductive write head takes on values of +1 and -1. The basic excitation applied to the recording channel is a step in current from +1 to -1, vice versa, in the analog write signal. This step in write current produces a transition in the magnetization state of the media as it moves past the head. When an inductive read head is passed over this magnetic media transition, a voltage pulse is induced by the bandwidth limited differentiating interaction of the head with the magnetization of the media. By suitable filtering or equalization, the sequence of samples on an isolated transition response pulse can be made to { . . . , 0, 0, 1, 2, 1, 0, 0, . . . }, in which case the recording or transmission channel matches the EPR4 signal model. Another sample sequence well known in the prior art is the Partial Response Class IV signal model (PR4), which corresponds to an expected sample sequence of 0, 1, 1, 0. Further, as one is designing or taking measurements on a write/media/read channel, it may be desirable to take into account the exact response, noise and distortion characteristics of the channel in selecting the signal model to be implemented in the demodulator. Thus, there is a need for a demodulator that is programmable as to the signal model, or expected sequence of sample values for an isolated media transition. In situations such as mass information storage in magnetic media, significant storage-system speed and capacity gains can be realized if the information bits can be closer together in position/time on the media. Further, as media transitions are more closely positioned, the writing and reading processes become more sensitive to the distortion, timing variations and noise that are inevitably introduced in the processes of writing, storing, and reading. Also, as the transitions become closer, the ability of the media to fully transition from, say, North-South magnetization to South-North magnetization may be taxed. Also, as the media transitions become closer, interference effects increase among adjacent or nearby transitions. FIG. 2 shows how positive-going pulse 200 from first media transition 201 combines with negative-going pulse 202 from second transition 203 to produce analog read signal 204, which can be viewed as the interference of the two pulses. Adjacent media transitions always give rise to read pulses of opposite polarities because they always are created by transitions of opposite types, for example North-South changes to South-North in transition 201, so adjacent transition 202 must be South-North changing back to North-South. Read signal 204 might give rise to a sequence of samples such as 0.333, 1.0, 0.667, -0.667, -1.0, 0.333. To the extent that the read process is linear (and it may not be entirely linear), the voltage waveform induced in the read head will be the superposition of a sequence of pulses, where each pulse is the response to an isolated magnetic transition on the media. Clearly, engineering a high-performance read channel is a complex challenge given the combined effects of the limited sampling rate in a digital demodulator, possibly incomplete transitions in the media, interference among read-signal responses to media transitions, and distortion, timing variations, noise and flaws in the media and in the write and read channels. The prior art uses a method known as partial-response signaling to increase media transition rates. Partial-response signaling is described in the book "Digital Transmission of Information", by Richard E. Blahut, 1990, pp. 139-158 and 249-255. This method allows the analog response of the storage/transmission media and of the write/transmit and read/receive circuitry to a media transition to overlap with the response to adjacent transitions associated with subsequent information bits. If properly implemented, this method can achieve higher information bit rates/densities than the alternative of requiring the media transitions to be spaced such that the read signal responses do not overlap. Such a method requires a sequence detector which can make its decisions not on a bit-by-bit basis but by examining the context of the surrounding read signal.
In a magnetic disk drive, the surface of the magnetic media is logically divided into concentric rings called tracks. The distance around the track varies as a function of the radius at which the track lies. Since it is desirable to keep the rate of revolution of the disk constant to avoid mechanical delays in accelerating and decelerating the disk, it is necessary to either store an amount of data on each track which is proportional to the length of the track (this requires a different data transfer rate for each track) or to vary the physical transition spacing on the media so that pulses are widely separated at the outside diameter and crowded very close at the inner diameter of the recording surface (this is wasteful of the magnetic media which is only sparsely used at the outer diameter). A practice known as zoned recording is a popular compromise between these two extremes. In zoned recording, a group of tracks (a zone) is established in which every track in the zone holds the same amount of data. Thus each zone requires a different data transfer rate, but the number of data transfer rates which need be supported is reduced (more coarsely quantized) This still leaves a variation in the physical spacing of transitions between the inside and outside diameters of each zone resulting in a variation in pulse shape.
Partial-response signaling has just recently been incorporated into mass storage devices and then in a limited form. One prior-art magnetic disk drive using partial-response signaling only supports PR4 (pulses with the samples of . . . , 0, 1, 1, 0, . . . ). PR4 signaling has only very limited inter-symbol interference evidenced by only two non-zero samples in the pulse. To increase the capacity of the media, the user of a PR4 read channel must increase the equalization of the pulses (slim the pulses) in order to limit the inter-symbol interference of adjacent pulses so that any pulse only affects two read signal samples. The increased equalization also enhances the noise accompanying the signal, making the detection task more difficult and errors more likely. U.S. Pat. No. 4,945,538 by Patel covers a similar situation but with EPR4 signaling and an RLL(1,7) code. This improves the allowed amount of inter-symbol interference, increasing it to three non-zero samples of ( . . . , 0, 1/2, 1, 1/2, 0, . . . ). Both of these techniques will allow an increase in capacity but are limited in the variety of pulse shapes which can be detected and therefore limited by how much equalization (pulse slimming) may be performed before the effect of equalizing the noise (noise enhancement) becomes intolerable.
Thus, there is a need for a flexible read channel which can accommodate a wide variety of pulse shapes as will be seen in each zone. There is also a need to allow larger amounts of controlled inter-symbol interference between pulses (pulses with more than two or three non-zero pulses) in order to continue increasing the capacity of the recording media.
A synchronous read channel having a single chip integrated circuit digital portion which provides digital gain control, timing recovery, equalization, digital peak detection, sequence detection, RLL(1,7) encoding and decoding, error-tolerant synchronization and channel quality measurement is disclosed. The integrated circuit accommodates both center sampling and side sampling, and has a high degree of programmability of various pulse shaping and recovery parameters and the ability to provide decoded data using sequence detection or digital peak detection. These characteristics, together with the error-tolerant sync mark detection and the ability to recover data when the sync mark is obliterated, allow a wide variety of retry and recovery strategies to maximize the possibility of data recovery. Various embodiments, including an embodiment incorporating the analog functions as well as the primary digital functions of the read channel in a single integrated circuit, and preferred embodiments utilizing a reduced complexity, programmable modified Viterbi detector supporting a broad class of partial response channels are disclosed.
FIG. 1 shows a state transition on a medium such as a track of a disk drive and its associated pulse in an analog read signal. It also shows two digitized sample models of such read-signal pulses.
FIG. 2 shows two adjacent medium transitions and their individual and combined read-signal pulses.
FIG. 3 is an overall block diagram of the present invention.
FIG. 4 is a block diagram illustrating the details of the gain control circuit 32 of FIG. 3.
FIG. 5 is a block diagram illustrating the details of the timing recovery circuit 34 of FIG. 3.
FIG. 6 is a block diagram illustrating the details of the spectrum smoothing filter 42 of FIG. 3.
FIG. 7A shows a sync mark in the context of a data sector, and FIG. 7B shows a preferred sync mark pattern.
The CL-SH4400 is a specific embodiment of the present invention designed to work with a companion analog integrated circuit and a disk controller to form a state of the art high density magnetic disk drive. In that regard, the uniqueness of the present invention, while used in a digital read-write channel, is primarily related to its read capability and versatility.
The companion integrated circuit with which the CL-SH4400 is specifically intended to implement a VGA (Variable Gain Amplifier), a tunable analog filter, an analog to digital converter, a timing VFO (Variable Frequency Oscillator), write pre-compensation and servo demodulation functions. Accordingly, in a read operation, the CL-SH4400 does not receive an analog signal but instead receives already digitized read information in the form of digitized analog read channel samples. Further, while the timing Variable Frequency Oscillator and the Variable Gain Amplifier are on the companion integrated circuit and are not part of the present invention, the timing VFO and the Variable Gain Amplifier are each digitally controlled through digital control signals generated in the CL-SH4400. Accordingly, in the specific embodiment to be described, digital control feedback signals for both the VFO and the VGA are generated in the CL-SH4400 even though the control loops for the timing recovery and the automatic gain control functions are actually closed within the companion analog integrated circuit. In that regard, it should be particularly noted that the automatic gain control signal may alternatively be generated on the analog companion integrated circuit, as the same may be readily generated in the analog domain rather than in the digital domain. Accordingly, particularly the generation of the digital gain control to be described as part of the CL-SH4400 is an optional design choice readily relegated to the companion integrated circuit if desired.
FIG. 3 provides a block diagram illustrating the general organization of the CL-SH4400. As may be seen in FIG. 3, the digitized read data for the CL-SH4400 is provided in an N-bit parallel form as digitized read data DRD0 and DRD1. Each of these two signals in the preferred embodiment disclosed is a 6-bit digitized read data signal. These two N-bit signals represent digitized samples of a read signal directly from a read head of the storage device after analog amplification and analog filtering. Those skilled in the art will recognize that the purpose of the analog amplifier and the analog filter is to scale the signals to the input range of the digital to analog converter and to attenuate frequencies above the Nyquist frequency (1/2 the sample frequency) to avoid signal distortion due to aliasing. In general, the analog filter will perform pulse shaping as well. The digitized read data signal DRD0 is a digitized read signal sample effectively taken near the center of a channel bit time (defined by the VFO frequency), subject however to a small amount of timing error or intentional timing set point offset in the VFO. The digitized read data signal DRD1 is the corresponding digitized read sample effectively taken near the center time of the previous logical channel bit, subject of course to similar timing errors and timing set point offsets. These two digitized read data signals are processed in the CL-SH4400 in a parallel or simultaneous manner so that ultimately in the CL-SH4400, two successive bits of digital read data will be derived from one set of DRD0 and DRD1 signals which together with successive bit pairs are decoded by a run-length limited (RLL) decoder and derandomized if applicable (e.g. if initially randomized) to provide the NRZ data output stream of the device. The processing of two digitized read data samples simultaneously doubles the throughput of the CL-SH4400 for a given clock rate without doubling the circuitry required, particularly in the sequence detector, though the present invention is not specifically limited to processing of two digitized read data sample at a time. One could process one digitized read data sample at a time, or alternatively process more than two digitized read data samples at a time, if desired. In that regard, the number of N-bit digitized read data sample connections to the chip normally will equal the number of samples processed at a time, though such signals could be multiplexed so that the number of N-bit digitized read data samples connections to the chip is less than the number of samples processed together.
In one mode of operation, multiplexer 20 couples the DRD0 and DRD1 signals directly to a transition detector 22 which processes the successive samples to detect the presence of transitions in each of the two digitized read data signals. In the preferred embodiment, the transition detector 22 is of the type disclosed in U.S. Pat. No. 5,329,554 entitled "Digital Pulse Detector," the disclosure of which is incorporated herein by reference. The output of the transition detector is a low or high level during the respective bit times (delayed as described in the co-pending application) depending upon whether a transition (providing a high level output) or no transition (providing a low level output) was detected. The output of the transition detector 22, the peak detected signal PKDET, in this mode would be coupled to multiplexer 24 and through a sync mark detector 26 to provide a sync byte detected output SBD if a sync byte was in fact detected, and to couple the two bits to the RLL decoder 28 which decodes the bit stream to provide the NRZ data out digital data. In the preferred embodiment run length constraint violations are detected and optionally multiplexed onto the NRZ data out lines. These may be used by an error correcting system within the disk controller. In the preferred embodiment, an error tolerant sync mark detector 26 is used. This detector, is designed to achieve a level of error tolerance for the synchronization function equal to that achieved for the data field by the error-correction code implemented in the disk controller. This is achieved in part by employing an error-tolerant Synchronization Mark pattern for minimum cross-correlation with the preamble and for minimum auto-correlation, and by making the length of the error tolerant Synchronization Mark and number of four-channel-bit groups which must be detected programmable. Referring to FIG. 7B, when the Synchronization Mark 44 length is programmed for one, two, or three NRZ bytes, the first twelve, twenty-four, or thirty-six bits, respectively, of the pattern are used. When the Synchronization Mark 44 length is programmed for one, two, three, or four bytes, the Synchronization Mark Threshold should be programmed to require error-free detection of three, four, six, or eight four-channel-bit groups, respectively, in normal operation. The synchronization mark recovery procedure may be used to recover data when a severe defect has destroyed the entire synchronization mark. When using this mode, the CL-SH4400 first goes through a normal timing and gain acquisition procedure while counting channel bits. The synchronization mark is assumed to have been detected when the count matches the synchronization mark recovery count. By varying the synchronization mark recovery count, the microcontroller can vary the assumed starting point of a header or data area until the correct starting point is tried, whereupon the sector will be recovered if there is no other error beyond the capability of the error correction code in the disk controller.
In the CL-SH4400, the NRZ data output is user selectable as a serial bit stream, a 2-bit parallel stream or character wide (8-bit wide) digital data. If the data was randomized prior to storage, the data randomizer 30 may be enabled to de-randomize the data from the RLL decoder 28 before being provided as the NRZ data output.
The output of the transition detector 22 in this mode is also provided to the gain control circuit 32 and the timing recovery circuit 34. Also the N-bit digitized samples DRD0 and DRD1 are coupled through multiplexer 20 to the gain control circuit 22 and the timing recovery circuit 34. The gain control circuit 32 is shown in more detail in FIG. 4. The gain errors (the difference between the programmable desired signal level referred to as the Gain Set point, and each digitized data signal) are determined for each digitized read data sample by the gain error circuit 33. The outputs PKDET of the transition detector 22 provide references to control the multiplexer 35 of the gain control circuit 32, as the gain adjustments are determined by the signal amplitudes of transitions and not the signal levels between transitions. The automatic gain control signal VGAC (5-bits in the preferred embodiment) for coupling back to the companion integrated circuit for analog amplifier gain control is provided by the digital gain loop filter 37, the details of which are shown in paragraph 4.5.2 on page 18 of Appendix 1. As shown therein, the gain loop filter includes a loop filter coefficient which is independently programmable for tracking and acquisition. The individual gain errors are also coupled to a channel quality circuit 46 as the signals GERR so that gain control performance can be measured to determine the best choice of loop filter coefficients and other parameters of the channel with respect to the performance of the automatic gain control loop.
The timing recovery circuit 34 in the CL-SH4400 is shown in greater detail in FIG. 5, and is generally in accordance with the timing recovery circuit disclosed in U.S. Pat. No. 5,359,631 entitled "Timing Recovery Circuit For Synchronous Wave Form Sampling," the disclosure of which is incorporated herein by reference. Timing recovery and maintenance of synchronization, of course, can only be done upon the detection of a transition, as the absence of transitions contains no timing information. The timing recovery circuit controls the read clocks which are synchronized to the read wave form. In the timing recovery circuit, a phase detector 39 digitally computes the phase error in the sampling instants of the analog to digital converter on the companion chip from the digitized sample values during transitions, as indicated by the signals PKDET. Providing timing error corrections only at transition times reduces the noise (jitter) in the timing loop. The sequence of measured phase errors is digitally filtered by filter 41 to produce a frequency control signal which is fed back to the companion chip, in the preferred embodiment as the 5-bit frequency control signal FCTL.
The timing recovery circuit has two modes of operation, acquisition and tracking. The appropriate range and resolution of the frequency control signal FCTL to the analog companion part is not the same for the two modes. In the acquisition mode, the necessary frequency control range is larger (wider range of possible frequency settings) than in tracking. Conversely, in tracking the required resolution (minimum step of frequency) is finer. To meet these conflicting requirements without unduly increasing the number of bits in the FCTL interface, the resolution and range are made to depend on the mode of operation, and a signal ACQ is used to communicate to the analog companion part which mode of operation is being used. When the operating mode is switched from acquisition to tracking, the last frequency setting during acquisition is stored in the companion analog part and the value on the FCTL bus during tracking is taken as an offset from the stored setting. In the preferred embodiment (CL-SH4400) the range and resolution are decreased by a factor of 8 between acquisition and tracking.
The timing recovery circuit 34 also includes a programmable timing set point. The timing set point permits a wider range of sampling strategies which enables the support of a wider range of pulse shapes. The timing set point is useful on retry in the event of the detection of an uncorrectable error. Also the digital filter includes two coefficients which are independently programmable for acquisition and tracking. These are also usable in a retry strategy to change the bandwidth and hence the response time of the timing loop. Like the individual gain errors GERR, the individual timing errors TERR are also coupled to the channel quality circuit for contribution to the quantitative analysis of the channel quality with respect to timing recovery. One alternate embodiment of the timing recovery block includes a frequency error detector. The frequency error detector is used to decrease the time required for the timing loop to lock to the channel bit frequency and phase during the acquisition period before encountering data.
As variations on the mode of operation just described, the two N-bit digitized read data signals DRD0 and DRD1 may be passed through a pulse shaping filter 38 prior to being coupled to multiplexing block 20. The pulse shaping filter provides digital filtering at the cost of a small amount of delay with two user selectable coefficients PC1 and PC2, independently programmable in the filter structure of This pulse shaping filter, of course, is in addition to any filtering done in the analog domain, and is an example of the flexibility and adaptability of the present invention. In particular, the effect of the pulse shaping filter may be eliminated by multiplexing block 20, or alternatively, the pulse shaping filter may be used with coefficients user selected, and thus variable, to provide the best performance of the overall storage system read channel with the flexibility to accommodate changes in pulse shape when changing from one recording zone to another, and to allow coefficient variations as part of overall device parameter variations for systematic retries upon the detection of uncorrectable errors in the subsequent error detection and correction (EDAC) operations. The pulse shaping filter of the preferred embodiment is a finite impulse response digital filter which means that the output is a function of the current and past inputs but not a function of its own past outputs. The delays necessary for the filter to remember the past inputs are shared by delay 36 to provide a separate delay path to multiplexing block 20. The delay path through delay 36 provides an amount of delay equivalent to the delay of pulse shaping filter 38 Multiplexing block 20 is provided to give a maximum of flexibility in modes of usage, by providing a separate source of input for the transition detector and the group of blocks comprising the sequence detector 40 (by way of spectrum smoothing filter 42), the gain control circuitry 32 and the timing recovery circuitry 34. The multiplexing block is designed so that all blocks may operate upon the raw input samples provided by DRD0 and DRD1, or alternatively the pulse shaping filter may be placed in one of the multiplexing block's output paths with the delay placed in the other path. The delay is necessary in this case so that the transition detector's outputs are synchronized with the sample values reaching the gain control circuitry and timing recovery circuitry. Finally, the pulse shaping filter may feed both of the multiplexing block's output paths. In general the multiplexing block could be designed so that by programming he multiplexing block each block at the multiplexing block's outputs (transition detector 22, gain control 32, timing recovery 34, and sequence detector 40 by way of spectrum smoothing filter 42) could receive raw input samples, delayed raw input samples, or filtered input samples independent of the data received by the other blocks. In the preferred embodiment of the present invention however, the gain control circuitry and the timing recovery circuitry have the capability of compensating for the pulse shape in an effort to increase the accuracy of the gain and timing recovery loops, and to reduce the amount of circuitry, the gain control circuitry and timing recovery circuitry assume the same pulse shape for which sequence detector 40 is programmed. This basic pulse shape received by the sequence detector is only marginally affected by the addition of the spectrum smoothing filter, which is designed to reduce only the head bumps at the tails of the pulse and does not seriously affect the center of the pulse except to correct for head bumps due to neighboring pulses. In that regard, the present invention includes a channel quality circuit 46 for measuring the quality of the read channel as earlier described. This provides not only quantitative channel evaluation, but in addition allows selection of read channel parameters such as, but not limited to, the coefficients PC1 and PC2 in the pulse shaping filter to best adapt the read channel to the characteristics of the storage medium and the pulse form and characteristics being read therefrom.
The present invention further includes a sequence detector 40 which receives as its input the two N-bit digital read data signals DRD0 and DRD1 as may be modified by the pulse shaping filter 38 and as may be additionally modified by the spectrum smoothing filter 42. In that regard, the spectrum smoothing filter 42, as shown in FIG. 6 hereof contains two delays FD1 and FD2 and four coefficients SC1, SC2, SC3 and SC4, all of which are independently programmable. The delays may be programmed from 0 to 23 channel bit intervals. The entire spectrum smoothing filter, or just its precursor correcting portion 43, can be disabled. The spectrum smoothing filter is designed to reduce the undershoots from the finite pole tips of a thin film head, or to reduce the bumps from the secondary gap of a single or double-sided MIG head. In the frequency domain, the filter acts to smooth out undulations caused by head bumps. If the precursor is disabled, the delay of the filter is disabled, whereas if a head which is not subject to head bumps is used, the post-cursor may be disabled.
The pulse shaping filter and the spectrum smoothing filter together form a digital equalizer which can modify the equalization done in the analog filter of the companion integrated circuit, and along with the companion integrated circuit provides support for changing equalization needs from head to head and zone to zone of the magnetic storage device. The parameters for the pulse shaping filter and the spectrum smoothing filter are loaded and/or varied by microcontroller 44 on initialization and during head seeks.
The sequence detector 40 is a partial response sequence detector. This allows the analog response of the read channel to a storage medium transition to overlap with the response to adjacent transitions associated with subsequent information bits. In comparison to most prior art read channels for magnetic storage media, the use of a partial response detector allows higher information storage densities in comparison to the prior art alternative of requiring the medium transitions to be sufficiently spaced from each other so that the read signal responses do not overlap significantly, thereby allowing each transition to be individually detected irrespective of the nearest neighboring transitions.
The particular sequence detector used in the present invention is a uniquely modified form of Viterbi detector which substantially preserves the full performance of the Viterbi algorithm in a substantially reduced complexity sequence detector. The basic Viterbi algorithm is described in the book "Fast Algorithms for Digital Signal Processing" by Richard E. Blahut, 1985, pages 387-399. In accordance with the Viterbi algorithm, a Viterbi detector does not attempt to decide whether a medium transition has occurred immediately upon receipt of the read sample or samples that correspond to that transition. Rather, as samples are taken from the read signal, the Viterbi detector keeps a running tally of the error between the actual sample sequence and the sample sequence that would be expected if the medium had been written with a particular sequence of transitions. Such an error tally is simultaneously kept for several possible transition sequences. As more samples are taken, less likely choices for transition sequences are pruned from consideration. If a set of possible sequences of medium transitions is appropriately constrained, then the location of each medium transition becomes known with a high degree of likelihood within a reasonable time after taking the samples corresponding to that transition. Because of the time delay between a sample acquisition and the determination of whether that sample represented a transition or an absence of a transition, the gain control circuit 32 and the timing recovery circuit 34 are both still referenced to the output of the transition detector 22, which has a more immediate response to the occurrence of a transition. Also, while in general the output of the sequence detector, when used, should be more accurate in ultimately determining whether a transition occurred at a particular bit time, an error in the output of the peak detector will have little effect on gain and timing. Specifically, failure to detect a transition will only slightly delay gain control and timing error corrections, and an isolated false detection of a transition will only slightly perturb the gain control and timing accuracy. This should be more than made up by the increased accuracy of the bit stream detection by the sequence detector's consideration of what comes before and after a particular digitized read data sample.
If the present invention is realized in an embodiment wherein digitized read data is processed a single bit time's worth at a time, a Viterbi detector of a conventional design may be used, or if two or more bit time's worth of samples are to be processed simultaneously, as in the preferred embodiment of the present invention, a conventional Viterbi detector could be modified for that purpose. However, in the preferred embodiment of the present invention, the uniquely modified form of Viterbi detector used is that diclosed in U.S. Pat. No. 5,291,499 entitled "Method and Apparatus for Reduced Complexity Sequence Detectors," the disclosure of which is incorporated herein by reference.
In a typical Viterbi detector implemented using the ADD, COMPARE, SELECT (ACS) method, each state in the expected sample sequence model is associated with a hardware module to perform the functions of adding new branch error metrics to path error metrics, comparing path error metrics, and selecting the path having the lowest path metric. In the sequence detector used in the preferred embodiment in accordance with the co-pending application, an ACS module may have two or more sequence model states dynamically associated with it such that at some times, one sequence model state is associated with it, and at other times, another sequence model is associated with it. This reduces the number of ACS modules required and also reduces the size and complexity of the detector path memories which must store one path for each ACS module. Groups of sequence model states may be chosen to share an ACS module without significant loss in performance as compared to the conventional Viterbi detector. These detectors support a wide range of sample models by making the expected sample sequence of an isolated medium transition programmable through control 44. By way of specific example, the sequence detector used in the CL-SH4400 disclosed herein will support the PR4, EPR4 and EEPR4 sample models, among others. In addition, the alternating polarity of pulses is enforced, as is a minimum run length constraint of d=1.
The d=1 constraint in the RLL(d,k) coding is an important constraint in the present invention, especially for applications where the storage system uses thin-film magnetic media. For thin-film magnetic media, there is an effect known as partial erasure which puts a practical limit on how close two magnetic transitions may be written. The effect is due to a ragged (or zig-zag) boundary between regions of opposite magnetization. As the transitions become too close, the zig-zags begin to overlap and the area of opposite magnetic polarity between two transitions starts to disappear. The result is that as the read head flies over the partially erased transitions, the amplitude of the corresponding read signal pulses is diminished. This is a non-linear, data pattern dependent effect which is difficult to compensate for. The d=1 constraint remedies this situation by preventing magnetic transitions in two consecutive channel bit times. The drawback is that the d=0 constrained code may typically represent 8 NRZ bits with 9 RLL bits (rate 8/9) while the d=1 constrained code can only represent 6 NRZ bits with 9 RLL bits (rate 2/3). For example, to store 8 NRZ bits, the d=0 constrained code will store 9 channel bits while the d=1 constrained code will store 12 channel bits in the same amount of space, hence the d=1 channel bit interval is 3/4 the size of the d=0 channel bit interval. Fortunately, the magnetic transitions have a minimum spacing of 2 channel bits and therefore the minimum distance between two transitions has increased by 3/2 with respect to the corresponding d=0 constrained code. This makes the d=1 constrained read channel a good solution for increasing storage capacity in applications where the minimum transition spacing is close enough for partial erasure effects to be noticeable.
The sequence detector utilized in the CL-SH4400 can be programmed to operate on any channel response which can be well represented by sequences in the form of a, b, 1, c wherein the selection of a, b and c allow the ability to accommodate pulse asymmetry which might otherwise require that the read signal pass through an analog or digital phase equalizer prior to entering the sequence detector. The levels a, b and c also give the ability to select between center and side sampling. Center-sampled pulses are notably those for which the sample levels a, b, 1, and c are selected such that 1 is very near the peak of the pulse, b and c are roughly halfway down their respective sides of the pulse, and a is near zero, for example, the sample levels 0, 1/2, 1 and 1/2. Side-sampled pulses are notably those for which the sample levels are selected such that 1 and b (which is about 1) straddle the peak of the pulse, for example the sample levels 5/16, 1, 1 and 5/16. This choice of side versus center sampling also affects the manner in which gain error and phase error are calculated in the gain control loop and timing recovery loop. The option to choose between side and center sampling allows the user a wider range of possible trade-offs between the amount of equalization (filtering) used to shape the raw pulse shape into the target pulse shape of the sequence detector and the amount of noise enhancement which arises as a consequence of shaping the raw pulse. Hence the read channel can be more suitably matched to the storage medium to provide better performance.
Referring again to FIG. 3, for writing information to the storage medium, the NRZ input data is provided to a run length limited encoder 48, in the CL-SH4400 through a user selectable serial line, a two bit parallel form or an eight bit byte parallel form. The run length limited encoder provides the desired run length limited coding, in the preferred embodiment an RLL (1,7) coding, randomized before encoding or not, depending upon the enabling of the data randomizer 30, with the encoded data being provided to multiplexer 52, in the preferred embodiment in a two-bit wide form. In the case of writing to the storage medium, the serial enable signal SER.sub.13 ENA will be deasserted so that the multiplexer 50 and 52 will provide the encoded data bits 1 (the most significant of the two parallel data bits) and 0 (the least significant of the two parallel data bits) to the companion integrated circuit to write the same to the storage medium.
When not writing, the serial enable signal SER.sub.13 ENA may be asserted, at which time multiplexers 50 and 52 are switched so that serial control address and data may be transferred on the SER.sub.13 DAT line to the companion integrated circuit synchronous with the associated serial clock signal SER.sub.13 CLK as the output signals of the two multiplexers 50 and 52. Multiplexing of these two chip pins of the single chip CL-SH4400 integrated circuit helps reduce the pin count without loss of performance or flexibility. This serial interface is provided to eliminate the need for the companion integrated circuit to interface with the bus of the microprocessor and eliminates a potential coupling between the noisy microprocessor bus and in the sensitive analog circuitry of the read channel in the companion integrated circuit. This also provides a benefit in pin count since the microprocessor bus interface would require numerous additional pins on the companion integrated circuit. Each of the control registers of the companion integrated circuit are mapped to corresponding register addresses in the integrated circuit of the present invention. When one of these registers is written to, the serial interface initiates a serial transfer write operation, sending the data to the appropriate register in the companion integrated circuit. The preferred embodiment of the present invention includes two modes, one in which a status bit which can be read to determine whether or not the serial transfer write operation is complete and another in which the integrated circuit of the preferred embodiment forces the microprocessor to pause while the serial transfer write operation is in progress. Similarly, a read of a register in the companion integrated circuit is performed by reading the corresponding register in the integrated circuit of the present invention. This initiates a serial transfer read operation. In the first of two serial interface read modes, the integrated circuit of the preferred embodiment will signal the microprocessor to pause until the serial transfer read operation is complete at which time the serially transferred data will be accessible at the pins of the integrated circuit of the present invention. In a second mode, the integrated circuit of the preferred embodiment will return the data left over from the previous serial transfer read operation, and once the current read operation is completed, it will initiate a new serial interface read operation with the address just supplied. The preferred embodiment includes a status bit which can be read to determine whether or not the new serial transfer read operation is complete. Once complete, the microprocessor may initiate a second read operation to retrieve the data originally desired and to initiate another serial transfer read operation at a new address for future use if desired. Summarizing the two modes, in one mode the microprocessor is made to wait, in the second mode the microprocessor must read the register twice, once to supply the register address and second time to retrieve the data and possibly supply the next register address.
In the embodiments hereinbefore described, numerous parameters were described as being programmable, and as such, as being useful for varying on retries in the event of the detection or repeated detection of an uncorrectable error. Obviously additional programmable or fixed parameters may also be incorporated, such as by way of example, additional filter coefficients in the pulse shaping and other filters. It should be noted that particularly certain parameters, such as the parameters of the pulse shaping filter 38 and the spectrum smoothing filter 42, may be made adaptive, or a combination of adaptive and programmable. By way of example, coefficients may be made adaptive, while the time constants of the adaptive characteristics and perhaps offsets, wave shapes, asymmetries and compensation for nonlinearities are made programmable. In that regard, it should be noted that given an uncorrectable or repeated uncorrectable error, there is no harm in further attempts at a successful read with different parameters, side versus center sampling, filtering versus different, less or no filtering, etc. Further, normally one would use the sequence detector on read for its superior detection capabilities over a peak detector. However in the case of hard errors wherein the errors in the output of the sequence detector exceed the error correction capability of the EDAC code used, a further retry strategy may include switching to an output derived from the peak detector, as previously described, rather than the sequence detector. This will add noise errors characteristic of transition detection effectively within the single bit-time of the possible transition, but will eliminate whatever additional propagation of the hard errors (for example media defects) may be caused by the sequence detector. The effect of the noise errors may be substantially eliminated by multiple reads, followed by a majority vote to cancel all or most of the effect of the noise errors, yielding an opportunity for a successful error correction when the same could not be achieved with the sequence detector in the path. Here again, pulse shaping filter characteristics may be varied and multiple retries of the peak detector multiple reads executed, as reasonable exhaustion of all opportunity for a successful read is better than a fatal error.
There have been disclosed and described herein preferred and alternate embodiments of a new and unique synchronous read channel which include a sequence detector with a flexible architecture capable of implementing a broad range of partial response polynomials. While an embodiment of the present invention which supports only one or two partial response channels would be highly useful, the detector used in the preferred embodiment of the present invention supports a broad class of partial response channels, including but not limited to PR4 (1,7), EPR4 (1,7) and EEPR (1,7). While the sequence detector is normally operative upon a read, the output of a digital peak detector may be enabled as the output of the read channel if desired. These and other inventive features of the invention will be apparent from the preceding description.
Thus while a preferred and alternate embodiments of the present invention has been disclosed and described in detail herein, it will be obvious to those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope thereof.
1. A synchronous read channel for reading data recorded on a magnetic disk storage medium by detecting binary data from a sequence of discrete time sample values generated by sampling pulses in an analog read signal from a magnetic read head positioned over the magnetic disk storage medium, comprising:
- (a) a sampling device for sampling the analog read signal to generate the discrete time sample values;
- (b) discrete time timing recovery, responsive to the discrete time sample values, for extracting timing information;
- (c) a discrete time sequence detector, responsive to the discrete time sample values, for detecting the binary data; and
- (d) a fault tolerant sync mark detector for detecting a fault tolerant sync mark recorded prior to the data, wherein the fault tolerant sync mark is selected to have minimum cross-correlation with an acquisition preamble.
2. The synchronous read channel as recited in claim 1, wherein the fault tolerant sync mark detector is programmable to detect sync marks of different lengths.
3. The synchronous read channel as recited in claim 1, wherein the fault tolerant sync mark detector comprises a programmable threshold indicating the number bits that must be accurately detected before the fault tolerant sync mark is deemed detected.
4. A synchronous read channel for reading data recorded on a magnetic disk storage medium by detecting binary data from a sequence of discrete time sample values generated by sampling pulses in an analog read signal from a magnetic read head positioned over the magnetic disk storage medium, comprising:
- (a) a sampling device for sampling the analog read signal to generate the discrete time sample values;
- (b) discrete time timing recovery, responsive to the discrete time sample values, for extracting timing information;
- (c) a discrete time sequence detector, responsive to the discrete time sample values, for detecting the binary data; and
- (d) a sync mark recovery circuit for recovering an undetectable sync mark in the discrete time sample values, wherein:
- (i) a number of channel values, responsive to the discrete time sample values, are counted from a predetermined reference point;
- (ii) the sync mark is deemed detected when a number of channel values counted matches a predetermined recovery count; and
- (iii) the recovery count is adjusted until the binary data is successfully synchronized.
5. The synchronous read channel as recited in claim 4, wherein the channel values are bits in the detected binary data.
6. A method of reading data recorded on a magnetic disk storage medium by detecting binary data from a sequence of discrete time sample values generated by sampling pulses in an analog read signal from a magnetic read head positioned oven the magnetic disk storage medium, comprising the steps of:
- (a) sampling the analog read signal to generate the discrete time sample values;
- (b) extracting timing information from the discrete time sample values;
- (c) detecting the binary data from the discrete time sample values; and
- (d) recovering an undetectable sync mark in the discrete time sample values by:
- (i) counting channel values from a predetermined reference point;
- (ii) considering-the sync mark detected when a number of channel values counted matches a predetermined recovery count; and
- (iii) adjusting the recovery count until the binary data is successfully synchronized.
7. The method for reading data as recited in claim 6, wherein the channel values are bits in the detected binary data.
Referenced Cited
U.S. Patent Documents
|October 3, 1978
|February 2, 1982
|February 22, 1983
|Halvorsen et al.
|December 25, 1984
|March 19, 1985
|August 13, 1985
|Harr et al.
|September 23, 1986
|February 17, 1987
|Dolivo et al.
|February 24, 1987
|August 4, 1987
|Fok et al.
|August 18, 1987
|September 27, 1988
|Ouchi et al.
|July 18, 1989
|July 31, 1990
|August 14, 1990
|Davie et al.
|August 28, 1990
|February 12, 1991
|Galbraith et al.
|July 2, 1991
|September 10, 1991
|Weathers et al.
|October 29, 1991
|Hase et al.
|April 21, 1992
|June 9, 1992
|Arakawa et al.
|June 9, 1992
|Kerwin et al.
|September 22, 1992
|Baugh et al.
|June 15, 1993
|Coker et al.
|July 27, 1993
|October 12, 1993
|Erikson et al.
|October 19, 1993
|Coker et al.
|November 2, 1993
|Johnson et al.
|November 9, 1993
|Nguyen et al.
|November 9, 1993
|Dolivo et al.
|January 25, 1994
|Patel et al.
|February 15, 1994
|Sugawara et al.
|March 1, 1994
|Behrens et al.
|March 1, 1994
|Patel et al.
|May 10, 1994
|Pan et al.
|June 14, 1994
|Nguyen et al.
|July 12, 1994
|Behrens et al.
|August 23, 1994
|Abbott et al.
|August 23, 1994
|Shimoda et al.
|August 30, 1994
|Boutaghou et al.
|September 6, 1994
|Abbott et al.
|October 25, 1994
|Behrens et al.
|November 8, 1994
|February 21, 1995
|Coker et al.
|March 17, 1998
|Dudley et al.
Other references
- Roy D. Cideciyan et al., "PMRL System for Digital Magnetic Recording," IEEE Journal on Selected Areas in Communications, vol. 10, No. 1, pp. 38-56, Jan. 1992. J. Hong et al., "An Experimental 180 Mb/sec PRML Channel for Magnetic Recording," IBM Storage Systems Products Division, vol. 27, No. 6, Nov. 1991. J.D. Coker et al., "Implementation PRML in a Rigid Disk Drive," IBM Storage Systems Products Division, vol. 27, No. 6, 1991. T.J. Schmerbeck, "A 27Mhz Mixed Analog/Digital Magnetic Recording Channel DSP Using Partial Response Signaling with Maximum Likelihood Detection," IEEE International Solid-state Circuits Conference, pp. 136-137, 1991. K. Knudson et al., "Producing Soft-Decision Information at the Output of a Class IV Partial Response Viterbi Detector," IEEE International Conference on Communications, vol. 2 of 3, pp. 26.5.1-26.5.5, Jun. 1991. K. Chopra et al., "A Soft Decision Detection Method for Run-Length Limited Recording Channels," Maple Press 1990. R. Behrens and A. Armstrong, "An Advanced Read/Write Channel for Magnetic Disk Storage," IEEE Twenty-Sixth Asilomar Conference on Signals & Computers, vol. 2, ppl 956-960, Oct. 1992. H.K. Thapar et al., "A Class of Partial Response Systems for Increasing Storage Density in Magnetic Recording," IEEE Transactions on Magnetics, vol. MAG-23, No. 5, Sep. 1987. William L. Abbott et al., "Channel equalization Methods for Magnetic Storage," IEEE, pp. 1618-1622, 1989. William L. Abbot et al., "Performance of Digital Magnetic Recording with Equalization and Offtrack Interference," IEEE Transactions on Magnetics, vol. 27, No. 1, Jan. 1991. Glover, N. and Dudley, T., "Practical Error Correction Design for Engineers," Revised Second Edition, pp. 250-269, Cirrus Logic Inc., 1991.
Patent History
Type: Grant
Filed: Mar 19, 1997
Date of Patent: Jun 1, 1999
Assignee: Cirrus Logic, Inc. (Fremont, CA)
Inventors: Richard T. Behrens (Louisville, CO), Trent O. Dudley (Littleton, CO), Neal Glover (Broomfield, CO)
Primary Examiner: Aristotelis M. Psitos
Assistant Examiner: Patrick Wamsley
Attorneys: Howard H. Sheerin, Dan A. Shifrin
Application Number: 8/823,393
International Classification: G11B 509;


text:
This post is going to draw an angry Haskell mob, but I just have to say it out loud: I have never seen a definition of the so-called category Hask and I do not actually believe there is one until someone does some serious work.
Let us look at the matter a bit closer. The Haskell wiki page on Hask says:
The objects of Hask are Haskell types, and the morphisms from objects
A to
B are Haskell functions of type
A -> B. The identity morphism for object
A is
id :: A -> A, and the composition of morphisms
f and
g is
f . g = \x -> f (g x).
Presumably "function" here means "closed expression". It is then immediately noticed that there is a problem because the supposed identity morphisms do not actually work correctly:
seq undefined () = undefined and
seq (undefined . id) () = (), therefore we do not have
undefined . id = undefined.
The proposed solution is to equate
f :: A -> B and
g :: A -> B when
f x = g x for all
x :: A. Again, we may presume that here
x ranges over all closed expressions of type
A. But this begs the question: what does
f x = g x mean? Obviously, it cannot mean "syntactically equal expressions". If we had a notion of observational or contextual equivalence then we could use that, but there is no such thing until somebody provides an operational semantics of Haskell. Written down, in detail, in standard form.
The wiki page gives two references. One is about the denotational semantics of Haskell, which is just a certain category of continuous posets. That is all fine, but such a category is not the syntactic category we are looking for. The other paper is a fine piece of work that uses denotational semantics to prove cool things, but does not speak of any syntactic category for Haskell.
There are several ways in which we could resolve the problem:
- If we define a notion of observational or contextual equivalence for Haskell, then we will know what it means for two expressions to be indistinguishable. We can then use this notion to equate indistinguishable morphisms.
- We could try to define the equality relation more carefully. The wiki page does a first step by specifying that at a function type equality is the extensional equality. Similarly, we could define that two pairs are equal if their components are equal, etc. But there are a lot of type constructors (including recursive types) and you'd have to go through them, and define a notion of equality on all of them. And after that, you need to show that this notion of equality actually gives a category. All the while, there will be a nagging doubt as to what it all means, since there is no operational semantics of Haskell.
- We could import a category-theoretic structure from a denotational semantics. It seems that denotational semantics of Haskell actually exists and is some sort of a category of domains. However, this would just mean we're restricting attention to a subcategory of the semantic category on the definable objects and morphisms. There is little to no advantage of doing so, and it's better to just stick with the semantic category.
Until someone actually does some work, there is no Hask! I'd delighted to be wrong, but I have not seen a complete construction of such a category yet.
Perhaps you think it is OK to pretend that something is a category when it is not. In that case, you would also pretend that the Haskell monads are actual category-theoretic monads. I recall a story from one of my math professors: when she was still a doctoral student she participated as "math support" in the construction of a small experimental nuclear reactor in Slovenia. One of the physicsts asked her to estimate the value of the harmonic series $1 + 1/2 + 1/3 + \cdots$ to four decimals. When she tried to explain the series diverged, he said "that's ok, let's just pretend it converges".
Supplemental: Of the three solutions mentioned above I like the best the one where we give Haskell an operational semantics. It's more or less clear how we would do this, after all Haskell is more or less a glorified PCF. However, the thing that worries me is
seq. Because of it
undefined and
undefined . id are not observationally equivalent, which means that we cannot use observational equivalence for equality of morphisms. We could try the wiki definition:
f :: A -> B and
g :: A -> B represent the same morphisms if
f x and
g x are observationally equivalent for all closed expressions
x :: A. But then we need to prove something after that to know that we really have a category. For instance, I do not find it obvious anymore that programs which involve seq behave nicely. And what happens with higher-order functions, where observational equivalence and extensional equality get mixed up, is everything still holding water? There are just too many questions to be answered before we have a category.
Supplemental II: Now that the mob is here, I can see certain patterns in the comments, so I will allow myself replying to them en masse by supplementing the post. I hope you all will notice this. Let me be clear that I am not arguing against the usefulness of category-theoretic thinking in programming. In fact, I support programming that is informed by abstraction, as it often leads to new insights and helps gets things done correctly. (And anyone who knows my work should find this completely obvious.)
Nor am I objecting to "fast & loose" mode of thinking while investigating a new idea in Haskell, that is obviously quite useful as well. I am objecting to:
- The fact the the Haskell wiki claims there is such a thing as "the category Hask" and it pretends that everything is ok.
- The fact that some people find it acceptable to defend broken mathematics on the grounds that it is useful. Non-broken mathematics is also useful, as well as correct. Good engineers do not rationalize broken math by saying "life is tough".
Anyhow, we do not need the Hask category. There already are other categories into which we can map Haskell, and they explain things quite well. It is ok to say "you can think of Haskell as a sort of category, but beware, there are technical details which break this idea, so you need to be a bit careful". It is not ok to write on the Haskell wiki "Hask is a category". Which is why I put up this blog post, so when people Google for Hask they'll hopefully find the truth behind it.
Supplemental III: On Twitter people have suggested some references that provide an operational semantics of Haskell:
- John Launchbury: A natural semantics for lazy evaluation
- Alan Jeffrey: A fully abstract semantics for concurrent graph reduction
Can we use these to define a suitable notion of equality of morphisms? (And let's forget about
seq for the time being.)

subset: commoncrawl


text:
The Nike Free Run 3 runing shoe features lightweight support and flexibility to help provide a broad range of motion that is ideal for the developing feet of a young athlete runner. Breathable mesh and a multi-layer upper foffers a lightweight, second-skin-like fit. Ultra-high resolution siping pattern delivers an incredibly smooth, naturally neutral ride. Abrasion-resistant rubber under the highest wear regions gives enhanced durability.
Nike Free Run 3 - Toddlers - Pure Platinum/Hot Punch/White/Reflect Silver
- Buy Now:
- Eastbay
- Price:
- $29.99
- By:
- Nike
To post comments, simply sign up and become a member!


text:
Next July will mark our fifth wedding anniversary and Fabian and I plan to take another big trip to celebrate. As you know by now, we both fell completely in love with London when we visited a couple of months ago and have been itching to go back ever since. However, I have also been dying to go back to Spain with Fabian since I visited in the summer of 2008. We will most likely combine the best of both worlds and pay a visit to both London and Madrid. I know it's still pretty early to be planning a trip, but I have already started looking into flights and hotels. Earlier this week, I came across the new Hotel Selenza in Madrid and I had to share it with my fellow design-lovers!
The hotel is filled with thoughtful details and modern touches. The hotel's design was carried out by the Italian architectural firm, Aplomo. The hotel's dining room features pretty moldings by Lovitex, Zeppelin pendants by Flos, and a giant Venetian-mirrored ceiling. The clean lines of the furniture work perfectly with all of the flourishes in the room.
This part of the lobby, along with many of the common areas, features beautiful Sicis tile with a pattern designed by Aplomo. The Skygarden light fixtures are from Flos and the beautiful three-dimensional mural is the work of artist, Javier Madrid.
The guest rooms are sleek and modern and feature touches like whimsical Lucite chairs from Aitali and wallcoverings by Evans and Brown.
The ensuite bathrooms feature the same thoughtful, modern touches that can be found in the rest of the hotel. I love the mosaic tile, modern sink, Molton Brown toiletries, and the fabulous tub!


text:
Cops: Mom charged after stripper party
Gansevoort woman had hired strippers for teen event at bowling alley
SOUTH GLENS FALLS — Police arrested the mother who hired two strippers for her son's 16th birthday party, according to the Glens Falls Post-Star.
The newspaper reported that Judy H. Viger, 33, of Gansevoort, was charged with five counts of endangering the welfare of a child.
The Nov. 3 party at Spare Time Bowling Alley featured two exotic dancers performing for partygoers as young as 14. The dancers stripped to thong underwear and bras and gave lap dances to some of the teenagers. A photo taken with a cellphone camera shows an upside-down dancer with a teen's head between her knees and her head between his legs.
Police began investigating the party after photos appeared online and stories appeared in the media. Police interviewed many of the 80 people at the part, which took place in a private room that had windows covered with butcher paper.
Endangering the welfare of a child is a misdemeanor that can carry a prison sentence up to one year. According to the law, endangerment occurs when a person "knowingly acts in a manner likely to be injurious to the physical, mental or moral welfare of a child less than 17 years old."


text:
Company Services
Garage Doors In Allentown, 18105
Garage Doors is a well established company Serving 18105, PA area. we are highly regarded throughout the industry for being the 'preferred installer' for most of the manufacturers.We are independent from all the garage door and operator manufacturers and are therefore free to choose only the very best garage doors and operators currently available for our customers in Airmont Area. We offer a nationwide delivery service, with some doors delivered the same week if stock and delivery schedules permit.
Garage Doors is committed to providing outstanding garage door service, repair and installation. Our Professional and Certified Technicians service and repair all types of garage doors and garage door openers. We also sell and install a wide selection of garage doors and garage door openers.
Our Garage Doors & Gates Services in Allentown, 18105 includes:
- Same Day and 24 Hour Emergency Service
- Limited Lifetime Warranty
- Highest Quality Garage Door Parts
- Trained, Certified and Uniformed Technicians
- New Garage Door Sales and Installation
- Garage Door Opener Sales and Installation
- Garage Door Accessories
- We Fix Broken Springs, Cables and Rollers
- Electric Gate Openers
- Gate Control Devices
- Telephone Intercom Systems
- Gate Accessories
Call us to discuss any Gates, Garage Doors questions or problems you have.
Call us toll free at : (888) 480-0701
Our Professional Serviceman provide Garage Door Services to these major cities in Pennsylvania:
• Allentown • Bethlehem • Coopersburg • Easton • Emmaus • Forks • Hanover • Hellertown • Kutztown • Lehigh • Lower Macungie • North Whitehall • Quakertown • Reading • South Whitehall • Whitehall •
Garage Doors By Zip Code:
• 18101 • 18102 • 18103 • 18104 • 18105 • 18106 • 18109 • 18175 • 18195 •
Tags: Garage Door Repair 18105, Gargae Door 18105, Gates Installation 18105, Gate Repair 18105 Allentown,
Garage Doors 18105


text:
Britney Spears's fiance Jason Trawick has petitioned to be the singer's co-conservator along with her father Jamie Spears, according to a U.S. report.
The Toxic hitmaker's father Jamie was placed in charge of her legal and business affairs in 2008 following the singer's much-publicized breakdown and hospitalization.
Spears' dad has continued to look after her estate but her legal team is working with Jamie to come up with a plan to gradually transfer control of the estate back to the singer.
E! Online editors are reporting that Trawick, under the behest of Jamie, is attempting to share conservatorship duties with Spears' father. The website reports that he will only have control over her well-being, not her finances.
Spears attended a hearing relating to the matter at Los Angeles County Superior Courthouse last month, and is reportedly set to attend another hearing in April.


text:
edo wrote:Roia wrote:Mr Moriaty wrote:"How many people are reading this thread naked?"
I can't figure out if you're liking my post by +1-ing it or telling me to add to the number because you are, in fact, reading this naked.
I'm also unsure whether or not I want to know the answer, but I've stated it now so come what may...


text:
- Home
- News
- Sports
- Opinion
- Obituaries
- Features
- Special Sections
- Classifieds
- Public Notices
By the time you read this, a group of United States senators will likely have introduced the first significant proposal on immigration reform in more than 20 years.
While it is far too early to comment on its content – the group has been fairly secretive as to details – the simple fact that such a high profile group will be offering a proposal is noteworthy. And it offers a good opportunity to talk, generally about immigration.
If you currently subscribe or have subscribed in the past to the The Lancaster News, then simply find your account number on your mailing label and enter it below.
Click the question mark below to see where your account ID appears on your mailing label.
|ZIP Code:


text:
April 21, 2011
LOS ANGELES -- It didn't take long for Fully Employed MBA (FEMBA) students Levi Brooker, Saba Kazemi, Steve Goodwillie, Steve Macanlis and Piotr Ozdzynski to form their team in the Global Access Program (GAP). These teammates had worked together on previous projects, got along well and knew they had a wide range of skills. Through the GAP project bidding process, they were chosen to work with an Australian firm called Dyesol that holds a number of solar energy patents and was interested in entering the U.S. energy production market.
GAP is a unique educational program that matches a team of students with an international technology company to develop a comprehensive business strategy. It gives students a chance to apply what they've learned in the first two years of their MBA program, and gives firms valuable data and analysis that might not otherwise be affordable - or available.
Team Dyesol started quickly. Steve Macanlis and Saba Kazemi flew to Australia to meet Dyesol senior executives and learn more about the products. Team members attended trade shows in Los Angeles, San Francisco and Dallas. This allowed them to meet prospective customers and competitors. In the course of their primary research, they spoke with over 200 industry experts.
The program requires a lot of primary and secondary research, according to Levi Brooker. "We spent 10-20 hours a week on this in addition to doing our normal jobs," he said. "Most people wind up missing at least a week of work to travel and attend meetings. It helps to have a flexible job."
After reviewing their data, the team decided that the timing was not right for Dyesol to enter the U.S. market. "We knew it wasn't going to be easy telling our client they shouldn't do this," says Brooker, "but we were able to back it up with data from our interviews."
In October, Team Dyesol made a mid-point presentation to their advisor Peter Cowen, UCLA Anderson faculty, GAP staff and several former GAP students. They received helpful input and realized they needed to provide Dyesol with data and insight to develop an alternative plan. "We did a lot of research on the U.S. real estate market and made projections to show where there might be opportunities for solar energy production in the future," said Brooker.
In December, the team met frequently to sharpen their final presentation. The opening presenter would be Steve Goodwillie who had background as a speaker and entertainer. His teammates prepared slides and organized data so it could be easily referenced.
Team Dyesol was scheduled early on the day of GAP final presentations. In the audience was their client, Dyesol Founder and Managing Director Sylvia Tulloch along with a panel of solar energy experts. Goodwillie started the presentation and made the team's primary recommendation. Each member of the team had an opportunity to present background research. The presentation prompted questions and comments from the panel, followed by applause from the audience.
"As opposed to just taking a test in a normal class," said Booker, "I feel like we gave a hard product to somebody who can use it. It was a good feeling. I think the most important thing that Dyesol got out of this was publicity because, in going to the trade shows, we found that people who should have known about the company - didn't. We talked to over 200 industry experts and now they know about Dyesol whether they become customers or not."
Brooker feels that the GAP program distinguishes UCLA Anderson's FEMBA Program from other schools. "It can be a life-changing experience because it exposes you to all aspects of business," he said. "One member of our team, who is an engineer, was very uncomfortable in the beginning of the project. By the end, he could talk like a salesman."


text: Please use this form to submit descriptions of lost items. If your item(s) is/are found, you will be contacted by our office to arrange shipping. Please let us know the most convenient way you can be contacted. All items will be shipped to you COD through the United States Postal Service. We do thank you in advance for your patience and understanding. Due to the volume of requests received, we may not be able to return correspondence unless we actually find your item(s).


text:
Warm Up America!
Do you like to knit or crochet or would like to learn? Spend time with ladies in Warm Up America! The Orrville group meets the first and third Thursday of each month at the library to share the fun of creating afghans, mittens, and scarves. The items are then given to local service organizations to distribute to local families in need. New volunteers are always welcome.
Don't have time to knit or crochet? Donations of yarn are always needed. Yarn donations can be dropped off at the library during normal business hours.


text:
Nahum 1:1-15 . JEHOVAH'S ATTRIBUTES AS A JEALOUS JUDGE OF SIN, YET MERCIFUL TO HIS TRUSTING PEOPLE, SHOULD INSPIRE THEM WITH CONFIDENCE. HE WILL NOT ALLOW THE ASSYRIANS AGAIN TO ASSAIL THEM, BUT WILL DESTROY THE FOE.
1. burden of Nineveh--the prophetic doom of Nineveh. Nahum prophesied against that city a hundred fifty years after Jonah.
2. jealous--In this there is sternness, yet tender affection. We are jealous only of those we love: a husband, of a wife; a king, of his subjects' loyalty. God is jealous of men because He loves them. God will not bear a rival in His claims on them. His burning jealousy for His own wounded honor and their love, as much as His justice, accounts for all His fearful judgments: the flood, the destruction of Jerusalem, that of Nineveh. His jealousy will not admit of His friends being oppressed, and their enemies flourishing (compare Exodus 20:5 , 1 Corinthians 16:22 , 2 Corinthians 11:2 ). Burning zeal enters into the idea in "jealous" here (compare Numbers 25:11 Numbers 25:13 , 1 Kings 19:10 ).
the Lord revengeth . . . Lord revengeth--The repetition of the incommunicable name JEHOVAH, and of His revenging, gives an awful solemnity to the introduction.
furious--literally, "a master of fury." So a master of the tongue, that is, "eloquent." "One who, if He pleases, can most readily give effect to His fury" [GROTIUS]. Nahum has in view the provocation to fury given to God by the Assyrians, after having carried away the ten tribes, now proceeding to invade Judea under Hezekiah.
reserveth wrath for his enemies--reserves it against His own appointed time ( 2 Peter 2:9 ). After long waiting for their repentance in vain, at length punishing them. A wrong estimate of Jehovah is formed from His suspending punishment: it is not that He is insensible or dilatory, but He reserves wrath for His own fit time. In the case of the penitent, He does not reserve or retain His anger ( Psalms 103:9 , Jeremiah 3:5 Jeremiah 3:12 , Micah 7:18 ).
3. slow to anger, and great in power--that is, but great in power, so as to be able in a moment, if He pleases, to destroy the wicked. His long-suffering is not from want of power to punish ( Exodus 34:6 Exodus 34:7 ).
not at all acquit--literally, "will not acquitting acquit," or treat as innocent.
Lord hath his way in the whirlwind--From this to Nahum 1:5 , inclusive, is a description of His power exhibited in the phenomena of nature, especially when He is wroth. His vengeance shall sweep away the Assyrian foe like a whirlwind ( Proverbs 10:25 ).
clouds are the dust of his feet--Large as they are, He treads on them, as a man would on the small dust; He is Lord of the clouds, and uses them as He pleases.
4. rebuketh the sea--as Jesus did ( Matthew 8:26 ), proving Himself God (compare Isaiah 50:2 ).
Bashan languisheth--through drought; ordinarily it was a region famed for its rich pasturage (compare Joel 1:10 ).
flower of Lebanon--its bloom; all that blooms so luxuriantly on Lebanon ( Hosea 14:7 ). As Bashan was famed for its pastures, Carmel for its corn fields and vineyards, so Lebanon for its forests ( Isaiah 33:9 ). There is nothing in the world so blooming that God cannot change it when He is wroth.
5. earth is burned--so GROTIUS. Rather, "lifts itself," that is, "heaveth" [MAURER]: as the Hebrew is translated in Psalms 89:9 , Hosea 13:1 ; compare 2 Samuel 5:21 , Margin.
6. fury is poured out like fire--like the liquid fire poured out of volcanoes in all directions (see Jeremiah 7:20 ).
rocks are thrown down--or, "are burnt asunder"; the usual effect of volcanic fire ( Jeremiah 51:25 Jeremiah 51:56 ). As Hannibal burst asunder the Alpine rocks by fire to make a passage for his army [GROTIUS].
7. Here Nahum enters on his special subject, for which the previous verses have prepared the way, namely, to assure his people of safety in Jehovah under the impending attack of Sennacherib ( Nahum 1:7 ), and to announce the doom of Nineveh, the capital of the Assyrian foe ( Nahum 1:8 ). The contrast of Nahum 1:7 Nahum 1:8 heightens the force.
he knoweth--recognizes as His own ( Hosea 13:5 , Amos 3:2 ); and so, cares for and guards ( Psalms 1:6 , 2 Timothy 2:19 ).
8. with an overrunning flood--that is, with irresistible might which overruns every barrier like a flood. This image is often applied to overwhelming armies of invaders. Also of calamity in general ( Psalms 32:6 , 42:7 , 90:5 ). There is, perhaps, a special allusion to the mode of Nineveh's capture by the Medo-Babylonian army; namely, through a flood in the river which broke down the wall twenty furlongs Isaiah 8:8 , Daniel 9:26 , Daniel 11:10 Daniel 11:22 Daniel 11:40 ).
end of the place thereof--Nineveh is personified as a queen; and "her place" of residence (the Hebrew for "thereof" is feminine) is the city itself ( Nahum 2:8 ), [MAURER]. Or, He shall so utterly destroy Nineveh that its place cannot be found; Nahum 3:17 confirms this (compare Psalms 37:36 , Daniel 2:35 , Revelation 12:8 , 20:11 ).
darkness--the severest calamities.
9. What do ye imagine against the Lord?--abrupt address to the Assyrians. How mad is your attempt, O Assyrians, to resist so powerful a God! What can ye do against such an adversary, successful though ye have been against all other adversaries? Ye imagine ye have to do merely with mortals and with a weak people, and that so you will gain an easy victory; but you have to encounter God, the protector of His people. Parallel to Isaiah 37:23-29 ; compare Psalms 1:1 .
he will make an utter end--The utter overthrow of Sennacherib's host, soon about to take place, is an earnest of the "utter end" of Nineveh itself.
affliction shall not rise up the second time--Judah's "affliction" caused by the invasion shall never rise again. So Nahum 1:12 . But CALVIN takes the "affliction" to be that of Assyria: "There will be no need of His inflicting on you a second blow: He will make an utter end of you once for all" ( 1 Samuel 3:12 , 26:8 , 2 Samuel 20:10 ). If so, this verse, in contrast to Nahum 1:12 , will express, Affliction shall visit the Assyrian no more, in a sense very different from that in which God will afflict Judah no more. In the Assyrian's case, because the blow will be fatally final; the latter, because God will make lasting blessedness in Judah's case succeed temporary chastisement. But it seems simpler to refer "affliction" here, as in Nahum 1:12 , to Judah; indeed destruction, rather than affliction, applies to the Assyrian.
10. while they are folden together as thorns--literally, "to the same degree as thorns" (compare 1 Chronicles 4:27 , Margin). As thorns, so folded together and entangled that they cannot be loosed asunder without trouble, are thrown by the husbandmen all in a mass into the fire, so the Assyrians shall all be given together to destruction. Compare 2 Samuel 23:6 2 Samuel 23:7 , where also "thorns" are the image of the wicked. As this image represents the speediness of their destruction in a mass, so that of "drunkards," their rushing as it were of their own accord into it; for drunkards fall down without any one pushing them [KIMCHI]. CALVIN explains, Although ye be dangerous to touch as thorns (that is, full of rage and violence), yet the Lord can easily consume you. But "although" will hardly apply to the next clause. English Version and KIMCHI, therefore, are to be preferred. The comparison to drunkards is appropriate. For drunkards, though exulting and bold, are weak and easily thrown down by even a finger touching them. So the insolent self-confidence of the Assyrians shall precipitate their overthrow by God. The Hebrew is "soaked," or "drunken as with their own wine." Their drunken revelries are perhaps alluded to, during which the foe (according to DIODORUS SICULUS [2]) broke into their city, and Sardanapalus burned his palace; though the main and ultimate destruction of Nineveh referred to by Nahum was long subsequent to that under Sardanapalus.
11. The cause of Nineveh's overthrow: Sennacherib's plots against Judah.
come out of thee--O Nineveh. From thyself shall arise the source of thy own ruin. Thou shalt have only thyself to blame for it.
imagineth evil--Sennacherib carried out the imaginations of his countrymen ( Nahum 1:9 ) against the Lord and His people ( 2 Kings 19:22 2 Kings 19:23 ).
a wicked counsellor--literally, "a counsellor of Belial." Belial means "without profit," worthless, and so bad ( 1 Samuel 25:25 , 2 Corinthians 6:15 ).
12-14. The same truths repeated as in Nahum 1:9-11 , Jehovah here being the speaker. He addresses Judah, prophesying good to it, and evil to the Assyrian.
Though they be quiet--that is, without fear, and tranquilly secure. So Chaldee and CALVIN. Or, "entire," "complete"; "Though their power be unbroken [MAURER], and though they be so many, yet even so they shall be cut down" (literally, "shorn"; as hair shaved off closely by a razor, Isaiah 7:20 ). As the Assyrian was a razor shaving others, so shall he be shaven himself. Retribution in kind. In the height of their pride and power, they shall be clean cut off. The same Hebrew stands for "likewise" and "yet thus." So many as they are, so many shall they perish.
when he shall pass through--or, "and he shall pass away," namely, "the wicked counsellor" ( Nahum 1:11 ), Sennacherib. The change of number to the singular distinguishes him from his host. They shall be cut down, he shall pass away home ( 2 Kings 19:35 2 Kings 19:36 ) [HENDERSON]. English Version is better, "they shall be cut down, "when" He (Jehovah) shall pass through," destroying by one stroke the Assyrian host. This gives the reason why they with all their numbers and power are to be so utterly cut off. Compare "pass through," that is, in destroying power ( Ezekiel 12:12 Ezekiel 12:23 , Isaiah 8:8 , Daniel 11:10 ).
Though I have afflicted thee--Judah, "I will afflict thee no more" ( Isaiah 40:1 Isaiah 40:2 , Isaiah 52:1 Isaiah 52:2 ). The contrast is between "they," the Assyrians, and "thee," Judah. Their punishment is fatal and final. Judah's was temporary and corrective.
13. will I break his yoke--the Assyrian's yoke, namely, the tribute imposed by Sennacherib on Hezekiah ( 2 Kings 18:14 ).
from off thee--O Judah ( Isaiah 10:27 ).
14. that no more of thy name be sown--that no more of thy seed, bearing thy name, as kings of Nineveh, be propagated; that thy dynasty become extinct, namely, on the destruction of Nineveh here foretold; "thee" means the king of Assyria.
will I cut off . . . graven image--The Medes under Cyaxares, the joint destroyers of Nineveh with the Babylonians, hated idolatry, and would delight in destroying its idols. As the Assyrians had treated the gods of other nations, so their own should be treated ( 2 Kings 19:18 ). The Assyrian palaces partook of a sacred character [LAYARD]; so that "house of thy gods" may refer to the palace. At Khorsabad there is remaining a representation of a man cutting an idol to pieces.
I will make thy grave--rather, "I will make it (namely, 'the house of thy gods,' that is, 'Nisroch') thy grave" ( 2 Kings 19:37 , Isaiah 37:38 ). Thus, by Sennacherib's being slain in it, Nisroch's house should be defiled. Neither thy gods, nor thy temple, shall save thee; but the latter shall be thy sepulchre.
thou art vile--or, thou art lighter than due weight ( Daniel 5:27 ; compare Job 31:6 ) [MAURER].
15. This verse is joined in the Hebrew text to the second chapter. It is nearly the same as Isaiah 52:7 , referring to the similar deliverance from Babylon.
him that bringeth good tidings--announcing the overthrow of Sennacherib and deliverance of Jerusalem. The "mountains" are those round Jerusalem, on which Sennacherib's host had so lately encamped, preventing Judah from keeping her "feasts," but on which messengers now speed to Jerusalem, publishing his overthrow with a loud voice where lately they durst not have opened their mouths. A type of the far more glorious spiritual deliverance of God's people from Satan by Messiah, heralded by ministers of the Gospel ( Romans 10:15 ).
perform thy vows--which thou didst promise if God would deliver thee from the Assyrian.
the wicked--literally, "Belial"; the same as the "counsellor of Belial" ( Nahum 1:11 , Margin); namely, Sennacherib.


text:
Composing LA
Tarik O'Regan presents the story of Western art music's place in the Golden Age of Hollywood
During the Golden age of Hollywood film, music for the movies was often written by the great European and Russian composers of the day. As a result, American cinema soundtracks of the 1930s emulated European symphonic style, with Los Angeles soon attracting composers from Stravinsky to Schoenberg. British composer Tarik O'Regan explores the appeal of LA for composers and musicians from Europe.
The programme also focuses on the success of today's composers of symphonic film scores, including the works of John Williams. With contributions from André Previn, Larry Schoenberg, conductor and composer Esa-Pekka Salonen and music writer Alex Ross, it promises to be an interesting historical and contemporary view of our audio-visual experience of films.
- Article Type: | TV and Radio |


text:
Recent Posts
- Barb on Fall in Central Park – original watercolor painting
- Maleah Georgen on Fall in Central Park – original watercolor painting
Tag Archives: lian zhen
Painting Lesson of Koi and Goldfish, by Lian Zhen
I have always loved Chinese style painting and one of the masters is artist Lian Quan Zhan. He has a talent for blending East and West styles and the results are beautiful. Lian Zhen is offering this watercolor painting lesson … Continue reading
Posted in Painting Techniques and Lessons Tagged artist, chinese, demo, demonstrations, demos, fish, goldfish, koi, lesson, lessons, lian zhen, negative painting, painting, pond, water, watercolor Leave a comment


text:
"Fold3 provides convenient access to US military records, including the stories, photos, and personal documents of the men and women who served. The Fold3 name comes from a traditional flag folding ceremony in which the third fold is made in honor and remembrance of veterans who served in defense of their country and to maintain peace throughout the world. Original records at Fold3 help you discover and share stories about these everyday heroes, forgotten soldiers, and the families that supported them. On Fold3, you can combine records found on the site with what you have in your own albums and shoeboxes to create an online memorial for someone who served."
Write it on your communicator: Fold3.


text:
Video of BottleRocket's The Flash hits the net
After the break is a video for the canceled superhero game, The Flash game. It's the one BottleRocket was making before its publisher, Brash, hit the skids. The footage you will see is just six months worth of work, and there was still at the least a year to go on it. Too bad, really, […]
Bottlerocket headlines
Namco pulled Splatterhouse off Bottlerocket because of "performance issues"
Namco pulled the Splatterhouse-plug on Bottlerocket due to "performance issues," the company said today. Namco Bandai bossman Makoto Iwai told Gamasutra: "The only reason why publishers pull the project out from the developer is when the developer isn't really meeting the requirements, " he said. "So, unfortunately, this was the case. "I have to be […]
New Splatterhouse images posted
On Gamespot. There's only two of them, but that's better than none, right? Take a look.
First Splatterhouse trailer released
Not much to see here, but at least we know it's not going to be pleasant. The game involves a hockey mask, pulling people in half and some silly bint called Jennifer that needs "saving," or somesuch. After the break. No date.
New Splatterhouse shots look jumpy, messy
This could be awesome. IGN's posted some new screens of upcoming horror remake Splatterhouse, showing jumping, making heads explode and what looks like two side-kick dog things. It's not out until next year, but artwork of a huge man with an oversized arm covered in bodily fluid up the elbow pretty much does it for […]
New Splatterhouse image shown
1up's posted a new image of the main model from the newly-revealed Splatterhouse update. not much more to say, really, other than BottleRocket's now been confirmed as the developer and you can see more in the next issue of EGM.


text:
Streamline your systems and improve your employee experience through cloud payroll.
On this page:
Our in-house experts provide a range of HR & Payroll services to alleviate the administrative burden on your team.
Integrate your HCM solutions and enable two-way data flow with our enterprise integration.
Keep your HR outsourcing services in safe hands by leveraging Ascender's Business Partner certification
Our Global Payroll Partnership with Workday ensures your systems talk to each other with ease.
Our customers can receive up to date Payroll advice from Australia's most experienced industry association.
Our Workforce Management partnerships ensure we can deliver you best-of- breed HR systems that are seamlessly integrated.
See how our clients are getting the most from their employees through our payroll management and HR solutions.
Leverage our in depth research to enhance your digital HR experiences.
Access thought-provoking articles on the world of Payroll and HR.
Our commitment to putting your people first and enabling their prosperity is why so many organisations trust us with their payroll and learning solutions.
Get to know our executive leadership team.
Join an organisation who puts the passion into providing and is leading the charge on change.
See what Ascender has been up to in the news and more.
Leave your details and we will have one of our local experts contact you.
Home > Thank You For Applying
Thank you for your application. One of our team will be in contact with you shortly. In the meantime, feel free to browse our resources.
Subscribe to our Payroll & HCM Insights
Read press release


text:
Caterpillar (track) by Unwound
Caterpillar appears on the following album(s) by Unwound:Kid Is Gone (this album) (compilation) (2013), A Single History 1991-1997 (compilation) (1999).
|Product Details
|All Tomorrow's Parties 1.1 CD Sonic Youth Unwound Cat Power
Condition: Very Good
|Time left:
27d 1h 41m 19s
Ships to:
Go to store
|Product prices and availability are accurate as of the date indicated and are subject to change. Any price and availability information displayed on the linked website at the time of purchase will apply to the purchase of this product. See full search results on eBay
Listen to Caterpillar on YouTube
Loading content from YouTube...
Caterpillar ratingsNot enough data Average Rating = (n ÷ (n + m)) × av + (m ÷ (n + m)) × AV
av = trimmed mean average rating an item has currently received.
n = number of ratings an item has currently received.
m = minimum number of ratings required for an item to appear in a 'top-rated' chart (currently 10).
AV = the site mean average rating.
Please log in or register if you want to be able to leave a rating.
Caterpillar comments
Be the first to add a comment for this track - add your comment!
Please log in or register if you want to be able to add a comment.
Your feedback for CaterpillarLet us know what you think of this track by adding a comment or assigning a rating below!