US4922507A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiple trellis coded modulation
Assignee: California Institute of Technology
•
Filing: 1987-12-01
•
Granted: 1990-05-01
•
Expires: 2007-12-01
Abstract
Abstract A technique for designing trellis codes to minimize bit error performance for a fading channel. The invention provides a criteria which may be used in the design of such codes which is significantly different from that used for average white Gaussian noise channels. The method of multiple trellis coded modulation of the present invention comprises the steps of: (a) coding b bits of input data into s intermediate outputs; (b) grouping said s intermediate outputs into k groups of si intermediate outputs each where the summation of all si,s is equal to s and k is equal to at least 2; (c) mapping each of said k groups of intermediate outputs into one of a plurality of symbols in accordance with a plurality of modulation schemes, one for each group such that the first group is mapped in accordance with a first modulation scheme and the second group is mapped in accordance with a second modulation scheme; and (d) outputting each of said symbols to provide k output symbols for each b bits of input data.
Inventors
- 👤 Marvin K. Simon
- 👤 Dariush Divsalar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 05:08
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/18; H04L27/186
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
132 words
The method of multiple trellis coded modulation comprising the steps of: (a) coding b bits of input data into s intermediate outputs; (b) grouping said s intermediate outputs into k groups of s i intermediate outputs each where the summation of all s i 's is equal to s and k is equal to at least 2; (c) mapping each of said k groups of intermediate outputs into one of a plurality of symbols in accordance with a plurality of modulation schemes, one for each group such that the first group is mapped in accordance with a first modulation scheme and the second group is mapped in accordance with a second modulation scheme; and (d) outputting each of said symbols to provide k output symbols for each b bits of input data.
Claim 2
Independent Claim
132 words
The method of multiple trellis coded modulation comprising the steps of: (a) coding b bits of input data into s intermediate outputs; (b) grouping said s intermediate outputs into k groups of s i intermediate outputs each where the summation of all s i 's is equal to s and k is equal to at least 2; (c) mapping each of said k groups of intermediate outputs into one of a plurality of symbols in accordance with a plurality of modulation schemes, one for each group such that the first group is mapped in accordance with a first modulation scheme and the second group is mapped in accordance with a second modulation scheme; and (d) outputting each of said symbols to provide k output symbols for each b bits of input data.
Claim 3
Dependent Claim
31 words
The method of claim 1 including the step of assigning a plurality of said symbols to each of said k groups of intermediate outputs in response to the signals provided thereby.
Claim 4
Dependent Claim
26 words
The method of claim 2 wherein said grouping step includes the step of storing said b input bits in a memory having at least two states.
Claim 5
Dependent Claim
46 words
The method of claim 3 wherein the step of assigning a plurality of symbols to each of said k groups of intermediate outputs includes the step of assigning said symbols to minimize the probability of bit error associated therewith by maximizing the free Euclidean distance thereof.
Claim 6
Dependent Claim
64 words
The method of claim 4 wherein the step of assigning symbols to each of said k groups of intermediate outputs includes the steps of: (a) providing a first assignment tree representative of symbol assignments for k=1 and (b) taking the k-fold cartesian product of said assignment tree with itself to provide said plurality of symbols for each of said k groups of intermediate outputs.
Claim 7
Dependent Claim
57 words
The method of claim 5 wherein the step of assigning a plurality of symbols to each of said k groups of intermediate outputs includes the step of assigning said symbols to minimize the probability of bit error associated therewith by maximizing a quantity L equal to the length of a shortest event error path through said trellis.
Claim 8
Dependent Claim
65 words
The method of claim 6 wherein the step of assigning said symbols to minimize the probability of bit error by maximizing a quantity L includes the step of maximizing the number of nonzero pairwise Euclidean squared distances d 2 between the symbols along branches of the shortest event error path through a trellis representing said symbol with those of the correct path through said trellis.
Claim 9
Dependent Claim
75 words
The method of claim 7 including the step of assigning symbols to minimize the probability of bit error P b given by: P.sub.b =(C/b)[(1+K)e.sup.-K /(E.sub.b /N.sub.o)].sup.L where E b /N o represents bit energy-to-noise ratio, K is a channel parameter which represents the ratio of power received directly to that received indirectly, b is the number of input bits to the encoder, and C is a constant that relates to the product of the distances.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-04-30 | 1993-10-30 | 1994-05-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-04-30 | 1997-10-30 | 1998-05-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-04-30 | 2001-10-30 | 2002-05-01 | $7700.00 | Window Closed / Lapsed |