Fast parsing of variable-to-fixed-length codes

Details Fast parsing of variable-to-fixed-length codes Fast parsing of variable-to-fixed-length codes

2011-08-23

2011-08-23

JeanPierre, Peguy (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from variable length codes

C341S050000

Reexamination Certificate

active

08004431

ABSTRACT:
Methods and systems for parsing and decoding compressed data are provided. Random segments of the compressed data may be decompressed and positioned appropriately in the corresponding uncompressed data set. The methods and systems utilize variable to fixed length (VF) coding techniques. For some applications, the VF coding techniques may be implemented within media encoders, decoders, or combined encoder-decoders (CODECs).

REFERENCES:
patent: 4188669 (1980-02-01), Rauscher
patent: 4509038 (1985-04-01), Hirano
patent: 6839005 (2005-01-01), Singhal et al.
patent: 2003/0236793 (2003-12-01), Karlsson
patent: 2008/0111721 (2008-05-01), Reznik
patent: 2008/0224905 (2008-09-01), Reznik
patent: 2010/0057810 (2010-03-01), Ei et al.
Algra, T.: “Fast and Efficient Variable-to-Fixed-Length Coding Algorithm,” Electronics Letters, IEE Stevenage, GB, vol. 28, No. 15 (Jul. 16, 1992) pp. 1399-1401, XP000307687, ISSN: 0013-5194.
Anonymous: “Data Structures and Algorithms Topic 8: Introduction to trees”[Online] 1997, XP002595247 McGill University: School of Computer Science. Winter 1997 Class Notes for 308-251B Retrieved from the Internet: URL:http://www.cs.mcgi11.ca/{cs251/01dCo.
Gallager: “Variable to fixed length source coding—tunstall codes”[Online] 1994, XP002595245 Massachusetts Institute of Technology (Supplementary Notes) Retrieved from the Internet: URL:http://web.mit.edu/gal1ager/www
otes/ notesl.pdf> [retrieved on Aug. 3, 2010].
International Search Report and Written Opinion—PCT/US2009/067148, International Search Authority—European Patent Office—Sep. 7, 2010.
Julia Abrahams: “Code and parse trees for lossless source coding” [Online] vol. 1, No. 2, Apr. 2001, pp. 113-146, XP002595248, Communications in information and systems Retrieved from the Interner: URL:http://intlpress.cn/CIS/p/2001/1—2/CIS-1-2-113-146.pdf>.
T.J. Tjalkens: “A universal variable-to-fixed length source code based on lawrence's algorithm”[Oniine] vol. 38, No. 2, Mar. 1992, pp. 247-253, XP002595249 IEEE Transactions on Information Theory Retrieved from the Internet: URL:http://refer.
International Preliminary Report on Patentability—PCT/US2009/067148, The International Bureau of WIPO—Geneva, Switzerland, Mar. 9, 2011.

Affiliated with

Also associated with

Rating

Fast parsing of variable-to-fixed-length codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast parsing of variable-to-fixed-length codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast parsing of variable-to-fixed-length codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2651839