Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability
Reexamination Certificate
2008-01-15
2008-01-15
Nguyen, Khai M. (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from code based on probability
C341S051000, C341S106000, C281S013000, C281S013000
Reexamination Certificate
active
11282145
ABSTRACT:
An input tangled sequence such as an instruction stream is compressed by modeling the sequence into multiple Markov chains to simultaneously capture and exploit the correlations among and within subsequences that are mingled in the input tangled sequence. The multiple Markov chains may be combined to drive an entropy coder.
REFERENCES:
patent: 5023611 (1991-06-01), Chamzas et al.
patent: 5025258 (1991-06-01), Duttweiler
patent: 5298896 (1994-03-01), Lei et al.
patent: 5414423 (1995-05-01), Pennebaker
patent: 5689589 (1997-11-01), Gormish et al.
patent: 6516305 (2003-02-01), Fraser
patent: 6606037 (2003-08-01), Ekstrand et al.
patent: 6850175 (2005-02-01), Bossen
patent: 1387265 (2004-02-01), None
Bloom: Solving the Problems of Context Modeling, CA Inst. of Tech., 11 pages, unknown date.
Witten, et al.: Arithmetic Coding for Data Compression, Communications of the ACM, Jun. 1987, vol. 30, No. 6, pp. 520-540.
Beszedes, et al.: Survey of Code-Size Reduction Methods, ACM Computing Surveys, vol. 35, No. 3, Sep. 2003, pp. 223-267.
Drinic, et al.: PPMexe: PPM for Compresssing Software, Proceedings of the Data Compression Conference (DDC '02), IEEE, 5 pages, no date.
Yuan Xie et al: “A code decompression architecture for VLIW processors”. Microarchitecture, 2001. Micro-34. Proceedings. 34th ACM/IEEE International Symposium on Dec. 1-5, 2001. Piscataway. NJ, USA, IEEE, Dec. 1, 2001, pp. 66-75.
Drinic M et al: “PPMexe: PPM for compressing sotware” Proceedings DCC2002. Data Compression Conference IEEE Comput. Soc Los Alamitos, CA, USA, 2002, pp. 192-201.
Lekatsas H et al: “Code compression for embedded systems” Design Automation Conference, 1998. Proceedings San Fancisco, CA, USA. Jun. 15-19, 1998, New York, NY, USA, IEEE, US, Jun. 15, 1998 (Jun. 15, 1998), pp. 516-521.
Fraser C W: “Automatic Inferfncf of Models for Statistical Code Compression” ACM Sigplan Notices, ACM, Associations for Computing Machinery, New York, NY, US, vol. 34, No. 5, May 1, 1999, pp. 242-246.
Beszedes A et al: “Survey of code-size reduction methods” ACM Computing Surveys ACM USA, vol. 35, No. 3, Sep. 2003 (Sep. 2003), pp. 223-267.
PCT Search Report dated Apr. 3, 2007.
Lv Lv
Sun Yuanhao
Wu Xiaolin X.
Yeo Boon-Lock
Yu Fenglin
Intel Corporation
Nguyen Khai M.
LandOfFree
Compression using multiple Markov chain modeling does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compression using multiple Markov chain modeling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression using multiple Markov chain modeling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3945082