Abstract: Systems and methods for transporting client data received at a first rate over an interconnect at a second, higher rate, wherein the client data is combined with dummy data according to a pattern that minimizes the amount of buffer space required to store the received client data. In one embodiment, a method comprises receiving client data at the first rate, buffering the client data, retrieving the client data, combining the client data with dummy data according to the pattern, and transmitting the combined data at the second rate. The pattern comprises K blocks, of which a first number contain P w-bytes of client data, and of which the remainder contain P+1 w-bytes of client data. The remainder of the space in the blocks is stuffed with dummy data. The pattern may also include a residual slot that contains one or more bytes of client data.

Abstract: Systems and methods for transporting client data received at a first rate over an interconnect at a second, higher rate, wherein the client data is combined with dummy data according to a pattern that minimizes the amount of buffer space required to store the received client data. In one embodiment, a method comprises receiving client data at the first rate, buffering the client data, retrieving the client data, combining the client data with dummy data according to the pattern, and transmitting the combined data at the second rate. The pattern comprises K blocks, of which a first number contain P w-bytes of client data, and of which the remainder contain P+1 w-bytes of client data. The remainder of the space in the blocks is stuffed with dummy data. The pattern may also include a residual slot that contains one or more bytes of client data.

Abstract: Systems and methods for transporting client data received at a first rate over an interconnect at a second, higher rate, wherein the client data is combined with dummy data according to a pattern that minimizes the amount of buffer space required to store the received client data. In one embodiment, a method comprises receiving client data at the first rate, buffering the client data, retrieving the client data, combining the client data with dummy data according to the pattern, and transmitting the combined data at the second rate. The pattern comprises K blocks, of which a first number contain P w-bytes of client data, and of which the remainder contain P+1 w-bytes of client data. The remainder of the space in the blocks is stuffed with dummy data. The pattern may also include a residual slot that contains one or more bytes of client data.

Abstract: Disclosed is a headerless hard drive system that includes a head-disk assembly, a servo control logic, and a format calculator. The head-disk assembly includes a set of recordable disks for storing data. Each recordable disk having a plurality of tracks with each track having a plurality of servo wedges for dividing the track into a plurality of data frames. In this arrangement, one data frame is associated with one servo wedge and the tracks do not contain any header information that uniquely identifies the data frames in the tracks. The servo control logic coupled to the head-disk assembly to process the servo wedges for generating a signal that identifies a servo wedge being processed on a track. The format calculator is configured to convert the signal that identifies the servo wedge being processed to an associated sector number on the track.

Abstract: A disk sequencer in a headerless disk drive system includes a format calculator that performs arithmetic processing on a frame number to generate frame parameters that indicate the format of a data frame associated with the frame number. The disk sequencer then uses the frame parameters to identify boundaries of data segments during a read or write. Arguments of the arithmetic processing include the frame number, static parameters that indicate fixed field sizes, and zone parameters that depend on the track. The static and zone parameters can be transferred to the disk sequencer during initialization and a seek respectively. The arithmetic processing is completed during processing of a servo sector to permit zero latency accesses. In one embodiment, the zone parameters are less than two words per zone and include a byte count for an ending partial data sector and a number of full data sectors in a first frame.

Abstract: A disk sequencer in a headerless disk drive system includes a format calculator that performs arithmetic processing on a frame number to generate frame parameters that indicate the format of a data frame associated with the frame number. The disk sequencer then uses the frame parameters to identify boundaries of data segments during a read or write. Arguments of the arithmetic processing include the frame number, static parameters that indicate fixed field sizes, and zone parameters that depend on the track. The static and zone parameters can be transferred to the disk sequencer during initialization and a seek respectively. The arithmetic processing is completed during processing of a servo sector to permit zero latency accesses. In one embodiment, the zone parameters are less than two words per zone and include a byte count for an ending partial data sector and a number of full data sectors in a first frame.

Abstract: A disk sequencer in a headerless disk drive system includes a format calculator that performs arithmetic processing on a frame number to generate frame parameters that indicate the format of a data frame associated with the frame number. The disk sequencer then uses the frame parameters to identify boundaries of data segments during a read or write. Arguments of the arithmetic processing include the frame number, static parameters that indicate fixed field sizes, and zone parameters that depend on the track. The static and zone parameters can be transferred to the disk sequencer during initialization and a seek respectively. The arithmetic processing is completed during processing of a servo sector to permit zero latency accesses. In one embodiment, the zone parameters are less than two words per zone and include a byte count for an ending partial data sector and a number of full data sectors in a first frame.