US20090092087A1 - Multi-antenna transmission for spatial division multiple access - Google Patents

Multi-antenna transmission for spatial division multiple access Download PDF

Info

Publication number
US20090092087A1
US20090092087A1 US12/172,979 US17297908A US2009092087A1 US 20090092087 A1 US20090092087 A1 US 20090092087A1 US 17297908 A US17297908 A US 17297908A US 2009092087 A1 US2009092087 A1 US 2009092087A1
Authority
US
United States
Prior art keywords
data symbol
transmitting entity
symbol streams
technique
steering vector
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US12/172,979
Inventor
J. Rodney Walton
John W. Ketchum
John Edward Smee
Mark S. Wallace
Steven J. Howard
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Priority to US12/172,979 priority Critical patent/US20090092087A1/en
Assigned to QUALCOMM INCORPORATED reassignment QUALCOMM INCORPORATED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SMEE, JOHN EDWARD, HOWARD, STEVEN J., KETCHUM, JOHN W., WALLACE, MARK S., WALTON, J. RODNEY
Publication of US20090092087A1 publication Critical patent/US20090092087A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7107Subtractive interference cancellation
    • H04B1/71072Successive interference cancellation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/309Measuring or estimating channel quality parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0408Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas using two or more beams, i.e. beam diversity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0417Feedback systems
    • H04B7/0421Feedback systems utilizing implicit feedback, e.g. steered pilot signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0426Power distribution
    • H04B7/043Power distribution using best eigenmode, e.g. beam forming or beam steering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0619Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal using feedback from receiving side
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0678Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission using different spreading codes between antennas
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0697Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using spatial multiplexing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/02Channels characterised by the type of signal
    • H04L5/023Multiplexing of multicarrier modulation signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24Cell structures
    • H04W16/28Cell structures using beam steering

Definitions

  • the present invention relates generally to data communication, and more specifically to multi-antenna transmission for spatial division multiple access (SDMA) in a multiple-input multiple-output (MIMO) communication system.
  • SDMA spatial division multiple access
  • MIMO multiple-input multiple-output
  • a MIMO system employs multiple (NT) transmit antennas and multiple (NR) receive antennas for data transmission.
  • a MIMO channel formed by the NT transmit and NR receive antennas may be decomposed into NS spatial channels, where N S ⁇ min ⁇ N T , N R ⁇ .
  • the NS spatial channels may be used to transmit NS independent data streams to achieve greater overall throughput.
  • an access point can communicate with one or more user terminals at any given moment. If the access point communicates with a single user terminal, then the NT transmit antennas are associated with one transmitting entity (either the access point or the user terminal), and the NR receive antennas are associated with one receiving entity (either the user terminal or the access point).
  • the access point can also communicate with multiple user terminals simultaneously via SDMA. For SDMA, the access point utilizes multiple antennas for data transmission and reception, and each of the user terminals typically utilizes one antenna for data transmission and multiple antennas for data reception.
  • Some key challenges for SDMA in a multiple-access MIMO system are (1) selecting the proper set of user terminals for simultaneous transmission and (2) transmitting data to and/or from each selected user terminal in a manner to achieve good system performance. There is therefore a need in the art for techniques to efficiently support SDMA for a multiple-access MIMO system.
  • an uplink channel response matrix is obtained for each active user terminal (e.g., a terminal desiring to transmit on the uplink) and decomposed to obtain a steering vector for the user terminal.
  • Each user terminal uses its steering vector for spatial processing to transmit on the uplink, if selected for uplink transmission.
  • An “effective” uplink channel response vector is formed for each user terminal based on the steering vector and the uplink channel response matrix for the user terminal.
  • each scheduling interval e.g., each time slot
  • multiple sets of active user terminals are formed and evaluated based on their effective channel response vectors (or their channel response matrices) to determine the best set of N up user terminals for uplink transmission in that scheduling interval. For example, the user set with the highest overall throughput may be selected.
  • the spatial signatures of the user terminals as well as multi-user diversity are exploited to select a set of “spatially compatible” user terminals for simultaneous transmission on the uplink, as described below.
  • the same or different number of user terminals may be selected for uplink transmission in different scheduling intervals.
  • Each user terminal selected for uplink transmission processes its data stream in accordance with the underlying wireless technology (e.g., CDMA, OFDM, or TDMA) to obtain a data symbol stream.
  • Each user terminal further performs spatial processing on its data symbol stream with its steering vector to obtain a set of transmit symbol streams, one transmit symbol stream for each antenna at the user terminal.
  • Each user terminal then transmits its transmit symbol streams from its multiple antennas and via its MIMO channel to the access point.
  • the N up selected user terminals simultaneously transmit their N up data symbol streams (e.g., one data symbol stream for each terminal) via their respective MIMO channels to the access point.
  • the access point obtains multiple received symbol streams from its multiple antennas.
  • the access point then performs receiver spatial processing on the received symbol streams in accordance with a linear or non-linear receiver spatial processing technique to recover the N up data symbol streams transmitted by the N up selected user terminals, as described below.
  • FIG. 1 shows a multiple-access MIMO system
  • FIG. 2 shows a process for performing multi-antenna transmission on the uplink for SDMA
  • FIG. 3 shows a process for evaluating and selecting user terminals for simultaneous transmission on the uplink
  • FIG. 4 shows a block diagram of an access point and two user terminals
  • FIGS. 5A and 5B show block diagrams of transmit (TX) data processors for CDMA and OFDM, respectively;
  • FIG. 6 shows the spatial processing at the access point and one user terminal for downlink and uplink transmission
  • FIG. 7 shows a receive spatial processor and a receive data processor
  • FIG. 8 shows a controller and a scheduler at the access point.
  • the multi-antenna transmission techniques described herein may be used in combination with various wireless technologies such as CDMA, OFDM, TDMA, and so on. Multiple user terminals can concurrently transmit/receive data via different (1) orthogonal code channels for CDMA, (2) time slots for TDMA, or (3) subbands for OFDM.
  • a CDMA system may implement IS-2000, IS-95, IS-856, Wideband-CDMA (W-CDMA), or some other standards.
  • An OFDM system may implement IEEE 802.11 or some other standards.
  • a TDMA system may implement GSM or some other standards. These various standards are known in the art.
  • the spatial processing for multi-antenna transmission may be performed on top of (either before or after) the data processing for the underlying wireless technology, as described below.
  • FIG. 1 shows a multiple-access MIMO system 100 with access points and user terminals.
  • An access point is generally a fixed station that communicates with the user terminals and may also be referred to as a base station or some other terminology.
  • a user terminal may be fixed or mobile and may also be referred to as a mobile station, a wireless device, or some other terminology.
  • Access point 110 may communicate with one or more user terminals 120 at any given moment on the downlink and uplink.
  • the downlink i.e., forward link
  • the uplink i.e., reverse link
  • a user terminal may also communicate peer-to-peer with another user terminal.
  • a system controller 130 couples to and provides coordination and control for the access points.
  • System 100 employs multiple transmit and multiple receive antennas for data transmission on the downlink and uplink.
  • Access point 110 is equipped with Nap antennas and represents the multiple-input (MI) for downlink transmissions and the multiple-output (MO) for uplink transmissions.
  • a set of N u selected user terminals 120 collectively represents the multiple-output for downlink transmissions and the multiple-input for uplink transmissions.
  • MI multiple-input
  • MO multiple-output
  • N u selected user terminals 120 collectively represents the multiple-output for downlink transmissions and the multiple-input for uplink transmissions.
  • For pure SDMA it is desired to have N ap ⁇ N u ⁇ 1 if the data symbol streams for the N u user terminals are not multiplexed in code, frequency, or time by some means.
  • N u may be greater than Nap if the data symbol streams can be multiplexed using different code channels with CDMA, disjoint sets of subbands with OFDM, and so on.
  • Each selected user terminal transmits user-specific data to and/or receives user-specific data from the access point.
  • each selected user terminal may be equipped with one or multiple antennas (i.e., N ut ⁇ 1).
  • the N u selected user terminals can have the same or different number of antennas.
  • System 100 may be a time division duplex (TDD) system or a frequency division duplex (FDD) system.
  • TDD time division duplex
  • FDD frequency division duplex
  • the downlink and uplink share the same frequency band.
  • the downlink and uplink use different frequency bands.
  • MIMO system 100 may also utilize a single carrier or multiple carriers for transmission. For simplicity, the following description assumes that (1) system 100 is a single-carrier system and (2) each user terminal is equipped with multiple antennas. For clarity, data transmission on the uplink is described below.
  • An uplink MIMO channel formed by the Nap antennas at the access point and the N ut,m antennas at a given user terminal m may be characterized by an N ap ⁇ N ut,m channel response matrix H up,m , which may be expressed as:
  • H _ up , m [ h 1 , 1 h 1 , 2 ... h 1 , N ut , m h 2 , 1 h 2 , 2 ... h 2 , N ut , m ⁇ ⁇ ⁇ ⁇ h N ap , 1 h N ap , 2 ... h N ap , N ut , m ] , Eq ⁇ ⁇ ( 1 )
  • the uplink channel response matrix H ap,m for user terminal m may be “diagonalized” using either singular value decomposition or eigenvalue decomposition to obtain Nm eigenmodes of H up,m .
  • the singular value decomposition of H up,m may be expressed as:
  • U up,m is an N ap ⁇ N ap unitary matrix of left eigenvectors of H up,m ;
  • the eigenvalue decomposition of a correlation matrix of H up,m may be expressed as:
  • R up,m is the N ut,m ⁇ N ut,m correlation matrix of H up,m ;
  • the columns of V up,m are the right eigenvectors of H up,m as well as the eigenvectors of R up,m .
  • the right eigenvectors of H up,m are also referred to as “steering” vectors and may be used for spatial processing by user terminal m to transmit data on the Nm eigenmodes of H up,m .
  • the eigenmodes may be viewed as orthogonal spatial channels obtained through decomposition.
  • the diagonal matrix ⁇ up,m contains non-negative real values along the diagonal and zeros elsewhere. These diagonal entries are known as the singular values of H up,m and represent the channel gains for the Nm eigenmodes of H up,m .
  • the singular values in ⁇ up,m are also the square roots of the eigenvalues in ⁇ up,m .
  • the singular values in ⁇ up,m may be ordered from largest to smallest, and the eigenvectors in V up,m may be ordered correspondingly.
  • the principal (i.e., dominant) eigenmode is the eigenmode associated with the largest singular value in ⁇ up,m , which is the first singular value after the ordering.
  • the eigenvector for the principal eigenmode of H up,m is the first column of V up,m after the ordering and is denoted as v up,m .
  • N up user terminals can transmit data concurrently on the uplink to the access point.
  • Each user terminal performs spatial processing on its data using a steering vector, which may be derived (1) based on the eigenvector v up,m for the principal eigenmode of the wireless channel for that terminal or (2) in some other manner.
  • Each of the N up user terminals can transmit data on the principal eigenmode of its uplink MIMO channel using either “beam-forming” or “beam-steering”, as described below.
  • each user terminal m spatially processes its data symbol stream ⁇ s up,m ⁇ with its steering vector V up,m to obtain N ut,m transmit symbol streams, as follows:
  • s up,m is a data symbol to be transmitted by user terminal m
  • the received symbols obtained for each user terminal m may be expressed as:
  • r up,m is an N ap ⁇ 1 vector with N ap received symbols obtained from the N ap access point antennas for user terminal m;
  • the access point can recover the N up data symbol streams transmitted by the N up user terminals using various receiver processing techniques such as a channel correlation matrix inversion (CCMI) technique (which is also commonly referred to as a zero-forcing technique), a minimum mean square error (MMSE) technique, a successive interference cancellation (SIC) technique, and so on.
  • CCMI channel correlation matrix inversion
  • MMSE minimum mean square error
  • SIC successive interference cancellation
  • the access point performs receiver spatial processing as follows:
  • AWGN additive white Gaussian noise
  • SNR signal-to-noise-and-interference ratio
  • P ut,m is the transmit power used by user terminal m
  • MMSE criterion For the MMSE technique, a spatial filter matrix M mmse is derived such that the mean square error between the estimated data vector from the MMSE spatial filter and the data vector s up is minimized.
  • This MMSE criterion may be expressed as:
  • M mmse is the N up ⁇ N ap spatial filter matrix for the MMSE technique.
  • the MMSE spatial filter matrix M mmse is derived as:
  • the spatial filter matrix M mmse contains N up rows for N up MMSE spatial filter row vectors for the N up user terminals.
  • G [ H up,eff H up,eff H + ⁇ n 2 I ] 1 .
  • the access point performs receiver spatial processing as follows:
  • the SNR of the recovered data symbol stream ⁇ mmse,m ⁇ for each user terminal m may be expressed as:
  • the access point can process the N ap received symbol streams using the SIC technique to recover the N up data symbol streams.
  • the access point initially performs spatial processing on the N ap received symbol streams (e.g., using CCMI, MMSE, or some other technique) and obtains one recovered data symbol stream.
  • the access point then processes (e.g., demodulates/symbol demaps, deinterleaves, and decodes) this recovered data symbol stream to obtain a decoded data stream.
  • the access point next estimates the interference this stream causes to the other N up ⁇ 1 data symbol streams and cancels the estimated interference from the N ap received symbol streams to obtain N ap modified symbol streams.
  • the access point then repeats the same processing on the N ap modified symbol streams to recover another data symbol stream.
  • the input (i.e., received or modified) symbol streams for stage l may be expressed as:
  • Equation (13) assumes that the data symbol streams recovered in the l ⁇ 1 prior stages are canceled.
  • the dimensionality of the effective channel response matrix H up,eff successively reduces by one column for each stage as a data symbol stream is recovered and canceled.
  • stage l the l ⁇ 1 data symbol streams recovered in the prior stages are given indices of ⁇ j 1 j 2 . . . j l ⁇ 1 ⁇ , and the N nr data symbol streams not yet recovered are given indices of ⁇ j l j l+1 . . . j N up ⁇ .
  • the access point derives an N nr ⁇ N ap spatial filter matrix M sic l based on the reduced effective channel response matrix H up,eff l (instead of the original matrix H up,eff ) using the CCMI, MMSE, or some other technique. Since H up,eff l is different for each stage, the spatial filter matrix M sic l is also different for each stage.
  • the access point multiplies the vector r sic l for the N ap modified symbol streams with the spatial filter matrix M sic l to obtain a vector ⁇ tilde over (s) ⁇ sic l for N nr detected symbol streams, as follows:
  • the access point selects one of the N nr detected symbol streams for recovery, where the selection criterion may be based on SNR and/or other factors. For example, the detected symbol stream with the highest SNR among the N nr detected symbol streams may be selected for recovery. Since only one data symbol stream is recovered in each stage, the access point can simply derive one 1 ⁇ N ap spatial filter row vector m j l l for the data symbol stream ⁇ s up,j l ⁇ to be recovered in stage l.
  • the row vector m j l l is one row of the matrix M sic l .
  • the spatial processing for stage l to recover the data symbol stream ⁇ s up,j l ⁇ may be expressed as:
  • the access point scales the detected symbol stream ⁇ tilde over (s) ⁇ up,j l ⁇ to obtain a recovered data symbol stream ⁇ up,j l ⁇ and further demodulates, deinterleaves, and decodes this stream ⁇ up,j l ⁇ to obtain a decoded data stream ⁇ circumflex over (d) ⁇ up,j l ⁇ .
  • the access point also forms an estimate of the interference this stream causes to the other data symbol streams not yet recovered.
  • the access point re-encodes, interleaves, and modulates the decoded data stream ⁇ circumflex over (d) ⁇ up,j l ⁇ in the same manner as performed at user terminal j l and obtains a stream of “remodulated” symbols ⁇ tilde over (s) ⁇ up,j l ⁇ , which is an estimate of the data symbol stream ⁇ s up,j l ⁇ just recovered.
  • the access point then spatially processes the remodulated symbol stream with the effective channel response vector h up,eff,j l for user terminal j l to obtain a vector i j l with N ap interference components caused by this stream.
  • the N ap interference components i j l are then subtracted from the N ap modified symbol streams r sic l for stage l to obtain N ap modified symbol streams r sic l
  • 1 for the next stage l+1, i.e., r sic l+1 r sic l ⁇ i j l .
  • the modified symbol streams r sic l+1 represent the streams that would have been received by the access point if the data symbol stream ⁇ s up,j l ⁇ had not been transmitted (i.e., assuming that the interference cancellation was effectively performed).
  • the access point processes the N ap received symbol streams in N up successive stages. For each stage, the access point (1) performs receiver spatial processing on either the N ap received symbol streams or the N ap modified symbol streams from the preceding stage to obtain one recovered data symbol stream, (2) processes this recovered data symbol stream to obtain a corresponding decoded data stream, (3) estimates and cancels the interference due to this stream, and (4) obtains N ap modified symbol streams for the next stage. If the interference due to each data stream can be accurately estimated and canceled, then later recovered data streams experience less interference and may be able to achieve higher SNRs.
  • the SNR of each recovered data symbol stream is dependent on (1) the spatial processing technique (e.g., CCMI or MMSE) used for each stage, (2) the specific stage in which the data symbol stream is recovered, and (3) the amount of interference due to data symbol streams recovered in subsequent stages.
  • the SNR progressively improves for data symbol streams recovered in later stages because the interference from data symbol streams recovered in prior stages is canceled. This then allows higher rates to be used for data symbol streams recovered later.
  • each user terminal m performs spatial processing with a normalized steering vector ⁇ tilde over (v) ⁇ up,m , which is derived using the phase information in the steering vector v up,m .
  • the normalized steering vector ⁇ tilde over (v) ⁇ up,m may be expressed as:
  • the N ut,m elements of ⁇ tilde over (v) ⁇ up,m have equal magnitude.
  • Each user terminal m spatially processes its data symbol stream ⁇ s up,m ⁇ with its normalized steering vector ⁇ tilde over (v) ⁇ up,m to obtain N ut,m transmit symbol streams, as follows:
  • the constant A in equation (16) may be selected such that the total energy of the N ut,m transmit symbols in the vector ⁇ tilde over (x) ⁇ up,m is unity or some other selected value.
  • the N ap ⁇ 1 effective uplink channel response vector ⁇ tilde over (h) ⁇ up,eff,m for each user terminal m with beam-steering may be expressed as:
  • the access point can perform receiver spatial processing using the CCMI, MMSE, or SIC technique described above, or some other technique.
  • the spatial filter matrix is derived with the matrix ⁇ tilde over (H) ⁇ up,eff instead of the matrix H up,eff .
  • FIG. 2 shows a process 200 for performing multi-antenna transmission on the uplink for SDMA.
  • an uplink channel response matrix H up,m is obtained for each active user terminal desiring to transmit on the uplink (block 210 ).
  • the matrix H up,m for each user terminal is decomposed to obtain a steering vector v up,m or ⁇ tilde over (v) ⁇ up,m for the user terminal (block 212 ).
  • An effective uplink channel response vector h up,eff,m is formed for each user terminal based on the steering vector and the uplink channel response matrix for the user terminal (block 214 ).
  • Blocks 210 through 214 are for channel estimation and decomposition and may be performed by the access point, the user terminals, or both.
  • Different sets of active user terminals are formed and evaluated based on their effective uplink channel response vectors h up,eff,m or their uplink channel response matrices H up,m (block 220 ).
  • the evaluation may be performed as described below.
  • the best set of Nup user terminals is selected for transmission (also block 220 ).
  • the rate to use by each selected user terminal (which is obtained from the evaluation in block 220 ) is sent to the user terminal (block 222 ).
  • Blocks 220 and 222 are for user scheduling and are typically performed by the access point.
  • Each selected user terminal performs spatial processing on its data symbol stream ⁇ s up,m ⁇ with its steering vector v up,m or ⁇ tilde over (v) ⁇ up,m and transmits N ut,m transmit symbol streams from its N ut,m antennas and via its MIMO channel to the access point (block 230 ).
  • the N up selected user terminals simultaneously transmit their N up data symbol streams via their MIMO channels to the access point.
  • Block 230 is for data transmission and is performed by each selected user terminal.
  • the access point obtains Nap received symbol streams from its Nap antennas (block 240 ).
  • the access point then performs receiver spatial processing on the Nap received symbol streams in accordance with the CCMI, MMSE, SIC, or some other technique to obtain N up recovered data symbol streams, which are estimates of the N up data symbol streams transmitted by the N up selected user terminals (block 242 ).
  • Blocks 240 and 242 are for data reception and are performed by the access point.
  • Multiple user terminals can be selected for simultaneous transmission on the uplink.
  • the user selection may be based on various factors. Some factors may relate to system constraints and requirements such as quality of service, maximum latency, average data rate, and so on. These factors may need to be satisfied for each user terminal. Other factors may relate to system performance, which may be quantified by overall system throughput or some other indication of performance.
  • a scheduling scheme can evaluate user terminals for transmission based on one or more metrics and one or more factors. Different scheduling schemes may use different metrics, take into account different factors, and/or weigh the metrics and factors differently.
  • different sets of user terminals can be evaluated in accordance with the scheduling scheme.
  • the “spatial signatures” of the individual user terminals e.g., their MIMO channel responses
  • multi-user diversity can be exploited to select the “best” set of “spatially compatible” user terminals for simultaneous transmission.
  • Spatial compatibility may be quantified by a metric such as overall throughput or some other measure of performance.
  • the best user set may be the one that achieves the highest score for the metric (e.g., the highest overall throughput) while conforming to the system constraints and requirements.
  • N act user terminals are active and desire to transmit data on the uplink.
  • FIG. 3 shows a process 220 a for evaluating and selecting user terminals for transmission on the uplink.
  • Process 220 a represents a specific scheduling scheme and may be used for block 220 in FIG. 2 .
  • a variable R max for the highest overall throughput is set to zero (block 310 ).
  • a new set of user terminals is selected from among the N act active user terminals (block 312 ).
  • An effective uplink channel response matrix H up,eff,n is formed for user set n with the effective uplink channel response vectors h up,eff,u n,1 through h up,eff,u n,N up for the N up user terminals in set n (block 314 ).
  • the SNR for each user terminal in set n is then computed based on the effective uplink channel response matrix H up,eff,n and using the CCMI, MMSE, SIC, or some other technique employed by the access point (block 316 ).
  • the SNRs for the user terminals with the CCMI and MMSE techniques can be computed as shown in equations (8) and (12), respectively.
  • the SNRs for the user terminals with the SIC technique are dependent on the order in which the user terminals are recovered. For the SIC technique, one or multiple orderings of user terminals may be evaluated. For example, a specific ordering may be evaluated whereby the user terminal with the highest SNR at each stage is processed by the access point.
  • the SNRs for the N up user terminals in set n are denoted as ⁇ n,1 ⁇ n,2 . . . ⁇ n,N up ⁇ .
  • the throughput for each user terminal in set n is then computed based on the SNR for the user terminal (block 318 ), as follows:
  • the overall throughput R n achieved by user set n can be computed (block 320 ), as follows:
  • a metric based on theoretical capacity (albeit with a compensation factor c n,i ) is used to select the best user set for uplink transmission.
  • a metric based on realizable throughput is used to select the best user set.
  • the user sets may be evaluated based on a set of “rates” supported by the system. These rates may be viewed as quantized values of the throughputs computed in equation (20). Each non-zero rate is associated with specific coding and modulation schemes, a particular spectral efficiency (which is typically given in units of bps/Hz), and a particular required SNR.
  • the required SNR for each rate may be determined by computer simulation, empirical measurement, and so on, and based on an assumption of an AWGN channel.
  • a look-up table (LUT) can store the set of supported rates and their required SNRs.
  • the SNR for each user terminal is mapped to a selected rate, which is the highest rate in the look-up table with a required SNR that is equal to or lower than the SNR for the user terminal.
  • the selected rates for all user terminals in each set are accumulated to obtain an aggregate rate for the set.
  • the user set with the highest aggregate rate is scheduled for transmission.
  • N act and N ap a large number of user sets may need to be evaluated for an exhaustive search for the best user set.
  • the number of user sets to evaluate may be reduced by prioritizing the active user terminals, considering other factors, and so on.
  • the priority of each active user terminal may be determined based on various factors such as the service category for the user terminal (e.g., premium or normal), the average throughput achieved by the user terminal, the amount of data the user terminal has to send, the delay experienced by the user terminal, and so on.
  • the priority of each user terminal may be updated over time to reflect the current status of the user terminal. As an example, only the N ap highest priority user terminals may be evaluated in each scheduling interval.
  • the effective uplink channel response vector h up,eff,u n,i is derived independently (or “locally”) for each user terminal based only on the uplink channel response matrix H up,u n,i for the user terminal.
  • the effective channel response matrix H up,eff,n for each user set n is formed with the independently derived effective channel response vectors for the user terminals in the set.
  • Multiple sub-hypotheses may be evaluated for each user set, where the vectors in H up,eff,n may be adjusted by different amounts for each sub-hypothesis.
  • the phases of the steering vectors for the user terminals in set n may be modified in a deterministic manner (e.g., by some ⁇ percentage) or in a pseudo-random manner for each sub-hypothesis while maintaining the power of each steering vector at unity (i.e., a unit norm for each steering vector).
  • a scheduling scheme may also evaluate each user set n based on the uplink MIMO channel response matrices H up,u n,i instead of the effective uplink channel response vectors h up,eff,u n,i for the user terminals in the set.
  • a steering vector v′ up,u n,i may be derived (“globally”) for each user terminal in set n in the presence of all user terminals in the set.
  • An effective uplink channel response matrix H′ up,eff,n is then formed for user set n based on the effective uplink channel response vectors h′ up,eff,u n,i for the user terminals in the set.
  • the performance (e.g., overall throughput) of user set n is then evaluated with the matrix H′ up,eff,n (instead of the matrix H up,eff,n ).
  • multiple sub-hypotheses may be evaluated for user set n, where each sub-hypothesis corresponds to a different set of steering vectors for the user terminals in the set.
  • the best sub-hypothesis is then selected for user set n.
  • Multiple user sets may be evaluated in similar manner and the best user set is selected for uplink transmission.
  • Different scheduling schemes may also be implemented and this is within the scope of the invention. Different scheduling schemes may consider different factors in selecting the user terminals for each set, derive the steering vectors for the user terminals in different manners, use other metrics to quantify the performance of each user set, and so on.
  • the uplink channel response matrix H up,m for each user terminal m may be estimated in various manners. Different channel estimation techniques may be used for TDD and FDD systems.
  • the downlink and uplink use different frequency bands.
  • the channel response for one link may not be correlated with the channel response for the other link.
  • the access point can estimate the uplink MIMO channel response for each user terminal based on a pilot transmitted by the user terminal.
  • the access point can perform decomposition of H up,m for each user terminal, derive the steering vector v up,m or ⁇ tilde over (v) ⁇ up,m , and send the steering vector to each user terminal selected for transmission.
  • each user terminal m can transmit an unsteered pilot (or a MIMO pilot) to allow the access point to estimate the uplink MIMO channel response and obtain the matrix H up,m .
  • the unsteered pilot comprises N ut,m orthogonal pilot transmissions sent from N ut,m user terminal antennas, where orthogonality may be achieved in time, frequency, code, or a combination thereof.
  • code orthogonality user terminal m sends N ut,m pilot transmissions simultaneously from its N ut,m antennas, with the pilot transmission from each antenna being “covered” with a different orthogonal (e.g., Walsh) sequence.
  • the access point “decovers” the received pilot symbols from each access point antenna i with the same N ut,m orthogonal sequences used by user terminal m to obtain estimates of the complex channel gain between access point antenna i and each of the N ut,m user terminal antennas.
  • the covering at the user terminal and the decovering at the access point can be performed in similar manner as for a Code Division Multiple Access (CDMA) system.
  • CDMA Code Division Multiple Access
  • the N ut,m pilot transmissions for the N ut,m user terminal antennas can be sent simultaneously on different subbands of the overall system bandwidth.
  • time orthogonality the N ut,m pilot transmissions for the N ut,m user terminal antennas can be sent in different time slots. In any case, the orthogonality among the N ut,m pilot transmissions allows the access point to distinguish the pilot transmission from each user terminal antenna.
  • Multiple user terminals can simultaneously transmit unsteered pilots on the uplink to the access point.
  • the pilot transmissions for all user terminals are orthogonal in code, time, and/or frequency to allow the access point to estimate the uplink channel response for each user terminal.
  • the downlink and uplink share the same frequency band.
  • a high degree of correlation normally exists between the downlink and uplink channel responses.
  • the responses of the transmit/receive chains at the access point may not be the same as the responses of the transmit/receive chains at the user terminal. If the differences can be determined via calibration and accounted for by applying the proper correction matrices at the access point and/or user terminal, then the overall downlink and uplink channel responses may be assumed to be reciprocal (i.e., transpose) of each other.
  • the access point can transmit an unsteered pilot from N ap access point antennas.
  • Each user terminal m can (1) process the downlink unsteered pilot to obtain its downlink MIMO channel response matrix H dn,m , (2) estimate the uplink MIMO channel response as the transpose of the downlink MIMO channel response (i.e., H up,m ⁇ H dn,m T ), (3) derive the steering vector v up,m or ⁇ tilde over (v) ⁇ up,m based on H up,m , and (4) compute the effective uplink channel response vector h up,eff,m .
  • Each user terminal can send the vector h up,eff,m to the access point in a direct form (e.g., by sending the entries of h up,eff,m ) or an indirect form (e.g., by transmitting a steered pilot that is generated with the steering vector v up,m or ⁇ tilde over (v) ⁇ up,m used for uplink transmission).
  • a direct form e.g., by sending the entries of h up,eff,m
  • an indirect form e.g., by transmitting a steered pilot that is generated with the steering vector v up,m or ⁇ tilde over (v) ⁇ up,m used for uplink transmission.
  • a downlink MIMO channel response matrix H dn,m can be obtained for each user terminal m and decomposed to obtain a downlink steering vector v dn,m for the user terminal.
  • the access point can evaluate different sets of user terminals for downlink transmission (e.g., in similar manner as that described above for the uplink) and select the best set of N dn user terminals for downlink transmission.
  • the access point spatially processes N dn data symbol streams with N dn downlink steering vectors for the N dn selected user terminals to obtain N ap transmit symbol streams, as follows:
  • s dn is an N dn ⁇ 1 vector with N dn data symbols to be transmitted on the downlink to the N dn selected user terminals;
  • a user terminal is equipped with at least N ap antennas (i.e., N ut,m ⁇ N ap ), then the user terminal can perform receiver spatial processing using CCMI, MMSE, or some other technique to isolate and recover its downlink data symbol stream. If a user terminal is equipped with less than N ap antennas (i.e., N ut,m ⁇ N ap ), then the user terminal can recover its downlink data symbol stream in the presence of crosstalk from the other data symbol streams.
  • N ap antennas i.e., N ut,m ⁇ N ap
  • a wideband MIMO system may utilize CDMA as the underlying wireless technology.
  • a multi-carrier MIMO system may utilize OFDM or some other multi-carrier modulation technique. OFDM effectively partitions the overall system bandwidth into multiple (N F ) orthogonal subbands. Each subband is associated with a respective carrier that may be modulated with data.
  • the channel estimation may be performed for each of the N F subbands to obtain N F frequency-domain channel response matrices for the N F subbands.
  • the spatial processing may be performed in various manners.
  • each of the N F channel response matrices is independently decomposed to obtain N F steering vectors for the N F subbands. Spatial processing is then performed for each subband with the steering vector obtained for that subband.
  • a single frequency-independent steering vector is derived for each user terminal based on the N F channel response matrices. Spatial processing is then performed for all N F subbands with this single steering vector.
  • the user terminals may be evaluated based on their frequency-dependent effective channel response vectors.
  • a time-domain channel impulse response matrix may be obtained for each of multiple (N P ) resolvable signal paths in the MIMO channel.
  • N P steering vectors are derived for each user terminal based on the N P channel impulse response matrices and used to account for the frequency-selective nature of the MIMO channel.
  • one steering vector is derived for each user terminal, for example, based on the channel impulse response matrix for the main signal path with the highest energy.
  • the steering vector(s) may be used to derive one or more effective channel response vectors, which are in turn used to evaluate and select user terminals for transmission.
  • FIG. 4 shows a block diagram of access point 110 and two user terminals 120 m and 120 x in MIMO system 100 .
  • Access point 110 is equipped with Nap antennas 424 a through 424 ap.
  • User terminal 120 m is equipped with N ut,m antennas 452 ma through 452 mu, and
  • user terminal 120 x is equipped with N ut,x antennas 452 xa through 452 xu.
  • Access point 110 is a transmitting entity for the downlink and a receiving entity for the uplink.
  • Each user terminal 120 is a transmitting entity for the uplink and a receiving entity for the downlink.
  • a “transmitting entity” is an independently operated apparatus or device capable of transmitting data via a wireless channel
  • a “receiving entity” is an independently operated apparatus or device capable of receiving data via a wireless channel.
  • the subscript “dn” denotes the downlink
  • the subscript “up” denotes the uplink
  • N up user terminals are selected for simultaneous transmission on the uplink
  • N dn user terminals are selected for simultaneous transmission on the downlink
  • N up may or may not be equal to N dn
  • N up and N dn may be static values or can change for each scheduling interval.
  • beam-steering is used in the following description.
  • a TX data processor 488 receives traffic data from a data source 486 and control data from a controller 480 .
  • TX data processor 488 processes (e.g., encodes, interleaves, and modulates) the traffic data ⁇ d up,m ⁇ for the user terminal based on the coding and modulation schemes associated with the rate selected for the user terminal and provides a data symbol stream ⁇ s up,m ⁇ .
  • a TX spatial processor 490 performs spatial processing on the data symbol stream ⁇ s up,m ⁇ with the steering vector v up,m , multiplexes in pilot symbols as needed, and provides N ut,m transmit symbol streams for the N ut,m antennas.
  • the steering vector v up,m is derived based on the uplink channel response matrix H up,m for the user terminal, as described above.
  • Each transmitter unit (TMTR) 454 receives and processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) a respective transmit symbol stream to generate an uplink signal.
  • N ut,m transmitter units 454 provide N ut,m uplink signals for transmission from N ut,m antennas 452 to the access point.
  • N up user terminals may be scheduled for simultaneous transmission on the uplink.
  • Each of these user terminals performs spatial processing on its data symbol stream with its steering vector and transmits its set of transmit symbol streams on the uplink to the access point.
  • Nap antennas 424 a through 424 ap receive the uplink signals from all N up user terminals transmitting on the uplink.
  • Each antenna 424 provides a received signal to a respective receiver unit (RCVR) 422 .
  • Each receiver unit 422 performs processing complementary to that performed by transmitter unit 454 and provides a received symbol stream.
  • An RX spatial processor 440 performs receiver spatial processing on the Nap received symbol streams from Nap receiver units 422 and provides N up recovered uplink data symbol streams. The receiver spatial processing is performed in accordance with the CCMI, MMSE, SIC, or some other technique.
  • a spatial filter matrix M ap for the access point is derived based on (1) the receiver spatial processing technique used by the access point and (2) the effective uplink channel response matrix H up,eff for the N up user terminals.
  • Each recovered uplink data symbol stream ⁇ up,m ⁇ is an estimate of a data symbol stream ⁇ s up,m ⁇ transmitted by a respective user terminal.
  • An RX data processor 442 processes (e.g., demodulates, deinterleaves, and decodes) each recovered uplink data symbol stream ⁇ up,m ⁇ in accordance with the rate used for that stream to obtain decoded data.
  • the decoded data for each user terminal may be provided to a data sink 444 for storage and/or a controller 430 for further processing.
  • a TX data processor 410 receives traffic data from a data source 408 for N dn user terminals scheduled for downlink transmission, control data from a controller 430 , and possibly other data from a scheduler 434 .
  • the various types of data may be sent on different transport channels.
  • TX data processor 410 processes (e.g., encodes, interleaves, and modulates) the traffic data for each user terminal based on the rate selected for that user terminal.
  • TX data processor 410 provides N dn downlink data symbol streams for the N dn user terminals.
  • a TX spatial processor 420 performs spatial processing on the N dn downlink data symbol streams with a matrix V dn of N dn downlink steering vectors for the N dn user terminals, multiplexes in pilot symbols, and provides Nap transmit symbol streams for the Nap antennas.
  • Each transmitter unit 422 receives and processes a respective transmit symbol stream to generate a downlink signal.
  • Nap transmitter units 422 provide Nap downlink signals for transmission from Nap antennas 424 to the user terminals.
  • N ut,m antennas 452 receive the Nap downlink signals from access point 110 .
  • Each receiver unit 454 processes a received signal from an associated antenna 452 and provides a received symbol stream.
  • An RX spatial processor 460 performs receiver spatial processing on N ut,m received symbol streams from N ut,m receiver units 454 and provides a recovered downlink data symbol stream ⁇ dn,m ⁇ for the user terminal.
  • the receiver spatial processing is performed in accordance with the CCMI, MMSE, or some other technique.
  • a spatial filter matrix M ut,m for each user terminal is derived based on (1) the receiver spatial processing technique used by the user terminal and (2) the downlink channel response matrix H dn,m for the user terminal.
  • An RX data processor 470 processes (e.g., demodulates, deinterleaves, and decodes) the recovered downlink data symbol stream to obtain decoded data for the user terminal.
  • a channel estimator 478 estimates the downlink channel response and provides downlink channel estimates, which may include channel gain estimates, SNR estimates, and so on. Similarly, a channel estimator 428 estimates the uplink channel response and provides uplink channel estimates.
  • the steering vectors for downlink and uplink transmission may be derived in various manners depending on whether the MIMO system is a TDD system or an FDD system, as described above. If the steering vector is derived by one entity (e.g., the access point) and needed by another entity (e.g., the user terminal), then the one entity sends the steering vector to the other entity.
  • Controller 480 for each user terminal typically derives the spatial filter matrix M ut,m for the user terminal based on the downlink channel response matrix H dn,m for that user terminal. Controller 430 derives the spatial filter matrix M ap for the access point based on the effective uplink channel response matrix H up,eff . Controller 480 for each user terminal may send feedback information (e.g., the downlink and/or uplink steering vectors, SNR estimates, and so on) to the access point. Controllers 430 and 480 also control the operation of various processing units at access point 110 and user terminal 120 , respectively.
  • feedback information e.g., the downlink and/or uplink steering vectors, SNR estimates, and so on
  • FIG. 5A shows a block diagram of a TX data processor 410 a that supports CDMA.
  • TX data processor 410 a may be used for TX data processors 410 and 488 in FIG. 4 .
  • an encoder 512 receives and codes a data stream ⁇ d m ⁇ for user terminal m based on the coding scheme for the selected rate and provides code bits.
  • the data stream may carry one or more data packets, and each data packet is typically coded separately to obtain a coded data packet.
  • the coding increases the reliability of the data transmission.
  • the coding scheme may include cyclic redundancy check (CRC) coding, convolutional coding, turbo coding, block coding, and so on, or a combination thereof.
  • CRC cyclic redundancy check
  • a channel interleaver 514 interleaves the code bits based on an interleaving scheme.
  • the interleaving provides time, frequency, and/or spatial diversity for the code bits.
  • a symbol mapping unit 516 maps the interleaved bits based on the modulation scheme for the selected rate and provides data symbols.
  • Each modulation symbol is a complex value in a signal constellation defined by the modulation scheme.
  • a CDMA modulator 520 performs modulation for CDMA.
  • a channelizer 522 receives and channelizes the data symbols and pilot symbols onto different code channels.
  • Each code channel is associated with a respective orthogonal sequence, which may be a Walsh sequence, an orthogonal variable spreading factor (OVSF) sequence, and so on.
  • the channelization is referred to as “covering” in IS-2000 and IS-95 and “spreading” in W-CDMA.
  • a scrambler 524 receives and spectrally spreads the channelized data for multiple code channels with a pseudo-random number (PN) sequence and provides a stream of data chips, which for simplicity is denoted as a data symbol stream ⁇ s m ⁇ .
  • PN pseudo-random number
  • the spectral spreading is referred to as “spreading” in IS-2000 and IS-95 and “scrambling” in W-CDMA.
  • the channelization and spectral spreading are known in the art and not described herein.
  • each data symbol stream is transmitted on a respective code channel, which is achieved by channelization with an orthogonal sequence.
  • the Nup selected user terminals may concurrently transmit N up or more data streams on different orthogonal code channels.
  • Each user terminal performs spatial processing on all of its data symbol streams (or its data chip stream) with the same steering vector v up,m or ⁇ tilde over (v) ⁇ up,m . Similar processing occurs for the downlink.
  • FIG. 5B shows a block diagram of a TX data processor 410 b that supports OFDM.
  • TX data processor 410 b may also be used for TX data processors 410 and 488 in FIG. 4 .
  • TX data processor 410 b includes encoder 512 , channel interleaver 514 , and symbol mapping unit 516 , which operate as described above for FIG. 5A .
  • TX data processor 410 b further includes an OFDM modulator 530 that performs modulation for OFDM.
  • an inverse fast Fourier transform (IFFT) unit 532 receives the data symbols from symbol mapping unit 516 and pilot symbols, provides the data and pilot symbols on subbands designated for data and pilot transmission, and provides a signal value of zero (a “zero” symbol) for each subband not used for data/pilot transmission. For each OFDM symbol period, IFFT unit 532 transforms a set of NF data, pilot, and zero symbols to the time domain using an NF-point inverse fast Fourier transform and provides a corresponding transformed symbol that contains NF chips.
  • a cyclic prefix generator 534 repeats a portion of each transformed symbol to obtain a corresponding OFDM symbol that contains N F +N cp chips.
  • the repeated portion is referred to as a cyclic prefix, and N cp is the number of chips being repeated.
  • the cyclic prefix ensures that the OFDM symbol retains its orthogonal properties in the presence of multipath delay spread caused by frequency selective fading (i.e., a frequency response that is not flat).
  • Cyclic prefix generator 534 provides a stream of OFDM symbols, which for simplicity is also denoted as a data symbol stream ⁇ s m ⁇ .
  • each data symbol stream is transmitted on a respective set of subbands assigned for that stream.
  • the N up selected user terminals may concurrently transmit N up or more data streams on different disjoint sets of subbands, where each of the NF subbands is assigned to at most one set.
  • Each user terminal performs spatial processing on all of its data symbol streams (or its OFDM symbol stream) with the same steering vector v up,m or ⁇ tilde over (v) ⁇ up,m . Similar processing occurs for the downlink.
  • FIGS. 5A and 5B show the processing for one data stream ⁇ d m ⁇ to obtain one data symbol steam ⁇ s m ⁇ .
  • Multiple data steams may be processed with multiple instances of the TX data processor to obtain multiple data symbol steams.
  • FIGS. 5A and 5B show specific implementations in which the processing for CDMA and OFDM are performed prior to the spatial processing for multi-antenna transmission.
  • the TX data processor includes the CDMA modulator or OFDM modulator, as shown in FIGS. 5A and 5B .
  • the processing for CDMA and OFDM may also be performed after the spatial processing for multi-antenna transmission.
  • FIG. 6 shows the spatial processing at access point 110 and one user terminal 120 m for downlink and uplink transmission.
  • the data symbol stream ⁇ s up,m ⁇ is multiplied with the steering vector v up,m by TX spatial processor 490 m to obtain the transmit symbol vector x up,m for the uplink.
  • the received symbol vector r up (for user terminal 120 m as well as other user terminals) is multiplied with a spatial filter matrix M ap by a unit 640 and further scaled with a diagonal matrix D ap ⁇ 1 by a unit 642 to obtain the recovered data symbol vector ⁇ tilde over (s) ⁇ up for the uplink.
  • Units 640 and 642 are part of an RX spatial processor 440 a.
  • the matrices M ap and D ap ⁇ 1 are derived based on the effective uplink channel response matrix H up,eff and using the CCMI, MMSE, or some other technique.
  • the data symbol vector s dn (which includes the downlink data symbol streams for user terminal 120 m as well as other user terminals) is multiplied with the downlink steering matrix V dn by TX spatial processor 420 to obtain the transmit symbol vector x dn for the downlink.
  • the received symbol vector r dn,m is multiplied with a spatial filter matrix M ut,m by a unit 660 and further scaled with a diagonal matrix D ut,m ⁇ 1 by a unit 662 to obtain a downlink recovered data symbol stream ⁇ dn,m ⁇ for user terminal 120 m.
  • Units 660 and 662 are part of RX spatial processor 460 m.
  • the matrices M ut,m and D ut,m ⁇ 1 are derived based on the downlink channel response matrix H dn,m for user terminal 120 m and using the CCMI, MMSE, or some other technique.
  • FIG. 7 shows a block diagram of an RX spatial processor 440 b and an RX data processor 442 b, which implement the SIC technique and may be used for access point 110 .
  • RX spatial processor 440 b and RX data processor 442 b implement N up successive (i.e., cascaded) receiver processing stages for N up data symbol streams transmitted by N up user terminals.
  • Each of stages 1 to N up ⁇ 1 includes a spatial processor 710 , an interference canceller 720 , an RX data stream processor 730 , and a TX data stream processor 740 .
  • the last stage includes only a spatial processor 710 u and an RX data stream processor 730 u.
  • spatial processor 710 a performs receiver spatial processing on the Nap received symbol streams and provides one recovered data symbol stream ⁇ up,j 1 ⁇ for user terminal j 1 being recovered in the first stage.
  • RX data stream processor 730 a demodulates, deinterleaves, and decodes the recovered data symbol stream ⁇ up,j 1 ⁇ and provides a decoded data stream ⁇ circumflex over (d) ⁇ up,j 1 ⁇ .
  • TX data stream processor 740 a encodes, interleaves, and modulates the decoded data stream ⁇ circumflex over (d) ⁇ up,j 1 ⁇ in the same manner performed by user terminal j 1 for that stream and provides a remodulated symbol stream ⁇ hacek over (s) ⁇ up,j 1 ⁇ .
  • Interference canceller 720 a performs transmitter spatial processing on the remodulated symbol stream ⁇ hacek over (s) ⁇ up,j 1 ⁇ with the effective channel response vector h up,eff,j 1 for user terminal j 1 to obtain Nap interference components due to the data symbol stream ⁇ s up,j 1 ⁇ .
  • the Nap interference components are subtracted from the Nap received symbol streams to obtain Nap modified symbol streams, which are provided to stage 2 .
  • stages 2 through N up ⁇ 1 performs the same processing as stage 1 , albeit on the Nap modified symbol streams from the preceding stage instead of the Nap received symbol streams.
  • the last stage performs spatial processing and decoding on the Nap modified symbol streams from stage N up ⁇ 1 and does not perform interference estimation and cancellation.
  • Spatial processors 710 a through 710 u may each implement the CCMI, MMSE, or some other technique.
  • Each spatial processor 710 multiplies an input (received or modified) symbol vector r sic l with a spatial filter matrix M ap l to obtain a detected symbol vector ⁇ tilde over (s) ⁇ up l , selects and scales one of the detected symbol streams, and provides the scaled symbol stream as the recovered data symbol stream for that stage.
  • the matrix M ap l is derived based on a reduced effective channel response matrix H up,eff l for the stage.
  • FIG. 8 shows a block diagram of an embodiment of controller 430 and scheduler 434 for evaluating and scheduling user terminals for transmission on the downlink and uplink.
  • a request processor 810 receives access requests sent by user terminals 120 and possibly access requests from other sources. These access requests are for data transmission on the downlink and/or uplink. For clarity, scheduling for uplink transmission is described below.
  • Request processor 810 processes the received access requests and provides the identities (IDs) and the status of all active user terminals.
  • a user selector 820 selects different sets of user terminals from among all active user terminals for evaluation. The user terminals may be selected for evaluation based on various factors such as user priority, the amount of data to send, system requirements, and so on.
  • An evaluation unit 830 evaluates each set of user terminals and provides a value for a metric for the set. For simplicity, the following description assumes that (1) overall throughput is used as the metric and (2) the effective uplink channel response vector is available for each active user terminal.
  • Evaluation unit 830 includes a matrix computation unit 840 and a rate selector 850 .
  • Matrix computation unit 840 performs the SNR computation for each set of user terminals. For each set, unit 840 forms the effective uplink channel response matrix H up,eff,n for the set and computes the SNR for each user terminal in the set based on H up,eff,n and the receiver spatial processing technique used by the access point.
  • Rate selector 850 receives a set of SNRs for each user set and determines the rate for each user terminal in the set as well as the overall throughput R n for the set. Rate selector 850 may access a look-up table (LUT) 852 , which stores a set of rates supported by the system and their required SNRs. Rate selector 850 determines the highest rate that may be used for uplink transmission by each user terminal based on the SNR computed for the user terminal. Rate selector 850 also accumulates the rates or throughputs for all user terminals in each set to obtain the overall throughput R n for the set.
  • LUT look-up table
  • Scheduler 434 receives (1) the different sets of user terminals from user selector 820 and (2) the rates for the user terminals and the overall throughput for each set from rate selector 850 . Scheduler 434 selects the best set of user terminals among all sets evaluated for each scheduling interval and schedules the selected user terminals for transmission on the uplink. Scheduler 434 provides scheduling information, which includes the identities of the selected user terminals, their rates, the scheduled transmission time (e.g., the start and the duration of the transmission), and so on. The scheduling information is sent to the selected user terminals.
  • the scheduling for downlink transmission may be performed in similar manner.
  • the SDMA transmission techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof.
  • the processing units used to support the underlying wireless technology e.g., CDMA or OFDM
  • the SDMA transmission on the downlink and uplink e.g., the transmit and receive spatial processing at the access point and user terminal, the evaluation of different user sets, and so on
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • processors controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
  • the SDMA transmission techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein.
  • the software codes may be stored in a memory unit (e.g., memory units 432 and 482 in FIG. 4 ) and executed by a processor (e.g., controllers 430 and 480 ).
  • the memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.

Abstract

An uplink channel response matrix is obtained for each terminal and decomposed to obtain a steering vector used by the terminal to transmit on the uplink. An “effective” uplink channel response vector is formed for each terminal based on its steering vector and its channel response matrix. Multiple sets of terminals are evaluated based on their effective channel response vectors to determine the best set (e.g., with highest overall throughput) for uplink transmission. Each selected terminal performs spatial processing on its data symbol stream with its steering vector and transmits its spatially processed data symbol stream to an access point. The multiple selected terminals simultaneously transmit their data symbol streams via their respective MIMO channels to the access point. The access point performs receiver spatial processing on its received symbol streams in accordance with a receiver spatial processing technique to recover the data symbol streams transmitted by the selected terminals.

Description

    CLAIM OF PRIORITY
  • This application is a continuation application of, and claims the benefit of priority from, U.S. patent application Ser. No. 11/869,457 to Walton, et al., filed on Oct. 9, 2007 and entitled “Multi-Antenna Transmission for Spatial Division Multiple Access”, which is a continuation application of, and claims the benefit of priority from, U.S. Pat. No. 7,298,805 to Walton, et al., issued Nov. 20, 2007 and entitled “Multi-Antenna Transmission for Spatial Division Multiple Access”, both of which are assigned to the assignee of this application, and are fully incorporated herein by reference for all purposes.
  • BACKGROUND
  • I. Field
  • The present invention relates generally to data communication, and more specifically to multi-antenna transmission for spatial division multiple access (SDMA) in a multiple-input multiple-output (MIMO) communication system.
  • II. Background
  • A MIMO system employs multiple (NT) transmit antennas and multiple (NR) receive antennas for data transmission. A MIMO channel formed by the NT transmit and NR receive antennas may be decomposed into NS spatial channels, where NS≦min {NT, NR}. The NS spatial channels may be used to transmit NS independent data streams to achieve greater overall throughput.
  • In a multiple-access MIMO system, an access point can communicate with one or more user terminals at any given moment. If the access point communicates with a single user terminal, then the NT transmit antennas are associated with one transmitting entity (either the access point or the user terminal), and the NR receive antennas are associated with one receiving entity (either the user terminal or the access point). The access point can also communicate with multiple user terminals simultaneously via SDMA. For SDMA, the access point utilizes multiple antennas for data transmission and reception, and each of the user terminals typically utilizes one antenna for data transmission and multiple antennas for data reception.
  • Some key challenges for SDMA in a multiple-access MIMO system are (1) selecting the proper set of user terminals for simultaneous transmission and (2) transmitting data to and/or from each selected user terminal in a manner to achieve good system performance. There is therefore a need in the art for techniques to efficiently support SDMA for a multiple-access MIMO system.
  • SUMMARY
  • Techniques for performing multi-antenna transmission for SDMA in a MIMO system are described herein. These techniques may be used in combination with various wireless technologies such as Code Division Multiple Access (CDMA), Orthogonal Frequency Division Multiplexing (OFDM), Time Division Multiple Access (TDMA), and so on. For uplink transmission by multiple user terminals to a single access point, an uplink channel response matrix is obtained for each active user terminal (e.g., a terminal desiring to transmit on the uplink) and decomposed to obtain a steering vector for the user terminal. Each user terminal uses its steering vector for spatial processing to transmit on the uplink, if selected for uplink transmission. An “effective” uplink channel response vector is formed for each user terminal based on the steering vector and the uplink channel response matrix for the user terminal.
  • For each scheduling interval (e.g., each time slot), multiple sets of active user terminals are formed and evaluated based on their effective channel response vectors (or their channel response matrices) to determine the best set of Nup user terminals for uplink transmission in that scheduling interval. For example, the user set with the highest overall throughput may be selected. In effect, the spatial signatures of the user terminals as well as multi-user diversity are exploited to select a set of “spatially compatible” user terminals for simultaneous transmission on the uplink, as described below. The same or different number of user terminals may be selected for uplink transmission in different scheduling intervals.
  • Each user terminal selected for uplink transmission processes its data stream in accordance with the underlying wireless technology (e.g., CDMA, OFDM, or TDMA) to obtain a data symbol stream. Each user terminal further performs spatial processing on its data symbol stream with its steering vector to obtain a set of transmit symbol streams, one transmit symbol stream for each antenna at the user terminal. Each user terminal then transmits its transmit symbol streams from its multiple antennas and via its MIMO channel to the access point. The Nup selected user terminals simultaneously transmit their Nup data symbol streams (e.g., one data symbol stream for each terminal) via their respective MIMO channels to the access point. The access point obtains multiple received symbol streams from its multiple antennas. The access point then performs receiver spatial processing on the received symbol streams in accordance with a linear or non-linear receiver spatial processing technique to recover the Nup data symbol streams transmitted by the Nup selected user terminals, as described below.
  • The techniques to support SDMA transmission on the downlink are also described herein. Various aspects and embodiments of the invention are described in further detail below.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 shows a multiple-access MIMO system;
  • FIG. 2 shows a process for performing multi-antenna transmission on the uplink for SDMA;
  • FIG. 3 shows a process for evaluating and selecting user terminals for simultaneous transmission on the uplink;
  • FIG. 4 shows a block diagram of an access point and two user terminals;
  • FIGS. 5A and 5B show block diagrams of transmit (TX) data processors for CDMA and OFDM, respectively;
  • FIG. 6 shows the spatial processing at the access point and one user terminal for downlink and uplink transmission;
  • FIG. 7 shows a receive spatial processor and a receive data processor; and
  • FIG. 8 shows a controller and a scheduler at the access point.
  • DETAILED DESCRIPTION
  • The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
  • The multi-antenna transmission techniques described herein may be used in combination with various wireless technologies such as CDMA, OFDM, TDMA, and so on. Multiple user terminals can concurrently transmit/receive data via different (1) orthogonal code channels for CDMA, (2) time slots for TDMA, or (3) subbands for OFDM. A CDMA system may implement IS-2000, IS-95, IS-856, Wideband-CDMA (W-CDMA), or some other standards. An OFDM system may implement IEEE 802.11 or some other standards. A TDMA system may implement GSM or some other standards. These various standards are known in the art. The spatial processing for multi-antenna transmission may be performed on top of (either before or after) the data processing for the underlying wireless technology, as described below.
  • FIG. 1 shows a multiple-access MIMO system 100 with access points and user terminals. For simplicity, only one access point 110 is shown in FIG. 1. An access point is generally a fixed station that communicates with the user terminals and may also be referred to as a base station or some other terminology. A user terminal may be fixed or mobile and may also be referred to as a mobile station, a wireless device, or some other terminology. Access point 110 may communicate with one or more user terminals 120 at any given moment on the downlink and uplink. The downlink (i.e., forward link) is the communication link from the access point to the user terminals, and the uplink (i.e., reverse link) is the communication link from the user terminals to the access point. A user terminal may also communicate peer-to-peer with another user terminal. A system controller 130 couples to and provides coordination and control for the access points.
  • System 100 employs multiple transmit and multiple receive antennas for data transmission on the downlink and uplink. Access point 110 is equipped with Nap antennas and represents the multiple-input (MI) for downlink transmissions and the multiple-output (MO) for uplink transmissions. A set of Nu selected user terminals 120 collectively represents the multiple-output for downlink transmissions and the multiple-input for uplink transmissions. For pure SDMA, it is desired to have Nap≧Nu≧1 if the data symbol streams for the Nu user terminals are not multiplexed in code, frequency, or time by some means. Nu may be greater than Nap if the data symbol streams can be multiplexed using different code channels with CDMA, disjoint sets of subbands with OFDM, and so on. Each selected user terminal transmits user-specific data to and/or receives user-specific data from the access point. In general, each selected user terminal may be equipped with one or multiple antennas (i.e., Nut≧1). The Nu selected user terminals can have the same or different number of antennas.
  • System 100 may be a time division duplex (TDD) system or a frequency division duplex (FDD) system. For a TDD system, the downlink and uplink share the same frequency band. For an FDD system, the downlink and uplink use different frequency bands. MIMO system 100 may also utilize a single carrier or multiple carriers for transmission. For simplicity, the following description assumes that (1) system 100 is a single-carrier system and (2) each user terminal is equipped with multiple antennas. For clarity, data transmission on the uplink is described below.
  • An uplink MIMO channel formed by the Nap antennas at the access point and the Nut,m antennas at a given user terminal m may be characterized by an Nap×Nut,m channel response matrix H up,m, which may be expressed as:
  • H _ up , m = [ h 1 , 1 h 1 , 2 h 1 , N ut , m h 2 , 1 h 2 , 2 h 2 , N ut , m h N ap , 1 h N ap , 2 h N ap , N ut , m ] , Eq ( 1 )
    • where entry hi,j, for i=1 . . . Nap and j=1 . . . Nut,m, is the coupling (i.e., complex gain) between access point antenna i and user terminal antenna j.
      For simplicity, the MIMO channel is assumed to be non-dispersive (i.e., flat fading), and the coupling between each transmit and receive antenna pair is represented with a single complex gain hi,j. In general, each user terminal is associated with a different uplink channel response matrix having dimensions determined by the number of antennas at that user terminal.
  • The uplink channel response matrix H ap,m for user terminal m may be “diagonalized” using either singular value decomposition or eigenvalue decomposition to obtain Nm eigenmodes of H up,m. The singular value decomposition of H up,m may be expressed as:

  • H up,m=U up,m Σ up,m V up,m H,   Eq (2)
  • where U up,m is an Nap×Nap unitary matrix of left eigenvectors of H up,m;
      • Σ up,m is an Nap×Nut,m diagonal matrix of singular values of H up,m;
      • V up,m is an Nut,m×Nut,m unitary matrix of right eigenvectors of H up,m; and
      • “H” denotes the conjugate transpose.
        A unitary matrix M is characterized by the property M H M=I, where I is the identity matrix. The columns of a unitary matrix are orthogonal to one another.
  • The eigenvalue decomposition of a correlation matrix of H up,m may be expressed as:

  • R up,m=H up,m H H up,m=V up,m Λ up,m V up,m H,   Eq (3)
  • where R up,m is the Nut,m×Nut,m correlation matrix of H up,m; and
      • Λ up,m is an Nut,m×Nut,m diagonal matrix of eigenvalues of R up,m.
        Singular value decomposition and eigenvalue decomposition are known in the art and described, for example, by Gilbert Strang in “Linear Algebra and Its Applications,” Second Edition, Academic Press, 1980.
  • As shown in equations (2) and (3), the columns of V up,m are the right eigenvectors of H up,m as well as the eigenvectors of R up,m. The right eigenvectors of H up,m are also referred to as “steering” vectors and may be used for spatial processing by user terminal m to transmit data on the Nm eigenmodes of H up,m. The eigenmodes may be viewed as orthogonal spatial channels obtained through decomposition.
  • The diagonal matrix Σ up,m contains non-negative real values along the diagonal and zeros elsewhere. These diagonal entries are known as the singular values of H up,m and represent the channel gains for the Nm eigenmodes of H up,m. The singular values in Σ up,m are also the square roots of the eigenvalues in Λ up,m. The singular values in Σ up,m may be ordered from largest to smallest, and the eigenvectors in V up,m may be ordered correspondingly. The principal (i.e., dominant) eigenmode is the eigenmode associated with the largest singular value in Σ up,m, which is the first singular value after the ordering. The eigenvector for the principal eigenmode of H up,m is the first column of V up,m after the ordering and is denoted as v up,m.
  • In a practical system, only an estimate of H up,m can be obtained, and only estimates of V up,m, Σ up,m and U up,m can be derived. For simplicity, the description herein assumes channel estimation and decomposition without errors.
  • With SDMA, Nup user terminals can transmit data concurrently on the uplink to the access point. Each user terminal performs spatial processing on its data using a steering vector, which may be derived (1) based on the eigenvector v up,m for the principal eigenmode of the wireless channel for that terminal or (2) in some other manner. Each of the Nup user terminals can transmit data on the principal eigenmode of its uplink MIMO channel using either “beam-forming” or “beam-steering”, as described below.
  • 1. Beam-Forming
  • For beam-forming, each user terminal m spatially processes its data symbol stream {sup,m} with its steering vector V up,m to obtain Nut,m transmit symbol streams, as follows:

  • x up,m =v up,m ·s up,m,   Eq (4)
  • where sup,m is a data symbol to be transmitted by user terminal m; and
      • x up,m is an Nut,m×1 vector with Nut,m transmit symbols to be sent from the Nut,m antennas at user terminal m.
        As used herein, a “data symbol” refers to a modulation symbol for data, and a “pilot symbol” refers to a modulation symbol for pilot. Although not shown in equation (4) for simplicity, each user terminal m may further scale each of the Nut,m transmit symbols in the vector x up,m with a scaling factor Gm such that the total energy for the Nut,m transmit symbols is unity or some other selected value. Each user terminal m transmits its Nut,m transmit symbol streams via its uplink MIMO channel to the access point.
  • At the access point, the received symbols obtained for each user terminal m may be expressed as:

  • r up,m =H up,m x up,m +n up,m =H up,m v up,m s up,m +n up,m =h up,eff,m s up,m +n up,m,   Eq (5)
  • where r up,m is an Nap×1 vector with Nap received symbols obtained from the Nap access point antennas for user terminal m;
      • h up,eff,m is an Nap×1 “effective” uplink channel response vector for user terminal m, which is h up,eff,m=H up,m v up,m; and
      • n up,m is an Nap×1 noise vector for user terminal m.
        The spatial processing by each user terminal m effectively transforms its MIMO channel with a channel response matrix of H up,m into a single-input multiple-output (SIMO) channel with a channel response vector of h up,eff,m.
  • The received symbols at the access point for all Nup user terminals transmitting simultaneously may be expressed as:
  • r _ up = H _ up , eff s _ up + n _ up = m = 1 N up r _ up , m = m = 1 N up h _ up , eff , m s up , m + n _ up , m , Eq ( 6 )
  • where s up is an Nup×1 vector with Nup data symbols transmitted by the Nup user terminals, which is s up=[sup,1 sup,2 . . . sup,N up ]T;
      • H up,eff is an Nap×Nup effective uplink channel response matrix for all Nup user terminals, which is H up,eff=[h up,eff,1 h up,eff,2 . . . h up,eff,N up ]; and
      • n up is an Nap×1 noise vector at the access point.
  • The access point can recover the Nup data symbol streams transmitted by the Nup user terminals using various receiver processing techniques such as a channel correlation matrix inversion (CCMI) technique (which is also commonly referred to as a zero-forcing technique), a minimum mean square error (MMSE) technique, a successive interference cancellation (SIC) technique, and so on.
  • A. CCMI Spatial Processing
  • For the CCMI technique, the access point performs receiver spatial processing as follows:
  • s ^ _ c c m i = M _ c c m i r _ up , = R _ up , eff - 1 H _ up , eff H ( H _ up , eff s _ up + n _ up ) , = s _ up + n _ c c m i , Eq ( 7 )
  • where M ccmi is an Nup×Nap spatial filter matrix for the CCMI technique, which is M ccmi=R up,eff −1 H up,eff H, where R up,eff=H up,eff H H up,eff;
      • ŝ ccmi is an Nup×1 vector with Nup recovered data symbols for the Nup user terminals with the CCMI technique; and
      • n ccmi=M ccmi n up is the CCMI filtered noise.
  • For simplicity, the noise n up is assumed to be additive white Gaussian noise (AWGN) with zero mean, a variance of σn 2, and an autocovariance matrix of φ nn=E[n up n up H]=σn 2 I, where E[x] is the expected value of x. In this case, the signal-to-noise-and-interference ratio (SNR) of the recovered data symbol stream {ŝccmi,m} for each user terminal m may be expressed as:
  • γ c c m i , m = P ut , m r m m σ n 2 , for m = 1 N up , Eq ( 8 )
  • where Put,m is the transmit power used by user terminal m;
      • rmm is the m-th diagonal element of R up,eff; and
      • γccmi,m is the SNR for user terminal m with the CCMI technique.
        Due to the structure of R up,eff, the CCMI technique may amplify the noise.
  • B. MMSE Spatial Processing
  • For the MMSE technique, a spatial filter matrix M mmse is derived such that the mean square error between the estimated data vector from the MMSE spatial filter and the data vector s up is minimized. This MMSE criterion may be expressed as:
  • min M _ m m s e E [ ( M _ m m s e r _ up - s _ up ) H ( M _ m m s e r _ up - s _ up ) ] , Eq ( 9 )
  • where M mmse is the Nup×Nap spatial filter matrix for the MMSE technique.
  • The solution to the optimization problem posed in equation (9) may be obtained in various manners. In one exemplary method, the MMSE spatial filter matrix M mmse is derived as:

  • M mmse =H up,eff H [H up,eff H up,eff Hn 2 I] −1.   Eq (10)
  • The spatial filter matrix M mmse contains Nup rows for Nup MMSE spatial filter row vectors for the Nup user terminals. The MMSE spatial filter row vector for each user terminal may be expressed as m mmse,m=h up,eff,m H G. where G=[H up,eff H up,eff Hn 2 I]1.
  • The access point performs receiver spatial processing as follows:
  • s ^ _ m m s e = D _ m m s e - 1 M _ m m s e r _ up , = D _ m m s e - 1 M _ m m s e ( H _ up , eff s _ up + n _ up ) , = s _ up + n _ m m s e , Eq ( 11 )
  • where D mmse is an Nup×Nup diagonal matrix whose diagonal elements are the diagonal elements of M mmse H up,eff, i.e., D mmse=diag [M mmse H up,eff];
      • ŝ mmse is an Nup×1 recovered data symbol vector for the MMSE technique; and
      • n mmse=M mmse n up is the MMSE filtered noise.
        In equation (11), the MMSE spatial filter provides an unnormalized estimate of s up, and the scaling by the diagonal matrix D mmse −1 provides a normalized estimate of s up.
  • The SNR of the recovered data symbol stream {ŝmmse,m} for each user terminal m may be expressed as:
  • γ m m s e , m = q m m 1 - q m m , for m = 1 N up , Eq ( 12 )
  • where qmm is the m-th diagonal element of M mmse H up,eff, i.e., qmm=m mmse,m h up,eff,m; and
      • γmmse,m is the SNR for user terminal m with the MMSE technique.
  • C. Successive Interference Cancellation Spatial Processing
  • The access point can process the Nap received symbol streams using the SIC technique to recover the Nup data symbol streams. For the SIC technique, the access point initially performs spatial processing on the Nap received symbol streams (e.g., using CCMI, MMSE, or some other technique) and obtains one recovered data symbol stream. The access point then processes (e.g., demodulates/symbol demaps, deinterleaves, and decodes) this recovered data symbol stream to obtain a decoded data stream. The access point next estimates the interference this stream causes to the other Nup−1 data symbol streams and cancels the estimated interference from the Nap received symbol streams to obtain Nap modified symbol streams. The access point then repeats the same processing on the Nap modified symbol streams to recover another data symbol stream.
  • For the SIC technique, the input (i.e., received or modified) symbol streams for stage l, where l=1 . . . Nup, may be expressed as:

  • r sic l(k)= H up,eff l s up l +n up l,   Eq (13)
  • where r sic l is an Nap×1 vector with Nap input symbols for stage l, and r sic 1=r up for the first stage;
      • s up l is an Nnr×1 vector for Nnr data symbol streams not yet recovered at stage l, where Nnr=Nupl+1; and
      • H up,eff l is an Nap×Nnr reduced effective channel response matrix for stage l.
  • Equation (13) assumes that the data symbol streams recovered in the l−1 prior stages are canceled. The dimensionality of the effective channel response matrix H up,eff successively reduces by one column for each stage as a data symbol stream is recovered and canceled. For stage l, the reduced effective channel response matrix H up,eff l is obtained by removing l−1 columns in the original matrix H up,eff corresponding to the l−1 data symbol streams already recovered in prior stages, i.e., H up,eff l=[h up,eff,j l h up,eff,j l+1 . . . h up,eff,j h up,eff, j N up ], where h up,eff,j n is an Nap×1 effective channel response vector for user terminal jn. For stage l, the l−1 data symbol streams recovered in the prior stages are given indices of {j1 j2 . . . jl−1}, and the Nnr data symbol streams not yet recovered are given indices of {jl jl+1 . . . jN up }.
  • For stage l, the access point derives an Nnr×Nap spatial filter matrix M sic l based on the reduced effective channel response matrix H up,eff l (instead of the original matrix H up,eff) using the CCMI, MMSE, or some other technique. Since H up,eff l is different for each stage, the spatial filter matrix M sic l is also different for each stage.
  • The access point multiplies the vector r sic l for the Nap modified symbol streams with the spatial filter matrix M sic l to obtain a vector {tilde over (s)} sic l for Nnr detected symbol streams, as follows:
  • s ~ _ sic l = M _ sic l r _ sic l , = M _ sic l ( H _ up , eff l s _ up l + n _ up ) = Q _ sic l s _ up l + n _ sic l , Eq ( 14 )
  • where Q sic l=M sic l H up,eff l and n sic l=M sic l n is the filtered noise for stage l. The access point then selects one of the Nnr detected symbol streams for recovery, where the selection criterion may be based on SNR and/or other factors. For example, the detected symbol stream with the highest SNR among the Nnr detected symbol streams may be selected for recovery. Since only one data symbol stream is recovered in each stage, the access point can simply derive one 1×Nap spatial filter row vector m j l l for the data symbol stream {sup,j l } to be recovered in stage l. The row vector m j l l is one row of the matrix M sic l. In this case, the spatial processing for stage l to recover the data symbol stream {sup,j l } may be expressed as:

  • {tilde over (s)} up,j l =m j l l r sic l =q j l l s up l +m j l l n up,   Eq (15)
  • where q j l l is the row of Q sic l corresponding to data symbol stream {sup,j l }.
  • In any case, the access point scales the detected symbol stream {{tilde over (s)}up,j l } to obtain a recovered data symbol stream {ŝup,j l } and further demodulates, deinterleaves, and decodes this stream {ŝup,j l } to obtain a decoded data stream {{circumflex over (d)}up,j l }. The access point also forms an estimate of the interference this stream causes to the other data symbol streams not yet recovered. To estimate the interference, the access point re-encodes, interleaves, and modulates the decoded data stream {{circumflex over (d)}up,j l } in the same manner as performed at user terminal jl and obtains a stream of “remodulated” symbols {{tilde over (s)}up,j l }, which is an estimate of the data symbol stream {sup,j l } just recovered. The access point then spatially processes the remodulated symbol stream with the effective channel response vector h up,eff,j l for user terminal jl to obtain a vector i j l with Nap interference components caused by this stream. The Nap interference components i j l are then subtracted from the Nap modified symbol streams r sic l for stage l to obtain Nap modified symbol streams r sic l|1 for the next stage l+1, i.e., r sic l+1=r sic l−ij l . The modified symbol streams r sic l+1 represent the streams that would have been received by the access point if the data symbol stream {sup,j l } had not been transmitted (i.e., assuming that the interference cancellation was effectively performed).
  • The access point processes the Nap received symbol streams in Nup successive stages. For each stage, the access point (1) performs receiver spatial processing on either the Nap received symbol streams or the Nap modified symbol streams from the preceding stage to obtain one recovered data symbol stream, (2) processes this recovered data symbol stream to obtain a corresponding decoded data stream, (3) estimates and cancels the interference due to this stream, and (4) obtains Nap modified symbol streams for the next stage. If the interference due to each data stream can be accurately estimated and canceled, then later recovered data streams experience less interference and may be able to achieve higher SNRs.
  • For the SIC technique, the SNR of each recovered data symbol stream is dependent on (1) the spatial processing technique (e.g., CCMI or MMSE) used for each stage, (2) the specific stage in which the data symbol stream is recovered, and (3) the amount of interference due to data symbol streams recovered in subsequent stages. In general, the SNR progressively improves for data symbol streams recovered in later stages because the interference from data symbol streams recovered in prior stages is canceled. This then allows higher rates to be used for data symbol streams recovered later.
  • 2. Beam-Steering
  • For beam-steering, each user terminal m performs spatial processing with a normalized steering vector {tilde over (v)} up,m, which is derived using the phase information in the steering vector v up,m. The normalized steering vector {tilde over (v)} up,m may be expressed as:

  • {tilde over (v)} up,m=[Ae m,1 Ae m,2 . . . Ae m,N ut ]T,   Eq (16)
  • where A is a constant (e.g., A=1/√{square root over (Nut,m)}); and
      • θm,i is the phase for antenna i at user terminal m, which is:
  • θ m , i = v up , m , i = tan - 1 ( Im { v up , m , i } Re { v up , m , i } ) . Eq ( 17 )
  • As shown in equation (16), the Nut,m elements of {tilde over (v)} up,m have equal magnitude. As shown in equation (17), the phase of each element in {tilde over (v)} up,m is equal to the phase of a corresponding element in v up,m (i.e., θm,i is obtained from vup,m,i, where v up,m=[vup,m,1 vup,m,2 . . . vup,m,N ut ]T).
  • Each user terminal m spatially processes its data symbol stream {sup,m} with its normalized steering vector {tilde over (v)} up,m to obtain Nut,m transmit symbol streams, as follows:

  • {tilde over (x)} up,m ={tilde over (v)} up,m ·s up,m.   Eq (18)
  • The constant A in equation (16) may be selected such that the total energy of the Nut,m transmit symbols in the vector {tilde over (x)} up,m is unity or some other selected value. The Nap×1 effective uplink channel response vector {tilde over (h)} up,eff,m for each user terminal m with beam-steering may be expressed as:

  • {tilde over (h)} up,eff,m=H up,m {tilde over (v)} up,m.   Eq (19)
  • The Nap×Nup effective uplink channel response matrix {tilde over (H)} up,eff for all Nup user terminals for beam-steering is then {tilde over (H)} up,eff=[{tilde over (h)} up,eff,1 {tilde over (h)} up,eff,2 . . . {tilde over (h)} up,eff,N up ].
  • The access point can perform receiver spatial processing using the CCMI, MMSE, or SIC technique described above, or some other technique. However, the spatial filter matrix is derived with the matrix {tilde over (H)} up,eff instead of the matrix H up,eff.
  • 3. SDMA Transmission
  • FIG. 2 shows a process 200 for performing multi-antenna transmission on the uplink for SDMA. Initially, an uplink channel response matrix H up,m is obtained for each active user terminal desiring to transmit on the uplink (block 210). The matrix H up,m for each user terminal is decomposed to obtain a steering vector v up,m or {tilde over (v)} up,m for the user terminal (block 212). An effective uplink channel response vector h up,eff,m is formed for each user terminal based on the steering vector and the uplink channel response matrix for the user terminal (block 214). Blocks 210 through 214 are for channel estimation and decomposition and may be performed by the access point, the user terminals, or both.
  • Different sets of active user terminals are formed and evaluated based on their effective uplink channel response vectors h up,eff,m or their uplink channel response matrices H up,m (block 220). The evaluation may be performed as described below. The best set of Nup user terminals is selected for transmission (also block 220). The rate to use by each selected user terminal (which is obtained from the evaluation in block 220) is sent to the user terminal (block 222). Blocks 220 and 222 are for user scheduling and are typically performed by the access point.
  • Each selected user terminal performs spatial processing on its data symbol stream {sup,m} with its steering vector v up,m or {tilde over (v)} up,m and transmits Nut,m transmit symbol streams from its Nut,m antennas and via its MIMO channel to the access point (block 230). The Nup selected user terminals simultaneously transmit their Nup data symbol streams via their MIMO channels to the access point. Block 230 is for data transmission and is performed by each selected user terminal.
  • The access point obtains Nap received symbol streams from its Nap antennas (block 240). The access point then performs receiver spatial processing on the Nap received symbol streams in accordance with the CCMI, MMSE, SIC, or some other technique to obtain Nup recovered data symbol streams, which are estimates of the Nup data symbol streams transmitted by the Nup selected user terminals (block 242). Blocks 240 and 242 are for data reception and are performed by the access point.
  • Multiple user terminals can be selected for simultaneous transmission on the uplink. The user selection may be based on various factors. Some factors may relate to system constraints and requirements such as quality of service, maximum latency, average data rate, and so on. These factors may need to be satisfied for each user terminal. Other factors may relate to system performance, which may be quantified by overall system throughput or some other indication of performance. A scheduling scheme can evaluate user terminals for transmission based on one or more metrics and one or more factors. Different scheduling schemes may use different metrics, take into account different factors, and/or weigh the metrics and factors differently.
  • Regardless of the particular scheduling scheme selected for use, different sets of user terminals can be evaluated in accordance with the scheduling scheme. The “spatial signatures” of the individual user terminals (e.g., their MIMO channel responses) and multi-user diversity can be exploited to select the “best” set of “spatially compatible” user terminals for simultaneous transmission. Spatial compatibility may be quantified by a metric such as overall throughput or some other measure of performance. The best user set may be the one that achieves the highest score for the metric (e.g., the highest overall throughput) while conforming to the system constraints and requirements.
  • For clarity, a specific scheduling scheme that selects user terminals based on overall throughput is described below. In the following description, Nact user terminals are active and desire to transmit data on the uplink.
  • FIG. 3 shows a process 220 a for evaluating and selecting user terminals for transmission on the uplink. Process 220 a represents a specific scheduling scheme and may be used for block 220 in FIG. 2. Initially, a variable Rmax for the highest overall throughput is set to zero (block 310).
  • A new set of user terminals is selected from among the Nact active user terminals (block 312). This user set forms a hypothesis to be evaluated and is denoted as u n={un,1 un,2 . . . un,N up }, where n denotes the n-th user set being evaluated and un,i is the i-th user terminal in set n. An effective uplink channel response matrix H up,eff,n is formed for user set n with the effective uplink channel response vectors h up,eff,u n,1 through h up,eff,u n,N up for the Nup user terminals in set n (block 314).
  • The SNR for each user terminal in set n is then computed based on the effective uplink channel response matrix H up,eff,n and using the CCMI, MMSE, SIC, or some other technique employed by the access point (block 316). The SNRs for the user terminals with the CCMI and MMSE techniques can be computed as shown in equations (8) and (12), respectively. The SNRs for the user terminals with the SIC technique are dependent on the order in which the user terminals are recovered. For the SIC technique, one or multiple orderings of user terminals may be evaluated. For example, a specific ordering may be evaluated whereby the user terminal with the highest SNR at each stage is processed by the access point. In any case, the SNRs for the Nup user terminals in set n are denoted as {γn,1 γn,2 . . . γn,N up }.
  • The throughput for each user terminal in set n is then computed based on the SNR for the user terminal (block 318), as follows:
  • r n , i = · log 2 ( 1 + γ n , i c n , i ) , for i = 1 N up , Eq ( 20 )
  • where cn,i is a positive constant that reflects the fraction of the theoretical capacity achieved by the coding and modulation schemes to be used by user terminal un,i (e.g., cn,i=2 for a coding and modulation scheme that is 3 dB from Shannon capacity) and rn,i is the throughput or spectral efficiency for user terminal un,i given in units of bits per second per Hertz (bps/Hz). The overall throughput Rn achieved by user set n can be computed (block 320), as follows:
  • R n = i = 1 N up r n , i . Eq ( 21 )
  • A determination is then made whether or not the overall throughput Rn for user set n is greater than the maximum overall throughput achieved thus far for all user sets that have been evaluated (block 330). If the answer is yes, then user set n and the overall throughput Rn for this set are saved (block 332). Otherwise, user set n is discarded.
  • A determination is then made whether or not all user sets have been evaluated (block 340). If the answer is no, then the process returns to block 312 to select another set of user terminals for evaluation. Otherwise, the user terminals in the saved set are scheduled for transmission on the uplink (block 342).
  • For the embodiment described above, a metric based on theoretical capacity (albeit with a compensation factor cn,i) is used to select the best user set for uplink transmission. In another embodiment, a metric based on realizable throughput is used to select the best user set. For this embodiment, the user sets may be evaluated based on a set of “rates” supported by the system. These rates may be viewed as quantized values of the throughputs computed in equation (20). Each non-zero rate is associated with specific coding and modulation schemes, a particular spectral efficiency (which is typically given in units of bps/Hz), and a particular required SNR. The required SNR for each rate may be determined by computer simulation, empirical measurement, and so on, and based on an assumption of an AWGN channel. A look-up table (LUT) can store the set of supported rates and their required SNRs. The SNR for each user terminal is mapped to a selected rate, which is the highest rate in the look-up table with a required SNR that is equal to or lower than the SNR for the user terminal. The selected rates for all user terminals in each set are accumulated to obtain an aggregate rate for the set. The user set with the highest aggregate rate is scheduled for transmission.
  • User sets of different sizes may be evaluated to determine the best user set for transmission. For example, sets with one user terminal (i.e., Nup=1) may be evaluated first, then sets with two user terminals (i.e., Nup=2) may be evaluated next, and so on, and sets with Nap user terminals (i.e., Nup=Nap) may be evaluated last.
  • Depending on the values for Nup, Nact and Nap, a large number of user sets may need to be evaluated for an exhaustive search for the best user set. The number of user sets to evaluate may be reduced by prioritizing the active user terminals, considering other factors, and so on. The priority of each active user terminal may be determined based on various factors such as the service category for the user terminal (e.g., premium or normal), the average throughput achieved by the user terminal, the amount of data the user terminal has to send, the delay experienced by the user terminal, and so on. The priority of each user terminal may be updated over time to reflect the current status of the user terminal. As an example, only the Nap highest priority user terminals may be evaluated in each scheduling interval.
  • In the exemplary scheduling scheme described above for FIG. 3, the effective uplink channel response vector h up,eff,u n,i is derived independently (or “locally”) for each user terminal based only on the uplink channel response matrix H up,u n,i for the user terminal. The effective channel response matrix H up,eff,n for each user set n is formed with the independently derived effective channel response vectors for the user terminals in the set. The vectors h up,eff,u n,i , for i=1 . . . Nup, in the matrix H up,eff,n may not yield the highest possible overall throughput for user set n. Multiple sub-hypotheses may be evaluated for each user set, where the vectors in H up,eff,n may be adjusted by different amounts for each sub-hypothesis. For example, the phases of the steering vectors for the user terminals in set n may be modified in a deterministic manner (e.g., by some±percentage) or in a pseudo-random manner for each sub-hypothesis while maintaining the power of each steering vector at unity (i.e., a unit norm for each steering vector).
  • A scheduling scheme may also evaluate each user set n based on the uplink MIMO channel response matrices H up,u n,i instead of the effective uplink channel response vectors h up,eff,u n,i for the user terminals in the set. A steering vector v′ up,u n,i may be derived (“globally”) for each user terminal in set n in the presence of all user terminals in the set. The effective uplink channel response vector h′ up,eff,u n,i for each user terminal can be computed based on the (globally derived) steering vector v′ up,u n,i and the uplink channel response matrix H up,u n,i as follows: h′ up,eff,u n,i =H up,u n,i v′ up,u n,i . An effective uplink channel response matrix H′ up,eff,n is then formed for user set n based on the effective uplink channel response vectors h′ up,eff,u n,i for the user terminals in the set. The performance (e.g., overall throughput) of user set n is then evaluated with the matrix H′ up,eff,n (instead of the matrix H up,eff,n). As an example, multiple sub-hypotheses may be evaluated for user set n, where each sub-hypothesis corresponds to a different set of steering vectors for the user terminals in the set. The best sub-hypothesis is then selected for user set n. Multiple user sets may be evaluated in similar manner and the best user set is selected for uplink transmission.
  • Various other scheduling schemes may also be implemented and this is within the scope of the invention. Different scheduling schemes may consider different factors in selecting the user terminals for each set, derive the steering vectors for the user terminals in different manners, use other metrics to quantify the performance of each user set, and so on.
  • The uplink channel response matrix H up,m for each user terminal m may be estimated in various manners. Different channel estimation techniques may be used for TDD and FDD systems.
  • In an FDD system, the downlink and uplink use different frequency bands. The channel response for one link may not be correlated with the channel response for the other link. In this case, the access point can estimate the uplink MIMO channel response for each user terminal based on a pilot transmitted by the user terminal. The access point can perform decomposition of H up,m for each user terminal, derive the steering vector v up,m or {tilde over (v)} up,m, and send the steering vector to each user terminal selected for transmission.
  • For the FDD system, each user terminal m can transmit an unsteered pilot (or a MIMO pilot) to allow the access point to estimate the uplink MIMO channel response and obtain the matrix H up,m. The unsteered pilot comprises Nut,m orthogonal pilot transmissions sent from Nut,m user terminal antennas, where orthogonality may be achieved in time, frequency, code, or a combination thereof. For code orthogonality, user terminal m sends Nut,m pilot transmissions simultaneously from its Nut,m antennas, with the pilot transmission from each antenna being “covered” with a different orthogonal (e.g., Walsh) sequence. The access point “decovers” the received pilot symbols from each access point antenna i with the same Nut,m orthogonal sequences used by user terminal m to obtain estimates of the complex channel gain between access point antenna i and each of the Nut,m user terminal antennas. The covering at the user terminal and the decovering at the access point can be performed in similar manner as for a Code Division Multiple Access (CDMA) system. For frequency orthogonality, the Nut,m pilot transmissions for the Nut,m user terminal antennas can be sent simultaneously on different subbands of the overall system bandwidth. For time orthogonality, the Nut,m pilot transmissions for the Nut,m user terminal antennas can be sent in different time slots. In any case, the orthogonality among the Nut,m pilot transmissions allows the access point to distinguish the pilot transmission from each user terminal antenna.
  • Multiple user terminals can simultaneously transmit unsteered pilots on the uplink to the access point. The pilot transmissions for all user terminals are orthogonal in code, time, and/or frequency to allow the access point to estimate the uplink channel response for each user terminal.
  • In a TDD system, the downlink and uplink share the same frequency band. A high degree of correlation normally exists between the downlink and uplink channel responses. However, the responses of the transmit/receive chains at the access point may not be the same as the responses of the transmit/receive chains at the user terminal. If the differences can be determined via calibration and accounted for by applying the proper correction matrices at the access point and/or user terminal, then the overall downlink and uplink channel responses may be assumed to be reciprocal (i.e., transpose) of each other.
  • For the TDD system, the access point can transmit an unsteered pilot from Nap access point antennas. Each user terminal m can (1) process the downlink unsteered pilot to obtain its downlink MIMO channel response matrix H dn,m, (2) estimate the uplink MIMO channel response as the transpose of the downlink MIMO channel response (i.e., H up,mH dn,m T), (3) derive the steering vector v up,m or {tilde over (v)} up,m based on H up,m, and (4) compute the effective uplink channel response vector h up,eff,m. Each user terminal can send the vector h up,eff,m to the access point in a direct form (e.g., by sending the entries of h up,eff,m) or an indirect form (e.g., by transmitting a steered pilot that is generated with the steering vector v up,m or {tilde over (v)} up,m used for uplink transmission).
  • For clarity, the SDMA transmission techniques have been described for uplink transmission. These techniques may also be used for downlink transmission. A downlink MIMO channel response matrix H dn,m can be obtained for each user terminal m and decomposed to obtain a downlink steering vector v dn,m for the user terminal. The access point can evaluate different sets of user terminals for downlink transmission (e.g., in similar manner as that described above for the uplink) and select the best set of Ndn user terminals for downlink transmission.
  • For downlink transmission, the access point spatially processes Ndn data symbol streams with Ndn downlink steering vectors for the Ndn selected user terminals to obtain Nap transmit symbol streams, as follows:

  • x dn =V dn ·s dn,   Eq (22)
  • where s dn is an Ndn×1 vector with Ndn data symbols to be transmitted on the downlink to the Ndn selected user terminals;
      • V dn is an Nap×Ndn matrix with Ndn downlink steering vectors for the Ndn selected user terminals, which is V dn=[v dn,1 v dn,2 . . . v dn,N dn ]; and
      • x dn is an Nap×1 vector with Nap transmit symbols to be sent from the Nap access point antennas.
        The access point may also spatially process the downlink data symbol stream for each user terminal with a normalized downlink steering vector {tilde over (v)} dn,m for beam-steering.
  • If a user terminal is equipped with at least Nap antennas (i.e., Nut,m≧Nap), then the user terminal can perform receiver spatial processing using CCMI, MMSE, or some other technique to isolate and recover its downlink data symbol stream. If a user terminal is equipped with less than Nap antennas (i.e., Nut,m<Nap), then the user terminal can recover its downlink data symbol stream in the presence of crosstalk from the other data symbol streams.
  • For clarity, the SDMA transmission techniques have been described for a single-carrier narrowband MIMO system with flat-fading. These techniques may also be used for a wideband MIMO system and a multi-carrier MIMO system. A wideband MIMO system may utilize CDMA as the underlying wireless technology. A multi-carrier MIMO system may utilize OFDM or some other multi-carrier modulation technique. OFDM effectively partitions the overall system bandwidth into multiple (NF) orthogonal subbands. Each subband is associated with a respective carrier that may be modulated with data.
  • For a MIMO OFDM system, for each user terminal, the channel estimation may be performed for each of the NF subbands to obtain NF frequency-domain channel response matrices for the NF subbands. The spatial processing may be performed in various manners. In one embodiment, each of the NF channel response matrices is independently decomposed to obtain NF steering vectors for the NF subbands. Spatial processing is then performed for each subband with the steering vector obtained for that subband. In another embodiment, a single frequency-independent steering vector is derived for each user terminal based on the NF channel response matrices. Spatial processing is then performed for all NF subbands with this single steering vector. In any case, NF effective uplink channel response vectors h up,eff,m(k), for k=1 . . . N F, are formed for each user terminal with either the single or NF steering vectors. The user terminals may be evaluated based on their frequency-dependent effective channel response vectors.
  • For a wideband MIMO system, for each user terminal, a time-domain channel impulse response matrix may be obtained for each of multiple (NP) resolvable signal paths in the MIMO channel. In one embodiment, NP steering vectors are derived for each user terminal based on the NP channel impulse response matrices and used to account for the frequency-selective nature of the MIMO channel. In another embodiment, one steering vector is derived for each user terminal, for example, based on the channel impulse response matrix for the main signal path with the highest energy. In any case, the steering vector(s) may be used to derive one or more effective channel response vectors, which are in turn used to evaluate and select user terminals for transmission.
  • 4. Exemplary MIMO System
  • FIG. 4 shows a block diagram of access point 110 and two user terminals 120 m and 120 x in MIMO system 100. Access point 110 is equipped with Nap antennas 424 a through 424 ap. User terminal 120 m is equipped with Nut,m antennas 452 ma through 452 mu, and user terminal 120 x is equipped with Nut,x antennas 452 xa through 452 xu. Access point 110 is a transmitting entity for the downlink and a receiving entity for the uplink. Each user terminal 120 is a transmitting entity for the uplink and a receiving entity for the downlink. As used herein, a “transmitting entity” is an independently operated apparatus or device capable of transmitting data via a wireless channel, and a “receiving entity” is an independently operated apparatus or device capable of receiving data via a wireless channel. In the following description, the subscript “dn” denotes the downlink, the subscript “up” denotes the uplink, Nup user terminals are selected for simultaneous transmission on the uplink, Ndn user terminals are selected for simultaneous transmission on the downlink, Nup may or may not be equal to Ndn, and Nup and Ndn may be static values or can change for each scheduling interval. For simplicity, beam-steering is used in the following description.
  • On the uplink, at each user terminal 120 selected for uplink transmission, a TX data processor 488 receives traffic data from a data source 486 and control data from a controller 480. TX data processor 488 processes (e.g., encodes, interleaves, and modulates) the traffic data {dup,m} for the user terminal based on the coding and modulation schemes associated with the rate selected for the user terminal and provides a data symbol stream {sup,m}. A TX spatial processor 490 performs spatial processing on the data symbol stream {sup,m} with the steering vector v up,m, multiplexes in pilot symbols as needed, and provides Nut,m transmit symbol streams for the Nut,m antennas. The steering vector v up,m is derived based on the uplink channel response matrix H up,m for the user terminal, as described above. Each transmitter unit (TMTR) 454 receives and processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) a respective transmit symbol stream to generate an uplink signal. Nut,m transmitter units 454 provide Nut,m uplink signals for transmission from Nut,m antennas 452 to the access point.
  • Nup user terminals may be scheduled for simultaneous transmission on the uplink. Each of these user terminals performs spatial processing on its data symbol stream with its steering vector and transmits its set of transmit symbol streams on the uplink to the access point.
  • At access point 110, Nap antennas 424 a through 424 ap receive the uplink signals from all Nup user terminals transmitting on the uplink. Each antenna 424 provides a received signal to a respective receiver unit (RCVR) 422. Each receiver unit 422 performs processing complementary to that performed by transmitter unit 454 and provides a received symbol stream. An RX spatial processor 440 performs receiver spatial processing on the Nap received symbol streams from Nap receiver units 422 and provides Nup recovered uplink data symbol streams. The receiver spatial processing is performed in accordance with the CCMI, MMSE, SIC, or some other technique. A spatial filter matrix M ap for the access point is derived based on (1) the receiver spatial processing technique used by the access point and (2) the effective uplink channel response matrix H up,eff for the Nup user terminals. Each recovered uplink data symbol stream {ŝup,m} is an estimate of a data symbol stream {sup,m} transmitted by a respective user terminal. An RX data processor 442 processes (e.g., demodulates, deinterleaves, and decodes) each recovered uplink data symbol stream {ŝup,m} in accordance with the rate used for that stream to obtain decoded data. The decoded data for each user terminal may be provided to a data sink 444 for storage and/or a controller 430 for further processing.
  • On the downlink, at access point 110, a TX data processor 410 receives traffic data from a data source 408 for Ndn user terminals scheduled for downlink transmission, control data from a controller 430, and possibly other data from a scheduler 434. The various types of data may be sent on different transport channels. TX data processor 410 processes (e.g., encodes, interleaves, and modulates) the traffic data for each user terminal based on the rate selected for that user terminal. TX data processor 410 provides Ndn downlink data symbol streams for the Ndn user terminals. A TX spatial processor 420 performs spatial processing on the Ndn downlink data symbol streams with a matrix V dn of Ndn downlink steering vectors for the Ndn user terminals, multiplexes in pilot symbols, and provides Nap transmit symbol streams for the Nap antennas. Each transmitter unit 422 receives and processes a respective transmit symbol stream to generate a downlink signal. Nap transmitter units 422 provide Nap downlink signals for transmission from Nap antennas 424 to the user terminals.
  • At each user terminal 120, Nut,m antennas 452 receive the Nap downlink signals from access point 110. Each receiver unit 454 processes a received signal from an associated antenna 452 and provides a received symbol stream. An RX spatial processor 460 performs receiver spatial processing on Nut,m received symbol streams from Nut,m receiver units 454 and provides a recovered downlink data symbol stream {ŝdn,m} for the user terminal. The receiver spatial processing is performed in accordance with the CCMI, MMSE, or some other technique. A spatial filter matrix M ut,m for each user terminal is derived based on (1) the receiver spatial processing technique used by the user terminal and (2) the downlink channel response matrix H dn,m for the user terminal. An RX data processor 470 processes (e.g., demodulates, deinterleaves, and decodes) the recovered downlink data symbol stream to obtain decoded data for the user terminal.
  • At each user terminal 120, a channel estimator 478 estimates the downlink channel response and provides downlink channel estimates, which may include channel gain estimates, SNR estimates, and so on. Similarly, a channel estimator 428 estimates the uplink channel response and provides uplink channel estimates. The steering vectors for downlink and uplink transmission may be derived in various manners depending on whether the MIMO system is a TDD system or an FDD system, as described above. If the steering vector is derived by one entity (e.g., the access point) and needed by another entity (e.g., the user terminal), then the one entity sends the steering vector to the other entity.
  • Controller 480 for each user terminal typically derives the spatial filter matrix M ut,m for the user terminal based on the downlink channel response matrix H dn,m for that user terminal. Controller 430 derives the spatial filter matrix M ap for the access point based on the effective uplink channel response matrix H up,eff. Controller 480 for each user terminal may send feedback information (e.g., the downlink and/or uplink steering vectors, SNR estimates, and so on) to the access point. Controllers 430 and 480 also control the operation of various processing units at access point 110 and user terminal 120, respectively.
  • FIG. 5A shows a block diagram of a TX data processor 410 a that supports CDMA. TX data processor 410 a may be used for TX data processors 410 and 488 in FIG. 4. Within TX data processor 410 a, an encoder 512 receives and codes a data stream {dm} for user terminal m based on the coding scheme for the selected rate and provides code bits. The data stream may carry one or more data packets, and each data packet is typically coded separately to obtain a coded data packet. The coding increases the reliability of the data transmission. The coding scheme may include cyclic redundancy check (CRC) coding, convolutional coding, turbo coding, block coding, and so on, or a combination thereof. A channel interleaver 514 interleaves the code bits based on an interleaving scheme. The interleaving provides time, frequency, and/or spatial diversity for the code bits. A symbol mapping unit 516 maps the interleaved bits based on the modulation scheme for the selected rate and provides data symbols. Unit 516 groups each set of B interleaved bits to form a B-bit binary value, where B≧1, and further maps each B-bit value to a specific modulation symbol based on the modulation scheme (e.g., QPSK, M-PSK, or M-QAM, where M=2B). Each modulation symbol is a complex value in a signal constellation defined by the modulation scheme.
  • A CDMA modulator 520 performs modulation for CDMA. Within CDMA modulator 520, a channelizer 522 receives and channelizes the data symbols and pilot symbols onto different code channels. Each code channel is associated with a respective orthogonal sequence, which may be a Walsh sequence, an orthogonal variable spreading factor (OVSF) sequence, and so on. The channelization is referred to as “covering” in IS-2000 and IS-95 and “spreading” in W-CDMA. A scrambler 524 receives and spectrally spreads the channelized data for multiple code channels with a pseudo-random number (PN) sequence and provides a stream of data chips, which for simplicity is denoted as a data symbol stream {sm}. The spectral spreading is referred to as “spreading” in IS-2000 and IS-95 and “scrambling” in W-CDMA. The channelization and spectral spreading are known in the art and not described herein.
  • For the uplink, each data symbol stream is transmitted on a respective code channel, which is achieved by channelization with an orthogonal sequence. The Nup selected user terminals may concurrently transmit Nup or more data streams on different orthogonal code channels. Each user terminal performs spatial processing on all of its data symbol streams (or its data chip stream) with the same steering vector v up,m or {tilde over (v)} up,m. Similar processing occurs for the downlink.
  • FIG. 5B shows a block diagram of a TX data processor 410 b that supports OFDM. TX data processor 410 b may also be used for TX data processors 410 and 488 in FIG. 4. TX data processor 410 b includes encoder 512, channel interleaver 514, and symbol mapping unit 516, which operate as described above for FIG. 5A. TX data processor 410 b further includes an OFDM modulator 530 that performs modulation for OFDM. Within OFDM modulator 530, an inverse fast Fourier transform (IFFT) unit 532 receives the data symbols from symbol mapping unit 516 and pilot symbols, provides the data and pilot symbols on subbands designated for data and pilot transmission, and provides a signal value of zero (a “zero” symbol) for each subband not used for data/pilot transmission. For each OFDM symbol period, IFFT unit 532 transforms a set of NF data, pilot, and zero symbols to the time domain using an NF-point inverse fast Fourier transform and provides a corresponding transformed symbol that contains NF chips. A cyclic prefix generator 534 repeats a portion of each transformed symbol to obtain a corresponding OFDM symbol that contains NF+Ncp chips. The repeated portion is referred to as a cyclic prefix, and Ncp is the number of chips being repeated. The cyclic prefix ensures that the OFDM symbol retains its orthogonal properties in the presence of multipath delay spread caused by frequency selective fading (i.e., a frequency response that is not flat). Cyclic prefix generator 534 provides a stream of OFDM symbols, which for simplicity is also denoted as a data symbol stream {sm}.
  • For the uplink, each data symbol stream is transmitted on a respective set of subbands assigned for that stream. The Nup selected user terminals may concurrently transmit Nup or more data streams on different disjoint sets of subbands, where each of the NF subbands is assigned to at most one set. Each user terminal performs spatial processing on all of its data symbol streams (or its OFDM symbol stream) with the same steering vector v up,m or {tilde over (v)} up,m. Similar processing occurs for the downlink.
  • For simplicity, FIGS. 5A and 5B show the processing for one data stream {dm} to obtain one data symbol steam {sm}. Multiple data steams (e.g., for multiple user terminals on the downlink) may be processed with multiple instances of the TX data processor to obtain multiple data symbol steams.
  • FIGS. 5A and 5B show specific implementations in which the processing for CDMA and OFDM are performed prior to the spatial processing for multi-antenna transmission. In this case, the TX data processor includes the CDMA modulator or OFDM modulator, as shown in FIGS. 5A and 5B. The processing for CDMA and OFDM may also be performed after the spatial processing for multi-antenna transmission. In this case, each transmitter unit (TMTR) would include a CDMA modulator or an OFDM modulator that performs CDMA or OFDM processing on a respective transmit symbol stream to generate a corresponding modulated signal.
  • FIG. 6 shows the spatial processing at access point 110 and one user terminal 120 m for downlink and uplink transmission. For the uplink, at user terminal 120 m, the data symbol stream {sup,m} is multiplied with the steering vector v up,m by TX spatial processor 490 m to obtain the transmit symbol vector x up,m for the uplink. At access point 110, the received symbol vector r up (for user terminal 120 m as well as other user terminals) is multiplied with a spatial filter matrix M ap by a unit 640 and further scaled with a diagonal matrix D ap −1 by a unit 642 to obtain the recovered data symbol vector {tilde over (s)} up for the uplink. Units 640 and 642 are part of an RX spatial processor 440 a. The matrices M ap and D ap −1 are derived based on the effective uplink channel response matrix H up,eff and using the CCMI, MMSE, or some other technique.
  • For the downlink, at access point 110, the data symbol vector s dn (which includes the downlink data symbol streams for user terminal 120 m as well as other user terminals) is multiplied with the downlink steering matrix V dn by TX spatial processor 420 to obtain the transmit symbol vector x dn for the downlink. At user terminal 120 m, the received symbol vector r dn,m is multiplied with a spatial filter matrix M ut,m by a unit 660 and further scaled with a diagonal matrix D ut,m −1 by a unit 662 to obtain a downlink recovered data symbol stream {ŝdn,m} for user terminal 120 m. Units 660 and 662 are part of RX spatial processor 460 m. The matrices M ut,m and D ut,m −1 are derived based on the downlink channel response matrix H dn,m for user terminal 120 m and using the CCMI, MMSE, or some other technique.
  • FIG. 7 shows a block diagram of an RX spatial processor 440 b and an RX data processor 442 b, which implement the SIC technique and may be used for access point 110. RX spatial processor 440 b and RX data processor 442 b implement Nup successive (i.e., cascaded) receiver processing stages for Nup data symbol streams transmitted by Nup user terminals. Each of stages 1 to Nup−1 includes a spatial processor 710, an interference canceller 720, an RX data stream processor 730, and a TX data stream processor 740. The last stage includes only a spatial processor 710 u and an RX data stream processor 730 u.
  • For stage 1, spatial processor 710 a performs receiver spatial processing on the Nap received symbol streams and provides one recovered data symbol stream {ŝup,j 1 } for user terminal j1 being recovered in the first stage. RX data stream processor 730 a demodulates, deinterleaves, and decodes the recovered data symbol stream {ŝup,j 1 } and provides a decoded data stream {{circumflex over (d)}up,j 1 }. TX data stream processor 740 a encodes, interleaves, and modulates the decoded data stream {{circumflex over (d)}up,j 1 } in the same manner performed by user terminal j1 for that stream and provides a remodulated symbol stream {{hacek over (s)}up,j 1 }. Interference canceller 720 a performs transmitter spatial processing on the remodulated symbol stream {{hacek over (s)}up,j 1 } with the effective channel response vector h up,eff,j 1 for user terminal j1 to obtain Nap interference components due to the data symbol stream {sup,j 1 }. The Nap interference components are subtracted from the Nap received symbol streams to obtain Nap modified symbol streams, which are provided to stage 2.
  • Each of stages 2 through Nup−1 performs the same processing as stage 1, albeit on the Nap modified symbol streams from the preceding stage instead of the Nap received symbol streams. The last stage performs spatial processing and decoding on the Nap modified symbol streams from stage Nup−1 and does not perform interference estimation and cancellation.
  • Spatial processors 710 a through 710 u may each implement the CCMI, MMSE, or some other technique. Each spatial processor 710 multiplies an input (received or modified) symbol vector r sic l with a spatial filter matrix M ap l to obtain a detected symbol vector {tilde over (s)} up l, selects and scales one of the detected symbol streams, and provides the scaled symbol stream as the recovered data symbol stream for that stage. The matrix M ap l is derived based on a reduced effective channel response matrix H up,eff l for the stage.
  • FIG. 8 shows a block diagram of an embodiment of controller 430 and scheduler 434 for evaluating and scheduling user terminals for transmission on the downlink and uplink. Within controller 430, a request processor 810 receives access requests sent by user terminals 120 and possibly access requests from other sources. These access requests are for data transmission on the downlink and/or uplink. For clarity, scheduling for uplink transmission is described below.
  • Request processor 810 processes the received access requests and provides the identities (IDs) and the status of all active user terminals. A user selector 820 selects different sets of user terminals from among all active user terminals for evaluation. The user terminals may be selected for evaluation based on various factors such as user priority, the amount of data to send, system requirements, and so on.
  • An evaluation unit 830 evaluates each set of user terminals and provides a value for a metric for the set. For simplicity, the following description assumes that (1) overall throughput is used as the metric and (2) the effective uplink channel response vector is available for each active user terminal. Evaluation unit 830 includes a matrix computation unit 840 and a rate selector 850. Matrix computation unit 840 performs the SNR computation for each set of user terminals. For each set, unit 840 forms the effective uplink channel response matrix H up,eff,n for the set and computes the SNR for each user terminal in the set based on H up,eff,n and the receiver spatial processing technique used by the access point. Rate selector 850 receives a set of SNRs for each user set and determines the rate for each user terminal in the set as well as the overall throughput Rn for the set. Rate selector 850 may access a look-up table (LUT) 852, which stores a set of rates supported by the system and their required SNRs. Rate selector 850 determines the highest rate that may be used for uplink transmission by each user terminal based on the SNR computed for the user terminal. Rate selector 850 also accumulates the rates or throughputs for all user terminals in each set to obtain the overall throughput Rn for the set.
  • Scheduler 434 receives (1) the different sets of user terminals from user selector 820 and (2) the rates for the user terminals and the overall throughput for each set from rate selector 850. Scheduler 434 selects the best set of user terminals among all sets evaluated for each scheduling interval and schedules the selected user terminals for transmission on the uplink. Scheduler 434 provides scheduling information, which includes the identities of the selected user terminals, their rates, the scheduled transmission time (e.g., the start and the duration of the transmission), and so on. The scheduling information is sent to the selected user terminals.
  • The scheduling for downlink transmission may be performed in similar manner.
  • The SDMA transmission techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units used to support the underlying wireless technology (e.g., CDMA or OFDM) and the SDMA transmission on the downlink and uplink (e.g., the transmit and receive spatial processing at the access point and user terminal, the evaluation of different user sets, and so on) may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
  • For a software implementation, the SDMA transmission techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit (e.g., memory units 432 and 482 in FIG. 4) and executed by a processor (e.g., controllers 430 and 480). The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.
  • Headings are included herein for reference and to aid in locating certain sections. These headings are not intended to limit the scope of the concepts described therein under, and these concepts may have applicability in other sections throughout the entire specification.
  • The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (20)

1. A method of receiving data in a multiple-input multiple-output (MIMO) communication system, comprising:
obtaining, from a plurality of receive antennas at a receiving entity, a plurality of received symbol streams for a plurality of data symbol streams sent by a plurality of transmitting entities, one data symbol stream for each transmitting entity, wherein the data symbol stream for each transmitting entity is spatially processed with a steering vector for the transmitting entity and sent from a plurality of transmit antennas at the transmitting entity; and
wherein the steering vector for each transmitting entity is derived by:
decomposing a channel response matrix for the transmitting entity to obtain a plurality of eigenvectors and a plurality of singular values, and
forming the steering vector for the transmitting entity based on an eigenvector corresponding to a largest singular value among the plurality of singular values.
2. The method of claim 1, further comprising:
processing the plurality of received symbol streams in accordance with a receiver spatial processing technique to obtain a plurality of recovered data symbol streams, which are estimates of the plurality of data symbol streams.
3. The method of claim 2, wherein the receiver spatial processing technique is a channel correlation matrix inversion (CCMI) technique or a minimum mean square error (MMSE) technique.
4. The method of claim 2, wherein the receiver spatial processing technique is a successive interference cancellation (SIC) technique.
5. The method of claim 1, wherein the steering vector for each transmitting entity is equal to the eigenvector corresponding to the largest singular value.
6. An apparatus at a receiving entity in a multiple-input multiple-output (MIMO) communication system, comprising:
a plurality of receiver units operative to obtain from a plurality of receive antennas a plurality of received symbol streams for a plurality of data symbol streams sent by a plurality of transmitting entities, one data symbol stream for each transmitting entity, wherein the data symbol stream for each transmitting entity is spatially processed with a steering vector for the transmitting entity and sent from a plurality of transmit antennas at the transmitting entity; and
wherein the steering vector for each transmitting entity is derived by:
decomposing a channel response matrix for the transmitting entity to obtain a plurality of eigenvectors and a plurality of singular values, and
forming the steering vector for the transmitting entity based on an eigenvector corresponding to a largest singular value among the plurality of singular values.
7. The apparatus of claim 6, further comprising:
a receive spatial processor operative to process the plurality of received symbol streams in accordance with a receiver spatial processing technique to obtain a plurality of recovered data symbol streams, which are estimates of the plurality of data symbol streams.
8. The apparatus of claim 7, wherein the receiver spatial processing technique is a channel correlation matrix inversion (CCMI) technique or a minimum mean square error (MMSE) technique.
9. The apparatus of claim 7, wherein the receiver spatial processing technique is a successive interference cancellation (SIC) technique.
10. The apparatus of claim 6, wherein the steering vector for each transmitting entity is equal to the eigenvector corresponding to the largest singular value.
11. An apparatus at a receiving entity in a multiple-input multiple-output (MIMO) communication system, comprising:
means for obtaining from a plurality of receive antennas a plurality of received symbol streams for a plurality of data symbol streams sent by a plurality of transmitting entities, one data symbol stream for each transmitting entity, wherein the data symbol stream for each transmitting entity is spatially processed with a steering vector for the transmitting entity and sent from a plurality of transmit antennas at the transmitting entity; and
wherein the steering vector for each transmitting entity is derived by:
decomposing a channel response matrix for the transmitting entity to obtain a plurality of eigenvectors and a plurality of singular values, and
forming the steering vector for the transmitting entity based on an eigenvector corresponding to a largest singular value among the plurality of singular values.
12. The apparatus of claim 11, further comprising:
means for processing the plurality of received symbol streams in accordance with a receiver spatial processing technique to obtain a plurality of recovered data symbol streams, which are estimates of the plurality of data symbol streams.
13. The apparatus of claim 12, wherein the receiver spatial processing technique is a channel correlation matrix inversion (CCMI) technique or a minimum mean square error (MMSE) technique.
14. The apparatus of claim 12, wherein the receiver spatial processing technique is a successive interference cancellation (SIC) technique.
15. The apparatus of claim 11, wherein the steering vector for each transmitting entity is equal to the eigenvector corresponding to the largest singular value.
16. A computer-program product at a receiving entity in a multiple-input multiple-output (MIMO) communication system comprising a computer readable medium having instructions thereon, the instructions comprising:
code for obtaining from a plurality of receive antennas a plurality of received symbol streams for a plurality of data symbol streams sent by a plurality of transmitting entities, one data symbol stream for each transmitting entity, wherein the data symbol stream for each transmitting entity is spatially processed with a steering vector for the transmitting entity and sent from a plurality of transmit antennas at the transmitting entity; and
wherein the steering vector for each transmitting entity is derived by:
decomposing a channel response matrix for the transmitting entity to obtain a plurality of eigenvectors and a plurality of singular values, and
forming the steering vector for the transmitting entity based on an eigenvector corresponding to a largest singular value among the plurality of singular values.
17. The computer-program product of claim 16, further comprising:
code for processing the plurality of received symbol streams in accordance with a receiver spatial processing technique to obtain a plurality of recovered data symbol streams, which are estimates of the plurality of data symbol streams.
18. The computer-program product of claim 17, wherein the receiver spatial processing technique is a channel correlation matrix inversion (CCMI) technique or a minimum mean square error (MMSE) technique.
19. The computer-program product of claim 17, wherein the receiver spatial processing technique is a successive interference cancellation (SIC) technique.
20. The computer-program product of claim 16, wherein the steering vector for each transmitting entity is equal to the eigenvector corresponding to the largest singular value.
US12/172,979 2003-11-21 2008-07-14 Multi-antenna transmission for spatial division multiple access Abandoned US20090092087A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/172,979 US20090092087A1 (en) 2003-11-21 2008-07-14 Multi-antenna transmission for spatial division multiple access

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US10/719,802 US7298805B2 (en) 2003-11-21 2003-11-21 Multi-antenna transmission for spatial division multiple access
US11/869,457 US20080025425A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US12/172,979 US20090092087A1 (en) 2003-11-21 2008-07-14 Multi-antenna transmission for spatial division multiple access

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/869,457 Continuation US20080025425A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access

Publications (1)

Publication Number Publication Date
US20090092087A1 true US20090092087A1 (en) 2009-04-09

Family

ID=34591435

Family Applications (7)

Application Number Title Priority Date Filing Date
US10/719,802 Active 2025-11-23 US7298805B2 (en) 2003-11-21 2003-11-21 Multi-antenna transmission for spatial division multiple access
US11/869,609 Abandoned US20080025444A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,596 Abandoned US20080037681A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,457 Abandoned US20080025425A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,547 Active 2030-02-16 US9548851B2 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US12/172,979 Abandoned US20090092087A1 (en) 2003-11-21 2008-07-14 Multi-antenna transmission for spatial division multiple access
US15/405,934 Expired - Lifetime US10128920B2 (en) 2003-11-21 2017-01-13 Multi-antenna transmission for spatial division multiple access

Family Applications Before (5)

Application Number Title Priority Date Filing Date
US10/719,802 Active 2025-11-23 US7298805B2 (en) 2003-11-21 2003-11-21 Multi-antenna transmission for spatial division multiple access
US11/869,609 Abandoned US20080025444A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,596 Abandoned US20080037681A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,457 Abandoned US20080025425A1 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access
US11/869,547 Active 2030-02-16 US9548851B2 (en) 2003-11-21 2007-10-09 Multi-antenna transmission for spatial division multiple access

Family Applications After (1)

Application Number Title Priority Date Filing Date
US15/405,934 Expired - Lifetime US10128920B2 (en) 2003-11-21 2017-01-13 Multi-antenna transmission for spatial division multiple access

Country Status (15)

Country Link
US (7) US7298805B2 (en)
EP (1) EP1685660B1 (en)
JP (3) JP2007512773A (en)
KR (1) KR100862408B1 (en)
CN (3) CN102123023B (en)
AU (2) AU2004310663B2 (en)
BR (1) BRPI0416781A (en)
CA (3) CA2787797A1 (en)
HK (1) HK1207489A1 (en)
IL (1) IL175699A0 (en)
MX (1) MXPA06005709A (en)
RU (1) RU2346391C2 (en)
SG (3) SG150535A1 (en)
TW (1) TWI358214B (en)
WO (1) WO2005053186A1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090052357A1 (en) * 2006-08-14 2009-02-26 Datang Mobile Communiations Equipment Co., Ltd. Method for realizing frequency domain scheduling in the time division duplex system and the system thereof
US20090268657A1 (en) * 2007-07-20 2009-10-29 Angeliki Alexiou Relays in wireless communications
US20110280261A1 (en) * 2010-05-11 2011-11-17 Texas Instruments Incorporated Interleaver Design and Header Structure For ITU G.hnem
US20130272237A1 (en) * 2010-10-08 2013-10-17 Alcatel Lucent Transmission control
US9548851B2 (en) 2003-11-21 2017-01-17 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access
US9667318B2 (en) 2010-05-11 2017-05-30 Texas Instruments Corporation Device and frame structure for powerline communications
US10404336B1 (en) * 2017-07-17 2019-09-03 Marvell International Ltd. Systems and methods for channel correlation based user detection in an uplink multi-user transmission of a multiple-input multiple-output network

Families Citing this family (170)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100403596C (en) * 2001-11-29 2008-07-16 美商内数位科技公司 Efficient multiple input multiple output system for multi-path fading channels
US8194770B2 (en) * 2002-08-27 2012-06-05 Qualcomm Incorporated Coded MIMO systems with selective channel inversion applied per eigenmode
US7715508B2 (en) 2005-11-15 2010-05-11 Tensorcomm, Incorporated Iterative interference cancellation using mixed feedback weights and stabilizing step sizes
US8208364B2 (en) 2002-10-25 2012-06-26 Qualcomm Incorporated MIMO system with multiple spatial multiplexing modes
US20040081131A1 (en) 2002-10-25 2004-04-29 Walton Jay Rod OFDM communication system with multiple OFDM symbol sizes
US7002900B2 (en) 2002-10-25 2006-02-21 Qualcomm Incorporated Transmit diversity processing for a multi-antenna communication system
US8320301B2 (en) 2002-10-25 2012-11-27 Qualcomm Incorporated MIMO WLAN system
US7986742B2 (en) 2002-10-25 2011-07-26 Qualcomm Incorporated Pilots for MIMO communication system
US8169944B2 (en) * 2002-10-25 2012-05-01 Qualcomm Incorporated Random access for wireless multiple-access communication systems
US8218609B2 (en) 2002-10-25 2012-07-10 Qualcomm Incorporated Closed-loop rate control for a multi-channel communication system
US7324429B2 (en) 2002-10-25 2008-01-29 Qualcomm, Incorporated Multi-mode terminal in a wireless MIMO system
US8170513B2 (en) 2002-10-25 2012-05-01 Qualcomm Incorporated Data detection and demodulation for wireless communication systems
US8570988B2 (en) 2002-10-25 2013-10-29 Qualcomm Incorporated Channel calibration for a time division duplexed communication system
US8134976B2 (en) 2002-10-25 2012-03-13 Qualcomm Incorporated Channel calibration for a time division duplexed communication system
US7151809B2 (en) 2002-10-25 2006-12-19 Qualcomm, Incorporated Channel estimation and spatial processing for TDD MIMO systems
US8452294B2 (en) * 2003-04-23 2013-05-28 Qualcomm Incorporated In-band ate indicator methods and apparatus
US9049722B2 (en) * 2004-04-23 2015-06-02 Qualcomm Incorporated Methods and apparatus of enhancing performance in wireless communication systems
US9473269B2 (en) 2003-12-01 2016-10-18 Qualcomm Incorporated Method and apparatus for providing an efficient control channel structure in a wireless communication system
WO2005055543A1 (en) * 2003-12-03 2005-06-16 Australian Telecommunications Cooperative Research Centre Channel estimation for ofdm systems
US8204149B2 (en) 2003-12-17 2012-06-19 Qualcomm Incorporated Spatial spreading in a multi-antenna communication system
US8027417B2 (en) 2003-12-19 2011-09-27 Nortel Networks Limited Interference-weighted communication signal processing systems and methods
US7804762B2 (en) * 2003-12-30 2010-09-28 Intel Corporation Method and apparatus for implementing downlink SDMA in a wireless network
US7336746B2 (en) 2004-12-09 2008-02-26 Qualcomm Incorporated Data transmission with spatial spreading in a MIMO communication system
US8169889B2 (en) 2004-02-18 2012-05-01 Qualcomm Incorporated Transmit diversity and spatial spreading for an OFDM-based multi-antenna communication system
US7742533B2 (en) 2004-03-12 2010-06-22 Kabushiki Kaisha Toshiba OFDM signal transmission method and apparatus
US9819403B2 (en) * 2004-04-02 2017-11-14 Rearden, Llc System and method for managing handoff of a client between different distributed-input-distributed-output (DIDO) networks based on detected velocity of the client
US10886979B2 (en) * 2004-04-02 2021-01-05 Rearden, Llc System and method for link adaptation in DIDO multicarrier systems
US7633994B2 (en) 2004-07-30 2009-12-15 Rearden, LLC. System and method for distributed input-distributed output wireless communications
US11309943B2 (en) 2004-04-02 2022-04-19 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US8170081B2 (en) 2004-04-02 2012-05-01 Rearden, LLC. System and method for adjusting DIDO interference cancellation based on signal strength measurements
US10187133B2 (en) * 2004-04-02 2019-01-22 Rearden, Llc System and method for power control and antenna grouping in a distributed-input-distributed-output (DIDO) network
US9312929B2 (en) 2004-04-02 2016-04-12 Rearden, Llc System and methods to compensate for Doppler effects in multi-user (MU) multiple antenna systems (MAS)
US10749582B2 (en) 2004-04-02 2020-08-18 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US8654815B1 (en) 2004-04-02 2014-02-18 Rearden, Llc System and method for distributed antenna wireless communications
US8160121B2 (en) * 2007-08-20 2012-04-17 Rearden, Llc System and method for distributed input-distributed output wireless communications
US11394436B2 (en) 2004-04-02 2022-07-19 Rearden, Llc System and method for distributed antenna wireless communications
US7599420B2 (en) * 2004-07-30 2009-10-06 Rearden, Llc System and method for distributed input distributed output wireless communications
US10985811B2 (en) 2004-04-02 2021-04-20 Rearden, Llc System and method for distributed antenna wireless communications
US10200094B2 (en) * 2004-04-02 2019-02-05 Rearden, Llc Interference management, handoff, power control and link adaptation in distributed-input distributed-output (DIDO) communication systems
US7711030B2 (en) * 2004-07-30 2010-05-04 Rearden, Llc System and method for spatial-multiplexed tropospheric scatter communications
US7885354B2 (en) * 2004-04-02 2011-02-08 Rearden, Llc System and method for enhancing near vertical incidence skywave (“NVIS”) communication using space-time coding
US10277290B2 (en) 2004-04-02 2019-04-30 Rearden, Llc Systems and methods to exploit areas of coherence in wireless systems
US7418053B2 (en) 2004-07-30 2008-08-26 Rearden, Llc System and method for distributed input-distributed output wireless communications
US10425134B2 (en) 2004-04-02 2019-09-24 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US8571086B2 (en) * 2004-04-02 2013-10-29 Rearden, Llc System and method for DIDO precoding interpolation in multicarrier systems
US11451275B2 (en) 2004-04-02 2022-09-20 Rearden, Llc System and method for distributed antenna wireless communications
US9826537B2 (en) * 2004-04-02 2017-11-21 Rearden, Llc System and method for managing inter-cluster handoff of clients which traverse multiple DIDO clusters
US7636381B2 (en) * 2004-07-30 2009-12-22 Rearden, Llc System and method for distributed input-distributed output wireless communications
US8542763B2 (en) 2004-04-02 2013-09-24 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US8285226B2 (en) 2004-05-07 2012-10-09 Qualcomm Incorporated Steering diversity for an OFDM-based multi-antenna communication system
US8923785B2 (en) 2004-05-07 2014-12-30 Qualcomm Incorporated Continuous beamforming for a MIMO-OFDM system
ATE509441T1 (en) * 2004-06-18 2011-05-15 Nokia Corp FREQUENCY RANGE EQUALIZATION OF FREQUENCY SELECTIVE MIMO CHANNELS
US7978649B2 (en) 2004-07-15 2011-07-12 Qualcomm, Incorporated Unified MIMO transmission and reception
US7372913B2 (en) * 2004-07-22 2008-05-13 Qualcomm Incorporated Pilot tones in a multi-transmit OFDM system usable to capture transmitter diversity benefits
US9685997B2 (en) * 2007-08-20 2017-06-20 Rearden, Llc Systems and methods to enhance spatial diversity in distributed-input distributed-output wireless systems
US20060025079A1 (en) * 2004-08-02 2006-02-02 Ilan Sutskover Channel estimation for a wireless communication system
JP4744965B2 (en) 2004-08-09 2011-08-10 パナソニック株式会社 Wireless communication device
US8270512B2 (en) 2004-08-12 2012-09-18 Interdigital Technology Corporation Method and apparatus for subcarrier and antenna selection in MIMO-OFDM system
US7711762B2 (en) * 2004-11-15 2010-05-04 Qualcomm Incorporated Efficient computation for eigenvalue decomposition and singular value decomposition of matrices
US7895254B2 (en) * 2004-11-15 2011-02-22 Qualcomm Incorporated Eigenvalue decomposition and singular value decomposition of matrices using Jacobi rotation
US8724740B2 (en) 2005-03-11 2014-05-13 Qualcomm Incorporated Systems and methods for reducing uplink resources to provide channel performance feedback for adjustment of downlink MIMO channel data rates
US8995547B2 (en) * 2005-03-11 2015-03-31 Qualcomm Incorporated Systems and methods for reducing uplink resources to provide channel performance feedback for adjustment of downlink MIMO channel data rates
US7729325B2 (en) * 2005-04-05 2010-06-01 Toshiba America Research, Inc. Beamforming and distributed opportunistic scheduling in wireless networks
US7826516B2 (en) 2005-11-15 2010-11-02 Rambus Inc. Iterative interference canceller for wireless multiple-access systems with multiple receive antennas
US7991088B2 (en) * 2005-11-15 2011-08-02 Tommy Guess Iterative interference cancellation using mixed feedback weights and stabilizing step sizes
US7466749B2 (en) 2005-05-12 2008-12-16 Qualcomm Incorporated Rate selection with margin sharing
US7680211B1 (en) * 2005-05-18 2010-03-16 Urbain A. von der Embse MIMO maximum-likelihood space-time architecture
US8358714B2 (en) 2005-06-16 2013-01-22 Qualcomm Incorporated Coding and modulation for multiple data streams in a communication system
US20070041457A1 (en) 2005-08-22 2007-02-22 Tamer Kadous Method and apparatus for providing antenna diversity in a wireless communication system
BRPI0614854B1 (en) * 2005-08-22 2019-05-14 Qualcomm Incorporated METHOD AND EQUIPMENT FOR VIRTUAL ANTENNA SELECTION
JP5002215B2 (en) 2005-08-24 2012-08-15 パナソニック株式会社 MIMO receiving apparatus and MIMO receiving method
US8855704B2 (en) * 2005-08-26 2014-10-07 Qualcomm Incorporated Fast cell selection in TD-CDMA (UMTS TDD)
CN101346902A (en) 2005-09-22 2009-01-14 坎特雷勒电信有限责任公司 Method for selection of an optimized number of subscribers in mobile radio systems
JP4504293B2 (en) * 2005-09-29 2010-07-14 株式会社東芝 Wireless communication apparatus, wireless communication system, and wireless communication method provided with multiple antennas
CN101273599B (en) * 2005-09-29 2011-07-20 美商内数位科技公司 MIMO beamforming-based single carrier frequency division multiple access system
EP3641158A1 (en) * 2005-09-30 2020-04-22 Apple Inc. Mimo communication system
JP2007110456A (en) * 2005-10-14 2007-04-26 Hitachi Ltd Radio communication apparatus
US7602837B2 (en) * 2005-10-20 2009-10-13 Freescale Semiconductor, Inc. Beamforming for non-collaborative, space division multiple access systems
US8068464B2 (en) 2005-10-27 2011-11-29 Qualcomm Incorporated Varying scrambling/OVSF codes within a TD-CDMA slot to overcome jamming effect by a dominant interferer
US8130727B2 (en) * 2005-10-27 2012-03-06 Qualcomm Incorporated Quasi-orthogonal allocation of codes in TD-CDMA systems
JP4754325B2 (en) * 2005-10-28 2011-08-24 京セラ株式会社 Radio base station and channel allocation method
EP1780907B1 (en) * 2005-10-31 2008-07-09 Mitsubishi Electric Information Technology Centre Europe B.V. Method for controlling the transmission of signals
US20070110135A1 (en) 2005-11-15 2007-05-17 Tommy Guess Iterative interference cancellation for MIMO-OFDM receivers
US7940640B2 (en) * 2006-01-20 2011-05-10 Nortel Networks Limited Adaptive orthogonal scheduling for virtual MIMO system
KR100922936B1 (en) * 2006-02-07 2009-10-22 삼성전자주식회사 Method and system for transmitting/receiving data in a communication system
US8689025B2 (en) * 2006-02-21 2014-04-01 Qualcomm Incorporated Reduced terminal power consumption via use of active hold state
JP2009527997A (en) * 2006-02-21 2009-07-30 クゥアルコム・インコーポレイテッド Spatial pilot structure for multi-antenna wireless communication
US9461736B2 (en) * 2006-02-21 2016-10-04 Qualcomm Incorporated Method and apparatus for sub-slot packets in wireless communication
US8077595B2 (en) * 2006-02-21 2011-12-13 Qualcomm Incorporated Flexible time-frequency multiplexing structure for wireless communication
US9130791B2 (en) 2006-03-20 2015-09-08 Qualcomm Incorporated Uplink channel estimation using a signaling channel
TWI355819B (en) * 2006-03-20 2012-01-01 Qualcomm Inc Uplink channel estimation using a signaling channe
US8543070B2 (en) * 2006-04-24 2013-09-24 Qualcomm Incorporated Reduced complexity beam-steered MIMO OFDM system
US8290089B2 (en) 2006-05-22 2012-10-16 Qualcomm Incorporated Derivation and feedback of transmit steering matrix
US20080007453A1 (en) * 2006-06-12 2008-01-10 Bill Vassilakis Smart antenna array over fiber
JP4767771B2 (en) * 2006-06-27 2011-09-07 京セラ株式会社 Base station apparatus and spatial multiplexing method
US8787841B2 (en) * 2006-06-27 2014-07-22 Qualcomm Incorporated Method and system for providing beamforming feedback in wireless communication systems
BRPI0714275A2 (en) 2006-08-07 2013-04-16 Interdigital Tech Corp Method, apparatus and system for the implementation of multiple inputs and multiple virtual outputs of multiple users.
WO2008030806A2 (en) 2006-09-06 2008-03-13 Qualcomm Incorporated Codeword permutation and reduced feedback for grouped antennas
KR100712606B1 (en) * 2006-09-25 2007-05-02 (주)카이로넷 Method of determining a variable quantization step size for improving channel decoding, method and apparatus of performing channel decoding operation based on a variable quantization step size
US7551682B2 (en) * 2006-10-25 2009-06-23 Cisco Technology, Inc. Method for improving the performance of a wireless network utilizing beamforming weighting vectors
MY157859A (en) 2006-10-27 2016-07-29 Interdigital Tech Corp Method and apparatus for enhancing discontinuous reception in wireless systems
KR20080040105A (en) * 2006-11-02 2008-05-08 한국전자통신연구원 Efficient transmission apparatus and method based on beam
US20100142590A1 (en) * 2006-12-08 2010-06-10 Hoehne Thomas Calibration in a spread spectrum communications system
KR101002877B1 (en) * 2007-03-06 2010-12-21 한국과학기술원 A method and Apparatus for scheduling Multiple Users In communication
US20080260051A1 (en) * 2007-04-23 2008-10-23 Federico Boccardi Method and apparatus for transmitting information simultaneously to multiple destinations over shared wireless resources
JP5138974B2 (en) * 2007-04-27 2013-02-06 株式会社日立製作所 MIMO wireless communication system, MIMO wireless communication apparatus, and wireless communication method
US20080317178A1 (en) * 2007-06-25 2008-12-25 Joonsuk Kim Method and system for sfbc/stbc using interference cancellation
US7953188B2 (en) * 2007-06-25 2011-05-31 Broadcom Corporation Method and system for rate>1 SFBC/STBC using hybrid maximum likelihood (ML)/minimum mean squared error (MMSE) estimation
US9521680B2 (en) * 2007-07-10 2016-12-13 Qualcomm Incorporated Methods and apparatus for successive interference cancellation based on three rate reports from interfering device in peer-to-peer networks
US9668225B2 (en) * 2007-07-10 2017-05-30 Qualcomm Incorporated Methods and apparatus for active successive interference cancellation based on one rate feedback and probability adaptation in peer-to-peer networks
US8849197B2 (en) * 2007-07-10 2014-09-30 Qualcomm Incorporated Methods and apparatus for active successive interference cancellation in peer-to-peer networks
US8855567B2 (en) * 2007-07-10 2014-10-07 Qualcomm Incorporated Methods and apparatus for successive interference cancellation based on two rate feedback in peer-to-peer networks
US8433349B2 (en) * 2007-07-10 2013-04-30 Qualcomm Incorporated Methods and apparatus for successive interference cancellation based on transmit power control by interfering device with success probability adaptation in peer-to-peer wireless networks
US8874040B2 (en) * 2007-07-10 2014-10-28 Qualcomm Incorporated Methods and apparatus for successive interference cancellation based on rate capping in peer-to-peer networks
US8989155B2 (en) * 2007-08-20 2015-03-24 Rearden, Llc Systems and methods for wireless backhaul in distributed-input distributed-output wireless systems
US7447276B1 (en) * 2007-08-29 2008-11-04 Harris Corporation Receiver and method for blind adaptive thresholding using noise estimator
US20090093222A1 (en) * 2007-10-03 2009-04-09 Qualcomm Incorporated Calibration and beamforming in a wireless communication system
US7782755B2 (en) * 2007-12-21 2010-08-24 Motorola, Inc. Method for uplink collaborative SDMA user pairing in WIMAX
WO2009105418A1 (en) 2008-02-20 2009-08-27 Hobbit Wave Beamforming devices and methods
US9300371B1 (en) 2008-03-07 2016-03-29 Marvell International Ltd. Beamforming systems and methods
MX2011000678A (en) * 2008-07-29 2011-02-25 Panasonic Corp Mimo transmission device and mimo transmission method.
US8848631B2 (en) 2008-09-22 2014-09-30 Panasonic Intellectual Property Corporation Of America Wireless communication apparatus, wireless communication system, and wireless communication method
DK2375604T3 (en) 2009-01-07 2018-11-19 Sun Patent Trust Wireless communication device, wireless communication system and method of wireless communication
WO2010088843A1 (en) * 2009-02-06 2010-08-12 大唐移动通信设备有限公司 Method, system and apparatus for space division multiple access and data demodulation
US8494031B2 (en) * 2009-02-27 2013-07-23 Qualcomm Incorporated Protocol operation and message design for SDMA data transmission to a plurality of stations
KR101800294B1 (en) * 2009-04-02 2017-12-20 삼성전자주식회사 Apparatus and method for error minimization of cell boundary users in multi-call communication system
CN101877689B (en) * 2009-04-28 2012-10-17 华为技术有限公司 Data transmitting method and device thereof as well as data receiving method and device thereof
CN102100045B (en) * 2009-04-28 2014-12-10 华为技术有限公司 Data transmitting processing method and apparatus, data receiving processing method and apparatus
EP2495612B1 (en) 2009-10-30 2019-11-27 Fujitsu Limited Optical signal processing device, receiver, and optical network system
US9474082B2 (en) 2009-11-09 2016-10-18 Apple Inc. Method and apparatus for co-scheduling transmissions in a wireless network
US8434336B2 (en) * 2009-11-14 2013-05-07 Qualcomm Incorporated Method and apparatus for managing client initiated transmissions in multiple-user communication schemes
RU2519332C2 (en) * 2010-01-12 2014-06-10 ЗедТиИ (ЮЭсЭй) ИНК. Method and system for spatial channel state information feedback based on kronecker product
US20110194655A1 (en) * 2010-02-10 2011-08-11 Qualcomm Incorporated Methods and apparatus to perform residual frequency offset estimation and correction in ieee 802.11 waveforms
WO2011124028A1 (en) 2010-04-07 2011-10-13 Nokia Corporation Relay control channel search space configuration
US9059821B2 (en) * 2011-08-02 2015-06-16 Celeno Communications (Israel) Ltd. Carrier grouping schemes for wireless local area networks
WO2013134506A2 (en) 2012-03-07 2013-09-12 Hobbit Wave, Inc. Devices and methods using the hermetic transform
US9154353B2 (en) 2012-03-07 2015-10-06 Hobbit Wave, Inc. Devices and methods using the hermetic transform for transmitting and receiving signals using OFDM
US11189917B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for distributing radioheads
US11190947B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for concurrent spectrum usage within actively used spectrum
US10194346B2 (en) 2012-11-26 2019-01-29 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US11050468B2 (en) 2014-04-16 2021-06-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
US20140169234A1 (en) * 2012-12-14 2014-06-19 Futurewei Technologies, Inc. Systems and Methods for Interference Avoidance, Channel Sounding, and Other Signaling for Multi-User Full Duplex Transmission
US10488535B2 (en) 2013-03-12 2019-11-26 Rearden, Llc Apparatus and method for capturing still images and video using diffraction coded imaging techniques
US9923657B2 (en) 2013-03-12 2018-03-20 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US9973246B2 (en) 2013-03-12 2018-05-15 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10164698B2 (en) 2013-03-12 2018-12-25 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10547358B2 (en) 2013-03-15 2020-01-28 Rearden, Llc Systems and methods for radio frequency calibration exploiting channel reciprocity in distributed input distributed output wireless communications
WO2015061709A1 (en) 2013-10-25 2015-04-30 HOBBIT, Wave Devices and methods employing hermetic transforms for encoding and decoding digital information in spread-spectrum communication systems
WO2015105592A2 (en) 2013-11-22 2015-07-16 Hobbit Wave Radar using hermetic transforms
US11290162B2 (en) 2014-04-16 2022-03-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
JP6394698B2 (en) * 2014-06-20 2018-09-26 株式会社ニコン Information storage device, information storage system, and information storage control program
US11304661B2 (en) 2014-10-23 2022-04-19 VertoCOMM, Inc. Enhanced imaging devices, and image construction methods and processes employing hermetic transforms
US9871684B2 (en) 2014-11-17 2018-01-16 VertoCOMM, Inc. Devices and methods for hermetic transform filters
FR3029375A1 (en) * 2014-11-28 2016-06-03 Orange METHOD AND DEVICE FOR SOFT AND SELECTIVE SSDF RELAY
CN105871483A (en) * 2015-01-21 2016-08-17 中兴通讯股份有限公司 Wireless channel measurement system, transmitter and receiver
US9552510B2 (en) 2015-03-18 2017-01-24 Adobe Systems Incorporated Facial expression capture for character animation
US9576356B2 (en) * 2015-05-08 2017-02-21 Siemens Healthcare Gmbh Region clustering forest for analyzing medical imaging data
DE102015111638B4 (en) * 2015-07-17 2023-01-05 Apple Inc. beam shaping device
CN106487436B (en) * 2015-09-01 2021-03-23 中兴通讯股份有限公司 Hybrid beam forming uplink multi-user pairing method and device
US20170170884A1 (en) * 2015-12-14 2017-06-15 Qualcomm Incorporated Mu-mimo scheduler transmit mode probing with transmit mode scoring
US10305717B2 (en) 2016-02-26 2019-05-28 VertoCOMM, Inc. Devices and methods using the hermetic transform for transmitting and receiving signals using multi-channel signaling
WO2017165556A1 (en) 2016-03-23 2017-09-28 The Regents Of The University Of California Interference-tolerant multiple-user radar system
CN107248878A (en) * 2016-03-29 2017-10-13 北京信威通信技术股份有限公司 A kind of method and device of precoding
CN107508661B (en) * 2016-06-14 2020-07-21 华为技术有限公司 Data processing method, network equipment and terminal
CN107846266B (en) * 2016-09-18 2022-03-04 中兴通讯股份有限公司 Time-frequency resource space division scheduling method and device
US9942020B1 (en) * 2017-04-26 2018-04-10 Cisco Technology, Inc. Minimum delay spatio-temporal filtering for interference rejection
CN108880641B (en) * 2017-05-16 2022-02-25 中兴通讯股份有限公司 Resource allocation method and device for wireless mobile communication system
KR102118389B1 (en) * 2018-06-27 2020-06-03 에스케이텔레콤 주식회사 Basement apparatus, and control method thereof
US20210092734A1 (en) * 2019-09-24 2021-03-25 Qualcomm Incorporated Sequence based physical uplink control channel transmission
CN113141229B (en) * 2020-01-20 2022-07-01 大唐移动通信设备有限公司 Interference suppression method and device

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5592490A (en) * 1991-12-12 1997-01-07 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems
US5642353A (en) * 1991-12-12 1997-06-24 Arraycomm, Incorporated Spatial division multiple access wireless communication systems
US5828658A (en) * 1991-12-12 1998-10-27 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems with spatio-temporal processing
US6128276A (en) * 1997-02-24 2000-10-03 Radix Wireless, Inc. Stacked-carrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays
US20020196842A1 (en) * 2001-03-30 2002-12-26 Texas Instruments Incorporated Closed loop multiple transmit, multiple receive antenna wireless communication system
US20030072382A1 (en) * 1996-08-29 2003-04-17 Cisco Systems, Inc. Spatio-temporal processing for communication
US20040086027A1 (en) * 2002-10-31 2004-05-06 Shattil Steve J. Orthogonal superposition coding for direct-sequence communications
US6760388B2 (en) * 2001-12-07 2004-07-06 Qualcomm Incorporated Time-domain transmit and receive processing with channel eigen-mode decomposition for MIMO systems
US20040136349A1 (en) * 2002-10-25 2004-07-15 Walton J. Rodney MIMO system with multiple spatial multiplexing modes
US20050078762A1 (en) * 2003-10-08 2005-04-14 Ketchum John W. Receiver spatial processing for eigenmode transmission in a MIMO system
US7020482B2 (en) * 2002-01-23 2006-03-28 Qualcomm Incorporated Reallocation of excess power for full channel-state information (CSI) multiple-input, multiple-output (MIMO) systems
US7020110B2 (en) * 2002-01-08 2006-03-28 Qualcomm Incorporated Resource allocation for MIMO-OFDM communication systems
US7047016B2 (en) * 2001-05-16 2006-05-16 Qualcomm, Incorporated Method and apparatus for allocating uplink resources in a multiple-input multiple-output (MIMO) communication system
US7149254B2 (en) * 2001-09-06 2006-12-12 Intel Corporation Transmit signal preprocessing based on transmit antennae correlations for multiple antennae systems
US7151809B2 (en) * 2002-10-25 2006-12-19 Qualcomm, Incorporated Channel estimation and spatial processing for TDD MIMO systems
US7280625B2 (en) * 2002-12-11 2007-10-09 Qualcomm Incorporated Derivation of eigenvectors for spatial processing in MIMO communication systems
US7298805B2 (en) * 2003-11-21 2007-11-20 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2192094C1 (en) * 2001-02-05 2002-10-27 Гармонов Александр Васильевич Method for coherent staggered signal transmission
GB0104610D0 (en) * 2001-02-23 2001-04-11 Koninkl Philips Electronics Nv Radio communication system
US20030125040A1 (en) * 2001-11-06 2003-07-03 Walton Jay R. Multiple-access multiple-input multiple-output (MIMO) communication system

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5642353A (en) * 1991-12-12 1997-06-24 Arraycomm, Incorporated Spatial division multiple access wireless communication systems
US5828658A (en) * 1991-12-12 1998-10-27 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems with spatio-temporal processing
US5592490A (en) * 1991-12-12 1997-01-07 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems
US20030072382A1 (en) * 1996-08-29 2003-04-17 Cisco Systems, Inc. Spatio-temporal processing for communication
US6128276A (en) * 1997-02-24 2000-10-03 Radix Wireless, Inc. Stacked-carrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays
US6512737B1 (en) * 1997-02-24 2003-01-28 Beamreach Networks, Inc. Stacked carrier discrete multiple tone communication system
US20020196842A1 (en) * 2001-03-30 2002-12-26 Texas Instruments Incorporated Closed loop multiple transmit, multiple receive antenna wireless communication system
US7047016B2 (en) * 2001-05-16 2006-05-16 Qualcomm, Incorporated Method and apparatus for allocating uplink resources in a multiple-input multiple-output (MIMO) communication system
US7149254B2 (en) * 2001-09-06 2006-12-12 Intel Corporation Transmit signal preprocessing based on transmit antennae correlations for multiple antennae systems
US6760388B2 (en) * 2001-12-07 2004-07-06 Qualcomm Incorporated Time-domain transmit and receive processing with channel eigen-mode decomposition for MIMO systems
US7020110B2 (en) * 2002-01-08 2006-03-28 Qualcomm Incorporated Resource allocation for MIMO-OFDM communication systems
US7020482B2 (en) * 2002-01-23 2006-03-28 Qualcomm Incorporated Reallocation of excess power for full channel-state information (CSI) multiple-input, multiple-output (MIMO) systems
US7151809B2 (en) * 2002-10-25 2006-12-19 Qualcomm, Incorporated Channel estimation and spatial processing for TDD MIMO systems
US20040136349A1 (en) * 2002-10-25 2004-07-15 Walton J. Rodney MIMO system with multiple spatial multiplexing modes
US20040086027A1 (en) * 2002-10-31 2004-05-06 Shattil Steve J. Orthogonal superposition coding for direct-sequence communications
US7280625B2 (en) * 2002-12-11 2007-10-09 Qualcomm Incorporated Derivation of eigenvectors for spatial processing in MIMO communication systems
US20050078762A1 (en) * 2003-10-08 2005-04-14 Ketchum John W. Receiver spatial processing for eigenmode transmission in a MIMO system
US7298805B2 (en) * 2003-11-21 2007-11-20 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access
US20080025444A1 (en) * 2003-11-21 2008-01-31 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access
US20080037681A1 (en) * 2003-11-21 2008-02-14 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9548851B2 (en) 2003-11-21 2017-01-17 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access
US10128920B2 (en) 2003-11-21 2018-11-13 Qualcomm Incorporated Multi-antenna transmission for spatial division multiple access
US7733765B2 (en) * 2006-08-14 2010-06-08 Datang Mobile Communications Equipment Co., Ltd. Method for realizing frequency domain scheduling in the time division duplex system and the system thereof
US20090052357A1 (en) * 2006-08-14 2009-02-26 Datang Mobile Communiations Equipment Co., Ltd. Method for realizing frequency domain scheduling in the time division duplex system and the system thereof
US20090268657A1 (en) * 2007-07-20 2009-10-29 Angeliki Alexiou Relays in wireless communications
US8774085B2 (en) * 2007-07-20 2014-07-08 Alcatel Lucent Relays in wireless communications
US10141978B2 (en) 2010-05-11 2018-11-27 Texas Instruments Incorporated Data encoder for power line communications
US9112753B2 (en) * 2010-05-11 2015-08-18 Texas Instruments Incorporated Interleaver design and header structure for ITU G.hnem
US9667318B2 (en) 2010-05-11 2017-05-30 Texas Instruments Corporation Device and frame structure for powerline communications
US9819392B2 (en) 2010-05-11 2017-11-14 Texas Instruments Incorporated Data encoder for power line communications
US20110280261A1 (en) * 2010-05-11 2011-11-17 Texas Instruments Incorporated Interleaver Design and Header Structure For ITU G.hnem
US10541727B2 (en) 2010-05-11 2020-01-21 Texas Instruments Incorporated Data encoder for power line communications
US11005530B2 (en) 2010-05-11 2021-05-11 Texas Instruments Incorporated Data encoder for power line communications
US11791862B2 (en) 2010-05-11 2023-10-17 Texas Instruments Incorporated Data encoder for power line communications
US9203479B2 (en) * 2010-10-08 2015-12-01 Alcatel Lucent Transmission control
US20130272237A1 (en) * 2010-10-08 2013-10-17 Alcatel Lucent Transmission control
US10404336B1 (en) * 2017-07-17 2019-09-03 Marvell International Ltd. Systems and methods for channel correlation based user detection in an uplink multi-user transmission of a multiple-input multiple-output network
US10735061B1 (en) 2017-07-17 2020-08-04 Nxp Usa, Inc. Systems and methods for channel correlation based user detection in an uplink multi-user transmission of a multiple-input multiple-output network

Also Published As

Publication number Publication date
US7298805B2 (en) 2007-11-20
US20080025425A1 (en) 2008-01-31
JP2007512773A (en) 2007-05-17
CN104393899B (en) 2017-11-07
WO2005053186A1 (en) 2005-06-09
JP5595746B2 (en) 2014-09-24
CN102123023B (en) 2012-09-05
CN1906864A (en) 2007-01-31
CN102123023A (en) 2011-07-13
JP2010213288A (en) 2010-09-24
SG150536A1 (en) 2009-03-30
JP2010183578A (en) 2010-08-19
US20080037681A1 (en) 2008-02-14
AU2004310663B2 (en) 2009-01-08
BRPI0416781A (en) 2007-03-06
RU2346391C2 (en) 2009-02-10
SG150535A1 (en) 2009-03-30
US20120213302A1 (en) 2012-08-23
KR20060094985A (en) 2006-08-30
RU2006121997A (en) 2007-12-27
MXPA06005709A (en) 2006-08-23
CA2787797A1 (en) 2005-06-09
US20170126290A1 (en) 2017-05-04
EP1685660A1 (en) 2006-08-02
US10128920B2 (en) 2018-11-13
US20080025444A1 (en) 2008-01-31
IL175699A0 (en) 2006-09-05
HK1207489A1 (en) 2016-01-29
JP5456540B2 (en) 2014-04-02
AU2004310663A1 (en) 2005-06-09
TWI358214B (en) 2012-02-11
EP1685660B1 (en) 2016-05-11
CA2787842A1 (en) 2005-06-09
KR100862408B1 (en) 2008-10-08
SG150537A1 (en) 2009-03-30
CN104393899A (en) 2015-03-04
CA2546749A1 (en) 2005-06-09
AU2008243127A1 (en) 2008-11-27
TW200537834A (en) 2005-11-16
US20050111599A1 (en) 2005-05-26
CA2787842C (en) 2013-08-20
US9548851B2 (en) 2017-01-17
CA2546749C (en) 2012-10-23

Similar Documents

Publication Publication Date Title
US10128920B2 (en) Multi-antenna transmission for spatial division multiple access
US9048892B2 (en) MIMO system with multiple spatial multiplexing modes
US7336746B2 (en) Data transmission with spatial spreading in a MIMO communication system
US7194042B2 (en) Data transmission with spatial spreading in a mimo communication system
JP2006521068A (en) Transmission mode selection for data transmission in multi-channel communication systems

Legal Events

Date Code Title Description
AS Assignment

Owner name: QUALCOMM INCORPORATED, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WALTON, J. RODNEY;KETCHUM, JOHN W.;SMEE, JOHN EDWARD;AND OTHERS;REEL/FRAME:021741/0284;SIGNING DATES FROM 20031110 TO 20031120

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION