[go: up one dir, main page]

US8238225B2 - Method and system of managing control information - Google Patents

Method and system of managing control information Download PDF

Info

Publication number
US8238225B2
US8238225B2 US12/605,462 US60546209A US8238225B2 US 8238225 B2 US8238225 B2 US 8238225B2 US 60546209 A US60546209 A US 60546209A US 8238225 B2 US8238225 B2 US 8238225B2
Authority
US
United States
Prior art keywords
unit
user
scheduled
units
base unit
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.)
Expired - Fee Related, expires
Application number
US12/605,462
Other languages
English (en)
Other versions
US20100046461A1 (en
Inventor
Mattias WENNSTROM
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Assigned to HUAWEI TECHNOLOGIES CO., LTD. reassignment HUAWEI TECHNOLOGIES CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WENNSTROM, MATTIAS
Publication of US20100046461A1 publication Critical patent/US20100046461A1/en
Application granted granted Critical
Publication of US8238225B2 publication Critical patent/US8238225B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0452—Multi-user MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity 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/0615—Diversity 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/0665—Feed forward of transmit weights to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03343—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037—Inter-user or inter-terminal allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0093—Point-to-multipoint
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L2025/0335—Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03375—Passband transmission
    • H04L2025/03414—Multicarrier
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L2025/03777—Arrangements for removing intersymbol interference characterised by the signalling
    • H04L2025/03802—Signalling on the reverse channel

Definitions

  • the present disclosure relates to a method of managing control information in a multi-user multi-input, multi-output system.
  • the present disclosure also relates to a multi-user multi-input multi-output system, different units belonging to such a system, and to various computer program elements whereby an inventive method or inventive units can be realized.
  • MIMO multiple-input, multiple-output
  • OFDM wireless orthogonal frequency division multiplexing
  • an OFDM time-frequency resource can simultaneously be shared by multiple users. This is described in publications “Philips, 3GPP Technical document R1-071403”, “Samsung, 3GPP Technical document R1-060335”, “On the optimality of multiantenna broadcast scheduling using zero forcing beamforming” by T. Yoo and A. Goldsmith, IEEE journal on selected areas in communications, Vol. 24, No. 3, March 2006, pp. 528-541.
  • precoding at the base station is performed in form of a linear mapping of each users signal to the transmitter antennas.
  • This linear mapping is easily described by a matrix multiplication, where a precoding matrix, is jointly selected by the scheduled mobile users to minimize the mutual interference.
  • precoded MU-MIMO is a closed loop MIMO scheme where the transmission is adjusted based on the channel to the co-scheduled mobile users.
  • each mobile user selects a channel quantization vector (CQV) from a finite mobile user codebook of precoding vectors.
  • the CQV is a quantization of the estimated channel vector from the N T base station transmitter antennas to the receiver antenna at the mobile user. If the mobile user has multiple receive antennas, the mobile user can find a receiver filter to combine the multiple receive antennas to obtain a virtual single antenna. The CQV is then estimated as the channel from the N T base station transmitter antennas to the single virtual receive antenna, i.e. after receiver filtering.
  • the selected CQV from the mobile user codebook is signalled to the base station.
  • the scheduler in the base station determines which mobile users are to be co-scheduled in an OFDM time frequency resource and selects the precoding matrix based on the reported CQV from these users.
  • the mobile users need to have knowledge of the used transmitter precoding matrix and this information needs to be signalled to the mobile users.
  • One problem with MU-MIMO signalling lies in the overhead of signalling the used precoding matrix at the base station transmitter to all the scheduled mobile users. If L mobile users are scheduled together in a mutual OFDM time-frequency resource, and there is a one-to-one correspondence between the selected vectors in the mobile user codebook and the selected base station precoding matrix, then there are K L possible base station transmitter precoding matrices where K is the number of vectors in the mobile user codebook. To signal the used transmitter precoding matrix in the downlink, L ⁇ log 2 (K) bits are needed, which generally is too large to be practical.
  • the predefined function is known to each user unit, the control information to each user unit only contains information on the index from every other user unit, and respective user unit regenerates the precoding matrix according to its own index, other user units' indices and the predefined function.
  • the base unit Since the base unit must have used the index of the user unit in the construction of the precoding matrix, the user unit has a prior knowledge of how the precoding matrix is constructed and this need not to be re-confirmed; only the residual information needs to be signalled to user unit. This will limit the required number of bits to represent the precoding matrix in the control message from L ⁇ log 2 (K) bits to (L ⁇ 1) ⁇ log 2 (K) bits, which is a significant reduction of the control signalling.
  • the index from the user codebook could for instance correspond to a requested channel quantization vector.
  • the base unit and respective user unit agree on forbidden combinations of indices from co-scheduled user units and take these forbidden combinations into consideration when selecting/regenerating the precoding matrix.
  • defined forbidden combinations of indices limits the possible amount of precoding matrices and thus limits the number of bits required to represent all possible precoding matrices to (L ⁇ 1) ⁇ log 2 (S) bits where S ⁇ K.
  • One proposed way of deciding on forbidden combinations is to have the base unit and respective user units to agree on a real-valued positive threshold (T), where a first user unit (A) and a second user unit (B) is only allowed to be co-scheduled if their respective indices represent vectors ( ⁇ a , ⁇ b ) that fulfils the condition
  • ⁇ ( H ) H ( H * H ) ⁇ 1
  • H [ x 1 x 2 . . . x L ]
  • the output of the function ⁇ is a N T by L precoding matrix.
  • the base unit transmits a single stream and indicates this in the control information to the user unit. It is also taught that if the least amount of bits required to represent the possible amount of precoding matrices has at least one free bit combination, then it is possible to allow one bit combination to represent single stream transmission.
  • a base unit In a method, system, a base unit, a user unit and a computer program element according to the present disclosure, less number of bits are required to represent the used precoding matrix in the control messages form the base unit to the user units. This will significantly reduce the signalling overhead for MU-MIMO communication systems.
  • FIG. 1 is a schematic and simplified illustration of a MU-MIMO system where indices are sent from the user units to the base unit, and
  • FIG. 2 is a schematic and simplified illustration of a MU-MIMO system where control information is sent from the base unit to the user units.
  • FIG. 1 showing in a multi-user multi-input, multi-output (MU-MIMO) system 1 with one base unit 2 and one or several user units 31 , 32 , where the base unit has N T antennas.
  • the user units 31 , 32 are for instance mobile telephones or other mobile communication units present within a cell serviced by the base unit 2 .
  • a user unit may also be any stationary unit that uses the MU-MIMO system for communication.
  • Respective user unit 31 sends an index a 1 representing a vector ⁇ from a user codebook 311 belonging to the user unit 31 .
  • Respective user unit 32 sends an index a 2 representing a vector ⁇ from a user codebook 321 belonging to the user unit 32 .
  • users which have reported the same user unit codebook index can not be MU-MIMO co-scheduled together since it makes user separation with linear receiver impossible, so all a l are unique.
  • rearrange the user indices and define a new set as a 1 , . . . , a L such that 1 ⁇ a l ⁇ a 2 ⁇ . . . ⁇ K.
  • the size of the codebook 21 is generally much larger than the user codebook, e.g., 311 , 321 .
  • mapping assures that for each subset a 1 , . . . , a L one and only one base unit codebook index p is defined.
  • mapping also assures that for each base unit codebook index p, one and only one subset a 1 , . . . , a L is defined.
  • Each of the allowed combinations a 1 , . . . , a L gives a unique base unit codebook index p and thus define the base unit codebook.
  • a 1 , . . . , a L no precoding matrix is defined, thereby the particular a 1 , . . . , a L is in this case a forbidden selection.
  • the base unit 2 co-schedules compatible user units 31 , 32 to simultaneously share one time-frequency resource, and in doing so the base unit 2 selects a precoding matrix from the base unit codebook based on the indices a 1 , a 2 received from co-scheduled user units, the selection being made according to a predefined function ⁇ .
  • FIG. 2 shows that the base unit 2 transmits control information regarding selected precoding matrix to each co-scheduled user unit 31 , 32 .
  • the control signalling is to indicate to each scheduled user unit, which precoding matrix from the base unit codebook is used. Since the size of the base unit codebook 21 is P matrices, log 2 (P) bits are needed for this control signalling, and in conventional art the same message is sent to each user.
  • the present disclosure is to reduce this overhead.
  • the disclosure relies in that each scheduled user unit get residual information only, that is, only new information. Therefore, the message 23 r , 23 r ′ to each user unit will be different.
  • the number Q and the subsets B a are determined by obeying the restrictions
  • the predefined function ⁇ is known to each user unit 31 , 32 it is thus enough that the control information to each user unit, for example user unit 31 only contains information on the index a 2 from every other user unit 32 . This enables respective user unit to regenerate the precoding matrix Wp according to its own index a 1 , other user units indices a 2 and the predefined function ⁇ .
  • the index from the user codebook 311 corresponds to a requested channel quantization vector (CQV).
  • the base unit 21 and respective user unit 31 , 32 agree on forbidden combinations of indices from co-scheduled user units and takes these forbidden combinations into consideration when regenerating the precoding matrix.
  • One way of using forbidden combinations of indices is to introduce a restriction on the relation between reported user unit codebook vectors in a co-scheduled resource, i.e., forbidden selections of user codebook indices are introduced. If a first user unit 31 , A and a second user unit 32 , B are co-scheduled and the first user unit A has reported the vector ⁇ a from the user codebook 311 and the second user unit B has reported ⁇ b , the restriction could be that the two user units A, B can only be co-scheduled in a time-frequency resource if
  • a user unit codebook 311 consisting of CQVs is defined. Also a base unit codebook 21 consisting of precoding matrices is defined. Each co-scheduled user unit has reported an index corresponding to a vector in the user unit codebook 311 .
  • the first user unit Since the first user unit knows a A , and that the subset of indices a 1 , . . . , a L are ordered such that 1 ⁇ a 1 ⁇ a 2 ⁇ . . . ⁇ a L ⁇ K; it can generate B a and from q it can obtain p. Also, from the ordering a 1 , . . . , a L , the first user unit A gets information on which of the columns of the precoding matrix p is intended for the first user unit A.
  • there are 16 2 256 “possible” precoding matrices which then will require 8 bits to signal to the two user units which precoding matrix is used.
  • the example above shows one way of sending information on the index from every other user unit, which is to send the index r for the other user unit, whereby it is possible to recreate the precoding matrix.
  • the base unit 2 transmits a single stream and indicates this in the control information to the user unit 31 .
  • the system comprises one base unit 2 and one or several user units 31 , 32 , where respective user unit 31 , 32 is adapted to send an index a 1 , a 2 representing a vector from a user codebook 311 , 312 belonging to the user unit 31 , 32 .
  • a scheduling unit 22 belonging to the base unit 2 , is adapted to co-schedule compatible user units 31 , 32 to simultaneously share one time-frequency recourse, where the base unit 2 is adapted to select a precoding matrix from a base unit codebook 21 based on the indices a 1 , a 2 received from co-scheduled user units 31 , 32 .
  • the scheduling unit 22 is adapted to make the selection according to a predefined function.
  • FIG. 2 shows that a transmitting unit 23 is adapted to transmit control information 23 r , 23 r ′ regarding selected precoding matrix to each co-scheduled user unit 31 , 32 .
  • the predefined function is known to each user unit 31 , 32 , that the control information 23 r , 23 r ′ to each user unit only contains information on the indices from every other user unit, and that respective user unit is adapted to regenerate the precoding matrix according to its own index, other user units indices and the predefined function.
  • the index a 1 , a 2 from the user codebook corresponds to a requested channel quantization vector (CQV).
  • the base unit 2 and respective user unit 31 , 32 are adapted to take agreed forbidden combinations of indices from co-scheduled user units into consideration when selecting/regenerating the precoding matrix.
  • One way of agreeing to forbidden combinations is that the base unit and respective user unit are adapted to agree on a real-valued positive threshold T, and that the scheduling unit is adapted to co-schedule a first user unit A and a second user unit B only if their respective indices represents vectors ⁇ a , ⁇ b that fulfils the condition
  • the base unit 2 is adapted to transmit a single stream and to indicate this in the control information to the user unit 31 .
  • the present disclosure also relates to a base unit 2 adapted to communicate with one or several user units 31 , 32 in a multi-user multi-input multi-output system 1 , where the base unit 2 is adapted to receive, from each user unit 31 , 32 an index a 1 , a 2 representing a vector from a user codebook belonging to respective user unit 31 , 32 .
  • a scheduling unit 22 belonging to the base unit 2 , is adapted to co-schedule compatible user units 31 , 32 to simultaneously share one time-frequency recourse, where the scheduling unit 22 is adapted to select a precoding matrix from a base unit codebook 21 based on received indices from co-scheduled user units.
  • the scheduling unit 21 is adapted to make the selection according to a predefined function.
  • a transmitting unit 23 belonging to the base unit 2 , is adapted to transmit control information 23 r , 23 r ′ regarding selected precoding matrix to each co-scheduled user unit 31 , 32 .
  • the control information 12 r , 12 r ′ to each user unit only contains information on indices from every other user unit.
  • the index from respective user unit corresponds to a requested channel quantization vector (CQV).
  • An inventive base unit 2 can be adapted to take agreed forbidden combinations of indices from co-scheduled user units 31 , 32 into consideration when selecting the precoding matrix.
  • the scheduling unit 22 is adapted to co-schedule a first user unit A and a second user unit B only if their respective indices related to vectors ( ⁇ a , ⁇ b ) that fulfils the condition
  • the base unit is adapted to transmit a single stream and to indicate this in the control information to the user unit.
  • the present disclosure also relates to an inventive user unit 31 adapted to communicate with a base unit 2 in a multi-user multi-input multi-output system 1 , where the user unit 31 is adapted send an index a 1 to the base unit, the index representing a vector coming from a user codebook 311 belonging to the user unit 31 .
  • the user unit 31 is adapted to receive control information 23 r regarding a selected precoding matrix related to possibly other co-scheduled user units 32 from the base unit 2 .
  • a predefined function used by the base unit 2 to select the precoding matrix is known to the user unit 31 , and that the control information only contains information on indices a 2 from other co-scheduled user units 32 .
  • the user unit 31 is adapted to regenerate the precoding matrix according to its own index a 1 , other user units indices a 2 and the predefined function.
  • the index corresponds to a channel quantification vector, CQV, and that the user unit 31 is adapted to make a request of a desired channel quantization vector by sending the index a 1 to the base unit 2 .
  • the user unit 31 is adapted to take agreed forbidden combinations of indices from other co-scheduled user units into consideration when regenerating the precoding matrix.
  • One way of realising this is to adapt the user unit 31 to take a real-valued positive threshold T into consideration when regenerating the precoding matrix, the threshold representing a value where a first user unit A and a second user unit B is only allowed to be co-scheduled if their respective indices represents vectors ⁇ a , ⁇ b that fulfils the condition
  • ⁇ T is also proposed that the user unit 31 is adapted to take agreed forbidden combinations of indices from other co-scheduled user units into consideration when regenerating the precoding matrix.
  • control information indicates that the user unit 31 is not co-scheduled with another user unit, then the user unit 31 is adapted to communicate with the base unit 2 through a single stream.
  • the present disclosure also relates to a number of different computer program elements.
  • One inventive computer program element 4 comprises computer program code means 41 to make a computer unit execute the steps of a base unit 2 according to the inventive method.
  • Another inventive computer program element 5 comprises computer program code means 51 to make a computer unit execute the steps of a user unit 31 according to the inventive method.
  • Another computer program element 6 comprises computer program code means 61 which when executed by a computer unit enables the computer unit to function as an inventive base unit 2 .
  • Another computer program element 7 comprises computer program code means 71 which when executed by a computer unit enables the computer unit to function as an inventive user unit 31 .

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)
US12/605,462 2007-04-29 2009-10-26 Method and system of managing control information Expired - Fee Related US8238225B2 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2007/001454 WO2008131593A1 (fr) 2007-04-29 2007-04-29 Procede et systeme de gestion d'informations de commande

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/001454 Continuation WO2008131593A1 (fr) 2007-04-29 2007-04-29 Procede et systeme de gestion d'informations de commande

Publications (2)

Publication Number Publication Date
US20100046461A1 US20100046461A1 (en) 2010-02-25
US8238225B2 true US8238225B2 (en) 2012-08-07

Family

ID=39925166

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/605,462 Expired - Fee Related US8238225B2 (en) 2007-04-29 2009-10-26 Method and system of managing control information

Country Status (3)

Country Link
US (1) US8238225B2 (fr)
CN (1) CN101669297B (fr)
WO (1) WO2008131593A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100232538A1 (en) * 2007-12-05 2010-09-16 Fujitsu Limited Transmitting Apparatus, Transmission Control Method, And Communication Apparatus
US20110134902A1 (en) * 2008-08-11 2011-06-09 Hyun Soo Ko Method of transmitting data using spatial multiplexing
US20110243019A1 (en) * 2010-04-05 2011-10-06 Nec Laboratories America, Inc. Mu-mimo-ofdma multi-rank cqi and precoder signaling schemes
US20130136452A1 (en) * 2011-11-30 2013-05-30 At&T Intellectual Property I, Lp Time-Domain Based Composite Modulation for Spectrally Efficient Optical Networks
US20160218783A1 (en) * 2015-01-27 2016-07-28 Nvidia Corporation Soft codebook subset restriction for elevation beamforming

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3364712A1 (fr) * 2007-02-02 2018-08-22 Mitsubishi Electric Corporation Système de communication mobile, station de base et terminal mobile de radiocommunication
EP2451086B1 (fr) * 2008-06-30 2018-02-28 Alcatel Lucent Procédé pour l'attribution de vecteurs de précodage dans un réseau cellulaire mobile
EP2209220A1 (fr) * 2009-01-19 2010-07-21 ST-Ericsson (France) SAS Procédé de formation de faisceau de données devant être transmises par une station de base dans un système MU-MIMO et appareil de réalisation de celui-ci
US8369439B2 (en) * 2009-09-30 2013-02-05 Alcatel Lucent Transmission of precoding codebook over an air interface
WO2011051914A1 (fr) * 2009-10-30 2011-05-05 Nokia Corporation Rétroaction de canal pour prendre en charge une priorité de rang efficace
WO2011122998A1 (fr) * 2010-03-29 2011-10-06 Telefonaktiebolaget L M Ericsson (Publ) Procédés et appareils d'attribution et d'identification de ressources radio
EP2375581B1 (fr) * 2010-04-01 2012-12-26 Alcatel Lucent Retour pour systèmes MIMO Multi-Utilisateurs
US8472554B2 (en) * 2010-04-16 2013-06-25 Nec Laboratories America, Inc. Signaling of mixture combination sets
US8724728B2 (en) 2010-12-01 2014-05-13 Samsung Electronics Co., Ltd. Method of generating adaptive codebook and multiple input multiple output communication system using the adaptive codebook
US9282552B2 (en) * 2011-05-17 2016-03-08 Lg Electronics Inc. Method for transmitting and receiving control information in a wireless communication system, and apparatus for same
CN107181509A (zh) * 2016-03-11 2017-09-19 电信科学技术研究院 一种数据传输方法和装置

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050286663A1 (en) 2004-06-23 2005-12-29 Intel Corporation Compact feedback for closed loop MIMO systems
WO2006049417A1 (fr) 2004-11-01 2006-05-11 Lg Electronics Inc. Procede de transmission d'une matrice de precodage dans un systeme a entrees multiples et sorties multiples (mimo)
US20060209980A1 (en) * 2005-03-04 2006-09-21 Samsung Electronics Co., Ltd. Beam and power allocation method for MIMO communication system
US20070042720A1 (en) 2005-07-06 2007-02-22 Zhengang Pan MIMO communication system and user scheduling method
US20070049218A1 (en) * 2005-08-30 2007-03-01 Qualcomm Incorporated Precoding and SDMA support
US20070053460A1 (en) 2005-09-02 2007-03-08 Alexei Ashikhmin Coding in a MIMO communication system
WO2007036073A1 (fr) 2005-09-30 2007-04-05 Huawei Technologies Co., Ltd. Procede d'allocation de ressources pour ofdm mimo de systemes d'acces multi-utilisateurs
US20070191066A1 (en) * 2006-02-14 2007-08-16 Mohammad Ali Khojastepour Structured codebook and successive beamforming for multiple-antenna systems
US20080227495A1 (en) * 2007-03-16 2008-09-18 Kotecha Jayesh H Reference signaling scheme using compressed feedforward codebooks for MU-MIMO systems
US20110032839A1 (en) * 2009-08-07 2011-02-10 Runhua Chen Multiple Rank CQI Feedback for Cellular Networks
US20110255632A1 (en) * 2010-04-16 2011-10-20 Nec Laboratories America, Inc. Signaling of mixture combination sets
US20120039411A1 (en) * 2010-08-13 2012-02-16 Nec Laboratories America, Inc. Feed-forward control signaling and decoding schemes
US20120057558A1 (en) * 2008-12-18 2012-03-08 Nec Laboratories America, Inc. Method and Systems for Conveying Scheduling Information of Overlapping Co-Scheduled Users in an OFDMA-MU-MIMO System

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100399721C (zh) * 2005-01-11 2008-07-02 中国人民解放军理工大学 基于发送辅助选择用户反馈的正交预波束成形传输方法
CN1841985A (zh) * 2005-03-30 2006-10-04 松下电器产业株式会社 多天线系统的有限反馈方法

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050286663A1 (en) 2004-06-23 2005-12-29 Intel Corporation Compact feedback for closed loop MIMO systems
WO2006007148A1 (fr) 2004-06-23 2006-01-19 Intel Corporation Systemes mimo a boucle fermee utilisant des listes de codage pour la retroaction
WO2006049417A1 (fr) 2004-11-01 2006-05-11 Lg Electronics Inc. Procede de transmission d'une matrice de precodage dans un systeme a entrees multiples et sorties multiples (mimo)
US20060209980A1 (en) * 2005-03-04 2006-09-21 Samsung Electronics Co., Ltd. Beam and power allocation method for MIMO communication system
US20070042720A1 (en) 2005-07-06 2007-02-22 Zhengang Pan MIMO communication system and user scheduling method
US20070049218A1 (en) * 2005-08-30 2007-03-01 Qualcomm Incorporated Precoding and SDMA support
US20070053460A1 (en) 2005-09-02 2007-03-08 Alexei Ashikhmin Coding in a MIMO communication system
WO2007036073A1 (fr) 2005-09-30 2007-04-05 Huawei Technologies Co., Ltd. Procede d'allocation de ressources pour ofdm mimo de systemes d'acces multi-utilisateurs
US20070191066A1 (en) * 2006-02-14 2007-08-16 Mohammad Ali Khojastepour Structured codebook and successive beamforming for multiple-antenna systems
US20080227495A1 (en) * 2007-03-16 2008-09-18 Kotecha Jayesh H Reference signaling scheme using compressed feedforward codebooks for MU-MIMO systems
US7961807B2 (en) * 2007-03-16 2011-06-14 Freescale Semiconductor, Inc. Reference signaling scheme using compressed feedforward codebooks for multi-user, multiple input, multiple output (MU-MIMO) systems
US20120057558A1 (en) * 2008-12-18 2012-03-08 Nec Laboratories America, Inc. Method and Systems for Conveying Scheduling Information of Overlapping Co-Scheduled Users in an OFDMA-MU-MIMO System
US20110032839A1 (en) * 2009-08-07 2011-02-10 Runhua Chen Multiple Rank CQI Feedback for Cellular Networks
US20110255632A1 (en) * 2010-04-16 2011-10-20 Nec Laboratories America, Inc. Signaling of mixture combination sets
US20120039411A1 (en) * 2010-08-13 2012-02-16 Nec Laboratories America, Inc. Feed-forward control signaling and decoding schemes

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
"R1-071569-Downlink signaling for support of single-user MIMO," 3GPP TSG RAN WG1 Meeting #48bis, Mar. 26-30, 2007, Samsung, St. Julian's, Malta.
International Search Report in corresponding PCT Application No. PCT/CN2007/001454 (Feb. 14, 2008).
Philips, "Performance of LTE DL MU-MIMO with Dedicated Pilots," 3GPP Technical Specification Group RAN WG1 Meeting #48bis, Tdoc R1-071403: 1-5 (Mar. 2007).
Samsumg, "Downlink MIMO for EUTRA," 3GPP Technical Specification Group RAN GW1 Meeting #44, R1-060335: 1-10 (Feb. 2006).
Written Opinion of the International Searching Authority in corresponding PCT Application No. PCT/CN2007/001454 (Feb. 14, 2008).
Yoo, "On the Optimality of Multiantenna Broadcast Scheduling Using Zero-Forcing Beamforming," IEEE Journal on Selected Areas in Communications, vol. 24, No. 3, pp. 528-541 (Mar. 2006).

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100232538A1 (en) * 2007-12-05 2010-09-16 Fujitsu Limited Transmitting Apparatus, Transmission Control Method, And Communication Apparatus
US8588053B2 (en) * 2007-12-05 2013-11-19 Fujitsu Limited Transmitting apparatus, transmission control method, and communication apparatus
US20110134902A1 (en) * 2008-08-11 2011-06-09 Hyun Soo Ko Method of transmitting data using spatial multiplexing
US8711828B2 (en) * 2008-08-11 2014-04-29 Lg Electronics Inc. Method of transmitting data using spatial multiplexing
US20110243019A1 (en) * 2010-04-05 2011-10-06 Nec Laboratories America, Inc. Mu-mimo-ofdma multi-rank cqi and precoder signaling schemes
US8705392B2 (en) * 2010-04-05 2014-04-22 Nec Laboratories America, Inc. MU-MIMO-OFDMA multi-rank CQI and precoder signaling schemes
US20130136452A1 (en) * 2011-11-30 2013-05-30 At&T Intellectual Property I, Lp Time-Domain Based Composite Modulation for Spectrally Efficient Optical Networks
US8855495B2 (en) * 2011-11-30 2014-10-07 At&T Intellectual Property I, L.P. Time-domain based composite modulation for spectrally efficient optical networks
US9337928B2 (en) 2011-11-30 2016-05-10 At&T Intellectual Property I, L.P. Time-domain based composite modulation for spectrally efficient optical networks
US20160218783A1 (en) * 2015-01-27 2016-07-28 Nvidia Corporation Soft codebook subset restriction for elevation beamforming
US10284269B2 (en) * 2015-01-27 2019-05-07 Nvidia Corporation Soft codebook subset restriction for elevation beamforming

Also Published As

Publication number Publication date
US20100046461A1 (en) 2010-02-25
CN101669297A (zh) 2010-03-10
CN101669297B (zh) 2013-02-27
WO2008131593A1 (fr) 2008-11-06

Similar Documents

Publication Publication Date Title
US8238225B2 (en) Method and system of managing control information
EP1994652B1 (fr) Procede d'emission/reception d'informations de retroaction dans un systeme a antennes multiples soutenant des utilisateurs multiples, et systeme de retroaction soutenant ledit procede
US8184682B2 (en) Precoding signaling in a MIMO wireless communication system
US9258048B2 (en) Method and terminal for feeding back channel state information
US9408196B2 (en) Method and terminal for feeding back channel state information
US8989285B2 (en) Efficient MIMO precoding feedback scheme
KR20100017117A (ko) Ｍｉｍｏ 통신에 대한 효과적인 프리코딩 정보 검증을 위한 방법 및 장치
WO2015013519A1 (fr) Procédés et dispositif de retour d'informations sur un indicateur de matrice de précodage multi-résolution
JP2008104193A (ja) Ｍｉｍｏシステムのプリコーディング方法及び該方法を用いた装置
CN102195698A (zh) 多用户多输入多输出mu-mimo无线通信系统中的下行链路传输
CN101932096A (zh) 多用户多输入多输出模式下层映射信息的通知方法和系统
CN101635608A (zh) 一种mcs选择方法、装置和无线通信系统
US8542757B2 (en) Efficient CQI signaling in MIMO systems with variable numbers of beams
CN101861705B (zh) 用于在实施空间预编码多天线系统中发送接收信号的方法、对应发送器、接收器
US9350429B2 (en) Signal transmission method, base station and system for multiple-user multiple-input multiple-output system
KR20090079480A (ko) 다중사용자 다중안테나 시스템에서 채널 품질 추정을 위한장치 및 방법
WO2011121444A2 (fr) Procédé et système d'allocation de ressources
KR20080112070A (ko) 제어 정보 생성 방법
Slim et al. MMSE based FDD overhead optimization for a multiuser two-way system
Slim et al. FDD overhead optimization for a multiuser two-way system with imperfect CSI
KR20080112071A (ko) 제어 정보 표현 및 생성 방법

Legal Events

Date Code Title Description
AS Assignment

Owner name: HUAWEI TECHNOLOGIES CO., LTD.,CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WENNSTROM, MATTIAS;REEL/FRAME:023421/0200

Effective date: 20091022

Owner name: HUAWEI TECHNOLOGIES CO., LTD., CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WENNSTROM, MATTIAS;REEL/FRAME:023421/0200

Effective date: 20091022

ZAAA Notice of allowance and fees due

Free format text: ORIGINAL CODE: NOA

ZAAB Notice of allowance mailed

Free format text: ORIGINAL CODE: MN/=.

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20240807