Universal modulation coding for a data channel
First Claim
1. An apparatus for implementing a universal modulation coding mechanism, the apparatus comprising:
- a storage area containing a set of state transition probabilities;
a modulation encoder configured to perform the steps ofreceiving a data sequence comprising a first number of bits,encoding the data sequence into a codeword sequence comprising a second number of bits based on the set of state transition probabilities, the second number of bits is greater than the first number of bits, andproviding the codeword sequence to a recording channel of a storage device; and
a modulation decoder configured to perform the steps ofreceiving the codeword sequence from the recording channel, anddecoding the data sequence from the codeword sequence based on the set of state transition probabilities.
3 Assignments
0 Petitions
Accused Products
Abstract
Technologies are described herein for implementing a universal modulation coding mechanism for a data channel. A user data sequence comprising a first number of bits is received. The user data sequence is encoded into a codeword sequence comprising a second number of bits utilizing a modulation encoder. The modulation encoder may encode the user data sequence based on a set of Markov state transition probabilities. The modulation encoder may implement a data de-compressor algorithm from a lossless data compression scheme. The codeword sequence is output to the data channel. The codeword sequence is subsequently received from the data channel, and the user data sequence is decoded from the codeword sequence utilizing a modulation decoder. The modulation decoder may decode the user data sequence based on the same set of Markov states transition probabilities. The modulation de-coder may implement the data compressor algorithm from the lossless data compression scheme.
-
Citations
20 Claims
-
1. An apparatus for implementing a universal modulation coding mechanism, the apparatus comprising:
-
a storage area containing a set of state transition probabilities; a modulation encoder configured to perform the steps of receiving a data sequence comprising a first number of bits, encoding the data sequence into a codeword sequence comprising a second number of bits based on the set of state transition probabilities, the second number of bits is greater than the first number of bits, and providing the codeword sequence to a recording channel of a storage device; and a modulation decoder configured to perform the steps of receiving the codeword sequence from the recording channel, and decoding the data sequence from the codeword sequence based on the set of state transition probabilities. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method comprising steps of:
-
receiving a user data sequence comprising a first number of bits at a controller, encoding the user data sequence by the controller into a codeword sequence comprising a second number of bits utilizing a data de-compressor based on a lossless data compression scheme; outputting the codeword sequence to a data channel; receiving the codeword sequence from the data channel; and decoding the user data sequence by the controller from the codeword sequence utilizing a data compressor based on the lossless data compression scheme. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A system comprising:
-
a hard disk drive comprising a magnetic recording channel; and a universal modulation encoder/decoder comprising a storage area containing a set of Markov state transition probabilities, the universal modulation encoder/decoder configured to receive a user data sequence, encode the user data sequence into a codeword sequence utilizing an arithmetic decoder based on the set of Markov state transition probabilities, provide the codeword sequence to the magnetic recording channel, receive the codeword sequence from the magnetic recording channel, and decode a recovered user data sequence from the codeword sequence utilizing an arithmetic encoder based on the set of Markov state transition probabilities. - View Dependent Claims (18, 19, 20)
-
Specification