CN113206716B - Modeling method of orthogonal channel matrix - Google Patents

Modeling method of orthogonal channel matrix Download PDF

Info

Publication number
CN113206716B
CN113206716B CN202110439763.6A CN202110439763A CN113206716B CN 113206716 B CN113206716 B CN 113206716B CN 202110439763 A CN202110439763 A CN 202110439763A CN 113206716 B CN113206716 B CN 113206716B
Authority
CN
China
Prior art keywords
channel matrix
orthogonal
orthogonal channel
matrix
modeling
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
CN202110439763.6A
Other languages
Chinese (zh)
Other versions
CN113206716A (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.)
Ksw Technologies Co ltd
Original Assignee
Ksw 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 Ksw Technologies Co ltd filed Critical Ksw Technologies Co ltd
Priority to CN202110439763.6A priority Critical patent/CN113206716B/en
Publication of CN113206716A publication Critical patent/CN113206716A/en
Application granted granted Critical
Publication of CN113206716B publication Critical patent/CN113206716B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/391—Modelling the propagation channel
    • 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

Abstract

The invention relates to the technical field of wireless channel modeling; at present, common orthogonal channels are all used for carrying out orthogonal channel modeling aiming at a single base station or a single terminal, and the orthogonal channels of any dimensionality aiming at multiple base stations or multiple terminals are lacked. The invention provides a modeling method of an orthogonal channel matrix, which realizes the modeling method of the orthogonal channel at the end with less antennas, namely, the channel orthogonality at the base station side or the terminal side can be realized, and the modeling method has the advantages of simple realization, simple principle and infinite expansion; the orthogonal channel matrix modeling method of any specified dimension is generated, namely, the orthogonal modeling of any dimension can be realized based on the orthogonal principle of a triangular coordinate system.

Description

Modeling method of orthogonal channel matrix
Technical Field
The invention belongs to the technical field of wireless channel modeling, and particularly relates to a modeling method of an orthogonal channel matrix.
Background
In MIMO wireless channel modeling, orthogonal channels are a very specific channel model. The channel capacity of the MIMO communication system can be influenced by the existence of fading channels, but the orthogonal channel as a channel model theoretically exists can help the MIMO communication system to reach the peak value of the channel capacity, and the value can be used as an upper bound of a subsequent fading channel capacity test to guide the subsequent system optimization and wireless channel test, so that the value is a key loop of a channel simulation test. At present, common orthogonal channels are all used for carrying out orthogonal channel modeling aiming at a single base station or a single terminal, and the orthogonal channels of any dimensionality aiming at multiple base stations or multiple terminals are lacked.
Therefore, at present, a modeling method of an orthogonal channel matrix needs to be designed to solve the above problems.
Disclosure of Invention
The present invention aims to provide a modeling method of an orthogonal channel matrix, which is used for solving the technical problems existing in the prior art, such as: at present, common orthogonal channels are all used for carrying out orthogonal channel modeling aiming at a single base station or a single terminal, and the orthogonal channels of any dimensionality aiming at multiple base stations or multiple terminals are lacked.
In order to achieve the purpose, the technical scheme of the invention is as follows:
the modeling method of the orthogonal channel matrix comprises the following steps:
correspondingly regarding the antennas of multiple base stations or multiple terminals as a base station or a terminal, and realizing orthogonal channel modeling at the end with fewer antennas;
defining a basic matrix as follows:
Figure GDA0003643142350000011
the splicing matrix is as follows:
Figure GDA0003643142350000012
assuming that an mxn orthogonal channel matrix needs to be generated,
when the M is larger than the N,
(1) first, an M × M orthogonal channel matrix is calculated, assuming that M is 2qQ ∈ [1, + ∞) and q is a positive integer, assuming p ∈ [1, q)]And p isiIs an element in the vector p, i ∈ [1,2, …, N]Let us know that pN＝q；
(2) If p isiIf < q, then it is generated
Figure GDA0003643142350000024
Of orthogonal channel matrix, then
Figure GDA0003643142350000021
Wherein B (1,1) represents the elements of the first row and the first column in the splicing square matrix B;
(3) if p isi+1If q is less than or equal to q, operating the step (2); if p isi+1Q, then
Figure GDA0003643142350000026
An M by M orthogonal channel matrix;
(4) for is to
Figure GDA0003643142350000025
Intercepting to obtain an M multiplied by N orthogonal channel matrix;
and (4) when M is less than or equal to N, executing the steps (1) to (4) in the same way.
Further, in step S1, when it is assumed that an M × N orthogonal channel matrix needs to be generated, M and N need to satisfy the following condition:
if M > N, M must satisfy an integer power of 2, N being any integer;
if M ≦ N, N must satisfy an integer power of 2, M being any integer.
Further, when M is 4 and N is 3, a 4 × 4 orthogonal channel matrix is first generated:
Figure GDA0003643142350000022
cutting the 4 × 4 matrix to obtain a 4 × 3 channel matrix;
Figure GDA0003643142350000023
further, when an orthogonal channel matrix with any specified dimension needs to be generated, the specific steps are as follows;
step (1) appointing a dimension C needing to be orthogonal and a discrete number C' of integration intervals;
step (2) in vector [ cos x, sin x, cos2x, sin2x, … cos nx, sin nx …]C elements C (x) and [ C ] are randomly selected1(x),c2(x),…,cC(x)]T；
C' uniform division is carried out on [ - π, π ] in step (3), and a vector is obtained:
d＝[-π,-π+Δc′,-π+2Δc′,…,π-Δc′]，
Figure GDA0003643142350000031
and (4) bringing the elements in the d into c (x) one by one to obtain an orthogonal channel matrix M multiplied by N of the specified orthogonal dimension.
Further, step (5) is included on the basis of step (4), namely
The generated orthogonal channel matrix is checked to avoid duplicate rows or columns in mxn.
Compared with the prior art, the invention has the following beneficial effects:
the scheme has the innovation point that the orthogonal channel modeling at the end with fewer antennas is completed, the channel orthogonality at the base station side or the terminal side can be realized, and the scheme has the advantages of simplicity and convenience in realization, simple principle and infinite expansion; and based on the orthogonal principle of the triangular coordinate system, orthogonal modeling of any dimension can be realized.
Drawings
Fig. 1 is a schematic diagram of steps of a method for modeling an orthogonal channel at a side with fewer antennas according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of steps of a modeling method for generating an orthogonal channel matrix with any specified dimension according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to fig. 1-2 of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment is as follows:
as shown in fig. 1, therefore, a method for modeling an orthogonal channel matrix is proposed, comprising the steps of:
correspondingly regarding the antennas of multiple base stations or multiple terminals as a base station or a terminal, and realizing orthogonal channel modeling at the end with fewer antennas;
defining a basic matrix as follows:
Figure GDA0003643142350000032
the splicing matrix is as follows:
Figure GDA0003643142350000041
assuming that an mxn orthogonal channel matrix needs to be generated,
when the M is larger than the N,
(1) first, an M × M orthogonal channel matrix is calculated, assuming that M is 2qQ ∈ [1, + ∞) and q is a positive integer, assuming p ∈ [1, q)]And p isiIs an element in the vector p, i ∈ [1,2, …, N]Let us know that pN＝q；
(2) If p isiIf < q, then generation is
Figure GDA0003643142350000045
Of orthogonal channel matrix, then
Figure GDA0003643142350000042
Wherein B (1,1) represents the elements of the first row and the first column in the splicing square matrix B;
(3) if p isi+1If q is less than or equal to q, operating the step (2); if p isi+1Q, then
Figure GDA0003643142350000046
An M by M orthogonal channel matrix;
(4) to pair
Figure GDA0003643142350000047
Intercepting to obtain an M multiplied by N orthogonal channel matrix;
and (4) when M is less than or equal to N, executing the steps (1) to (4) in the same way.
Further, in step S1, when it is assumed that an M × N orthogonal channel matrix needs to be generated, M and N need to satisfy the following condition:
if M > N, M must satisfy an integer power of 2, N being any integer;
if M ≦ N, N must satisfy an integer power of 2, M being any integer.
Further, when M is 4 and N is 3, a 4 × 4 orthogonal channel matrix is first generated:
Figure GDA0003643142350000043
cutting the 4 × 4 matrix to obtain a 4 × 3 channel matrix;
Figure GDA0003643142350000044
similarly, if an 8 × 8 channel matrix is required, the above method can be used for S2And multiplying the elements in the splicing square matrix B respectively to obtain the final product. Meanwhile, the diversity of the orthogonal channel matrix can be generated by reasonably selecting the base matrix A and the splicing square matrix B.
The method can realize the orthogonal channel modeling at the end with fewer antennas, is simple to realize, and supports the infinite extension of the antennas due to the iterative generation. In some special scenarios, an orthogonal channel model of arbitrary dimension may be used, and if there is a 32 × 8MIMO channel model, only 8 orthogonal links (a logical connection from each base station antenna to one terminal antenna is called a link) may be generated using the above method, and if 32 links are required to be orthogonal, the following method is used. Namely;
according to the orthogonal theorem of trigonometric functions:
the functions that make up the trigonometric series are 1, cos x, sin x, cos2x, sin2x, …, cos nx, sin nx, … are orthogonal in [ - π, π ], i.e., where the integral of the product of any two different functions over [ - π, π ] is equal to 0:
Figure GDA0003643142350000051
Figure GDA0003643142350000052
Figure GDA0003643142350000053
in the above formula, m is [0,1,2, … ], and n is [0,1,2, … ].
According to the above formula, if an M × N orthogonal channel matrix is generated (M and N are both positive integers), for a dimension C (C is M or N) that needs to be orthogonal, C elements are randomly selected from vectors [ cos x, sin x, cos2x, sin2x, … cos nx, sin nx ], and meanwhile [ -pi, pi ] is equally divided by another dimension C '(C' is M or N), i.e., the integral is discretized, the integral result can satisfy:
∑cos nx sin mxdx≈0，m≠n；
∑sin nx sin mxdx≈0，m≠n；
∑cos nx cos mxdx≈0，m≠n
and the larger the discretization, the more accurate the result of the orthogonality.
As shown in fig. 2, when an orthogonal channel matrix of any specified dimension needs to be generated, the specific steps are as follows;
step (1) appointing a dimension C needing to be orthogonal and a discrete number C' of integration intervals;
step (2) in vector [ cos x, sin x, cos2x, sin2x, … cos nx, sin nx …]C elements C (x) and [ C ] are randomly selected1(x),c2(x),…,cC(x)]T；
C' uniform division is carried out on [ - π, π ] in step (3), and a vector is obtained:
d＝[-π,-π+Δc′,-π+2Δc′,…,π-Δc′]，
Figure GDA0003643142350000061
and (4) bringing the elements in the d into c (x) one by one to obtain an orthogonal channel matrix M multiplied by N of the specified orthogonal dimension.
Further, step (5) is included on the basis of step (4), namely
The generated orthogonal channel matrix is checked to avoid duplicate rows or columns in mxn. That is, due to the periodicity of the sine and cosine functions, the generated orthogonal channel matrix needs to be checked to avoid repeated rows or columns in mxn; if repetition occurs, go back to (2) to continue generating, or circumvent this problem by specifying n in the vector [ cos x, sin x, cos2x, sin2x, … cos nx, sin nx … ] as a large number of primes.
Where the generated coefficients are real numbers, the above method can be easily extended to complex sets if orthogonal complex impulse responses are required, since
Figure GDA0003643142350000062
I.e. the integrals of the complex exponential function sets over a period are also orthogonal.
The above are preferred embodiments of the present invention, and all changes made according to the technical scheme of the present invention that produce functional effects do not exceed the scope of the technical scheme of the present invention belong to the protection scope of the present invention.

Claims (5)

1. The modeling method of the orthogonal channel matrix is characterized by comprising the following steps:
correspondingly regarding the antennas of multiple base stations or multiple terminals as a base station or a terminal, and realizing orthogonal channel modeling at the end with fewer antennas;
defining a basic matrix as follows:
Figure FDA0003034584170000011
the splicing square matrix is as follows:
Figure FDA0003034584170000012
assuming that an mxn orthogonal channel matrix needs to be generated,
when the M is larger than the N,
(1) first, an M × M orthogonal channel matrix is calculated, assuming that M is 2q，q∈[1,+∞)，And q is a positive integer; let p ∈ [1, q ] be]And p isiIs an element in the vector p, i ∈ [1,2, …, N]Let us know that pN＝q；
(2) If p isiIf < q, then it is generated
Figure FDA0003034584170000013
Of the orthogonal channel matrix
Figure FDA0003034584170000014
Figure FDA0003034584170000015
Wherein B (1,1) represents the elements of the first row and the first column in the splicing square matrix B;
(3) if p isi+1If q is less than or equal to q, operating the step (2); if p isi+1Q is greater than
Figure FDA0003034584170000016
An M × M orthogonal channel matrix;
(4) to pair
Figure FDA0003034584170000017
Intercepting to obtain an M multiplied by N orthogonal channel matrix;
and (4) when M is less than or equal to N, executing the steps (1) to (4) in the same way.
2. The method for modeling an orthogonal channel matrix as claimed in claim 1, wherein in step S1, assuming that an mxn orthogonal channel matrix needs to be generated, M and N need to satisfy the following condition:
if M > N, M must satisfy an integer power of 2, N being any integer;
if M ≦ N, N must satisfy an integer power of 2, M being any integer.
3. The method of claim 2, wherein when M is 4 and N is 3, a 4 x 4 orthogonal channel matrix is first generated:
Figure FDA0003034584170000021
cutting the 4 × 4 matrix to obtain a 4 × 3 channel matrix;
Figure FDA0003034584170000022
4. the modeling method of the orthogonal channel matrix according to any of claims 1-3, characterized in that when the orthogonal channel matrix of any specified dimension needs to be generated, the specific steps are as follows;
step (1), appointing a dimension C needing to be orthogonal and a discrete number C' of an integral interval;
step (2) to vector [ cosx, sinx, cos2x, sin2x, … cosnx, sinnx …]C elements C (x) and [ C ] are randomly selected1(x),c2(x),…,cC(x)]T；
C' uniform division is carried out on [ - π, π ] in step (3), and a vector is obtained:
d＝[-π,-π+Δc′,-π+2Δc′,…,π-Δc′]，
Figure FDA0003034584170000023
and (4) bringing the elements in the d into c (x) one by one to obtain an orthogonal channel matrix M multiplied by N of the specified orthogonal dimension.
5. The modeling method of an orthogonal channel matrix according to claim 4, further comprising a step (5) of, on the basis of the step (4), forming a matrix
The generated orthogonal channel matrix is checked to avoid duplicate rows or columns in mxn.
CN202110439763.6A 2021-04-23 2021-04-23 Modeling method of orthogonal channel matrix Active CN113206716B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110439763.6A CN113206716B (en) 2021-04-23 2021-04-23 Modeling method of orthogonal channel matrix

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110439763.6A CN113206716B (en) 2021-04-23 2021-04-23 Modeling method of orthogonal channel matrix

Publications (2)

Publication Number Publication Date
CN113206716A CN113206716A (en) 2021-08-03
CN113206716B true CN113206716B (en) 2022-06-24

Family

ID=77028067

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110439763.6A Active CN113206716B (en) 2021-04-23 2021-04-23 Modeling method of orthogonal channel matrix

Country Status (1)

Country Link
CN (1) CN113206716B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108199794A (en) * 2018-03-05 2018-06-22 南京邮电大学 A kind of statistical modeling method of novel Massive mimo channels model

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
HUE040750T2 (en) * 2009-01-07 2019-03-28 Sun Patent Trust Wireless communication apparatus, wireless communication system and wireless communication method
CN101645759B (en) * 2009-08-26 2013-03-27 北京天碁科技有限公司 Estimation method, device and system of channel matrix rank based on double reception antenna
CN109478955A (en) * 2016-08-11 2019-03-15 华为技术有限公司 A kind of feedback parameter report method and device
US11018729B2 (en) * 2019-05-21 2021-05-25 Nxp Usa, Inc. Structured-pipelined CORDIC for matrix equalization
CN111698183B (en) * 2020-06-28 2023-04-07 上海瀚讯信息技术股份有限公司 Multi-mode vortex wave orthogonalization self-adaptive transmission method and device
CN112235024B (en) * 2020-10-15 2022-03-18 上海海事大学 Interference-nulling-based optimal antenna configuration method for any message topology MIMO system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108199794A (en) * 2018-03-05 2018-06-22 南京邮电大学 A kind of statistical modeling method of novel Massive mimo channels model

Also Published As

Publication number Publication date
CN113206716A (en) 2021-08-03

Similar Documents

Publication Publication Date Title
CN112910807B (en) Intelligent super-surface channel estimation method and system based on space random sampling
CN101682364B (en) Systems and methods for designing a sequence for code modulation of data and channel estimation
CN2674803Y (en) Substation with zero control apparatus
JP6681692B2 (en) Common signal transmission method and apparatus in mixed beam forming technology
CN102232319B (en) Method and apparatus of a multiple-access communication system
CN103259755B (en) A kind of universe covers the main synchronizing sequence method for designing of multi-beam satellite LTE
CN103650366B (en) Beamforming methods and apparatuses
CN104698430A (en) Virtual array antenna based angle estimation method for improving accuracy
EP3026823A1 (en) Method and device for acquiring channel information
CN105162507A (en) Signal to leakage noise ratio (SLNR)-based two-stage precoding method in large-sale MIMO FDD system
CN105246086A (en) Method and equipment for determining antenna angles
CN107852387A (en) Reduce the method that pre-coding matrix calculates in extensive multi-input multi-output system and user equipment is grouped complexity
CN109871631A (en) Array pattern integrated approach based on nonuniform fast Fourier transform algorithm
CN113206716B (en) Modeling method of orthogonal channel matrix
Wang et al. Learning the structured sparsity: 3-D massive MIMO channel estimation and adaptive spatial interpolation
US20180269937A1 (en) Methods and Devices for Configuring or Generating Channel Acquisition Signal
CN108462519A (en) A kind of channel state information feedback method, UE and access network entity
CN102545983A (en) Processing method and device for pilot frequency in multi-point cooperative transmission system
CN107426119B (en) Cross-shaped channel estimation method, device and system for millimeter wave communication
CN101252419A (en) Capacity evaluating method using channel statistical information in multi-aerial transmission system
Li et al. Joint measure matrix and channel estimation for millimeter-wave massive MIMO with hybrid precoding
CN106230755A (en) A kind of mimo system channel estimation methods and device
CN103414544A (en) Method for generating multiphase orthogonal complementary sequence set in communication system
CN106506051A (en) Method and apparatus based on the mixing precoding of reconfigurable antenna
CN105071844A (en) Method and device for determining beam forming weight vector

Legal Events

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