EP0122805A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Block coded modulation system
Assignee: Motorola Solutions Inc
•
Filing: 1984-04-16
•
Granted: —
•
Expires: 2004-04-16
Abstract
Abstract A family of block coded modulation systems for achieving coding gains using easily implemented coding and decoding methods is described.
Inventors
- 👤 George D. Forney, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-29 06:21
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/25; H03M13/251; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427; H04L27/3438
Claims Analysis
Total Claims: 77
Claim 1
Independent Claim
131 words
A method for sending digital data over a band-limited channel comprising selecting a code word corresponding to a plurality of modulation signal points drawn from a constellation of available signals, the code word being selected from an available set of said code words on the basis of a block of said digital data, and the code words belonging to said available set for said block being independent of said signal points corresponding to the code word selected for any other said block, characterised in that said constellation comprises groups having equal numbers of said signals, and in that the group from which at least one said signal point for said block is drawn depends on the group from which at least one other said signal point for said block is drawn.
Claim 2
Independent Claim
131 words
A method for sending digital data over a band-limited channel comprising selecting a code word corresponding to a plurality of modulation signal points drawn from a constellation of available signals, the code word being selected from an available set of said code words on the basis of a block of said digital data, and the code words belonging to said available set for said block being independent of said signal points corresponding to the code word selected for any other said block, characterised in that said constellation comprises groups having equal numbers of said signals, and in that the group from which at least one said signal point for said block is drawn depends on the group from which at least one other said signal point for said block is drawn.
Claim 3
Dependent Claim
45 words
A method according to Claim 1, further characterised in that said signal points are two-dimensional, said code words are 2m-dimensional, m being the number of said signal points corresponding to each said code word, and each said block of said digital data comprising mN bits.
Claim 4
Independent Claim
23 words
A method according to Claims 1 or 2, further characterised in that said signals of said constellation are arranged on a rectangular grid.
Claim 5
Dependent Claim
45 words
A method according to Claim 1, further characterised in that said signals are arranged in said constellation so that the minimum squared distance between two said signals belonging to the same said group is greater than between two said signals belonging to different said groups.
Claim 6
Dependent Claim
41 words
A method according to Claim 4, further characterised in that the minimum squared distance between two said signal points belonging to the same said group is twice the minimum squared distance between two said signal points belonging to different said groups.
Claim 7
Independent Claim
45 words
A method according to any preceding claim, further characterised in that each said block comprises a plurality of bits, and in that the said groups from which said signal points for said block are drawn are determined by a single said bit of said block.
Claim 8
Dependent Claim
56 words
A method according to Claim 2, further characterised in that m-1 said signal points for each said block are drawn from among all said signals in said constellation, and the one remaining said signal point for said block is drawn from a group that depends` on the groups from which said m-1 signal points are drawn.
Claim 9
Dependent Claim
34 words
A method according to Claim 7, further characterised in that said group from which said one remaining signal point is drawn depends on a single-parity-check code based on at least one of said bits.
Claim 10
Dependent Claim
33 words
A method according to Claim 9, further characterised in that said group from which said one remaining signal point is drawn is determined on the basis of a state-transition trellis for said block.
Claim 11
Dependent Claim
40 words
A method according to Claim 2 or any of Claims 3 to 9 when appendent thereto, further characterised in that N is an integer, m is an even integer no smaller than 2, and said constellation comprises 1.5x2 N signals.
Claim 12
Dependent Claim
37 words
A method according to Claim 2 or any of Claims 3 to 9 when appendent thereto, further characterised in that N=r+1/2, r being an integer, m is no smaller than 2, and said constellation comprises 2r+1 signals.
Claim 13
Independent Claim
17 words
A method according to any of Claims 2 to 11, further characterised in that m is 2.
Claim 14
Independent Claim
61 words
A method according to any of Claims 1 to 3, further characterised in that said groups each comprise subsets having equal numbers of said signals, and in that the subset from which at least one said signal point for said block is drawn depends on the subset from which at least one other said signal point for said block is drawn.
Claim 15
Dependent Claim
48 words
A method according to Claim 13, further characterised in that said signals are arranged in said constellation so that the minimum squared distance between two signals belonging to one said subset is greater than between two said signals belonging to different said subsets within the same said group.
Claim 16
Dependent Claim
41 words
A method according to Claim 14, further characterised in that the minimum squared distance between tWo said signal points belonging to the same said subset is twice the minimum squared distance between two said signal points belonging to different said subsets.
Claim 17
Independent Claim
54 words
A method according to any of Claims 13 to 15, further characterised in that each said block comprises a plurality of bits, and the subsets from which said signal points for said block are drawn are determined based on a plurality of bits representing less than all of said digital data of said block.
Claim 18
Independent Claim
86 words
A method according to both Claims 2 and 13, further characterised in that one said signal point for each said block is drawn from among all said signals in said constellation, m-2 of said signal points are drawn from groups that depend on the group from which said one signal point is drawn, and the single remaining said signal point for said block is drawn from a subset that depends on the subsets from which said one signal point and said m-2 signal points are drawn.
Claim 19
Dependent Claim
33 words
A method according to Claim 17, further characterised in that said subset from which said single remaining signal is drawn depends on a single-parity-check code based on at least one of said bits.
Claim 20
Dependent Claim
34 words
A method according to Claim 17, further characterised in that said subsets from which said signal points for said block are drawn are determined on the basis of a state-transition trellis for said block.
Claim 21
Dependent Claim
40 words
A method according to Claim 17, further characterised in that said subsets and said groups from which said signal points for said block are drawn are determined based on a Hamming code applied to at least one of said bits.
Claim 22
Dependent Claim
35 words
A method according to any of Claims 13 to 20 when appendent to Claim 2, further characterised in that N is an integer, m is at least 4, and said constellation comprises 2N+1 said signals.
Claim 23
Dependent Claim
40 words
A method according to any of Claims 13 to 20 when appendent to Claim 2, further characterised in that N=r+1/2, r being an integer, m is an even integer no smaller than 4, and said constellation comprises 1.5×2 r+1 signals.
Claim 24
Dependent Claim
22 words
A method according to any of Claims 13 to 22 when appendent to Claim 2, further characterised in that m is 4.
Claim 25
Dependent Claim
56 words
A method according to Claim 13, further characterised in that said subsets each comprise classes having equal numbers of said signals, and in that said class from which at least one signal point for said block is drawn depends on the class from which at least one other said signal point for said block is drawn.
Claim 26
Dependent Claim
48 words
A method according to Claim 24, further characterised in that said signals are arranged in said constellation so that the minimum squared distance between two signals belonging to one said class is greater than between two said signals belonging to different said classes within the same said subset.
Claim 27
Dependent Claim
41 words
A method according to Claim 25, further characterised in that the minimum squared distance between two said signal points belonging to the same said class is twice the minimum squared distance between two said signal points belonging to different said classes.
Claim 28
Independent Claim
54 words
A method according to any of Claims 24 to 26, further characterised in that each said block comprises a plurality of bits, and the classes from which said signal points for said block are drawn are determined based on a plurality of bits representing less than all of said digital data of said block.
Claim 29
Dependent Claim
22 words
A method according to any of Claims 24 to 27, when appendent to Claim 7, further characterised in that m is 8.
Claim 30
Dependent Claim
22 words
A method according to Claim 28, further characterised in that N is an integer and said constellation comprises 1.5x2 N+l said signals.
Claim 31
Dependent Claim
22 words
A method according to Claim 28, further characterised in that N=r+1/2, r being an integer, and said constellation comprises 2 r+2 signals.
Claim 32
Dependent Claim
37 words
A method according to Claim 24, further characterised in that said classes from which said signal points for said block are drawn are determined based on a Hamming code applied to at least one of said bits.
Claim 33
Dependent Claim
56 words
A method according to Claim 24, further characterised in that said classes each comprise subclasses having equal numbers of said signals, and in that said subclass from which at least one signal point for said block is drawn depends on the subclass from which at least one other said signal point for said block is drawn.
Claim 34
Dependent Claim
48 words
A method according to Claim 32, further characterised in that said signals are arranged in said constellation so that the minimum squared distance between two signals belonging to one said subclass is greater than between two said signals belonging to different said subclasses within the same said class.
Claim 35
Dependent Claim
41 words
A method according to Claim 33, further characterised in that the minimum squared distance between two said signal points belonging to the same said subclass is twice the minimum squared distance between two said signal points belonging to different said subclasses.
Claim 36
Independent Claim
54 words
A method according to any of Claims 32 to 34, further characterised in that each said block comprises a plurality of bits, and the subclasses from which said signal points for said block are drawn are determined based on a plurality of bits representing less than all of said digital data of said block.
Claim 37
Dependent Claim
22 words
A method according to any of Claims 32 to 35, when appendent to Claim 2, further characterised in that m is 12.
Claim 38
Dependent Claim
22 words
A method according to Claim 36, further characterised in that N is an integer and said constellation comprises 2N +2 said signals.
Claim 39
Dependent Claim
37 words
A method according to Claim 33, further characterised in that said subclasses from which said signal points for said block are drawn are determined based on a Golay code applied to at least one of said bits.
Claim 40
Dependent Claim
32 words
A method according to Claim 2 or any of Claims 3 to 38 (other than Claims 10, 22 or 33 when appendent to Claim 2, further characterised in that N is 4.
Claim 41
Independent Claim
21 words
A method according to Claims 10, 22 or 33 or any Claim appendent thereto, further characterised in that N is 41.
Claim 42
Independent Claim
60 words
A method according to any preceding Claim, further characterised in that said constellation comprises quadruplets each having four said signals, the signals belonging to each said quadruplet being located at the same distance from the origin but separated by 90° intervals about said origin, said digital data comprises bits, and at least two of said bits are quadrantally differentially encoded.
Claim 43
Dependent Claim
36 words
A method according to Claim 41, further characterised in that said groups each comprise subsets having equal numbers of said signals and said four signals belonging to each quadruplet are drawn from four different said subsets.
Claim 44
Independent Claim
33 words
A method according to any preceding claim, further characterised in that decoding is conducted by deciding which code word was sent based on maximum likelihood sequence estimation in accordance with the Viterbi algorithm.
Claim 45
Independent Claim
30 words
A method according to any of Claims 1 to 40, further characterised in that all said signal points for each said code word are drawn from the same said group.
Claim 46
Dependent Claim
54 words
A method according to Claim 44, further characterised in that decoding is conducted by deciding which said code word was sent by first making a separate tentative decision based on code words whose signal points are drawn from each of said groups, and thereafter making a final decision based on said separate tentative decisions.
Claim 47
Independent Claim
42 words
A method according to any of claims 1 to 40, further characterised in that said digital data comprises bits and the selection of said signal points for a block depends on a single-parity-check code based on at least one of said bits.
Claim 48
Dependent Claim
81 words
A method according to Claim 46, further characterised in that decoding is conducted by deciding which said code word was sent by first making a tentative decision as to each signal point in said code word without regard to whether said parity check is satisfied, and accepting said tentative decisions as the final decision, either without changes if said parity check is satisfied, or after changing the least reliable one of said tentative decisions if said parity check is not satisfied.
Claim 49
Independent Claim
112 words
A method for sending a block of digital data bits over a band-limited channel using a plurality of modulation signal points drawn from a two-dimensional constellation of available signals, characterised in that said constellation comprises a plurality of inner signals, and a plurality of outer signals located farther from the origin than said inner signals, in that one bit of said digital data determines whether any of said plurality of signal points will be drawn from said outer signals, and in that if an outer signal will be drawn, at least one other bit of said digital data determines which of said plurality of signal points will be an outer signal point.
Claim 50
Independent Claim
112 words
A method for sending a block of digital data bits over a band-limited channel using a plurality of modulation signal points drawn from a two-dimensional constellation of available signals, characterised in that said constellation comprises a plurality of inner signals, and a plurality of outer signals located farther from the origin than said inner signals, in that one bit of said digital data determines whether any of said plurality of signal points will be drawn from said outer signals, and in that if an outer signal will be drawn, at least one other bit of said digital data determines which of said plurality of signal points will be an outer signal point.
Claim 51
Dependent Claim
55 words
A method according to Claim 48, further characterised in that there are 2 t said signal points, said digital data comprises at least t+l bits, there are S said inner signals and 2 S said outer signals, and t said bits determine which of said plurality of signal points will be an outer signal point.
Claim 52
Independent Claim
23 words
A method according to Claims 48 or 49, further characterised in that said signals of said constellation are arranged on a rectangular grid.
Claim 53
Independent Claim
61 words
A method according to Claims 48 to 50, further characterised in that said constellation comprises quadruplets each having four said signals, the signals belonging to each said quadruplet being located at the same distance from the origin but separated by 90 0 intervals about the origin of a signal plane, and at least two of said bits are quadrantally differentially encoded.
Claim 54
Dependent Claim
11 words
A method according to Claim 49, further characterised in that t=l.
Claim 55
Dependent Claim
20 words
A method according to Claim 52, further characterised in that said block comprises 2N+1 said bits and S is 2".
Claim 56
Dependent Claim
20 words
A method according to Claim 53, further characterised in that N of said bits determine which inner signal is drawn.
Claim 57
Dependent Claim
13 words
A method according to Claim 49, further characterised in that t is 2.
Claim 58
Dependent Claim
25 words
A method according to Claim 55, further characterised in that said block comprises 4N+1 bits and S is 2 N , N being an integer.
Claim 59
Dependent Claim
27 words
A method according to Claim 55, further characterised in that said block comprises 4N+3 bits and S is 1. 5 x2 N , N being an integer.
Claim 60
Dependent Claim
34 words
A method according to Claim 56, further characterised in that N-2 of said bits determine which said outer signal is drawn and in that N of said bits determine which inner signal is drawn.
Claim 61
Independent Claim
20 words
A method according to any of Claims 53, 54, 56, 57 or 58, further characterised in that N is 4.
Claim 62
Dependent Claim
150 words
Apparatus for sending digital data over a band-limited channel, characterised in that said apparatus comprises a code word selector for selecting code words corresponding to a plurality of modulation signal points drawn from a constellation of available signals, said code word selector being adapted to select a said code word from an available set of said code words on the basis of a block of said digital date., the code words belonging to said available set for said block being independent of said signal points corresponding to the code word selected for any other said block, and said constellation comprising groups having equal numbers of said signals, and in that said apparatus includes means for determining the group from which at least one said signal point for said block is drawn in dependence upon the group from which at least one other said signal point for said block is drawn.
Claim 63
Dependent Claim
150 words
Apparatus for sending digital data over a band-limited channel, characterised in that said apparatus comprises a code word selector for selecting code words corresponding to a plurality of modulation signal points drawn from a constellation of available signals, said code word selector being adapted to select a said code word from an available set of said code words on the basis of a block of said digital date., the code words belonging to said available set for said block being independent of said signal points corresponding to the code word selected for any other said block, and said constellation comprising groups having equal numbers of said signals, and in that said apparatus includes means for determining the group from which at least one said signal point for said block is drawn in dependence upon the group from which at least one other said signal point for said block is drawn.
Claim 64
Dependent Claim
66 words
Apparatus according to Claim 60, wherein said groups each comprise subsets having equal numbers of said signals, said apparatus being further characterised in that it comprises subset selector means adapted to select the subset from which at least one said signal point for said block is drawn in dependence upon the subset from which at least one other said signal point for said block is drawn.
Claim 65
Dependent Claim
39 words
Apparatus according to Claim 61, further characterised in that said subset selector means is adapted to determine said subsets from which said signal points for said block are drawn on the basis of a state-transition trellis for said block.
Claim 66
Dependent Claim
45 words
Apparatus according to Claim 61, further characterised in that said subset selector means is adapted to determine the subsets and the groups from which said signal points for said block are drawn based upon a Hamming code applied to at least one of said bits.
Claim 67
Dependent Claim
65 words
Apparatus according to Claim 61, wherein said subsets each comprise classes having equal numbers of said signals, said apparatus being further characterised in that it includes class selector means adapted to select said class from which at least one signal point for said block is drawn in dependence upon the class from which at least one other said signal point for said block is drawn.
Claim 68
Dependent Claim
42 words
Apparatus according to Claim 64, further characterised in that said class selector means is adapted to determine said classes from which said signal points for said block are drawn based upon a Hamming code applied to at least one of said bits.
Claim 69
Dependent Claim
65 words
Apparatus according to Claim 64, wherein said classes each comprise subclasses having equal numbers of said signals, said apparatus being further characterised in that it includes subclass selector means adapted to select said subclass from which at least one signal point for said block is drawn in dependence upon the subclass from which at least one other said signal point for said block is drawn.
Claim 70
Dependent Claim
39 words
Apparatus according to Claim 66, wherein said subclass selector means is adapted to determine said subclasses from which said signal points for said block are drawn based upon a Golay code applied to at least one of said bits.
Claim 71
Dependent Claim
40 words
Apparatus according to any of Claims 60 to 67, characterised in that it further comprises means for selecting at least one said signal point of said block on the basis of less than all said digital data in said block.
Claim 72
Dependent Claim
66 words
Decoding apparatus characterised in that it is adapted to operate in conjunction with apparatus according to any of Claims 60 to 68 to decode digital data sent over a band-limited channel, and in that said decoder includes decider means adapted to decide which code word was sent, said decider means being adapted to operate on a maximum likelihood sequence estimation in accordance with the Viterbi algorithm.
Claim 73
Dependent Claim
80 words
Decoding apparatus characterised in that it is adapted to operate in conjunction with apparatus according to any of Claims 60 to 68 to decode digital data sent over a band-limited channel, and in that said decoder includes means adapted to make tentative decisions about which signal point was sent prior to final decoding of all of the received signal points for a block, and in that said decoder includes adaptive control circuitry arranged to be responsive to said tentative decision.
Claim 74
Dependent Claim
96 words
Decoding apparatus characterised in that it is adapted to operate in conjunction with apparatus according to any of Claims 60 to 68 to decode digital data sent over a band-limited channel, and in that said apparatus includes means adapted to decide which said code word was sent, all said signal points for each said code word being drawn from the same said group, by first making a separate tentative decision based on code words whose signal points are drawn from each of said groups, and thereafter making a final decision based on said separate tentative decisions.
Claim 75
Dependent Claim
151 words
Decoding apparatus characterised in that it is adapted to operate in conjunction with apparatus according to any of Claims 60 to 68 to decode digital data sent over a band-limited channel, and in that said apparatus includes decider means adapted to decide which said code word was sent, said digital data comprising bits and the selection of said signal points for a block depending on a single-parity-check code based on at least one of said bits, which decider means includes first means for making a tentative decision as to each signal point in said code word without regard to whether said parity check is satisfied, and second means responsive to said parity check and adapted to accept said tentative decision as the final decision either without change if said parity check is satisfied or after changing the least reliable one of said tentative decisions if said parity check is not satisfied.
Claim 76
Dependent Claim
133 words
Apparatus for sending a block of digital data bits over a band-limited channel, said apparatus being characterised in that it comprises means for drawing a plurality of modulation signal points from a two-dimensional constellation of available signals which comprises a plurality of inner signals and a plurality of outer signals located further from the origin that said inner signals, and in that said apparatus comprises means responsive to one bit of said digital data for determining whether any of said plurality of signal points will be drawn from said outer signals, and in that said apparatus includes means for determining on the basis of at least one other bit of said digital data, if an outer signal will be drawn, which of said plurality of signal points will be an outer signal point.
Claim 77
Dependent Claim
133 words
Apparatus for sending a block of digital data bits over a band-limited channel, said apparatus being characterised in that it comprises means for drawing a plurality of modulation signal points from a two-dimensional constellation of available signals which comprises a plurality of inner signals and a plurality of outer signals located further from the origin that said inner signals, and in that said apparatus comprises means responsive to one bit of said digital data for determining whether any of said plurality of signal points will be drawn from said outer signals, and in that said apparatus includes means for determining on the basis of at least one other bit of said digital data, if an outer signal will be drawn, which of said plurality of signal points will be an outer signal point.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.