Patent US4990910A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4990910A Expired / Lapsed US ⏱️ 0.0 years remaining

Variable length code conversion system

Assignee: KDDI Corp
•
Filing: 1990-02-15
•
Granted: 1991-02-05
•
Expires: 2010-02-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A variable length code is converted to a new code in order to improve synchronization recovery capability without changing the length of each codeword. A short codeword with high occurrence probability is first selected as a seed. An object codeword, which is longer than the seed located at a leaf of a tree structure of the code, is exchanged with another node or leaf, which at the same is located depth as that of the object codeword in the tree structure, when a rear portion, called a suffix of said object codeword, coincides with the seed. The seed is also exchanged with another node or leaf on the same level as that of the seed, and the exchange of the object codewords is effected for the fresh seed in a similar manner as above. The final seed and the object codewords are determined so that the number of the codewords which coincide with the suffixes of seeds becomes maximum.

Inventors

  • 👤 Yasuhiro Takishima
  • 👤 Hitomi Murakami

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 21:55
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1682; H04J3/1688; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/42

Claims Analysis

Total Claims: 3
Claim 1
Independent Claim 344 words
A variable length code conversion system for generating a new codeword from an original codeword without increasing average bit length so that a shorter codeword coincides with a rear part of another codeword which is longer than said shorter codeword, said variable length code conversion system comprising: (a) input means for reading original codewords together with occurrence probability of each codeword; (b) a seed selector for successively selecting each of a plurality of short codewords with high occurrence probability as each of a plurality of seed words; (c) an object codeword selector for successively selecting each of a plurality of object codewords in said original codewords so that each of said object codewords is longer than said selected seed word; (d) a first equivalent converter for successively exchanging a node or leaf of each selected object codeword with a node or leaf which is located on a same level of a tree structure of the variable length code as that of said selected object codeword, and which has a rear portion equal to the seed word; (e) a counter for counting a number of coincidences between rear portions of said selected object codewords and the seed word when all said selected object codewords are exhausted; (f) a second equivalent converter for exchanging the seed word with a node or a leaf on the same level in said tree structure as that of the seed word, and resetting said counter; (g) control means for activating said object codeword selector, to successively reselect each of said plurality of object codewords; and said first equivalent converter, to successively re-exchange the node or leaf of each reselected object codeword and said counter to count the number of coincidence between said rear portions of said selected object codewords and the seed word so that said number of coincidences from said counter is a maximum and for activating said seed selector to select another seed; and (h) an output means for providing a new codeword from said control means when all the seeds selected by the seed selector are exhausted.
Claim 2
Dependent Claim 344 words
A variable length code conversion system for generating a new codeword from an original codeword without increasing average bit length so that a shorter codeword coincides with a rear part of another codeword which is longer than said shorter codeword, said variable length code conversion system comprising: (a) input means for reading original codewords together with occurrence probability of each codeword; (b) a seed selector for successively selecting each of a plurality of short codewords with high occurrence probability as each of a plurality of seed words; (c) an object codeword selector for successively selecting each of a plurality of object codewords in said original codewords so that each of said object codewords is longer than said selected seed word; (d) a first equivalent converter for successively exchanging a node or leaf of each selected object codeword with a node or leaf which is located on a same level of a tree structure of the variable length code as that of said selected object codeword, and which has a rear portion equal to the seed word; (e) a counter for counting a number of coincidences between rear portions of said selected object codewords and the seed word when all said selected object codewords are exhausted; (f) a second equivalent converter for exchanging the seed word with a node or a leaf on the same level in said tree structure as that of the seed word, and resetting said counter; (g) control means for activating said object codeword selector, to successively reselect each of said plurality of object codewords; and said first equivalent converter, to successively re-exchange the node or leaf of each reselected object codeword and said counter to count the number of coincidence between said rear portions of said selected object codewords and the seed word so that said number of coincidences from said counter is a maximum and for activating said seed selector to select another seed; and (h) an output means for providing a new codeword from said control means when all the seeds selected by the seed selector are exhausted.
Claim 3
Dependent Claim 63 words
A variable length code conversion system according to claim 1, wherein a memory storing a flag for each node and each leaf of said tree structure is provided, said flag is turned ON when a node or a leaf of said flag coincides with the seed word, and further exchange of a node or a leaf which has a flag ON is prohibited.

References Cited (Backward Citations)

US3675212A Cited
US3918047A Cited
US4899149A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-02-04 1994-08-06 1995-02-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-02-04 1998-08-06 1999-02-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-02-04 2002-08-06 2003-02-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag