Patent US5544178A successfully refreshed from Google Patents.
US5544178A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for encoding data in a PRML class-IV digital communication channel
Assignee: Cirrus Logic Inc
•
Filing: 1994-06-10
•
Granted: 1996-08-06
•
Expires: 2014-06-10
Abstract
Abstract A method and apparatus for encoding, detecting and decoding data in a Partial Response (PR) class-IV magnetic recording storage system that does not require the conventional interleave constraint and therefore minimizes the path memory and latency of a sequence detector such as the Maximum Likelihood (ML) Viterbi detector. Rather than encoding an interleave constraint to ensure merging of path memories, in the detector, the parity of the encoded codewords is utilized in selecting the correct sequence out of the unmerged paths. The encoding technique encodes the data using two groups of codewords: the first group causes the path memories of the sequence detector to merge into one survivor sequence, and the second group causes the path memories to merge into two survivor sequences different in only one bit and thus different in parity. The correct survivor sequence is thereby selected according to the parity of the codeword being detected. Parity is determined during the encoding process such that codewords from the second group follow codewords with even or odd parity. By looking ahead to the following codeword during the detection process, the parity of the current codeword being detected is determined and the correct survivor sequence selected. Further, the encoding technique provides the ability to correct for certain errors in the detected sequence when a "1" bit is erased due to noise in the system.
Inventors
- 👤 Christopher P. Zook
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 11:09
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/63; H03M13/6343; G; G11; G11B; G11B20/00; G11B20/10; G11B20/10009; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426; H03M13/03; H03M13/23; H03M13/235; H03M13/27; H03M13/2782; H03M13/37; H03M13/39; H03M13/41; H03M13/65; H03M13/6502; H03M13/6505; G11B2020/1434
Claims Analysis
Total Claims: 54
Claim 1
Independent Claim
244 words
An apparatus for encoding an input stream of binary data into an output stream of binary codewords, comprising: (a) a receiver connected to receive the input stream of binary data; (b) an encoder means, connected to the receiver, for encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits, said encoder generating the output stream of binary codewords; and (c) a parity means for generating a parity signal having two states, active and inactive, connected to receive the codewords from the encoder, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least one "1" bit in both interleaves within a predetermined first N bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and zero "1" bits in the other interleave within the first N bit positions of the codeword.
Claim 2
Independent Claim
244 words
An apparatus for encoding an input stream of binary data into an output stream of binary codewords, comprising: (a) a receiver connected to receive the input stream of binary data; (b) an encoder means, connected to the receiver, for encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits, said encoder generating the output stream of binary codewords; and (c) a parity means for generating a parity signal having two states, active and inactive, connected to receive the codewords from the encoder, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least one "1" bit in both interleaves within a predetermined first N bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and zero "1" bits in the other interleave within the first N bit positions of the codeword.
Claim 3
Dependent Claim
18 words
The apparatus as recited in claim 1, wherein j is 8, k is 9, and N is 3.
Claim 4
Dependent Claim
133 words
The apparatus as recited in claim 1, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 5
Dependent Claim
159 words
The apparatus as recited in claim 1, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is in the active state; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is in the inactive state.
Claim 6
Independent Claim
247 words
An apparatus for encoding an input stream of binary data into an output stream of binary codewords, comprising; (a) a receiver connected to receive the input stream of binary data; (b) an encoder means, connected to the receiver, for encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits, said encoder generating the output stream of binary codewords; and (c) a parity means for generating a parity signal having two states, active and inactive, connected to receive the codewords from the encoder, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least two "1" bits in both interleaves within a predetermined first M bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and less than two "1" bits in the other interleave within a predetermined first M bit positions of the codeword.
Claim 7
Independent Claim
247 words
An apparatus for encoding an input stream of binary data into an output stream of binary codewords, comprising; (a) a receiver connected to receive the input stream of binary data; (b) an encoder means, connected to the receiver, for encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits, said encoder generating the output stream of binary codewords; and (c) a parity means for generating a parity signal having two states, active and inactive, connected to receive the codewords from the encoder, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least two "1" bits in both interleaves within a predetermined first M bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and less than two "1" bits in the other interleave within a predetermined first M bit positions of the codeword.
Claim 8
Dependent Claim
18 words
The apparatus as recited in claim 5, wherein j is 8, k is 9, and M is 9.
Claim 9
Dependent Claim
137 words
The apparatus as recited in claim 5, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and less than two "1" bits in the odd interleave within the first M bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and less than two "1" bits in the even interleave within the first M bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 10
Independent Claim
230 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; an (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises four path memories; (c) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 11
Independent Claim
230 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; an (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises four path memories; (c) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 12
Dependent Claim
18 words
The apparatus as recited in claim 8, wherein j is 8, k is 9, and N is 3.
Claim 13
Dependent Claim
133 words
The apparatus as recited in claim 8, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 14
Dependent Claim
153 words
The apparatus as recited in claim 8, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is active; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is inactive.
Claim 15
Independent Claim
262 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; (c) the two path memories of the first and second sequence detector merge into a first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 16
Independent Claim
262 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; (c) the two path memories of the first and second sequence detector merge into a first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 17
Dependent Claim
18 words
The apparatus as recited in claim 12, wherein j is 8, k is 9, and N is 3.
Claim 18
Dependent Claim
133 words
The apparatus as recited in claim 12, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 19
Dependent Claim
153 words
The apparatus as recited in claim 12, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is active; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is inactive.
Claim 20
Independent Claim
250 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the sequence detector comprises four path memories; and (b) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 21
Independent Claim
250 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the sequence detector comprises four path memories; and (b) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 22
Dependent Claim
18 words
The apparatus as recited in claim 16, wherein j is 8, k is 9, and M is 9.
Claim 23
Dependent Claim
137 words
The apparatus as recited in claim 16, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and less than two "1" bits in the odd interleave within the first M bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and less than two "1" bits in the even interleave within the first M bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 24
Independent Claim
325 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the binary data stream comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the binary data stream and the even interleave consisting of even bit positions of the binary data stream; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; and (c) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the two path memories of both sequence detectors merge into a corresponding first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the two path memories of one of the sequence detectors do not merge into the corresponding survivor sequence after the sequence detectors process the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 25
Independent Claim
325 words
An apparatus for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said apparatus for encoding comprising: (a) an encoder for encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits, said encoder generating the stream of binary codewords; and (b) a parity generator for generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated by the encoder, said encoder utilizing the parity signal for encoding the stream of binary data into the codewords, wherein: (a) the binary data stream comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the binary data stream and the even interleave consisting of even bit positions of the binary data stream; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; and (c) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the two path memories of both sequence detectors merge into a corresponding first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the two path memories of one of the sequence detectors do not merge into the corresponding survivor sequence after the sequence detectors process the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 26
Dependent Claim
18 words
The apparatus as recited in claim 19, wherein j is 8, k is 9, and M is 9.
Claim 27
Dependent Claim
59 words
The apparatus as recited in claim 19, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (c) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 28
Independent Claim
217 words
A method for encoding an input stream of binary data into an output stream of binary codewords, comprising the steps of: (a) receiving the input stream of binary data; (b) encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits; and (c) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (b), said encoding in step (b) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least one "1" bit in both interleaves within a predetermined first N bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and zero "1" bits in the other interleave within the first N bit positions of the codeword.
Claim 29
Independent Claim
217 words
A method for encoding an input stream of binary data into an output stream of binary codewords, comprising the steps of: (a) receiving the input stream of binary data; (b) encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits; and (c) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (b), said encoding in step (b) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least one "1" bit in both interleaves within a predetermined first N bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and zero "1" bits in the other interleave within the first N bit positions of the codeword.
Claim 30
Dependent Claim
18 words
The method as recited in claim 22, wherein j is 8, k is 9, and N is 3.
Claim 31
Dependent Claim
133 words
The method as recited in claim 22, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 32
Dependent Claim
159 words
The method as recited in claim 22, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is in the active state; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is in the inactive state.
Claim 33
Independent Claim
220 words
A method for encoding an input stream of binary data into an output stream of binary codewords, comprising the steps of: (a) receiving the input stream of binary data; (b) encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits; and (c) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (b), said encoding in step (b) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least two "1" bits in both interleaves within a predetermined first M bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and less than two "1" bits in the other interleave within a predetermined first M bit positions of the codeword.
Claim 34
Independent Claim
220 words
A method for encoding an input stream of binary data into an output stream of binary codewords, comprising the steps of: (a) receiving the input stream of binary data; (b) encoding a predetermined j number of bits from the input stream into a codeword comprising a predetermined k number of bits; and (c) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (b), said encoding in step (b) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords are selected from a first and second plurality of codewords; (b) the codewords comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the codeword and the even interleave consisting of even bit positions of the codeword; (c) the codewords out of the first plurality of codewords have at least two "1" bits in both interleaves within a predetermined first M bit positions of the codeword; and (d) the codewords out of the second plurality of codewords have at least one "1" bit in one interleave and less than two "1" bits in the other interleave within a predetermined first M bit positions of the codeword.
Claim 35
Dependent Claim
18 words
The method as recited in claim 26, wherein j is 8, k is 9, and M is 9.
Claim 36
Dependent Claim
137 words
The method as recited in claim 26, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and less than two "1" bits in the odd interleave within the first M bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and less than two "1" bits in the even interleave within the first M bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 37
Independent Claim
222 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises four path memories; (c) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 38
Independent Claim
222 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises four path memories; (c) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 39
Dependent Claim
18 words
The method as recited in claim 29, wherein j is 8, k is 9, and N is 3.
Claim 40
Dependent Claim
133 words
The method as recited in claim 29, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 41
Dependent Claim
153 words
The method as recited in claim 29, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is active; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is inactive.
Claim 42
Independent Claim
247 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; (c) the two path memories merge into a first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 43
Independent Claim
247 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the codewords generated are selected from a first and second plurality of codewords; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; (c) the two path memories merge into a first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first N number of bits out of the codewords selected from the first plurality of codewords; and (d) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first N number of bits out of the codewords selected from the second plurality of codewords.
Claim 44
Dependent Claim
11 words
The method as recited in claim 33, wherein N is 3.
Claim 45
Dependent Claim
133 words
The method as recited in claim 33, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and zero "1" bits in the odd interleave within the first N bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and zero "1" bits in the even interleave within the first N bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 46
Dependent Claim
153 words
The method as recited in claim 33, wherein: (a) the second plurality of codewords comprises a third, fourth, fifth, and sixth plurality of codewords; (b) the codewords out of the third plurality of codewords having a {0, 0, 1} bit sequence as the first three bits; (c) the codewords out of the fourth plurality of codewords having a {0, 1, 0} bit sequence as the first three bits; (d) the codewords out of the fifth plurality of codewords having a {1, 0, 0} bit sequence as the first three bits; (e) the codewords out of the sixth plurality of codewords having a {1, 0, 1} bit sequence as the first three bits; (f) the encoder generates codewords out of the third and fourth plurality of codewords if the parity signal is active; and (g) the encoder generates codewords out of the fifth and sixth plurality of codewords if the parity signal is inactive.
Claim 47
Independent Claim
242 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the sequence detector comprises four path memories; and (b) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 48
Independent Claim
242 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding the input stream of binary data into the codewords, wherein: (a) the sequence detector comprises four path memories; and (b) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the four path memories merge into a single survivor sequence comprising at least k bits after the sequence detector processes a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) the four path memories merge into two survivor sequences comprising at least k bits each and different in only one bit after the sequence detector processes the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 49
Dependent Claim
18 words
The method as recited in claim 37, wherein j is 8, k is 9, and M is 9.
Claim 50
Dependent Claim
137 words
The method as recited in claim 37, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and less than two "1" bits in the odd interleave within the first M bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and less than two "1" bits in the even interleave within the first M bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
Claim 51
Independent Claim
313 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding a the input stream of binary data into the codewords, wherein: (a) the binary data stream comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the binary data stream and the even interleave consisting of even bit positions of the binary data stream; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; and (c) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the two path memories of both sequence detectors merge into a corresponding first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 52
Independent Claim
313 words
A method for encoding a stream of binary data into a stream of binary codewords utilized in PRML communication channels, said PRML communication channel comprising at least one sequence detector, said method for encoding comprising the steps of: (a) encoding a predetermined j number of bits from the data stream of binary data into a codeword comprising a predetermined k number of bits; and (b) generating a parity signal having two states, active and inactive, responsive to the number of "1" bits in at least part of at least one codeword generated in step (a), said encoding in step (a) utilizing the parity signal for encoding a the input stream of binary data into the codewords, wherein: (a) the binary data stream comprising an even and odd interleave subsequence, the odd interleave consisting only of odd bit positions of the binary data stream and the even interleave consisting of even bit positions of the binary data stream; (b) the sequence detector comprises a first and second sliding threshold sequence detector having two path memories each, the first and second sequence detectors processing the even and odd interleaves of the binary data stream respectively; and (c) the codewords generated are selected from a first and second plurality of codewords such that when a "1" bit out of at least one of the codewords is changed to a "0": (a) the two path memories of both sequence detectors merge into a corresponding first and second survivor sequence comprising a total of at least k bits after the sequence detectors process a predetermined first M number of bits out of the codewords selected from the first plurality of codewords; and (b) one of the path memories does not merge into the corresponding survivor sequence after the sequence detectors process the first M number of bits out of the codewords selected from the second plurality of codewords.
Claim 53
Dependent Claim
18 words
The method as recited in claim 40, wherein j is 8, k is 9, and M is 9.
Claim 54
Dependent Claim
137 words
The method as recited in claim 40, wherein: (a) the second plurality of codewords comprises a third and fourth plurality of codewords; (b) the codewords out of the third plurality of codewords have at least one "1" bit in the even interleave and less than two "1" bits in the odd interleave within the first M bit positions of the codeword; (c) the codewords out of the fourth plurality of codewords have at least one "1" bit in the odd interleave and less than two "1" bits in the even interleave within the first M bit positions of the codeword; (d) the encoder generates codewords out of the third plurality of codewords if the parity signal is active; and (e) the encoder generates codewords out of the fourth plurality of codewords if the parity signal is inactive.
References Cited (Backward Citations)
US3631471A
Cited
US4413251A
Cited
US4547890A
Cited
US4617552A
Cited
US4833471A
Cited
US4707681A
Cited
US4779072A
Cited
US4786890A
Cited
US5241309A
Cited
US5196848A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-08-06 | 2000-02-05 | 2000-08-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-08-06 | 2004-02-05 | 2004-08-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-08-06 | 2008-02-05 | 2008-08-06 | $7700.00 | Window Closed / Lapsed |