WO2021196726A1 - 一种快速搜索方法 - Google Patents
一种快速搜索方法 Download PDFInfo
- Publication number
- WO2021196726A1 WO2021196726A1 PCT/CN2020/135753 CN2020135753W WO2021196726A1 WO 2021196726 A1 WO2021196726 A1 WO 2021196726A1 CN 2020135753 W CN2020135753 W CN 2020135753W WO 2021196726 A1 WO2021196726 A1 WO 2021196726A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- channel
- user
- vector
- energy
- polynomial
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 239000013598 vector Substances 0.000 claims abstract description 47
- 230000001419 dependent effect Effects 0.000 claims abstract description 4
- 239000011159 matrix material Substances 0.000 claims description 24
- 238000004364 calculation method Methods 0.000 claims description 12
- 230000001427 coherent effect Effects 0.000 claims description 12
- 238000005284 basis set Methods 0.000 claims description 3
- 238000009795 derivation Methods 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims description 3
- 238000009827 uniform distribution Methods 0.000 claims description 3
- 238000011144 upstream manufacturing Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 6
- 238000004088 simulation Methods 0.000 description 6
- 238000012549 training Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
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
-
- 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/0202—Channel estimation
Definitions
- This application belongs to the field of wireless communication technology, and particularly relates to a fast search method.
- Massive MIMO Multiple-Input Multiple-Output
- 5G Fifth-Generation, fifth-generation mobile communication technology
- the channels of each user tend to be orthogonal, and multi-user interference tends to disappear.
- the use of low-complexity signal detection technology at the receiving end can achieve good performance.
- Massive MIMO technology has shown great potential in increasing system capacity, spectrum efficiency and energy efficiency. The performance of massive MIMO systems largely depends on perfect CSI (Channel State Information).
- a unified transmission strategy can be designed in TDD and FDD (Frequency Division Duplexing) massive MIMO systems, which can effectively solve the pilot pollution and the training overhead that increases with the increase in the number of antennas. problem.
- spatial rotation is an innovative method to improve channel estimation performance.
- spatial rotation can be regarded as searching for a fixed number of orthogonal DFT (Discrete Fourier Transform, Discrete Fourier Transform) basis vectors to more accurately represent the channel.
- orthogonal DFT Discrete Fourier Transform, Discrete Fourier Transform
- the orthogonal space basis of each user channel needs to be updated. Without any prior knowledge, the high complexity brought by calculating spatial features and searching for rotation parameters has become an obstacle to realizing spatial rotation operations.
- spatial rotation is an innovative method to improve the performance of channel estimation.
- spatial rotation can be regarded as searching for a fixed number of orthogonal DFT (Discrete Fourier Transform, Discrete Fourier Transform) basis vectors to more accurately represent the channel.
- orthogonal DFT Discrete Fourier Transform, Discrete Fourier Transform
- the orthogonal space basis of each user channel needs to be updated.
- This application provides a fast search method.
- this application provides a quick search method, which includes the following steps:
- Step 1) The base station calculates the discrete Fourier transform according to the uplink channel vector h k of the kth user, and determines the spatial characteristics of the kth user
- Step 2) Initialize N angle values, respectively calculate the discrete Fourier transform of the channel vector at N rotation angles, and calculate the sparse channel energy at N angles according to the discrete Fourier transform;
- Step 3) Take the rotation angle as the independent variable and the sparse channel energy as the dependent variable, and use the m-order polynomial to perform polynomial fitting on the data of N points;
- Step 4) Calculate the maximum value of the polynomial in the angle range as the rotation angle of the k-th user, and combine its spatial characteristics to obtain the optimal orthogonal spatial basis of the channel;
- Step 5) Repeat steps 1) to 3) for other K-1 users, and update the channel optimal orthogonal space base of each user in the current coherent time slot.
- the uplink channel vector h k of the k-th user can be represented by a vector of M ⁇ 1.
- the incident angle range of the diameter of the upstream channel for the k-th user [ ⁇ k - ⁇ k, ⁇ k + ⁇ k], the incident angle of each diameter in the range satisfying a uniform distribution, channel
- the incident angle domain has sparse characteristics.
- the discrete Fourier transform of the channel in step 1) can be expressed as Where F is an M ⁇ M matrix, and the elements in the p-th row and q-th column are When the number of base station antennas tends to infinity, the energy of each path is concentrated at one point in the DFT domain; when the number of base station antennas is limited, energy leakage occurs, and the DFT points around the center point contain a small amount of channel energy, and the channel energy remains in the DFT domain. Presents a highly concentrated characteristic; according to the characteristic of energy leakage, calculate the subscript set for:
- q max and q min are subscript sets respectively
- the maximum and minimum in n is equal to Round up
- ⁇ M is the number of orthogonal space bases set in advance.
- step 3 Another implementation manner provided by this application is: the specific method of polynomial fitting in step 3) is as follows:
- the polynomial order m satisfies m ⁇ N.
- the order vector (a total of m) as:
- the least square method is used to obtain the minimum variance solution as in Is the pseudo-inverse of matrix ⁇ m.
- step 4) the determination of the k-th user's rotation angle and the optimal orthogonal space base is as follows:
- the optimal orthogonal space basis set of the k-th user uplink channel vector is determined as:
- ⁇ ( ⁇ k, opt ) H represents the conjugate transposed matrix of the matrix ⁇ ( ⁇ k, opt ), and the vector v q represents the qth column of the discrete Fourier transform matrix F after the conjugate transpose.
- the fast search method provided in this application is a fast search method for the optimal orthogonal space base in a massive MIMO system.
- the fast search method provided in the present application proposes a fast method for searching orthogonal space bases, which is used to realize an efficient sparse representation of uplink and downlink channels in a massive MIMO system.
- the method of determining the user space characteristic parameters is improved, and a low-complexity method for searching the user's optimal spatial rotation angle is proposed.
- This method has almost no space when the AS is narrow. Performance loss. Therefore, this method is of great significance for reducing the computational complexity of TDD and FDD massive MIMO systems and improving the channel estimation performance. .
- the fast search method provided in this application greatly reduces the computational complexity of the massive MIMO system while ensuring the improvement of channel estimation accuracy.
- the user's spatial characteristic parameters are more accurately extracted under the premise of low complexity, and a more efficient channel sparse representation in the spatial domain is realized.
- the fast search method provided by this application selects orthogonal space bases by calculating the user's spatial characteristics and rotation parameters; under the same number of space bases, it improves the uplink and downlink channel estimation accuracy of TDD and FDD massive MIMO systems, and reduces The computational complexity of the system.
- the fast search method provided by this application is based on the user's DOA and AS estimation.
- the AS is small, there is almost no performance loss, and when the AS is large It has better channel estimation performance than other methods.
- the base station can extract the current spatial information of each user, which helps the base station to adjust the number of user training sequences in real time and ensure the quality of channel estimation.
- the fast search method provided by this application is based on the study of the energy change of the sparse channel, and it can approach the best through a small number of high-dimensional calculations.
- the complexity of the spatial rotation operation in a single coherent time slot is greatly reduced, and the requirements for hardware implementation are reduced.
- the optimal orthogonal space base search method proposed in this application is not only suitable for massive MIMO systems under SBEM, but also can achieve significant results for two-dimensional space base extended models (2D-SBEM).
- 2D-SBEM two-dimensional space base extended models
- FIG. 1 is a schematic diagram of the space-based expansion model (SBEM) of the massive MIMO system of the present application;
- Figure 2 is a performance comparison diagram of each spatial feature method of the present application.
- Figure 3 is a performance comparison of the orthogonal space-based search method under SBEM of the present application.
- Fig. 4 is a performance comparison of the orthogonal space-based search method under 2D-SBEM of the present application.
- K single-antenna users of the massive MIMO system are randomly distributed in the coverage area of the base station.
- the base station obtains the channel vector of each user through uplink channel estimation in the current coherent time slot.
- it is necessary to update the orthogonal space base corresponding to each user channel so that the virtual beam can be Target users more accurately.
- the number of optimal orthogonal space bases finally obtained is much smaller than the number of base station antennas, which contains most of the energy of the channel, and is a highly sparse representation of the channel.
- the optimal orthogonal space basis of the downlink channel can be directly obtained according to the search result of the optimal orthogonal space basis of the uplink channel, which greatly improves the performance of uplink and downlink channel estimation under the premise of low complexity.
- the base station calculates the discrete Fourier transform according to the uplink channel vector h k of the kth user to determine the spatial characteristics of the kth user
- the uplink channel vector h k of the k-th user can be represented by a vector of M ⁇ 1.
- the incident angle range of the diameter of the upstream channel for the k-th user [ ⁇ k - ⁇ k, ⁇ k + ⁇ k], the incident angle of each diameter in the range satisfying a uniform distribution, channel
- the incident angle domain has sparse characteristics.
- the discrete Fourier transform of the channel can be expressed as Where F is an M ⁇ M matrix, and the elements in the p-th row and q-th column are When the number of base station antennas tends to infinity, the energy of each path is concentrated at one point in the DFT domain; when the number of base station antennas is limited, energy leakage occurs, and the DFT points around the center point contain a small amount of channel energy, and the channel energy remains in the DFT domain. Presents a highly concentrated characteristic. According to the characteristics of energy leakage, calculate the subscript set for:
- q max and q min are subscript sets respectively
- the maximum and minimum in n is equal to Round up
- ⁇ M is the number of orthogonal space bases set in advance.
- step 3 the specific method of polynomial fitting in step 3) is as follows:
- the polynomial order m satisfies m ⁇ N.
- the order vector (a total of m) as:
- the least square method is used to obtain the minimum variance solution as in Is the pseudo-inverse of matrix ⁇ m.
- step 4 determination of the k-th user's rotation angle and the optimal orthogonal space basis in step 4) is as follows:
- the optimal orthogonal space basis set of the k-th user uplink channel vector is determined as:
- ⁇ ( ⁇ k, opt ) H represents the conjugate transposed matrix of the matrix ⁇ ( ⁇ k, opt ), and the vector v q represents the qth column of the discrete Fourier transform matrix F after the conjugate transpose.
- Figures 2, 3, and 4 compare the system performance achieved by the solution proposed by this application with the existing technical solutions, show the performance of the spatial feature calculation and rotation angle search methods proposed by this application, and reflect the large-scale performance of this application.
- Fig. 2 compares the curve change of the mean square error of the uplink channel achieved by the spatial feature calculation scheme proposed by this application and the existing scheme with the angle expansion.
- Configuration in the simulation the number of base station antennas is 128, the orthogonal base is set to 16, and the signal-to-noise ratio is 20 decibels. From the simulation results, it can be seen that the existing low-complexity implementation scheme (with the maximum energy point as the center point) deteriorates with the increase in angle expansion, and the spatial feature calculation scheme proposed in this application is under the premise of low complexity. , It is close to the optimal performance under any angle of expansion.
- the spatial feature calculation scheme proposed in this application is based on DOA and AS estimation, and can deal with the randomness of the gain and incidence angle distribution in the multipath.
- the base station can more accurately extract the current spatial information of each user in each coherent time slot, which helps the base station to adjust the number of user training sequences in real time and ensure the quality of channel estimation.
- Fig. 3 compares the curve variation of the mean square error of the uplink channel achieved with the signal-to-noise ratio under the SBEM and the existing schemes of the orthogonal space base selection scheme proposed in this application.
- the optimal orthogonal space basis of the downlink channel can be directly derived from the optimal orthogonal space basis of the uplink channel.
- the cross-space basis selection scheme is of great significance for improving the uplink and downlink channel estimation performance of massive MIMO systems under SBEM.
- Fig. 4 compares the curve variation of the mean square error of the uplink channel achieved with the signal-to-noise ratio under the 2D-SBEM of the orthogonal space base selection scheme proposed by this application and the existing scheme.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
- Radio Transmission System (AREA)
Abstract
Description
Claims (7)
- 如权利要求2所述的快速搜索方法,其特征在于:所述步骤1)中信道的离散傅里叶变换可以表示为 其中F是M×M的矩阵,其第p行第q列的元素为 当基站天线数量趋于无穷时,每条径的能量集中在DFT域的一个点;当基站天线数量有限时,出现能量泄漏,中心点周围的DFT点包含少量信道能量,信道能量在DFT域仍呈现高度集中的特性;根据能量泄漏的特性,计算下标集合 为:
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010260247.2A CN111614386B (zh) | 2020-04-03 | 2020-04-03 | 一种快速搜索方法 |
CN202010260247.2 | 2020-04-03 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021196726A1 true WO2021196726A1 (zh) | 2021-10-07 |
Family
ID=72195674
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/135753 WO2021196726A1 (zh) | 2020-04-03 | 2020-12-11 | 一种快速搜索方法 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN111614386B (zh) |
WO (1) | WO2021196726A1 (zh) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111614386B (zh) * | 2020-04-03 | 2021-04-27 | 西安交通大学 | 一种快速搜索方法 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8416896B2 (en) * | 2004-10-06 | 2013-04-09 | Broadcom Corporation | Method and system for channel estimation in a single channel MIMO system with multiple RF chains for WCDMA/HSDPA |
CN110380994A (zh) * | 2019-05-13 | 2019-10-25 | 上海海事大学 | 快速贝叶斯匹配追踪海上稀疏信道估计方法 |
CN110460549A (zh) * | 2019-08-02 | 2019-11-15 | 南京邮电大学 | 一种新颖的多用户3d mimo***的信道估计方法 |
CN110636018A (zh) * | 2019-09-29 | 2019-12-31 | 哈尔滨工程大学 | 一种网格补偿大规模mimo信道估计方法 |
CN111614386A (zh) * | 2020-04-03 | 2020-09-01 | 西安交通大学 | 一种快速搜索方法 |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103684700B (zh) * | 2013-12-31 | 2017-05-24 | 重庆邮电大学 | 一种基于正交联合码本集的3d mu‑mimo预编码方法 |
US11374635B2 (en) * | 2018-06-22 | 2022-06-28 | Samsung Electronics Co., Ltd. | Method and apparatus for sensor assisted beam selection, beam tracking, and antenna module selection |
CN110166383B (zh) * | 2019-05-15 | 2021-07-02 | 南京邮电大学 | 一种基于树状随机搜索导频设计方法 |
-
2020
- 2020-04-03 CN CN202010260247.2A patent/CN111614386B/zh active Active
- 2020-12-11 WO PCT/CN2020/135753 patent/WO2021196726A1/zh active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8416896B2 (en) * | 2004-10-06 | 2013-04-09 | Broadcom Corporation | Method and system for channel estimation in a single channel MIMO system with multiple RF chains for WCDMA/HSDPA |
CN110380994A (zh) * | 2019-05-13 | 2019-10-25 | 上海海事大学 | 快速贝叶斯匹配追踪海上稀疏信道估计方法 |
CN110460549A (zh) * | 2019-08-02 | 2019-11-15 | 南京邮电大学 | 一种新颖的多用户3d mimo***的信道估计方法 |
CN110636018A (zh) * | 2019-09-29 | 2019-12-31 | 哈尔滨工程大学 | 一种网格补偿大规模mimo信道估计方法 |
CN111614386A (zh) * | 2020-04-03 | 2020-09-01 | 西安交通大学 | 一种快速搜索方法 |
Also Published As
Publication number | Publication date |
---|---|
CN111614386B (zh) | 2021-04-27 |
CN111614386A (zh) | 2020-09-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112910807B (zh) | 一种基于空间随机采样的智能超表面信道估计方法及*** | |
Xie et al. | Channel estimation for TDD/FDD massive MIMO systems with channel covariance computing | |
Ma et al. | High-resolution channel estimation for frequency-selective mmWave massive MIMO systems | |
US8032184B2 (en) | Method for generating downlink beamforming weighting vectors | |
CN102175989B (zh) | 一种非相干分布式信号二维波达角的测定方法 | |
WO2021227482A1 (zh) | 一种大规模天线***中的安全传输方法 | |
CN109490850A (zh) | 主瓣干扰下宽带阵列自适应波束形成方法 | |
Zhang et al. | Channel estimation for massive MIMO-OFDM systems by tracking the joint angle-delay subspace | |
CN110971547B (zh) | 一种基于毫米波/太赫兹的宽带大规模终端检测和信道估计方法 | |
CN108667493A (zh) | 一种面向大规模mimo中nlos场景下的波束赋形方法 | |
CN106788655A (zh) | 互耦条件下未知互耦信息的干扰相干稳健波束形成方法 | |
WO2023185373A1 (zh) | 天波大规模mimo三重波束基信道建模及信道信息获取 | |
CN110166401A (zh) | 大规模mimo正交频分复用***的相位噪声抑制方法 | |
WO2021196726A1 (zh) | 一种快速搜索方法 | |
CN110212951B (zh) | 一种基于Butler矩阵的大规模MIMO信道估计方法 | |
Lu et al. | Robust expectation–maximization direction-of-arrival estimation algorithm for wideband source signals | |
Li et al. | Reconfigurable intelligent surface aided position and orientation estimation based on joint beamforming with limited feedback | |
CN108572347A (zh) | 基于通信信号信道状态响应信息的面阵二维测角方法及*** | |
Lu et al. | Near-field localization and channel reconstruction for ELAA systems | |
CN105847196B (zh) | 一种基于DOA的多小区Massive MIMO***的信道估计方法 | |
Li et al. | Fast Estimation Method of Space‐Time Two‐Dimensional Positioning Parameters Based on Hadamard Product | |
Ji et al. | Multipath extraction based UL/DL channel estimation for FDD massive MIMO-OFDM systems | |
Han et al. | Superdirectivity-enhanced wireless communications: A multi-user perspective | |
CN108900290B (zh) | 一种基于定位信息的导频分配方法 | |
Zhao et al. | Deep reinforcement learning based intelligent reflecting surface optimization for tdd multi-user mimo systems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20928932 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20928932 Country of ref document: EP Kind code of ref document: A1 |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20928932 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 17/05/2023) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20928932 Country of ref document: EP Kind code of ref document: A1 |