US6178196B1 — Combined interference cancellation and maximum li…

Claim 1

Independent Claim 138 words

A method for decoding a set of M signals received at an input interface from a plurality of terminal units that transmit on a given channel, comprising the steps of: processing said M signals, received over L time intervals, where L is an integer, with signals having components related to channel coefficients between transmitting points of said terminal units and an input interface, to detect signals transmitted from each of said terminal units by canceling interference from K of said terminal units, where M and K are integers such that M≧2 and K≦M, and to identity probable signals transmitted by said terminal units through maximum likelihood detection; and applying signals developed through said maximum likelihood detection to a location, from which the signals may be applied to post processing that culminates in signals adapted for delivery to users.

Claim 2

Independent Claim 138 words

A method for decoding a set of M signals received at an input interface from a plurality of terminal units that transmit on a given channel, comprising the steps of: processing said M signals, received over L time intervals, where L is an integer, with signals having components related to channel coefficients between transmitting points of said terminal units and an input interface, to detect signals transmitted from each of said terminal units by canceling interference from K of said terminal units, where M and K are integers such that M≧2 and K≦M, and to identity probable signals transmitted by said terminal units through maximum likelihood detection; and applying signals developed through said maximum likelihood detection to a location, from which the signals may be applied to post processing that culminates in signals adapted for delivery to users.

Claim 3

Dependent Claim 13 words

The method of claim 1 where transmissions of said terminal units are synchronized.

Claim 4

Dependent Claim 26 words

The method of claim 1 where each of the K terminal units employs at least two transmitting antennas, and said input interface includes M receiving antennas.

Claim 5

Dependent Claim 30 words

The method of claim 1 where each of the K terminal units employs N transmitting antennas, where N is greater than 1, and said input interface includes M receiving antennas.

Claim 6

Dependent Claim 59 words

The method of claim 4 , where said interference canceling involves algebraic operations carried out on said M received signals with said signals having components related to channel coefficients between transmitting points of said terminal units, to form a plurality of signals, each of which is substantially unrelated to signals sent by all but one of the terminal units.

Claim 7

Dependent Claim 10 words

The method of claim 4 where said K=M=2 and 1≦N≦2.

Claim 8

Dependent Claim 171 words

The method of claim 6 where said processing comprises multiplying said vector of received signals by conditioning matrix [ I - G 1  G 2 - 1 - H 2  H 1 - 1 I ] , , where H 1 = [ h 11 h 12 h 12 * - h 11 * ] , G 1 = [ g 11 g 12 g 12 * - g 11 * ] ,  H 2 = [ h 21 h 22 h 22 * - h 21 * ] , G 2 = [ g 21 g 22 g 22 * - g 21 * ] , , I is the diagonal matrix, h ij is a channel coefficient estimate between a transmitting antenna i of a first transmitting unit and a receive antenna j of said M receiving antennas, and g ij is a channel coefficient estimate between a transmitting antenna i of a second transmitting unit and a receive antenna j of said M receiving antennas.

Claim 9

Dependent Claim 7 words

The method of claim 7 where L=2.

Claim 10

Dependent Claim 62 words

The method of claim 7 where said maximum likelihood detection minimizes a metric ∥{tilde over (r)} 1 −{tilde over (H)}·{circumflex over (c)}∥ 2 over all potential code vectors {circumflex over (c)}, where {tilde over (r)} 1 is one of said plurality of signals formed by said step of multiplying, and {tilde over (H)}=H 1 −G 1 G 2 −1 H 2 .

Claim 11

Dependent Claim 14 words

The method of claim 9 where said maximum likelihood detection develops an uncertainty measure.

Claim 12

Dependent Claim 25 words

The method of claim 10 where the uncertainty measure is given by Δ c =∥{tilde over (r)} 1 −{tilde over (H)}·{circumflex over (c)}∥ 2 .

Claim 13

Dependent Claim 304 words

The method of claim 6 where said processing executes a subroutine ZF.DECODE(r x ,r y ,H x ,H y ,G x ,G y ) which returns an output {circumflex over (c)} by executing the following calculations {tilde over (r)}=r x −G x G y −1 r y , {tilde over (H)}=H x −G x G y −1 H y , and c ^ = arg   min cεC     r ~ - H ~ · c x    2 , where r x is the first argument of the ZF.DECODE subroutine and corresponds to a vector of signals received over said L time intervals at receiving antenna x, r y is the second argument of the ZF.DECODE subroutine and corresponds to a vector of signals received over said L time intervals at receiving antenna y, H x is the third argument of the ZF.DECODE subroutine and corresponds to a matrix comprising channel coefficients between transmitting antenna x of a first terminal unit and said M receiving antennas, H y is the fourth argument of the ZF.DECODE subroutine and corresponds to a matrix comprising channel coefficients between transmitting antenna y of said first terminal unit and said M receiving antennas, G x is the fifth argument of the ZF.DECODE subroutine and corresponds to a matrix comprising channel coefficients between transmitting antenna x of a second terminal unit and said M receiving antennas, G y is the sixth argument of the ZF.DECODE subroutine and corresponds to a matrix comprising channel coefficients between transmitting antenna y of said second terminal unit and said M receiving antennas, and {circumflex over (c)} is a selected code vector c from a set of code vectors C as the code transmitted by the terminal related to the second and third arguments of the ZF.DECODE subroutine.

Claim 14

Dependent Claim 54 words

The method of claim 12 where said processing comprises executing the ZF.DECODE subroutine a first time with argument (r 1 ,r 2 ,H 1 ,H 2 ,G 1 ,G 2 ), and executing the ZF.DECODE subroutine a second time with argument (r 2 ,r 1 ,H 2 ,H 1 ,G 2 ,G 1 ).

Claim 15

Dependent Claim 163 words

The detector of claim 13 where said conditioning matrix is [ I - G 1  G 2 - 1 - H 2  H 1 - 1 I ] , where   H 1 = [ h 11 h 12 h 12 * - h 11 * ] ,  G 1 = [ g 11 g 12 g 12 * - g 11 * ] , H 2 = [ h 21 h 22 h 22 * - h 21 * ] , G = [ g 21 g 22 g 22 * - g 21 * ] , , I is the diagonal matrix, h ij is a channel coefficient estimate between a transmitting antenna i of a first transmitting unit and a receive antenna j of said M receiving antennas, and g ij is a channel coefficient estimate between a transmitting antenna i of a second transmitting unit and a receive antenna j of said M receiving antennas.

Claim 16

Dependent Claim 18 words

The detector of claim 14 where said processor also performs maximum likelihood detection on said plurality of signals.

Claim 17

Dependent Claim 14 words

The detector of claim 15 , where said input interface comprises M receiving antennas.

Claim 18

Dependent Claim 33 words

The method of claim 12 where said subroutine ZF.DECODE also returns an uncertainty measure output Δ c by carrying out the calculation Δ c =∥{tilde over (r)}−{tilde over (H)}·{circumflex over (c)}∥ 2 .

Claim 19

Dependent Claim 197 words

The method of claim 17 where said processing comprises the steps of: executing the ZF.DECODE subroutine a first time, with argument (r 1 ,r 2 ,H 1 ,H 2 ,G 1 ,G 2 ), to obtain a first version of a probable vector signal of a first terminal unit, {circumflex over (c)} 0 , and a measure of uncertainty, Δ c,0 ; obtaining a first version of a probable vector signal of a second terminal unit, {circumflex over (s)} 0 , and a measure of uncertainty Δ s,0 ; executing the ZF.DECODE subroutine a second time, with argument (r 2 ,r 1 ,G 2 ,G 1 ,H 2 ,H 1 ), to obtain a second version of a probable vector signal of the second terminal unit, {circumflex over (s)} 0 , and a measure of uncertainty, Δ s,1 ; obtaining a second version of a probable vector signal of a first terminal unit, {circumflex over (c)} 0 , and a measure of uncertainty Δ c,1 ; selecting said first version of said probable vector signals if (Δ c,0 +Δ s,0 )<(Δ c,1 +Δ s,1 ), and selecting said second version of said probable vector signal based otherwise.

Claim 20

Dependent Claim 118 words

The method of claim 1 where M>2 and K>2, and where said processing comprises the steps of: combining said M received signals for form a signal that is essentially independent of transmissions of all but one of the terminal units, performing a maximum likelihood detection to identify a probably signal vector transmitted by said one of the terminal units, modifying remaining ones of said M received signals to account for contribution of the probable signals vector, and returning to said step of combining as long as there is a terminal unit whose transmission is to be detected, to select another one of said terminal units whose signal is to be detected with said step of maximum likelihood detection.

Claim 21

Dependent Claim 415 words

The method of claim 1 where M>2 and K>2, and where said processing comprises executing a subroutine ( c ^ , Δ ) = G_ZFDECODE  ( { r m } 1 ≤ m ≤ M , { H km } 1 ≤ k ≤ K , 1 ≤ m ≤ M ) {     r m ( 0 ) = r m , 1 ≤ m ≤ M     H k , m ( 0 ) = H k , m , 1 ≤ m ≤ M , 1 ≤ k ≤ K    for   j = 1 → K - 1    M j = M - j , K j = K - j    for   i = 1 → M j    r i ( j ) = r i ( j - 1 ) - H K j  j ( j - 1 )  ( H K j , M j ( j - 1 ) ) +  r M j ( j - 1 )    H k , j ( j ) = H k , i ( j - 1 ) - H K j , m ( j - 1 )  ( H K j , M j ( j - 1 ) ) +  H k , M j ( j - 1 ) , 1 ≤ k ≤ K j    end    end    c ^ = arg   min c ^ 1  εC  ∑ m = 1 M - K + 1      r m ( K - 1 ) - H 1 , m ( K - 1 ) · c ^    2    Δ = ∑ m = 1 M - K + 1      r m ( K - 1 ) - H 1 , m ( K - 1 ) · c ^    2  }  where r m (a) is a received signal at antenna m, as modified in step (a); H k,m (a) is a matrix of channel coefficients between terminal unit k and receive antenna m, at step a; and (H k,m (a) ) + is the generalized inverse of H k,m (a) .

Claim 22

Dependent Claim 35 words

The method of claim 1 where said processing form a vector of signals from said M signals and said processing includes pre-multiplying said vector by a preconditioning matrix having components related to said channel coefficients.

Claim 23

Dependent Claim 20 words

The method of claim 21 where said components of the conditioning matrix are related to estimates of said channel coefficients.

Claim 24

Dependent Claim 114 words

A detector responsive to M received signals, where M≧2, from a plurality of terminal units and canceling interference from K of said terminal units, where K≦M, comprising: a processor for transforming said M received signals through algebraic operations involving components related to channel coefficients between transmitting antennas of said terminal units and said M received signal to form a plurality of signals, to each of which is substantially unrelated to signals sent by all but one of the terminal units, where M, N, and K are positive integers, and to perform maximum likelihood detection calculations on said plurality of signals; and a memory coupled to said processor for storing information for controlling said processor.

Claim 25

Dependent Claim 114 words

A detector responsive to M received signals, where M≧2, from a plurality of terminal units and canceling interference from K of said terminal units, where K≦M, comprising: a processor for transforming said M received signals through algebraic operations involving components related to channel coefficients between transmitting antennas of said terminal units and said M received signal to form a plurality of signals, to each of which is substantially unrelated to signals sent by all but one of the terminal units, where M, N, and K are positive integers, and to perform maximum likelihood detection calculations on said plurality of signals; and a memory coupled to said processor for storing information for controlling said processor.

Claim 26

Dependent Claim 39 words

The detector of claim 23 where said processor, in the course of forming one of said signals from said M received signals, substantially nullifies contribution of transmissions from terminals for which a probably transmitted signal vector has been selected.

Claim 27

Dependent Claim 31 words

The detector of claim 24 where each execution of said subroutine develops one of said signals that is substantially unrelated to signals sent by all but one of the terminal units.

Claim 28

Dependent Claim 293 words

The detector of claim 23 where said processor: forms a first version of a first of said plurality of signals, selects a first version of a probable transmitted signal vector of a first of said terminals, and evaluates a first uncertainty measure, then forms a first version of a second of said plurality of signals and in the course of said forming said first version of said second of said plurality of signals nullifies contribution of transmissions of said first version of a probable transmitted signal vector of said first of said terminals, selects a first version of a probable transmitted signal vector of a second of said terminals, and evaluates a second uncertainty measure, then forms a second version of said second of said plurality of signals, without said nullifying, selects a second version of a probable transmitted signal vector of said second of said terminals, and evaluates a third uncertainty measure, then forms a second version of said first of said plurality of signals and in the course of said forming said second version of said first of said plurality of signals nullifies contribution of transmissions of said second version of a probable transmitted signal vector of said second terminal, selects a second version of a probable transmitted signal vector of said first of said terminals, and evaluates a fourth uncertainty measure, then forms a first combination involving said first and second uncertainty measures, forms a second combination involving said third and fourth uncertainty measures, and selects either said first version or said second version of the probable transmitted signal vector of said first of said terminals and the probable transmitted signal vector of said second of said terminals based on whether said first combination is greater than said second combination.

Claim 29

Dependent Claim 15 words

The detector of claim 26 where said subroutine is executed not less than K times.

Claim 30

Dependent Claim 7 words

The detector of claim 23 where M=N=K=2.

Claim 31

Dependent Claim 10 words

The detector of claim 23 where M>2, and K>2 .

Claim 32

Dependent Claim 10 words

The detector of claim 23 where M>2, K>2, and N>2.

Claim 33

Dependent Claim 19 words

The detector of claim 23 where the processor also estimates parameters of channel through which said M signals traverse.

Claim 34

Dependent Claim 28 words

The detector of claim 23 further comprising a subroutine stored in said memory and executed by said processor, which subroutine performs said transforming of said M received signals.

Claim 35

Dependent Claim 34 words

The detector of claim 23 further comprising a subroutine stored in said memory and executed by said processor, which subroutine performs said transforming of said M received signals, followed by a maximum likelihood detection.

Claim 36

Dependent Claim 12 words

The detector of claim 23 further comprising means for estimating channel parameters.

Claim 37

Dependent Claim 46 words

The detector of claim 23 where said processor forms said plurality of signals by forming a vector from said M received signals and pre-multiplying said vector by a conditioning matrix of coefficients that are related to channel coefficients between said transmitting antennas and an input interface.

Claim 38

Dependent Claim 135 words

A detector responsive to M received signals, where M≧2, from a plurality of terminal units and canceling interference from K of said terminal units, where K≦M, comprising: a first means responsive to said M received signals, for transforming said M received signals through algebraic operations involving components related to channel coefficients between transmitting antennas of said terminal units and said M received signal to form a plurality of signals, each of which is substantially unrelated to signals sent by all but one of the terminal units, where M, N, and K are positive integers; a second means, responsive to said first means, for performing maximum likelihood detection calculations on said plurality of signals; and means for applying information developed by said second means to a location accessible for further processing and delivery to a user.

Claim 39

Dependent Claim 135 words

A detector responsive to M received signals, where M≧2, from a plurality of terminal units and canceling interference from K of said terminal units, where K≦M, comprising: a first means responsive to said M received signals, for transforming said M received signals through algebraic operations involving components related to channel coefficients between transmitting antennas of said terminal units and said M received signal to form a plurality of signals, each of which is substantially unrelated to signals sent by all but one of the terminal units, where M, N, and K are positive integers; a second means, responsive to said first means, for performing maximum likelihood detection calculations on said plurality of signals; and means for applying information developed by said second means to a location accessible for further processing and delivery to a user.

Claim 40

Dependent Claim 19 words

The detector of claim 23 where the processor also calculates an uncertainty measure associated with each maximum likelihood detection.

Claim 41

Dependent Claim 22 words

The detector of claim 27 further comprising M antennas and amplification and demodulation circuitry interposed between said M antennas and said processor.

Claim 42

Dependent Claim 45 words

The detector of claim 23 where said processor forms said plurality of signals one at a time, and with each formed signal of said plurality of signals the processor selects a probable transmitted signal vector of one of said terminals and evaluates an uncertainty measure.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2004-01-23	2004-07-24	2005-01-23	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2008-01-23	2008-07-24	2009-01-23	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2012-01-23	2012-07-24	2013-01-23	$7700.00	Window Closed / Lapsed

Combined interference cancellation and maximum likelihood decoding of space-time block codes

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag