Electrical computers and digital processing systems: multicomput – Computer-to-computer data modifying – Compressing/decompressing
Reexamination Certificate
2005-12-27
2005-12-27
Etienne, Ario (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data modifying
Compressing/decompressing
C709S246000, C709S247000, C714S746000, C714S748000
Reexamination Certificate
active
06981060
ABSTRACT:
In a packet based data transmission including automatic repeat request (ARQ) protocols, the memory consumption of the ARQ protocol is reduced by compression/decompression of failed data block prior to combination with the retransmitted data blocks using low complexity compression/decompression algorithms. The compression algorithm includes of two parts: calculating and storing a scale factor that estimates the soft values in the data block, and storing the each soft values' sign in local memory instead of the complete soft value. Since one bit is sufficient to store the sign of each soft value, the memory consumption of a data block containing N soft values is N bits. Note, the scale factor increases the memory consumption, in bits, with the word length of the scale factor. However, the relative memory increase becomes smaller the larger the data block.
REFERENCES:
patent: 4589111 (1986-05-01), Adachi
patent: 5130993 (1992-07-01), Gutman et al.
patent: 5450453 (1995-09-01), Frank
patent: 5550756 (1996-08-01), Ohmi et al.
patent: 5675703 (1997-10-01), Sato
patent: 5881104 (1999-03-01), Akahane
patent: 6058459 (2000-05-01), Owen et al.
patent: 6137784 (2000-10-01), Wallerius et al.
patent: 6247150 (2001-06-01), Niemela
patent: 6347124 (2002-02-01), Antia et al.
patent: 6366545 (2002-04-01), Koyata
patent: 6400928 (2002-06-01), Khullar et al.
patent: 6668089 (2003-12-01), Bracamonte et al.
patent: 6711709 (2004-03-01), York
patent: 6718507 (2004-04-01), Johnston et al.
patent: 6744766 (2004-06-01), Alapuranen
patent: 0 771 092 (1997-02-01), None
patent: 99/22481 (1999-05-01), None
Timothy C. Bell et al., “The Relationship between Greedy Parsing and Symbolwise Text Compression”, Journal of the Association for Computer Machinery, vol. 41, No. 4, Jul. 1994, pp. 708-724.
Jeffrey Scott Vitter et al., “Optimal Prefetching via Data Compression”, Journal of the ACM, vol. 43, No. 5, Sep. 1996, pp. 771-793.
Joachim Hagenauer et al., “A Viterbi Algorithm with Soft-Decision Outputs and its Applications,”, in Proc. Globecom, Dalles, TX, Nov. 1989, pp. 1680-1686.
Etienne Ario
Osman Ramy M.
Potomac Patent Group PLLC
Telefonaktiebolaget L M Ericsson (publ)
LandOfFree
Compression based on channel characteristics 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 based on channel characteristics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression based on channel characteristics will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3470894