Patent US6127971A successfully refreshed from Google Patents.
US6127971A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Combined array processing and space-time coding
Assignee: AT&T Inc
•
Filing: 1998-07-14
•
Granted: 2000-10-03
•
Expires: 2018-07-14
Abstract
Abstract Enhanced performance is realized in a wireless transmission arrangement that is subject to fading by employing a perspective that combines array signal processing with channel coding. Specifically, in accordance with our invention, antennas at the transmitter are partitioned into small groups, and individual space-time codes are used to transmit information from each group of antennas. At the receiver, an individual space-time code is decoded by a linear array processing technique that suppresses signals transmitted by other groups of antennas by treating them as interference.
Inventors
- 👤 Arthur Robert Calderbank
- 👤 Ayman F. Naguib
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:42
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/02; H04L1/06; H04L1/0618; H04B; H04B7/00; H04B7/02; H04B7/04; H04B7/06; H04B7/0613; H04B7/0667; H04B7/0669; H04B7/08; H04B7/0837; H04B7/0842; H04B7/086; H04B7/0848
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
89 words
A method for transmitting signal over n antennas comprising the steps of: partitioning the antennas into q groups, where each group has n k antennas, where at least for some value of k n k ≧2, and ##EQU10## partitioning a frame of bits into q bit-groups of B bits each, where each bit-group has B k bits and ##EQU11## encoding each bit-group of B k bits with coder C k to develop n k symbols; and transmitting the n k symbols over respective one of said n k antennas.
Claim 2
Independent Claim
89 words
A method for transmitting signal over n antennas comprising the steps of: partitioning the antennas into q groups, where each group has n k antennas, where at least for some value of k n k ≧2, and ##EQU10## partitioning a frame of bits into q bit-groups of B bits each, where each bit-group has B k bits and ##EQU11## encoding each bit-group of B k bits with coder C k to develop n k symbols; and transmitting the n k symbols over respective one of said n k antennas.
Claim 3
Dependent Claim
29 words
The method of claim 1 where said C k is a component code of a product code C 1 ×C 2 ×, . . . , ×C q .
Claim 4
Dependent Claim
13 words
The method of claim 1 where said C k is a trellis code.
Claim 5
Independent Claim
86 words
A method for decoding signals received over m receiving antennas comprising the steps of: receiving a signal at each of the receiving antenna, partitioning the m receiving antennas into q groups, decoding the signals received by the antennas of a group k with code C k , where codes C 1 , C 2 , . . . ,C q for component codes of a product code C 1 ×C 2 ×, . . . , ×C q , while suppressing signals from other component codes.
Claim 6
Independent Claim
86 words
A method for decoding signals received over m receiving antennas comprising the steps of: receiving a signal at each of the receiving antenna, partitioning the m receiving antennas into q groups, decoding the signals received by the antennas of a group k with code C k , where codes C 1 , C 2 , . . . ,C q for component codes of a product code C 1 ×C 2 ×, . . . , ×C q , while suppressing signals from other component codes.
Claim 7
Dependent Claim
57 words
The method of claim 4 where the signal received at each of the receiving antennas corresponds to a collection of signals transmitted from q groups of transmitting antennas, and where group k of transmitting antennas transmits n k symbols that result from encoding a block of B k bits with a coder employing code C k .
Claim 8
Dependent Claim
22 words
The method of claim 4 where said decoding for receiving antenna group k is independent of decoding for receiving antenna group j≠k.
Claim 9
Dependent Claim
23 words
The method of claim 4 where said decoding for receiving antenna group k is responsive to outputs decoded for receiving antenna groups j<k.
Claim 10
Dependent Claim
45 words
The method of claim 7 where, in decoding for receiving antenna group k, the contribution to the signal received at the antennas of group k from signal decoded for receiving antenna groups j<k is subtracted from the signal received at the antennas of group k.
Claim 11
Dependent Claim
72 words
A transmitter comprising: means for partitioning an applied frame of B bits into q bit-groups where bit-group k has B k bits and ##EQU12## q encoders, with encoder k, k=1,2, . . . ,q, being responsive to bit-group k, where the encoder k encodes the B k bits into n k symbols; and means for transmitting each of the symbols developed by said q encoders out of n transmitting antennas, where ##EQU13##10.
Claim 12
Dependent Claim
72 words
A transmitter comprising: means for partitioning an applied frame of B bits into q bit-groups where bit-group k has B k bits and ##EQU12## q encoders, with encoder k, k=1,2, . . . ,q, being responsive to bit-group k, where the encoder k encodes the B k bits into n k symbols; and means for transmitting each of the symbols developed by said q encoders out of n transmitting antennas, where ##EQU13##10.
Claim 13
Dependent Claim
23 words
The transmitter of claim 9 where said q encoders develop n symbols and the n-th symbol is transmitted by the n-th transmitting antenna.
Claim 14
Dependent Claim
18 words
The transmitter of claim 10 where the n symbols are transmitted out of the n transmitting antennas simultaneously.
Claim 15
Dependent Claim
13 words
The transmitter of claim 9 where said means for transmitting includes a modulator.
Claim 16
Dependent Claim
38 words
The transmitter of claim 9 where each of said q encoders employs an encoding code C k that is a component code of a product code C 1 ×C 2 ×, . . . , ×C q .
Claim 17
Dependent Claim
15 words
The transmitter of claim 13 where each code said C k is a trellis code.
Claim 18
Dependent Claim
41 words
A receiver comprising: in antennas coupled to m receivers, q processing units, each coupled to m k of said receivers, where m k is an integer such that ##EQU14## and means for combining output signals decoded by said q processing units.
Claim 19
Dependent Claim
41 words
A receiver comprising: in antennas coupled to m receivers, q processing units, each coupled to m k of said receivers, where m k is an integer such that ##EQU14## and means for combining output signals decoded by said q processing units.
Claim 20
Dependent Claim
39 words
The receiver of claim 15 where each of said processing unit includes a decoder employing a codeC k that is a component code of a product code C 1 ×C 2 ×, . . . , ×C q .
Claim 21
Dependent Claim
31 words
The receiver of claim 15 where processing unit k subtracts a computed contribution to signals received at antennas coupled to said processing unit k of signals detected by processing units j<k.
Claim 22
Dependent Claim
14 words
The receiver of claim 16 where said code C k is a trellis code.
Claim 23
Independent Claim
64 words
A method for transmitting signal over n antennas comprising the steps of: in response to an applied frame of signals, developing q streams of codewords, where q is less than n, where the streams of codewords are independent of each other, and where the codewords within a stream are correlated to each other; and transmitting the S streams of codewords over said n antennas.
Claim 24
Independent Claim
64 words
A method for transmitting signal over n antennas comprising the steps of: in response to an applied frame of signals, developing q streams of codewords, where q is less than n, where the streams of codewords are independent of each other, and where the codewords within a stream are correlated to each other; and transmitting the S streams of codewords over said n antennas.
Claim 25
Dependent Claim
25 words
The method of claim 19 where each stream of codewords k is transmitted by a group of said antennas having n k antennas and ##EQU15##
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) | 2003-10-03 | 2004-04-03 | 2004-10-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-03 | 2008-04-03 | 2008-10-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-03 | 2012-04-03 | 2012-10-03 | $7700.00 | Window Closed / Lapsed |