IP Library Granted Patent US 8,514,107
Granted Patent B2
US 8,514,107 · App. 13/138,717 · Granted Aug 20, 2013

Method and device for encoding and decoding of symbol sequences wherein each symbol may have one out of three or more possible symbol values

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,514,107
App. No.
13/138,717
Granted
Aug 20, 2013
Kind
B2
Abstract

A method for compressing a symbol sequence, wherein each symbol may have one out of three or more possible symbol values, said method comprises the steps of modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value and a second run of symbols of a second most frequent symbol value, by a further symbol value not comprised in the three or more possible symbol values, generating a binary sequence comprising all replaced run pairs and compression encoding the binary sequence and the modified symbol sequence.

Claims (10)

1. A method for compressing a symbol sequence, wherein each symbol has one out of three or more possible symbol values, said method comprising the steps of:

modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value immediately followed by a second run of symbols of a second most frequent symbol value, by a further symbol value being different from the three or more possible symbol values;

generating a binary sequence comprising the replaced run pairs; and

encoding the binary sequence and the modified symbol sequence.

2. A encoder for performing the method of claim 1 .

3. A non-transitory storage medium carrying a symbol sequence compress encoded according to the method of claim 1 .

4. A method for decompressing a compressed symbol sequence, wherein each symbol has one out of three or more possible symbol values, said method comprising the steps of:

decoding a different symbol sequence, said different symbol sequence comprising symbols of a further symbol value being different from the three or more possible symbol values, and decoding a sequence of run pairs comprised in a binary sequence, the number of run pairs in the sequence of run pairs equalling the number of symbols of said further symbol value in the different symbol sequence, wherein a run pair contains a first run of symbols of a symbol value immediately followed by a second run of symbols of a second symbol value; and

replacing, in the different sequence, the symbols of said further symbol value by the run pairs wherein order of the run pairs is maintained.

5. A decoder for performing the method of claim 4 .

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 23, 2018
From: THOMSON LICENSING
To: INTERDIGITAL VC HOLDINGS, INC.
Reel/Frame 047289/0698 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 21, 2011
From: CHEN, QU QUING; CAI, KANG YING; CHEN, ZHI BO; TENG, JUN
To: THOMSON LICENSING
Reel/Frame 027062/0658 →