Patent US5825816A successfully refreshed from Google Patents.
US5825816A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Spectral and power shaping mapper for high data rate signalling
Assignee: General Datacomm Inc
•
Filing: 1997-05-05
•
Granted: 1998-10-20
•
Expires: 2017-05-05
Abstract
Abstract A spectral and power shaping mapper for high data rate signaling modem is provided. Based on data rates and other criteria, groups of incoming bits are grouped together, with a first subgroup of bits being used to generate two sign vectors, a second subgroup of bits being used in conjunction with an appended bit to generate two magnitude manipulation vectors, and a third subgroup of bits being used in a modulus converter to generate a plurality of quotients (rk). The quotients and magnitude manipulation vectors are used to select two or more sequences of constellation points from a multidimensional constellation. The sequences of selected points are combined with the sign vectors to generate four sequences of octets for a shaping selector. The shaping selector, preferably in the form of a convolutional encoder state machine uses criteria such as lowest cost paths and/or lowest average power in order to select which sequence of octets to output.
Inventors
- 👤 Paul Dana Cole
- 👤 Yuri Goldstein
- 👤 Yuri Okunev
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 15:47
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3411; H04B; H04B14/00; H04B14/02; H04B14/023; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4917; H04L25/4927
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
209 words
A PAM mapper, comprising: a) memory means for storing indications of at least one PAM constellation; and b) code generation means coupled to said memory means, said code generation means including (i) grouping logic means for taking a group of incoming bits, for dividing said group of incoming bits into a first subgroup of bits, a second subgroup of bits, and a third subgroup of bits, (ii) means for receiving said second subgroup of bits, for appending at least one bit to said second subgroup of bits, and generating therefrom at least two magnitude manipulation vectors; (iii) means for receiving said third subgroup of bits and generating at least one integer value therefrom, (iv) point selector means for receiving said at least two magnitude manipulation vectors and said at least one integer value, and for selecting at least two sequences of at least one indication of a constellation point each from said at least one PAM constellation, and (v) a shaping selector means for receiving said at least two sequences and for receiving at least one sign vector which is a function of said first subgroup of bits, said shaping selector means for selecting for output one combination from at least two combinations of said sequences and sign vector.
Claim 2
Dependent Claim
209 words
A PAM mapper, comprising: a) memory means for storing indications of at least one PAM constellation; and b) code generation means coupled to said memory means, said code generation means including (i) grouping logic means for taking a group of incoming bits, for dividing said group of incoming bits into a first subgroup of bits, a second subgroup of bits, and a third subgroup of bits, (ii) means for receiving said second subgroup of bits, for appending at least one bit to said second subgroup of bits, and generating therefrom at least two magnitude manipulation vectors; (iii) means for receiving said third subgroup of bits and generating at least one integer value therefrom, (iv) point selector means for receiving said at least two magnitude manipulation vectors and said at least one integer value, and for selecting at least two sequences of at least one indication of a constellation point each from said at least one PAM constellation, and (v) a shaping selector means for receiving said at least two sequences and for receiving at least one sign vector which is a function of said first subgroup of bits, said shaping selector means for selecting for output one combination from at least two combinations of said sequences and sign vector.
Claim 3
Dependent Claim
61 words
A PAM mapper according to claim 1, wherein: said code generation means further comprises means for receiving said first subgroup of bits and generating therefrom two different sign vectors, said two different sign vectors and said at least two sequences providing at least four combinations, said shaping selector means for selecting for output one combination from said at least four combinations.
Claim 4
Dependent Claim
59 words
A PAM mapper according to claim 1, wherein: said means for receiving said third subgroup of bits comprises a arithmetic unit means for taking a value representing said third subgroup of bits, and dividing said value by at least one divisor to obtain at least one quotient, said at least one quotient constituting said at least one integer value.
Claim 5
Dependent Claim
82 words
A PAM mapper according to claim 3, wherein: said point selector means includes means for manipulating said at least one integer value and said at least two magnitude manipulation vectors according to p k =N k h k +r k +C where C is a constant, N k is an integer, h k is a function of said magnitude manipulation vectors, r k is said at least one quotient, and p k is an index to said at least one constellation point.
Claim 6
Dependent Claim
41 words
A PAM mapper according to claim 1, wherein: said means for receiving said second subgroup of bits comprises means for XORing an assemblage of said second subgroup of bits and said at least one appended bit with a predetermined binary vector.
Claim 7
Dependent Claim
38 words
A PAM mapper according to claim 5, wherein: a bit of said predetermined binary vector which is XORed with said appended bit of said assemblage has a binary value other than a binary value of said appended bit.
Claim 8
Dependent Claim
45 words
A PAM mapper according to claim 2, wherein: said means for receiving said first subgroup of bits and generating therefrom two different sign vectors comprises means for XORing a first of said sign vectors with a predetermined binary vector to obtain a second sign vector.
Claim 9
Dependent Claim
30 words
A PAM mapper according to claim 7, wherein: said means for receiving said first subgroup of bits comprises a differential encoder means for generating said first of said sign vectors.
Claim 10
Dependent Claim
19 words
A PAM mapper according to claim 1, wherein: said shaping se lector means comprises a convolutional encoder state machine.
Claim 11
Dependent Claim
18 words
A PAM mapper according to claim 9, wherein: said shaping selector means further comprises an octet-to-μ-law-value look-up table.
Claim 12
Dependent Claim
25 words
A PAM mapper according to claim 9, wherein: said shaping selector means selects said one combination for output based on at least one specified criterion.
Claim 13
Dependent Claim
25 words
A PAM mapper according to claim 11, wherein: said at least one specified criterion comprises a lowest maximum absolute value of a running digital sum.
Claim 14
Dependent Claim
19 words
A PAM mapper according to claim 11, wherein: said at least one specified criterion comprises a lowest average power.
Claim 15
Dependent Claim
19 words
A PAM mapper according to claim 12, wherein: said at least one specified criterion comprises a lowest average power.
Claim 16
Dependent Claim
43 words
A PAM mapper according to claim 1, wherein: said memory means for storing indications of at least one PAM constellation stores indications of a plurality of PAM constellations including at least one N-dimensional PAM constellation, wherein N is an integer greater than one.
Claim 17
Dependent Claim
23 words
A PAM mapper according to claim 15, further comprising: constellation controller means coupled to said grouping logic means and to said memory means.
Claim 18
Independent Claim
154 words
A method for mapping a plurality of bits to generate an output, comprising: a) grouping a plurality of bits together into a group of bits; b) taking a first subgroup of bits from said group of bits and generating at least one sign vector therefrom; c) taking a second subgroup of bits from said group of bits, appending at least one bit thereto, and generating a plurality of magnitude manipulation vectors therefrom; d) taking a third subgroup of bits and generating at least one integer value therefrom; e) utilizing said at least one integer value and said plurality of magnitude manipulation vectors to select a plurality of sequences of constellation point indications; f) combining said plurality of sequences of constellation point indications with said at least one sign vector to obtain at least two combinations; and g) selecting for output one combination from said at least two combinations of said sequences and sign vector.
Claim 19
Independent Claim
154 words
A method for mapping a plurality of bits to generate an output, comprising: a) grouping a plurality of bits together into a group of bits; b) taking a first subgroup of bits from said group of bits and generating at least one sign vector therefrom; c) taking a second subgroup of bits from said group of bits, appending at least one bit thereto, and generating a plurality of magnitude manipulation vectors therefrom; d) taking a third subgroup of bits and generating at least one integer value therefrom; e) utilizing said at least one integer value and said plurality of magnitude manipulation vectors to select a plurality of sequences of constellation point indications; f) combining said plurality of sequences of constellation point indications with said at least one sign vector to obtain at least two combinations; and g) selecting for output one combination from said at least two combinations of said sequences and sign vector.
References Cited (Backward Citations)
US5436930A
Cited
US5696794A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-19 | 2002-04-20 | 2002-10-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-19 | 2006-04-20 | 2006-10-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-19 | 2010-04-20 | 2010-10-20 | $7700.00 | Window Closed / Lapsed |