Patent EP0086091A2 successfully refreshed from Google Patents.
EP0086091A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Apparatus and method for signal processing
Assignee: AT&T Inc
•
Filing: 1983-02-03
•
Granted: —
•
Expires: 2003-02-03
Abstract
Abstract An n-dimensional channel code is used in a data transmission system. The alphabet of codewords (data symbols) comprises a subset of points of a selected coset of a selected lattice. The alphabet includes at least one point of the coset whose norm (signal energy) is greater than at least one other point of the coset which is excluded from the alphabet.
Inventors
- 👤 Allen Gersho
- 👤 Victor Bernard Lawrence
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-02 13:33
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
112 words
Signal processing apparatus comprised of means for receiving a sequence of signal indications each having one of M predetermined values, means for generating for each of said signal indications, as a function of its value, a signal representing a particular member of a predetermined n-dimensional alphabet, CHARACTERIZED BY said alphabet being comprised of M points of a selected coset of a selected n-dimensional lattice, n > 2, and at least one of said M points having a norm which is greater than the norm of at least one other point of said coset which is not included in said alphaet, and means for applying each signal thus generated to a communication channel.
Claim 2
Dependent Claim
112 words
Signal processing apparatus comprised of means for receiving a sequence of signal indications each having one of M predetermined values, means for generating for each of said signal indications, as a function of its value, a signal representing a particular member of a predetermined n-dimensional alphabet, CHARACTERIZED BY said alphabet being comprised of M points of a selected coset of a selected n-dimensional lattice, n > 2, and at least one of said M points having a norm which is greater than the norm of at least one other point of said coset which is not included in said alphaet, and means for applying each signal thus generated to a communication channel.
Claim 3
Dependent Claim
26 words
Apparatus according to claim 1, CHARACTERIZED IN THAT the coset is comprised of all points in n-space whose coordinates are either all even or all odd.
Claim 4
Dependent Claim
88 words
Apparatus according to claim 1, CHARACTERIZED IN THAT M = 256 and n = 4 and said alphabet comprises the basic points (1 1 1 1), (2 0 0 0), (2 2 0'0), (2 2 2 0), (3 1 1 1), (2 2 2 2) and (3 3 1 1), every distinct permutation of the coordinates of each of said basic points and every distinct point formed by changing the sign of any one or more of the coordinates of said basic points and each of said permutations.
Claim 5
Dependent Claim
109 words
Apparatus according to claim 1, CHARACTERIZED IN THAT the coset comprises a plurality of groups of coset points, each of said groups comprising a respective basic point, every distinct permutation of the components of said basic point, and every distinct point formed by changing the sign of any one or more of the components of said basic point and of each said permutation, wherein said alphabet includes predetermined ones of said groups and wherein the norm of at least one of the groups included in said alphabet is greater than the norm of at least one of the groups of said coset which is not included in said alphabet.
Claim 6
Dependent Claim
39 words
Apparatus according to any one of the preceding claims, CHARACTERIZED IN THAT the signal comprises a succession of double sideband-quadrature carrier pulses, each of said pulses representing a respective pair of components of said particular member of the alphabet.
Claim 7
Dependent Claim
108 words
Method for processing a received sequence of signal indications each having one of M predetermined values, comprising the steps of generating for each of said signal indications, as a function of its value, a signal representing a particular member of a predetermined n-dimensional alphabet, CHARACTERIZED BY said alphabet being comprised of M point of a selected coset of a selected n-dimensional lattice, n > 2, and at least one of said M points having a norm which is greater than the norm of at least one other point of said coset which is not included in said alphabet, and applying each signal thus generated to a communication channel.
Claim 8
Dependent Claim
108 words
Method for processing a received sequence of signal indications each having one of M predetermined values, comprising the steps of generating for each of said signal indications, as a function of its value, a signal representing a particular member of a predetermined n-dimensional alphabet, CHARACTERIZED BY said alphabet being comprised of M point of a selected coset of a selected n-dimensional lattice, n > 2, and at least one of said M points having a norm which is greater than the norm of at least one other point of said coset which is not included in said alphabet, and applying each signal thus generated to a communication channel.
Claim 9
Dependent Claim
26 words
Method according to claim 6, CHARACTERIZED IN THAT the coset is comprised of all points in n-space whose coordinates are either all even or all odd.
Claim 10
Dependent Claim
89 words
Method according to claim 6, CHARACTERIZED IN THAT M = 256 and n = 4 and said alphabet comprises the basic points (1 1 1 1), (2 0 0 0), (2 2 0 0), (2 2 2 0), (3 1 1 1), (2 2 2 2) and (3 3 1 1), every distinct permutation of the coordinates of said basic points and every distinct point formed by changing the sign of any one or more of the coordinates of each of said basic points and each of said permutations.
Claim 11
Dependent Claim
111 words
1 9. Method according to claim 6, CHARACTERIZED IN THAT the coset comprises a plurality of groups of coset points, each of said groups comprising a respective basic point, every distinct permutation of the components of said basic point, and every distinct point formed by changing the sign of any one or more of the components of said basic point and of each said permutation, wherein said alphabet includes predetermined ones of said groups and wherein the norm of at least one of the groups included in said alphabet is greater than the norm of at least one of the groups of said coset which is not included in said alphabet.
Claim 12
Dependent Claim
38 words
Method according to any one of claims 6-9, CHARACTERIZED IN THAT the signal comprises a succession of double sideband-quadrature carrier pulses, each of said pulses representing a respective pair of components of said particular member of the alphabet.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.