Coded data generation or conversion – Digital code to digital code converters – To or from run length limited codes
Reexamination Certificate
2005-08-23
2005-08-23
Tokar, Michael (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from run length limited codes
C341S058000, C341S067000, C341S081000
Reexamination Certificate
active
06933865
ABSTRACT:
A system and method of forming RLL coded data streams with separator blocks has an RLL encoder and a channel encoder. The input code word is divided into data portions and a separator portion. The data portions are inserted into an output codeword without encoding. Each data portion is separated from a next data portion by a space. The separator portion is encoded into non-zero separator sub-matrices, which are stuffed into the spaces between the data portions. The separator portions and the data portions may be separately permuted without exceeding a maximum number of consecutive zeros.
REFERENCES:
patent: 5028922 (1991-07-01), Huang
patent: 5233348 (1993-08-01), Pollmann et al.
patent: 5969649 (1999-10-01), Ashley et al.
patent: 5999110 (1999-12-01), Blaum et al.
patent: 6072410 (2000-06-01), Kim
patent: 6081208 (2000-06-01), Kikuchi et al.
patent: 6344807 (2002-02-01), Hassner et al.
Phillips, A.; and Tomizuka, M.; “Multirate Estimation and Control Under Time-Varying Data Sampling with Applications to Information Storage Devices.” Proceedings of the American Control Conference, Seattle WA, pp. 4151-4155 (Jun. 1995).
Yamaguchi, K.; and Imai, H.; “Good k/ (k+1) Time-Varying Convolutional Encoders from Time-Invariant Convolutional Codes,” 1995 IEEE International Symposium on Information Theory, 1995 Proceedings, pp. 159 (Sep. 17-22, 1995).
Palazzo, Jr. R. “A Time-Varying Convolutional Encoder Better Than the Best Time-Invariant Encoder”. IEEE on Information Theory, vol. 39, No. 3, pp. 1109-1110 (May 1993).
B.H. Marcus et al. “Finite-State Modulation Codes for Data Storage.” IEEE Journal on Selected Areas in Communications, vol. 10, No. 1, pp. 5-37, (Jan. 1992).
Vucetic, B. “An Adaptive Coding Scheme for Time-Varying Channels.” IEEE Transactions on Communications, vol. 39, No. 5, pp. 653-663 (May 1991).
C. D. Heegard et al. “Variable-Length State Splitting with Applications to Average Runlength-Constrained (ARC) Codes,” IEEE Transactions on Information Theory, vol. 37, No. 3, pp. 759-777 (May 1991).
Gubner, J.A.; and Hughes, B.L..; “Nonconvexity of the Capacity Region of the Multiple-Access Arbitrarily Varying Channel Subject to Constraints.” IEEE Transactions on Information Theory, vol. 41, No. 1, pp. 3-13, (Jan. 1995).
Perez, L.C. “Time Varying Convolutional Codes Revisited,” IEEE Information Theory Workshop, pp. 67-69 (Sep. 2-7, 2001).
Ashley, J.; and Marcus, B.; “Time-Varying Encoders for Constrained Systems: An Approach to Limiting Error Propagation,” IEEE Transactions on Information Theory, vol. 46, No. 3, pp. 1038-1043 (May 2000).
Ashley, J.; and Marcus, B.; “A Generalized State-Splitting Algorithm,” IEEE Transactions on Information Theory, vol. 43, No. 4, pp. 1326-1338 (Jul. 1997).
R. Adler et al. “State Splitting for Variable-Length Graphs,” IEEE Transactions on Information Theory, vol. IT-32, No. 1, pp. 108-113 (Jan. 1986).
C. Shalizi et al. “Pattern Discovery in Time Series, Part I: Theory, Algorithm, Analysis, and Convergence.” Journal of Machine Learning Research, pp. 1-22 (Jul. 2002).
Monsen, P. “MMSE Equalization of Interference on Fading Diversity Channels,” IEEE Transactions on Communications, vol. Com-32, No. 1, pp. 5-12 (Jan. 1984).
J. Coker et al. “Noise-Predictive Maximum Likelihood (NPML) Detection,” IEEE Storage Systems Division, IEEE Transactions on Magnetics, vol. 34, No. 1, pp. 110-117 (Jan. 1998).
Moon, J.; and Park, J.; “Pattern-Dependent Noise Prediction in Signal-Dependent Noise,” IEEE Journal on Selected Areas in Communications, vol. 19, No. 4, pp. 730-743 (Apr. 2001).
Kavcic, A.; and Moura, J.; “The Viterbi Algorithm and Markov Noise Memory,” IEEE Transactions on Information Theory, vol. 46, No. 1, pp. 291-301 (Jan. 2000).
P. CharnKeitKong et al. “On Classes of Rate k/ (k+1) Convolutional Codes and Their Decoding Techniques,” IEEE Transactions on Information Theory, vol. 42, No. 6, pp. 2181-2193 (Nov. 1996).
Kurtas Erozan
Kuznetsov Alexander Vasilievich
Mai Lam T.
Seagate Technology LLC
Tokar Michael
Westman Champlin & Kelly P.A.
LandOfFree
Method and apparatus for coded symbol stuffing in recording... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for coded symbol stuffing in recording..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for coded symbol stuffing in recording... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3455591