Image analysis – Image compression or coding – Lossless compression
Reexamination Certificate
2006-01-10
2006-01-10
Johns, Andrew W. (Department: 2621)
Image analysis
Image compression or coding
Lossless compression
C341S065000
Reexamination Certificate
active
06985633
ABSTRACT:
Alphabet-partitioned codewords, for example class based codewords, are decoded using a two-part decoder. The first part is a class code decoder that extracts, from the codeword, information for decoding the symbol code. The second part is a symbol code decoder that uses that information to decode the symbol code. If the symbol code is a literal, the symbol is just stripped from the codeword; otherwise, the symbol is retrieved from a symbol memory. Throughput of blocks of even numbers of codewords is enhanced by compressing first and second block halves oppositely and by using two decoders to decompress first and second block halves in parallel. Throughput is enhanced further by using extended codewords, each of which is a concatenation of class codes and symbol codes of several symbols.
REFERENCES:
patent: 3918047 (1975-11-01), Denes
patent: 3984833 (1976-10-01), Van Voorhis
patent: 5444800 (1995-08-01), Kim
patent: 5583500 (1996-12-01), Allen et al.
patent: 5632024 (1997-05-01), Yajima et al.
patent: 5652852 (1997-07-01), Yokota
patent: 5668599 (1997-09-01), Cheney et al.
patent: 5717394 (1998-02-01), Schwartz et al.
patent: 5784585 (1998-07-01), Denman
patent: 5872599 (1999-02-01), Rosenbrg
patent: 5905893 (1999-05-01), Worrell
patent: 6052415 (2000-04-01), Carr et al.
patent: 6307489 (2001-10-01), Freking et al.
patent: 6360348 (2002-03-01), Yang
patent: 6408421 (2002-06-01), Benes et al.
patent: 6518895 (2003-02-01), Weiss et al.
patent: WO 98/38791 (1998-09-01), None
T. A. Welch, “A technique for high-performance data compression”,IEEE Computervol. 17, No. 6 pp. 8-19 (Jun. 1984).
Miretsky et al., “RISC code compression model”,Proc. Embedded Systems Conference, Chicago IL, Mar. 1999).
A. Said and W. A. Perlman, in “Low-complexity waveform coding via alphabet and sample-set partitioning”,Visual Communications and Image Processing '97, Proc. SPIEvol. 3024, pp. 25-37 (Feb. 1997).
C. Van Voorhis, Constructing codes with bounded codeword lengths,IEEE Transactions on Information Theoryvol. 20 No. 3 pp. 288-290 (Mar. 1974).
A. Wolfe and A. Chanin in Executing compressed programs on an embedded RISC architecture,Proc. Int'l Symp.On Microarchitecture, pp. 81-91 (1992).
D. A. Huffman, “A method for the construction of minimum redundancy codes”,Proc. IREvol. 40 No. 9 pp. 1098-1101 (Sep. 1952).
T. M. Kemp et al., “A decompression core for PowerPC”,IBM Journal of Research and Developmentvol. 42 No. 6 pp. 807-812 (Nov. 1998).
S. Schwartz and B. Kallick, “Generating a canonical prefix coding”,Communications of the ACMvol. 7 no. 3 pp. 166-169 (Mar. 1964).
S. M. Lei and M. T. Sun, in “An entropy coding system for digital HDTV applications”,IEEE Transactions on Circuits and Systems for Video Technologyvol. 1 No. 1 pp. 147-155 (Mar. 1991).
S. Chang and D. G. Messerschmitt, in Designing high-throughput VLC decoder Part I—concurrent VSLI architectures,IEEE Transactions on Circuits and Systems for Video Technologyvol. 2 No. 2 pp. 187-196 (Jun. 1992).
J. Ziv and A. Lempel, “A universal algorithm for sequential data compression ”,IEEE Transactions on Information Theoryvol. 23 No. 3 pp. 337-343 (May 1977).
Beren Shay
Weiss Shlomo
Alavi Amir
Friedman Mark M.
Johns Andrew W.
Ramot at Tel Aviv University Ltd.
LandOfFree
Device and method for decoding class-based codewords does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Device and method for decoding class-based codewords, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Device and method for decoding class-based codewords will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3546356