CN106100712B - Method for precoding based on dicode sheet in extensive mimo system - Google Patents

Method for precoding based on dicode sheet in extensive mimo system Download PDF

Info

Publication number
CN106100712B
CN106100712B CN201610742843.8A CN201610742843A CN106100712B CN 106100712 B CN106100712 B CN 106100712B CN 201610742843 A CN201610742843 A CN 201610742843A CN 106100712 B CN106100712 B CN 106100712B
Authority
CN
China
Prior art keywords
code book
code
receiving end
optimal
word
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.)
Active
Application number
CN201610742843.8A
Other languages
Chinese (zh)
Other versions
CN106100712A (en
Inventor
李晓辉
杨冬华
袁江伟
刘乃安
黑永强
付卫红
韦娟
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.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN201610742843.8A priority Critical patent/CN106100712B/en
Publication of CN106100712A publication Critical patent/CN106100712A/en
Application granted granted Critical
Publication of CN106100712B publication Critical patent/CN106100712B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • 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
    • 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/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/0482Adaptive codebooks
    • 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/08Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Transmission System (AREA)

Abstract

The invention discloses the method for precoding based on dicode sheet in a kind of extensive mimo system, mainly solve the problems, such as that prior art receiving end feedback overhead is big, codebook search complexity is high.Implementation step is: 1. receiving ends generate the first code book;2. receiving end converts according to Householder and generates the second code book;3. receiving end selects the optimal code word of the first code book and records corresponding singular value;4. receiving end selects the second code book optimum code word and records corresponding singular value;5. receiving end determines optimal pre-coding matrix and optimal pre-coding matrix index information, and the optimal pre-coding matrix index information is fed back to transmitting terminal;6. transmitting terminal selects pre-coding matrix according to the index information that receiving end is fed back, precoding is carried out.The present invention reduces the expenses of receiving end feedback index information, reduce the search complexity of code book, can be used for extensive mimo wireless communication system.

Description

Method for precoding based on dicode sheet in extensive mimo system
Technical field
The invention belongs to mobile communication technology fields, are related to a kind of multiple-input and multiple-output MIMO method for precoding, have code The features such as this search complexity is low, and feedback overhead is low.
Background technique
In recent years, extensive multiple-input and multiple-output MIMO technology and millimeter-wave technology are considered as the following 5th generation 5G movement A part of Key Communication Technology causes the extensive concern of academia.Extensive MIMO is extended on the basis of traditional MIMO And come, tradition MIMO is compared, extensive mimo antenna number sharply increases, and under the conditions of identical running time-frequency resource, can wait More parallel subchannels are imitated, the transmission rate of system is further increased.However, the space due to base station end is limited, deployment is big Scale aerial array needs to reduce the distance between antenna.Millimeter wave frequency band wavelength is short, can guarantee day in the case where small spacing Mutually indepedent between line, the realization for extensive MIMO technology provides possibility.
MIMO precoding technique can change transmission power, and the adjustment direction of the launch makes system obtain higher system appearance Amount, the lower bit error rate and lower complexity, but in extensive mimo system, because number of antennas is huge so that channel matrix H dimension increases rapidly, and the precoding technique based on non-code book is no longer applicable in, and codebook-based Linear Precoding is at pass The focus of note, wherein the design of code book is vital, because the feedback of channel is limited, the big code book of dimension can increase The complexity of the length and system that add the performance of precoding, but feed back in large scale system is noticeable factor.Cause This, it would be desirable to balanced precoding accuracy and feedback length enable systematic entirety to maximize.
The patent of CHINA PUTIAN INSTITUTE OF TECHNOLOGY Co., Ltd application is " a kind of using dicode this progress feedback of channel information Method and system " (number of patent application: 201010289774.2, publication number: CN102412939A) discloses a kind of using dicode The method of this progress feedback of channel information.Steps of the method are: first, pre-coding matrix of the receiving side signal from the prior art Code book in select first best code word;Second, receiving side signal combination channel state information and the first best code word group At function, by measure maximize standard the optimal code word of second level is selected from pre-set second level code book;Third, signal receive The feedback information of the codewords indexes of codewords indexes of the Fang Shengcheng comprising selected first best code word and the optimal code word of second level is simultaneously It is sent to signalling;4th, for signalling according to received feedback information, generation pre-coding matrix is first best code The product of word and the optimal code word of second level.This method is more accurately reflected actual using dicode this progress feedback of channel information Channel condition improves the overall performance of system.The shortcoming of this method is: code book generation is more complex, and feedback overhead is larger, and And codebook search complexity is higher.
Summary of the invention
It is an object of the invention to be directed to the deficiency of above-mentioned prior art, propose in a kind of extensive mimo system based on double The method for precoding of code book reduces codebook search complexity to reduce the feedback overhead of receiving end.
To achieve the above object, technical solution of the present invention includes the following:
(1) receiving end generates the first code book W1:
(2) receiving end generates the second code book W according to the first code book2:
2a) receiving end is extended each column of the first code book according to Householder transformation, obtains the second code book square Battle array W2n, wherein n indicates the serial number of the first code book column, n=1 ..., N, and N is the beam vector number of the first code book;
2b) according to the second code book matrix W2nUltimately generate the second code book W2={ W2n};
(3) receiving end selects the optimal code word of the first code book:
3a) receiving end traverses the first code book generation optimal code word of the first code book according to minimum singular value selection criterion is maximized U1p, and by the optimal code word U of the first code book1pIt is expressed as column vector αlSet, i.e. U1p=[α12,…,αl,…,αL], wherein αl For the l column vector of the optimal code word of the first code book, l=1 ..., L, L is the spatial reuse number of plies;
3b) the corresponding singular value λ of the storage optimal code word of the first code book1And the first optimal code word U of code book1pIn the first code book Index information P1;
(4) receiving end selects the second code book optimum code word:
4a) receiving end is according to the optimal code word U of the first code book1pL column vector αl, find l column vector αlExtension obtains The second code book matrix W2k∈W2, with the second obtained code book matrix W of all L column vectors extension2kForm the second codebook matrix Collect { W2k, wherein k indicates the optimal code word U of the first code book1pL column vector αlSerial number in the first code book, k ∈ 1 ..., N;
4b) receiving end is every time from the second code book matrix stack { W2kEach of respectively select in the second codebook matrix column composition to Code selection word U2, code word set { U to be selected is formed with all code words to be selected selected2};
4c) receiving end traverses code word set { U to be selected according to minimum singular value selection criterion is maximized2Generate the second code book most Excellent code word U2p
4d) the corresponding singular value λ of the second code book optimum code word of storage2And the second code book optimum code word U2pIn the second code book Index information P2;
(5) singular value size is compared in receiving end:
Receiving end is by the corresponding singular value λ of the optimal code word of the first code book1Singular value λ corresponding with the second code book optimum code word2 It is compared: if λ12, (6) are thened follow the steps, if λ12, then follow the steps (7);
(6) pre-coding matrix and index information P are selected from the first code book:
Select the optimal code word U of the first code book1pAs optimal pre-coding matrix, the optimal code word U of the first code book is selected1p? Index information P of the index information P1 as optimal pre-coding matrix in one code book;
(7) pre-coding matrix and index information P are selected from the second code book:
Select the second code book optimum code word U2pAs optimal pre-coding matrix, the second code book optimum code word U is selected2p? Index information P of the index information P2 as optimal pre-coding matrix in two code books;
(8) optimal pre-coding matrix index information P is fed back to transmitting terminal by receiving end;
(9) transmitting terminal finds corresponding precoding square according to optimal pre-coding matrix index information P in identical code book Battle array U, the corresponding pre-coding matrix of index of reference information P carry out precoding to information x to be sent, the transmission information after obtaining precoding xt=Ux.
Compared with the prior art, the present invention has the following advantages:
1) due in the present invention the second code book be to be obtained according to the first code book, searching for corresponding second code book optimum code word When, do not need traversal all code words of the second code book, it is only necessary to find the corresponding second code of column vector of the optimal code word of the first code book This matrix stack finds out the second code book optimum code word in the second code book matrix stack, overcomes existing dicode this programme code book and searches The high deficiency of rope complexity, reduces the complexity of search.
2) the optimal code word of receiving end of the invention due to selecting one of code book in the optimal code word of two code books As pre-coding matrix, receiving end only needs to feed back the index information of the optimal code word of one of code book, overcomes existing Dicode this programme feeds back the index information of the optimal code word of two code books, causes the deficiency that feedback overhead is big, reduces receiving end Feedback overhead.
3) present invention due in receiving end to the singular value of the optimal code word of the first code book and the surprise of the second code book optimum code word Different value, which is compared, determines that optimal pre-coding matrix, this adaptive selection mode overcome the prior art and only use first The inaccurate deficiency of the optimal code word match channels status information of code book, improves the accuracy of match channels status information.
Detailed description of the invention
Fig. 1 is realization general flow chart of the invention.
Fig. 2 is the sub-process figure that optimal pre-coding matrix and optimal pre-coding matrix index information are determined in the present invention.
Specific embodiment
Consider a point-to-point extensive mimo wireless communication system, which is furnished with M root transmitting antenna, and R piece-root grafting receives day Line.Information x to be sent carries out pre- precoding by pre-coding matrix U, and the form for the Equivalent Base-Band signal y that receiving end receives is such as Under:
Y=HUx+n
Wherein, H indicates the corresponding channel gain of antenna for base station, and n is noise vector, and it is 0 that wherein element, which obeys mean value, variance For N0Independent identically distributed multiple Gauss distribution.
Referring to Fig.1, steps are as follows for realization of the invention:
Step 1, receiving end generate the first code book W1
In the prior art, the first code book W is generated1Mode it is more, such as: IEEE802.15.3c code book generating mode, DFT code book generating mode, Kerdock code book generating mode, LTE R8 code book generating mode, Jim Glassman vanning code book generation side Formula, Codebook of Vector Quantization generating mode etc..
The code book generating mode that the present invention uses are as follows: IEEE802.15.3c code book generating mode and DFT code book generation side Formula.
Embodiment 1, receiving end generate the first code book W using IEEE802.15.3c code book generating mode1:
Firstly, generating the first code book W1M row n-th arrange element value:
Wherein, fix () indicates that element is rounded symbol to zero, and mod () indicates element remainder numerical symbol, and m indicates first The serial number of code book row, m=1 ..., M, M are transmitting antenna number, and n indicates the serial number of the first code book column, n=1 ..., N, N the The beam vector number of one code book, j are expressed as (- 1)1/2
Then the first code book is constituted with the element value of all row, column
Embodiment 2, receiving end generate the first code book W using DFT code book generating mode1:
Firstly generate the first code book W1M row n-th arrange element value:
Then the first code book is constituted with the element value of all row, column
Step 2, receiving end generate the second code book W2
2a) receiving end is extended each column of the first code book according to Householder transformation, obtains the second code book square Battle array W2n:
Wherein, I indicates unit matrix, w1(n) the n-th column of the first code book are indicated,Indicate the n-th column of the first code book Complex conjugate transposition.
2b) according to the second code book matrix W2nUltimately generate the second code book W2={ W2n}。
Step 3, receiving end select the optimal code word of the first code book.
3a) receiving end traverses the first code book generation optimal code word of the first code book according to minimum singular value selection criterion is maximized U1p:
Wherein argmaxf () expression, which takes, meets the maximum independent variable of function f (), λ1min() indicates that the first code book waits for The minimum value of the corresponding singular value of code selection word, H indicate the corresponding channel gain of antenna for base station, U1Indicate one of the first code book to Code selection word.
3b) by the optimal code word U of the first code book1pIt is expressed as column vector αlSet, i.e. U1p=[α12,…,αl,…,αL], Wherein αlFor the l column vector of the optimal code word of the first code book, l=1 ..., L, L is the spatial reuse number of plies.
3c) the corresponding singular value λ of the storage optimal code word of the first code book1And the first optimal code word U of code book1pIn the first code book Index information P1.
Step 4, receiving end select the second code book optimum code word.
4a) receiving end is according to the optimal code word U of the first code book1pL column vector αl, find l column vector αlExtension obtains The second code book matrix W2k∈W2, with the second obtained code book matrix W of all L column vectors extension2kForm the second codebook matrix Collect { W2k, wherein k indicates the optimal code word U of the first code book1pL column vector αlSerial number in the first code book, k ∈ 1 ..., N.
4b) receiving end is every time from the second code book matrix stack { W2kEach of respectively select in the second codebook matrix column composition to Code selection word U2, code word set { U to be selected is formed with all code words to be selected selected2}。
4c) receiving end traverses code word set { U to be selected according to minimum singular value selection criterion is maximized2Generate the second code book most Excellent code word U2p:
Wherein λ2min() indicates the minimum value of the corresponding singular value of the second code book code word to be selected, U2Indicate the second code book One code word to be selected.
4d) the corresponding singular value λ of the second code book optimum code word of storage2And the second code book optimum code word U2pIn the second code book Index information P2.
Step 5, receiving end compare singular value size, select pre-coding matrix and index information P.
Referring to Fig. 2, this step is implemented as follows:
5a) receiving end is by the corresponding singular value λ of the optimal code word of the first code book1It is corresponding unusual with the second code book optimum code word Value λ2It is compared: if λ12, then follow the steps 5b), if λ12, then follow the steps 5c).
5b) select the optimal code word U of the first code book1pAs optimal pre-coding matrix, the optimal code word U of the first code book is selected1p? Index information P of the index information P1 as optimal pre-coding matrix in first code book.
5c) select the second code book optimum code word U2pAs optimal pre-coding matrix, the second code book optimum code word U is selected2p? Index information P of the index information P2 as optimal pre-coding matrix in second code book.
Optimal pre-coding matrix index information P is fed back to transmitting terminal by step 6, receiving end.
Step 7, transmitting terminal find corresponding prelist according to optimal pre-coding matrix index information P in identical code book Code matrix U, the corresponding pre-coding matrix of index of reference information P carry out precoding to information x to be sent, the transmission after obtaining precoding Information xt=Ux.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered It is considered as protection scope of the present invention.

Claims (5)

1. the method for precoding based on dicode sheet in extensive mimo system, includes the following steps:
(1) receiving end generates the first code book W1:
(2) receiving end generates the second code book W according to the first code book2:
2a) receiving end is extended each column of the first code book according to Householder transformation, obtains the second codebook matrix W2n, wherein n indicates the serial number of the first code book column, n=1 ..., N, and N is the beam vector number of the first code book;
2b) according to the second code book matrix W2nUltimately generate the second code book W2={ W2n};
(3) receiving end selects the optimal code word of the first code book:
3a) receiving end traverses the first code book generation optimal code word U of the first code book according to minimum singular value selection criterion is maximized1p, And by the optimal code word U of the first code book1pIt is expressed as column vector αlSet, i.e. U1p=[α12,…,αl,…,αL], wherein αlFor The l column vector of the optimal code word of first code book, l=1 ..., L, L are the spatial reuse number of plies;
3b) the corresponding singular value λ of the storage optimal code word of the first code book1And the first optimal code word U of code book1pRope in the first code book Fuse ceases P1;
(4) receiving end selects the second code book optimum code word:
4a) receiving end is according to the optimal code word U of the first code book1pL column vector αl, find l column vector αlExtend second obtained Codebook matrix W2k∈W2, with the second obtained code book matrix W of all L column vectors extension2kForm the second code book matrix stack {W2k, wherein k indicates the optimal code word U of the first code book1pL column vector αlSerial number in the first code book, k ∈ 1 ..., N;
4b) receiving end is every time from the second code book matrix stack { W2kEach of respectively select in the second codebook matrix column composition to code selection Word U2, code word set { U to be selected is formed with all code words to be selected selected2};
4c) receiving end traverses code word set { U to be selected according to minimum singular value selection criterion is maximized2Generate the second code book optimum code Word U2p
4d) the corresponding singular value λ of the second code book optimum code word of storage2And the second code book optimum code word U2pRope in the second code book Fuse ceases P2;
(5) singular value size is compared in receiving end:
Receiving end is by the corresponding singular value λ of the optimal code word of the first code book1Singular value λ corresponding with the second code book optimum code word2It carries out Compare: if λ1> λ2, (6) are thened follow the steps, if λ1< λ2, then follow the steps (7);
(6) pre-coding matrix and index information P are selected from the first code book:
Select the optimal code word U of the first code book1pAs optimal pre-coding matrix, the optimal code word U of the first code book is selected1pIn the first code book In index information P of the index information P1 as optimal pre-coding matrix;
(7) pre-coding matrix and index information P are selected from the second code book:
Select the second code book optimum code word U2pAs optimal pre-coding matrix, the second code book optimum code word U is selected2pIn the second code book In index information P of the index information P2 as optimal pre-coding matrix;
(8) optimal pre-coding matrix index information P is fed back to transmitting terminal by receiving end;
(9) transmitting terminal finds corresponding pre-coding matrix U according to optimal pre-coding matrix index information P in identical code book, The corresponding pre-coding matrix of index of reference information P carries out precoding to information x to be sent, the transmission information x after obtaining precodingt= Ux。
2. the method according to claim 1, wherein receiving end generates the first code book in step (1), including as follows Generating mode:
First way: the first code book W is generated according to the generating mode of code book in IEEE802.15.3c1M row n-th arrange member Element value:
Wherein, fix () indicates that element is rounded symbol to zero, and mod () indicates element remainder numerical symbol, and m indicates the first code book Capable serial number, m=1 ..., M, M are transmitting antenna number, and n indicates the serial number of the first code book column, n=1 ..., N, and N is first yard This beam vector number, j are expressed as (- 1)1/2
The first code book is constituted with the element value of all row, columnThe second way: The first code book W is generated according to DFT code book generating mode1M row n-th arrange element value:
The first code book is constituted with the element value of all row, column
3. the method according to claim 1, wherein step 2a) in receiving end according to Householder transformation pair Each column of first code book are extended, and obtain the second code book matrix W2n, it is expressed as follows:
Wherein, I indicates unit matrix, w1(n) the n-th column of the first code book are indicated,Indicate the multiple total of the n-th column of the first code book Yoke transposition.
4. the method according to claim 1, wherein step 3a) in receiving end according to maximizing minimum singular value Selection criterion traverses the first code book and generates the optimal code word U of the first code book1p, it is expressed as follows:
Wherein argmax () expression, which takes, meets the maximum independent variable of function f (), λ1min() indicates the first code book code word to be selected The minimum value of corresponding singular value, H indicate the corresponding channel gain of antenna for base station, U1Indicate one of the first code book to code selection Word.
5. the method according to claim 1, wherein step 4c) in receiving end according to maximizing minimum singular value Selection criterion traverses the second code book and generates the second code book optimum code word U2p, it is expressed as follows:
Wherein argmax () expression, which takes, meets the maximum independent variable of function f (), λ2min() indicates the second code book code word to be selected The minimum value of corresponding singular value, H indicate the corresponding channel gain of antenna for base station, U2Indicate one of the second code book to code selection Word.
CN201610742843.8A 2016-08-26 2016-08-26 Method for precoding based on dicode sheet in extensive mimo system Active CN106100712B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610742843.8A CN106100712B (en) 2016-08-26 2016-08-26 Method for precoding based on dicode sheet in extensive mimo system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610742843.8A CN106100712B (en) 2016-08-26 2016-08-26 Method for precoding based on dicode sheet in extensive mimo system

Publications (2)

Publication Number Publication Date
CN106100712A CN106100712A (en) 2016-11-09
CN106100712B true CN106100712B (en) 2019-06-21

Family

ID=57226006

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610742843.8A Active CN106100712B (en) 2016-08-26 2016-08-26 Method for precoding based on dicode sheet in extensive mimo system

Country Status (1)

Country Link
CN (1) CN106100712B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109391306B (en) * 2017-08-14 2021-09-17 深圳市中兴微电子技术有限公司 Method and device for selecting two-stage codebook and rank and computer-readable storage medium
CN109428635B (en) * 2017-08-31 2021-04-27 深圳市中兴微电子技术有限公司 Two-stage codebook selection method and device and computer readable storage medium
CN112350760B (en) * 2019-08-09 2021-07-23 大唐移动通信设备有限公司 Method and device for selecting precoding codebook
CN111555784B (en) * 2020-05-19 2021-10-22 北京邮电大学 Precoding method and device and electronic equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101951686A (en) * 2010-10-12 2011-01-19 西安电子科技大学 Dynamic clustering reduced hidden feedback overhead method
CN103004160A (en) * 2010-06-01 2013-03-27 诺基亚公司 Apparatus, method and computer program product for selecting beam group and subset of beams in communication system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103944621B (en) * 2013-01-18 2017-12-05 上海贝尔股份有限公司 It is determined that the method for the two-stage codebook set suitable for the configuration of 4Tx cross polarised antennas

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103004160A (en) * 2010-06-01 2013-03-27 诺基亚公司 Apparatus, method and computer program product for selecting beam group and subset of beams in communication system
CN101951686A (en) * 2010-10-12 2011-01-19 西安电子科技大学 Dynamic clustering reduced hidden feedback overhead method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"一种基于双码本结构的有限反馈预编码方案";张阳林,王明月;《通信技术》;20151210;第48卷(第12期);全文

Also Published As

Publication number Publication date
CN106100712A (en) 2016-11-09

Similar Documents

Publication Publication Date Title
US11483040B2 (en) Method and apparatus for explicit CSI reporting in advanced wireless communication systems
KR102392749B1 (en) Method and apparatus for enabling multi-resolution CSI reporting in an improved wireless communication system
CN105210306B (en) It is used to select to send and receive the device and method of wave beam in wireless communication system
CN102725967B (en) For the method and apparatus of information feed back and precoding
CN104202118B (en) Precoding codebook and feedback representation
CN102132502B (en) Method, mobile station and computer-readable media of concatenating precoder selection
CN106160816B (en) The synchronization signal and signal that perfect omnidirectional precoding is realized in extensive mimo system send and receive method
CN106100712B (en) Method for precoding based on dicode sheet in extensive mimo system
CN101944985B (en) Feedback method for channel state information
EP3533156A1 (en) Codebook for csi reporting in advanced wireless communication system
CN101854236B (en) Method and system for feeding back channel information
JP5551823B2 (en) Channel state information feedback
CN103152140A (en) Limiting feedback method of three-dimensional multi-user MIMO (multiple input multiple output) based on direct-product code books
CN101146078A (en) A selection method for multi-input and multi-output space multiplexing pre-coding matrix
KR20090101405A (en) Method for transmitting signals for reducing feedback overhead and method for transmitting feedback information for the same
CN102130708A (en) Method for feeding back multicell channel state information and user equipment
CN101695008B (en) Multi-user multi-antenna two-stage limited feedback method
CN105721029B (en) Multi-user dispatching method based on this Limited Feedback of dicode in 3D MU-MIMO FDD system
CN102460994A (en) Transmitting/receiving apparatus and method thereof in codebook based multiple antenna system
CN101860420B (en) A kind of channel information acquisition method and system
CN107113124A (en) Omni-direction transmissions method and apparatus for extensive mimo system
CN103259582B (en) A kind of multi-point cooperative transmission method for precoding, terminal and base station
CN102291201A (en) Low-complexity codebook searching method of dual-codebook-oriented structure
CN102571172A (en) User scheduling method and equipment in MIMO wireless communication system
CN102082635B (en) Codebook storage and information transceiving method and device using codebook

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant