Data compression with incremental redundancy

Details Data compression with incremental redundancy Data compression with incremental redundancy

2007-11-27

2007-11-27

Dildine, R. Stephen (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

Reexamination Certificate

active

10911297

ABSTRACT:
In a packet-based data transmission including incremental redundancy (IR) protocols, the memory consumption of the IR protocol is reduced by compressing and storing failed data units in their punctured format. The failed data units are compressed using low complexity compression/decompression algorithms. The compression algorithm includes two parts: calculating and storing a scale factor for each transmission burst that estimates the soft values in the burst, and storing each soft values' sign in local memory instead of the complete soft value. If the currently received data unit is a retransmission, its compressed versions in the punctured format stored in the IR memory are decompressed, de-punctured and combined with the currently received data unit. The combined data unit is then decoded. The decompression restores an estimated soft-value by multiplying the sign value stored in the IR memory with its corresponding scale factor obtained from a mapping table.

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: 6529561 (2003-03-01), Sipola
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: 2002/0107987 (2002-08-01), Malm
patent: 2002/0159545 (2002-10-01), Ramesh et al.
patent: 0 771 092 (1997-05-01), None
patent: 1187386 (2002-03-01), None
patent: WO 99/22481 (1999-05-01), None
Hagenauer, Joachim, et al., “A Viterbi Algorithm with Soft-Decision Outputs and its Applications”, Dallas Globecom '89, IEE Global Telecommunications Conference & Exhibition, Dallas, Texas, Nov. 27-30, 1989.
PCT International Search Report, dated Jan. 19, 2005, in connection with International Application No. PCT/EP2004/009346.
PCT Written Opinion, dated Jan. 19, 2005, in connection with International Application No. PCT/EP2004/009346.
European Search Report, dated Aug. 9, 2001, in connection with U.S. Appl. No. 09/735,495.
Bell, Timothy C. 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.
Vitter, Jefffrey Scott et al., “Optimal Prefetching via Data Compression,” Journal of the ACM, vol. 43, No. 5, Sep. 1996, pp. 771-793.
Hagenauer, Joachim et al., “A Viterbi Algorithm with Soft-Decision Outputs and its Applications,” in Proc. Globecom, Dallas, TX, Nov. 1989, pp. 1680-1686.

Affiliated with

Also associated with

Rating

Data compression with incremental redundancy does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data compression with incremental redundancy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression with incremental redundancy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3867753