← Back to Patent Explorer
US5216694A Expired / Lapsed US ⏱️ 0.0 years remaining

Trellis coding for fractional bits

Assignee: Nokia Bell Labs
•
Filing: 1991-09-12
•
Granted: 1993-06-01
•
Expires: 2011-09-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A trellis-coded communications system for encoding a fractional number of bits is described. In this system, the number of allowed state transitions, originating from each state of a trellis encoder, is restricted to a number that is not an integral power of an integer. Furthermore, not all state transitions are used with equal probability.

Inventors

  • 👤 Lee-Fang Wei

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 17:33
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/25; H03M13/256; H04; H04L; H04L27/00; H04L27/18; H04L27/186

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 64 words
A method comprising the steps of receiving a stream of data bits at an average rate of m data bits per symbol interval, where m>0, and using a trellis encoder to encode a fractional portion of the m data bits in each symbol interval, where the number of state transitions in the trellis encoder is not equal to an integral power of an integer.
Claim 2
Independent Claim 64 words
A method comprising the steps of receiving a stream of data bits at an average rate of m data bits per symbol interval, where m>0, and using a trellis encoder to encode a fractional portion of the m data bits in each symbol interval, where the number of state transitions in the trellis encoder is not equal to an integral power of an integer.
Claim 3
Dependent Claim 64 words
The method of claim 1 further comprising the step of precoding the received stream of m data bits to provide one of a plurality of precoded output bit patterns in each symbol interval to the trellis encoder, where the number of precoded output bits is p, p being an integer, and the plurality of precoded output bit patterns is less than 2 p .
Claim 4
Dependent Claim 35 words
The method of claim 2 wherein at least one of the plurality of precoded output bit patterns is used with a different probability from the remaining ones of the plurality of precoded output bit patterns.
Claim 5
Dependent Claim 106 words
The method of claim 2 wherein the precoding step includes the steps of fractional bit encoding a portion of the stream of m data bits over a predetermined number of symbol intervals to provide one of a plurality of bit patterns in each symbol interval wherein at least one of said plurality of bit patterns is used with a different probability than the remaining ones of said plurality of bit patterns, and combining the one of the plurality of bit patterns in each symbol interval with the remaining portion of m data bits to provide the plurality of precoded output bit patterns in each symbol interval.
Claim 6
Dependent Claim 52 words
The method of claim 1 further comprising the step of mapping each one of the number of state transitions to one of a plurality of 2N-dimensional symbols in each symbol interval, where N is an integer, whereby over a number of symbol intervals the mapping step provides a stream of 2N-dimensional symbols.
Claim 7
Independent Claim 60 words
A method comprising the steps of receiving a stream of data bits at an average rate of m data bits per symbol interval, where m>0, and using a trellis encoder to encode a fractional portion of the m data bits in each symbol interval, where at least one state transition of the trellis encoder is used with a different probability.
Claim 8
Independent Claim 60 words
A method comprising the steps of receiving a stream of data bits at an average rate of m data bits per symbol interval, where m>0, and using a trellis encoder to encode a fractional portion of the m data bits in each symbol interval, where at least one state transition of the trellis encoder is used with a different probability.
Claim 9
Dependent Claim 64 words
The method of claim 6 further comprising the step of precoding the received stream of m data bits to provide one of a plurality of precoded output bit patterns in each symbol interval to the trellis encoder, where the number of precoded output bits is p, p being an integer, and the plurality of precoded output bit patterns is less than 2 p .
Claim 10
Dependent Claim 35 words
The method of claim 7 wherein at least one of the plurality of precoded output bit patterns is used with a different probability from the remaining ones of the plurality of precoded output bit patterns.
Claim 11
Dependent Claim 61 words
Apparatus comprising means for receiving a stream of data bits at an average fractional rate of m data bits per symbol interval, where m>0, and means for trellis encoding a fractional portion of the m data bits in each symbol interval, where the number of state transitions in the trellis encoder is not equal to an integral power of an integer.
Claim 12
Dependent Claim 61 words
Apparatus comprising means for receiving a stream of data bits at an average fractional rate of m data bits per symbol interval, where m>0, and means for trellis encoding a fractional portion of the m data bits in each symbol interval, where the number of state transitions in the trellis encoder is not equal to an integral power of an integer.
Claim 13
Dependent Claim 68 words
The apparatus of claim 9 further comprising a means for precoding the received stream of m data bits to provide one of a plurality of precoded output bit patterns in each symbol interval to the means for trellis encoding, where the number of precoded output bit patterns is p bits, p being an integer, and the plurality of precoded output bit patterns is less than 2 p .
Claim 14
Dependent Claim 35 words
The apparatus of claim 10 wherein at least one of the plurality of precoded output bit patterns is used with a different probability from the remaining ones of the plurality of precoded output bit patterns.
Claim 15
Dependent Claim 107 words
The apparatus claim 10 wherein the means for precoding includes means for fractional bit encoding a portion of the stream of m data bits over a pre-determined number of symbol intervals to provide one of a plurality of bit patterns in each symbol interval wherein at least one of said plurality of bit patterns is used with a different probability than the remaining ones of said plurality of bit patterns, and means for combining the one of the plurality of bit patterns in each symbol interval with the remaining portion of m data bits to provide the plurality of precoded output bit patterns in each symbol interval.
Claim 16
Dependent Claim 52 words
The apparatus of claim 10 further comprising means for mapping each one of the number of state transitions to one of a plurality of 2N-dimensional symbols in each symbol interval, where N is an integer, whereby over a number of symbol intervals the means for mapping provides a stream of 2N-dimensional symbols.
Claim 17
Dependent Claim 57 words
Apparatus comprising means for receiving a stream of data bits at an average fractional rate of m data bits per symbol interval, where m>0, and means for trellis encoding a fractional portion of the m data bits in each symbol interval, where at least one state transition of the trellis encoder is used with a different probability.
Claim 18
Dependent Claim 57 words
Apparatus comprising means for receiving a stream of data bits at an average fractional rate of m data bits per symbol interval, where m>0, and means for trellis encoding a fractional portion of the m data bits in each symbol interval, where at least one state transition of the trellis encoder is used with a different probability.

References Cited (Backward Citations)

US4483012A Cited
US4831635A Cited
US4939555A Cited
US4901331A Cited
US4941154A Cited
US5115453A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-05-31 1996-11-30 1997-06-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-05-31 2000-11-30 2001-06-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-05-31 2004-11-30 2005-06-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag