US5537424A — Matched spectral null codes with partitioned syst…

Claim 1

Independent Claim 101 words

A method for detecting spectral null sequences of a spectrally-constrained code, comprising the steps of: using an encoder, generating the spectral null sequences from digital electrical signals representing unencoded input data; transmitting the sequences from the encoder to a partial response channel subject to noise; and transmitting the sequences from the channel to a Viterbi detector having a detector trellis structure derived from a running-digital-sum (RDS) trellis structure that is made time-varying by partitioning a set of quasicatastrophic sequences generated by a canonical spectral null trellis into disjoint subsets, each of which subsets is assigned to a unique initial RDS state.

Claim 2

Independent Claim 101 words

A method for detecting spectral null sequences of a spectrally-constrained code, comprising the steps of: using an encoder, generating the spectral null sequences from digital electrical signals representing unencoded input data; transmitting the sequences from the encoder to a partial response channel subject to noise; and transmitting the sequences from the channel to a Viterbi detector having a detector trellis structure derived from a running-digital-sum (RDS) trellis structure that is made time-varying by partitioning a set of quasicatastrophic sequences generated by a canonical spectral null trellis into disjoint subsets, each of which subsets is assigned to a unique initial RDS state.

Claim 3

Dependent Claim 48 words

The method of claim 1, including the steps of: generating codewords of the spectrally-constrained code from an initial RDS value; and constraining said codewords to assume, at an end and at least one prespecified interior location in each codeword, permissible RDS values prescribed by the initial RDS value.

Claim 4

Dependent Claim 124 words

The method of claim 1, including the steps of: deleting predetermined edges from the time-varying trellis structure at preselected times corresponding to at least one prespecified location within each codeword to provide a modified trellis structure, each said edge terminating in a state corresponding to one of a preselected subset of permissible RDS values; vertically compressing states and edges remaining in the modified trellis structure; providing an auxiliary trellis structure representing sequences deleted from the time-varying trellis structure; recursively computing survivor sequences and survivor metrics in the auxiliary trellis structure and modified trellis structure; and transferring the survivor sequences and survivor metrics from the auxiliary trellis structure to the modified trellis structure at said preselected times for states corresponding to said permissible RDS values.

Claim 5

Dependent Claim 18 words

The method of claim 1, including the step of providing a systolic structure as the detector trellis structure.

Claim 6

Dependent Claim 32 words

The method of claim 4, including the step of assigning to add-compare-select (ACS) units detector states rotated cyclically by an amount determined by codeword length and number of permissible RDS trellis states.

Claim 7

Dependent Claim 34 words

The method of claim 5, wherein said amount is an integer equal to the quotient obtained by dividing the number of RDS trellis states by a number that is divisible into the codeword length.

Claim 8

Dependent Claim 29 words

The method of claim 5, wherein the codeword length is 10, the number of permissible RDS trellis states is 6, and the detector states are rotated cyclically by 3.

Claim 9

Dependent Claim 155 words

In a method for improving reliability of a data storage device that transmits binary data as codewords over a partial response channel, the steps of: encoding from the binary data a spectral-null trellis code that constrains codewords generated from an initial running digital sym (RDS) value to assume, at the end and also at at least one prespecified location within the codewords, subsets of permissible RDS values prescribed by the initial RDS value; and transmitting spectral null sequences from the channel to a Viterbi detector having a detector trellis structure derived from RDS trellis structured by (i) replicating preselected sets of RDS states and edges over a predetermined time period less than a full trellis period to form subtrellises from one portion of a main trellis, and (ii) connecting, at the end of said time period, an identical subset of states of each subtrellis with identical states of a remaining portion of the main trellis.

Claim 10

Dependent Claim 155 words

In a method for improving reliability of a data storage device that transmits binary data as codewords over a partial response channel, the steps of: encoding from the binary data a spectral-null trellis code that constrains codewords generated from an initial running digital sym (RDS) value to assume, at the end and also at at least one prespecified location within the codewords, subsets of permissible RDS values prescribed by the initial RDS value; and transmitting spectral null sequences from the channel to a Viterbi detector having a detector trellis structure derived from RDS trellis structured by (i) replicating preselected sets of RDS states and edges over a predetermined time period less than a full trellis period to form subtrellises from one portion of a main trellis, and (ii) connecting, at the end of said time period, an identical subset of states of each subtrellis with identical states of a remaining portion of the main trellis.

Claim 11

Dependent Claim 66 words

The method of claim 8, including the steps of: deleting predetermined edges from the time-varying trellis structure at preselected times corresponding to at least one prespecified location within each codeword to provide a modified trellis structure, each said edge terminating in a state corresponding to one of a preselected subset of permissible RDS values; and vertically compressing states and edges remaining in the modified trellis structure.

Claim 12

Dependent Claim 68 words

The method of claim 9, including the steps of: providing an auxiliary trellis structure representing sequences deleted from the time-varying trellis structure; recursively computing survivor sequences and survivor metrics in the auxiliary trellis structure and modified trellis structure; and transferring the survivor sequences and survivor metrics from the auxiliary trellis structure to the modified trellis structure at said preselected times for states corresponding to said permissible RDS values.

Claim 13

Independent Claim 128 words

A method for detecting spectral null sequences of a spectrally-constrained code, comprising the steps of: using an encoder, generating the spectral null sequences from digital electrical signals representing unencoded input data; transmitting the sequences from the encoder to a partial response channel subject to noise; and transmitting the sequences from the channel to a Viterbi detector having a detector trellis structure derived from a running-digital-sum (RDS) trellis structure by (i) replicating preselected sets of RDS states and edges over a predetermined time period less than a full trellis period to form subtrellises from one portion of a main trellis, and (ii) connecting, at the end of said time period, an identical subset of states of each subtrellis with identical states of a remaining portion of the main trellis.

Claim 14

Independent Claim 128 words

A method for detecting spectral null sequences of a spectrally-constrained code, comprising the steps of: using an encoder, generating the spectral null sequences from digital electrical signals representing unencoded input data; transmitting the sequences from the encoder to a partial response channel subject to noise; and transmitting the sequences from the channel to a Viterbi detector having a detector trellis structure derived from a running-digital-sum (RDS) trellis structure by (i) replicating preselected sets of RDS states and edges over a predetermined time period less than a full trellis period to form subtrellises from one portion of a main trellis, and (ii) connecting, at the end of said time period, an identical subset of states of each subtrellis with identical states of a remaining portion of the main trellis.

Claim 15

Dependent Claim 86 words

The method of claim 11, including the steps of: deleting predetermined edges from the time-varying trellis structure and vertically compressing said structure to create a modified trellis structure; and transferring survivor sequences and survivor metrics from an auxiliary trellis structure to the modified trellis structure as a substitute for those corresponding to the deleted edges at preselected times corresponding to at least one prespecified location within each codeword, each said edge terminating in a state corresponding to one of a preselected subset of permissible RDS values.

Claim 16

Independent Claim 104 words

An apparatus for transmitting sequences of codewords of a spectrally-constrained code over a partial response channel, comprising: an encoder for generating the codewords from digital electrical signals representing unencoded input data and transmitting said codewords to the channel; and a Viterbi detector that receives output words generated by the channel from the transmitted codewords and has a time-varying detector trellis structure derived from a running-digital-sum (RDS) trellis structure in which a set of quasicatastrophic sequences generated by a canonical spectral null trellis is partitioned into disjoint subsets, each of which subsets is assigned to a unique initial RDS state that renders said sequences noncatastrophic.

Claim 17

Independent Claim 104 words

An apparatus for transmitting sequences of codewords of a spectrally-constrained code over a partial response channel, comprising: an encoder for generating the codewords from digital electrical signals representing unencoded input data and transmitting said codewords to the channel; and a Viterbi detector that receives output words generated by the channel from the transmitted codewords and has a time-varying detector trellis structure derived from a running-digital-sum (RDS) trellis structure in which a set of quasicatastrophic sequences generated by a canonical spectral null trellis is partitioned into disjoint subsets, each of which subsets is assigned to a unique initial RDS state that renders said sequences noncatastrophic.

Claim 18

Dependent Claim 35 words

The apparatus of claim 13, wherein said encoder constrains said codewords to assume, at an end and at least one prespecified interior location in each codeword, permissible RDS values prescribed by an initial RDS value.

Claim 19

Dependent Claim 47 words

The apparatus of claim 13, wherein: (i) an auxiliary trellis structure represents sequences deleted from the time-varying trellis structure and the auxiliary trellis structure comprises two complementary substructures, and (ii) the detector comprises a branch metric unit that recursively computes survivor metrics for the two complementary substructures.

Claim 20

Dependent Claim 14 words

The apparatus of claim 13, wherein the Viterbi detector has a systolic trellis structure.

Claim 21

Dependent Claim 54 words

The apparatus of claim 13, wherein the Viterbi detector includes: (i) a plurality of add-compare-select (ACS) units with fixed-branch metric inputs; and (ii) means for selectively assigning, in a preselected cyclical manner, different detector states to each of said ACS units during successive stages to reduce the number of interconnections between respective ACS units.

Claim 22

Dependent Claim 106 words

The apparatus of claim 13, wherein the detector comprises: a local survivor memory unit (LSMU) having a number of shift registers equal to the maximum number of RDS values in the time-varying trellis structure, each shift register having the length of one codeword; and a global survivor memory unit (GSMU) connected to the LSMU and comprising a plurality of shift registers, each having a length of one codeword and containing a respective estimated survivor codeword, the shift registers of the GSMU being arranged in sets of x shift registers, where x is equal to the number of beginning and ending states of the time-varying trellis structure.

Claim 23

Dependent Claim 78 words

The apparatus of claim 13, wherein the encoder divides the input data into subsequences of input data words having a preselected length ratio to subsequences of codewords in a configuration of concatenated subsets of sequences with prespecified RDS values to constrain said codewords to assume, at an end and at least one prespecified interior location in each codeword, permissible RDS values prescribed by an initial RDS value and simplify mapping between sets of input data words and codewords.

Claim 24

Dependent Claim 19 words

The apparatus of claim 19, wherein each input data word and each codeword comprises two subsequences of equal length.

Claim 25

Dependent Claim 25 words

The apparatus of claim 19, wherein the encoder divides each set of input data words into subsets with preselected Hamming weights of equal length subsequences.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1999-07-16	2000-01-15	2000-07-16	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2003-07-16	2004-01-15	2004-07-16	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2007-07-16	2008-01-15	2008-07-16	$7700.00	Window Closed / Lapsed

Matched spectral null codes with partitioned systolic trellis structures

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag