Patent US5822371A successfully refreshed from Google Patents.
US5822371A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Mapper for high data rate signalling
Assignee: PCTel Inc
•
Filing: 1997-02-14
•
Granted: 1998-10-13
•
Expires: 2017-02-14
Abstract
Abstract A pulse amplitude modulated (PAM) mapper includes a constellation matrix memory which stores indications of a plurality of different constellations, wherein at least one of the different stored constellations is of different dimension than another of the stored constellations. The constellations are used individually or together to support a plurality of different modem data rates. In a preferred embodiment, in addition to the constellation matrix memory, the mapper includes a logic block, a constellation controller, a PAM code generation block, and an output register. The logic block receives incoming bits of information, groups the bits as a function of the desired or agreed upon bit rate as indicated by the constellation controller, and provides a plurality of each group of bits to the PAM code generation block, and one or more sign bits to the output register. The PAM code generation block uses the provided bits to choose at least one point from one of the constellations, and uses each chosen constellation point to generate a seven-bit PAM code (typically mu -law or A-law code value) word. Each seven-bit output is provided to the output register, and together with associated sign bits generates output bytes. Algorithms are provided for choosing multiple points from the 2D and higher dimensional constellations from provided groups of bits.
Inventors
- 👤 Yuri Goldstein
- 👤 Yuri Okunev
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 08:48
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3411; H04B; H04B14/00; H04B14/02; H04B14/023; H04B14/04; H04B14/046; H04B14/048; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4917; H04L25/4927
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
178 words
A PAM mapper, comprising: a) a constellation matrix memory means for storing indications of a plurality of different PAM constellations having different numbers of constellation points; b) means for receiving and storing incoming bits and for grouping the incoming bits into a group of bits based on a data bit rate of the PAM mapper, a first subgroup of said group of bits comprising at least one sign bit; c) code generation means coupled to said means for receiving and storing and to said constellation matrix memory means, said code generation means for receiving a second subgroup of said group of bits, for using said second subgroup to identify an indication of a constellation point in a selected of said plurality of different PAM constellations, and for generating PAM output code based on said indication; and d) output means coupled to said means for receiving and storing and to code generation means, said output means for receiving said at least one sign bit and for receiving said output code, and for forming at least one output byte therefrom.
Claim 2
Dependent Claim
178 words
A PAM mapper, comprising: a) a constellation matrix memory means for storing indications of a plurality of different PAM constellations having different numbers of constellation points; b) means for receiving and storing incoming bits and for grouping the incoming bits into a group of bits based on a data bit rate of the PAM mapper, a first subgroup of said group of bits comprising at least one sign bit; c) code generation means coupled to said means for receiving and storing and to said constellation matrix memory means, said code generation means for receiving a second subgroup of said group of bits, for using said second subgroup to identify an indication of a constellation point in a selected of said plurality of different PAM constellations, and for generating PAM output code based on said indication; and d) output means coupled to said means for receiving and storing and to code generation means, said output means for receiving said at least one sign bit and for receiving said output code, and for forming at least one output byte therefrom.
Claim 3
Dependent Claim
108 words
A mapper according to claim 1, wherein: at least one of said plurality of different PAM constellations is a two-dimensional constellation, said means for receiving, storing, and grouping, includes means for grouping fifteen bits together as a group of bits, with said first subgroup comprising two sign bits, and said code generation means uses said second subgroup of bits to identify two indications of constellation points selected from said two-dimensional constellation, said two indications being used to generate two PAM output codes, and said output means receives said two sign bits, and receives bits of said two PAM output codes, and forms first and second output bytes therefrom.
Claim 4
Dependent Claim
80 words
A mapper according to claim 2, wherein: said address computation means includes means for dividing a value of said second subgroup of bits by L, where L is a positive integer representing the number of positive points in said two-dimensional constellation, to obtain a quotient and a remainder, wherein said quotient is used to identify a first of said two indications of constellation points, and said remainder is used to identify a second of said two indications of constellation points.
Claim 5
Dependent Claim
19 words
A mapper according to claim 3, wherein: said second subgroup comprises thirteen bits, and L is equal to 91.
Claim 6
Dependent Claim
132 words
A mapper according to claim 1, wherein: at least one of said plurality of different PAM constellations is an N-dimensional constellation, N being a positive integer greater than one, said means for receiving, storing, and grouping, includes means for grouping x bits together as a group of bits, x being a positive integer greater than three, with said first subgroup comprising N of said group of x bits, and said code generation means uses the remaining x-N bits as said second subgroup to identify N indications of constellation points selected from said N-dimensional constellation, said N indications being used to generate N PAM output codes, and said output means receives said first subgroup of N sign bits, and receives bits of said N PAM output codes, and forms N output bytes therefrom.
Claim 7
Dependent Claim
118 words
A mapper according to claim 5, wherein: said address computation means includes means for dividing a value of said plurality of bits by L N-m , and for dividing remainders by L N-m where L is a positive integer corresponding to the number of positive points in said N-dimensional constellation, and m is a dummy variable originally set to one and incremented by one upon each division operation by said means for dividing for said plurality of bits, to obtain quotients and remainders, wherein each quotient is used to identify one of said N indications of constellation points, and said remainder, when N-m equals one, is used to identify an N'th of said N indications of constellation points.
Claim 8
Dependent Claim
57 words
A mapper according to claim 1, further comprising: control means coupled to said means for receiving, storing, and grouping, for sequentially indicating to said means for receiving, storing, and grouping how many bits are to be grouped together, wherein specific of said plurality of PAM constellations are sequentially utilized based on how many bits are grouped together.
Claim 9
Dependent Claim
27 words
A mapper according to claim 7, wherein: said control means for sequentially indicating, indicates how many bits are to be grouped together based on a repeating frame.
Claim 10
Dependent Claim
57 words
A mapper according to claim 5, further comprising: control means coupled to said means for receiving, storing, and grouping, for sequentially indicating to said means for receiving, storing, and grouping how many bits are to be grouped together, wherein specific of said plurality of PAM constellations are sequentially utilized based on how many bits are grouped together.
Claim 11
Dependent Claim
27 words
A mapper according to claim 9, wherein: said control means for sequentially indicating, indicates how many bits are to be grouped together based on a repeating frame.
Claim 12
Dependent Claim
30 words
A mapper according to claim 5, wherein: said plurality of different PAM constellations includes at least one one-dimensional constellation, at least one two-dimensional constellation, and at least one four-dimensional constellation.
Claim 13
Dependent Claim
64 words
A mapper according to claim 11, wherein: a first of said plurality of different PAM constellations is an 182-point 2D constellation, a second of said plurality of different PAM constellations is a 128-point 1D constellation, a third of said plurality of different PAM constellations is a 64-point 1D constellation, and a fourth of said plurality of different PAM constellations is a 108-point 4D constellation.
Claim 14
Dependent Claim
64 words
A mapper according to claim 11, wherein: a first of said plurality of different PAM constellations is an 92-point 2D constellation, a second of said plurality of different PAM constellations is a 128-point 1D constellation, a third of said plurality of different PAM constellations is a 64-point 1D constellation, and a fourth of said plurality of different PAM constellations is a 78-point 4D constellation.
Claim 15
Dependent Claim
19 words
A mapper according to claim 11, wherein: said plurality of different PAM constellations includes at least one eight-dimensional constellation.
Claim 16
Dependent Claim
78 words
A mapper according to claim 1, wherein: said code generation means comprises a PAM code memory means for storing μ-law or A-law code which constitutes said PAM output code, and an address computation means for using said second subgroup to identify an indication of a constellation point in a selected of said plurality of different PAM constellations and for using said indication to select a location in said PAM code memory means which provides said PAM output code.
Claim 17
Dependent Claim
136 words
A PAM mapper, comprising: a) a constellation matrix memory means for storing indications of a plurality of different PAM constellations having different numbers of constellation points, wherein a first of said different PAM constellations is of a first dimension, and a second of said different PAM constellations is of a second dimension different than said first dimension; b) code generation means coupled to said constellation matrix memory means, said code generation means for using said indications to generate μ-law or A-law code value outputs; c) means for grouping incoming bits into a group of bits, with a first subgroup of at least one of said group of bits representing at least one sign bit, and a second subgroup of said group of bits indicating at least one of said indications in said constellation matrix memory means.
Claim 18
Dependent Claim
136 words
A PAM mapper, comprising: a) a constellation matrix memory means for storing indications of a plurality of different PAM constellations having different numbers of constellation points, wherein a first of said different PAM constellations is of a first dimension, and a second of said different PAM constellations is of a second dimension different than said first dimension; b) code generation means coupled to said constellation matrix memory means, said code generation means for using said indications to generate μ-law or A-law code value outputs; c) means for grouping incoming bits into a group of bits, with a first subgroup of at least one of said group of bits representing at least one sign bit, and a second subgroup of said group of bits indicating at least one of said indications in said constellation matrix memory means.
Claim 19
Dependent Claim
49 words
A mapper according to claim 16, further comprising: d) output means coupled to said means for grouping and to said code generation means, said output means for receiving said first subgroup and for receiving bits generated by said code generation means, and forming at least one output byte therefrom.
Claim 20
Dependent Claim
102 words
A mapper according to claim 16, wherein: at least one of said plurality of different PAM constellations is an N-dimensional constellation, N being an integer greater than one, said means for grouping groups x bits together as a group of bits, x being a positive integer greater than N, with a first subgroup of N of said group of x bits being sign bits, and a second subgroup comprising the remainder of said group of x bits identifying N indications of constellation points selected from said N-dimensional constellation, said N indications being used to generate N μ-law or A-law code value outputs.
Claim 21
Independent Claim
131 words
A method for mapping a plurality of incoming bits into PAM code outputs, comprising: a) grouping a plurality of said incoming bits into a group of x bits based on a desired data rate, x being a positive integer greater than four; b) choosing a first subgroup of N bits of said x bits as sign bits, where N is a positive integer greater than one and less than x; c) utilizing a second subgroup of the remaining x-N bits in order to choose N indications of a multidimensional constellation having L positive points, where 2 x-N ≦L N ; d) utilizing said N indications to choose N PAM code values; e) using sand N PAM code values with said first subgroup of N bits to provide said PAM code outputs.
Claim 22
Independent Claim
131 words
A method for mapping a plurality of incoming bits into PAM code outputs, comprising: a) grouping a plurality of said incoming bits into a group of x bits based on a desired data rate, x being a positive integer greater than four; b) choosing a first subgroup of N bits of said x bits as sign bits, where N is a positive integer greater than one and less than x; c) utilizing a second subgroup of the remaining x-N bits in order to choose N indications of a multidimensional constellation having L positive points, where 2 x-N ≦L N ; d) utilizing said N indications to choose N PAM code values; e) using sand N PAM code values with said first subgroup of N bits to provide said PAM code outputs.
Claim 23
Dependent Claim
86 words
A method according to claim 19, wherein: said step of utilizing a second subgroup comprises repetitively dividing a digital value represented by said second subgroup of bits by L N-m , where m is a variable which takes values from 1 to N-1 sequentially, until N-m equals 1, to obtain at least one quotient and a remainder, wherein a first of said at least one quotient is used to select a first of said indications, and said remainder is used to select another of said indications.
References Cited (Backward Citations)
US4791654A
Cited
US5150381A
Cited
US5493586A
Cited
US5321725A
Cited
US5394437A
Cited
US5406583A
Cited
WO1995015924A1
Cited
US5528625A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-12 | 2002-04-13 | 2002-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-12 | 2006-04-13 | 2006-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-12 | 2010-04-13 | 2010-10-13 | $7700.00 | Window Closed / Lapsed |