Combinatorial coding/decoding for electrical computers and...

Coded data generation or conversion – Digital code to digital code converters

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C341S051000

Reexamination Certificate

active

07990289

ABSTRACT:
Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

REFERENCES:
patent: 3626167 (1971-12-01), Guck et al.
patent: 4168513 (1979-09-01), Hains et al.
patent: 4509038 (1985-04-01), Hirano
patent: 4792793 (1988-12-01), Rawlinson et al.
patent: 4929946 (1990-05-01), O'Brien et al.
patent: 5313203 (1994-05-01), Suu et al.
patent: 5357250 (1994-10-01), Healey et al.
patent: 5710561 (1998-01-01), Schmidt et al.
patent: 5748786 (1998-05-01), Zandi et al.
patent: 5754704 (1998-05-01), Barnsley et al.
patent: 5764803 (1998-06-01), Jacquin et al.
patent: 5768437 (1998-06-01), Monro et al.
patent: 5818877 (1998-10-01), Tsai et al.
patent: 5915044 (1999-06-01), Gardos et al.
patent: 6078619 (2000-06-01), Monro et al.
patent: 6188334 (2001-02-01), Bengio et al.
patent: 6225925 (2001-05-01), Bengio et al.
patent: 6272241 (2001-08-01), Tattersall
patent: 6281817 (2001-08-01), Bengio et al.
patent: 6320522 (2001-11-01), Satoh
patent: 6373411 (2002-04-01), Shoham
patent: 6556719 (2003-04-01), Monro
patent: 6563438 (2003-05-01), Satoh
patent: 6990145 (2006-01-01), Monro et al.
patent: 7015837 (2006-03-01), Malvar
patent: 7030789 (2006-04-01), Cideciyan et al.
patent: 7082483 (2006-07-01), Poo
patent: 7155445 (2006-12-01), Kling et al.
patent: 7265691 (2007-09-01), Tomic
patent: 7301485 (2007-11-01), Senda
patent: 7340013 (2008-03-01), Ammer et al.
patent: 7453377 (2008-11-01), Lee et al.
patent: 2004/0126018 (2004-07-01), Monro
patent: 2004/0165737 (2004-08-01), Monro
patent: 2010/0085218 (2010-04-01), Monro
patent: 2010/0085221 (2010-04-01), Monro
patent: 2010/0085224 (2010-04-01), Monro
patent: 2010/0238056 (2010-09-01), Seki et al.
patent: 0595599 (1994-05-01), None
patent: 0836325 (1998-04-01), None
patent: 0 939 554 (1999-09-01), None
patent: 2293733 (1996-04-01), None
patent: WO97/16029 (1997-05-01), None
patent: WO 99/08449 (1999-02-01), None
patent: WO 01/63935 (2001-08-01), None
Notice of Allowance on U.S. Appl. 12/423,935, mailed Nov. 12, 2010.
R.F. Rice, “Some Practical Universal Noiseless Coding Techniques,” Jet Propulsion Laboratory, Pasadena, California, JPL Publication 79-22, Mar. 1979.
Office Action on U.S. Appl. No. 12/463,584, mailed Apr. 2, 2010.
Notice of Allowance from U.S. Appl. No. 11/776,786, mailed Jun. 17, 2009.
Non-final Office Action on U.S. Appl. No. 12/423,935, mailed Jul. 8, 2010.
Notice of Allowance on U.S. Appl. No. 12/463,584, mailed Aug. 19, 2010.
U.S. Appl. No. 11/777,239, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,230, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,144, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,130, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,122, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,100, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,081, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/777,022, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/776,786, filed Jul. 12, 2007, Monro.
U.S. Appl. No. 11/422,316, filed Jun. 5, 2006, Monro.
De Natale, et al., “A Mesh-Interpolation Scheme for Very-Low Bitrate Coding of Video Sequences” European Transactions on Telecommunications, vol. 9, No. 1, pp. 47-55, 1998.
Tian et al., “Image Data Processing in the Compressed Wavelet Domain” Proceedings of ICSP'96, pp. 978-981, 1996.
Said et al., “A New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees” IEEE Transactions on Circuits and Systems for Video Technology, vol. 6, No. 3, pp. 243-250, Jun. 1996.
Shapiro, “Embedded Image Coding Using Zerotrees of Wavelet Coefficients” IEEE Transactions on Signal Processing, vol. 41, No. 12, pp. 3445-3462, Dec. 1993.
Horst et al., “Mupcos: A multi-purpose coding scheme” Signal Processing: Image Communication 5, pp. 75-89, 1993.
International Search Report and Written Opinion for PCT/US2008/069539 completed Sep. 30, 2008.
International Search Report and Written Opinion for PCT/US2008/069543 completed Sep. 30, 2008.
International Search Report and Written Opinion for PCT/US2008/069502, mailed Nov. 3, 2008.
Communication and Written Opinion for PCT/US2008/069497 mailed Oct. 9, 2008.
Communication and Written Opinion for PCT/US2008/069317 mailed Oct. 9, 2008.
Anonymous: “Conversion Between Different Number Systems” Internet Article, [Online] Nov. 11, 2002, XP002494744. Retrieved from the Internet: URL: http://www.cstc.org/data/resouces/60/convexp.html> [retrieved on Sep. 5, 2008].
Bose, B. et al., “Lee Distance Gray Codes” Information Theory, 1995. Proceedings 1995 IEEE International Symposium, Whistler, BC, Canada Sep. 17-22, 1995, New York, NY, IEEE, US Sep. 17, 1995, p. 236, XP010192708.
Notice of Allowance for U.S. Appl. No. 11/777,081, mailed Oct. 13, 2009.
Non-Final Office Action on U.S. Appl. No. 11/777,230, mailed Feb. 1, 2011.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Combinatorial coding/decoding for electrical computers and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Combinatorial coding/decoding for electrical computers and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial coding/decoding for electrical computers and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2717051

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.