CN113037659A - Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method - Google Patents
Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method Download PDFInfo
- Publication number
- CN113037659A CN113037659A CN202110215615.6A CN202110215615A CN113037659A CN 113037659 A CN113037659 A CN 113037659A CN 202110215615 A CN202110215615 A CN 202110215615A CN 113037659 A CN113037659 A CN 113037659A
- Authority
- CN
- China
- Prior art keywords
- matrix
- optimization
- solution
- theta
- representing
- 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.)
- Granted
Links
Images
Classifications
-
- 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
- H04L25/021—Estimation of channel covariance
-
- 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
- H04L25/024—Channel estimation channel estimation algorithms
- H04L25/0242—Channel estimation channel estimation algorithms using matrix methods
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multi-intelligent-reflector-assisted uplink cloud access network access link transmission method. The system is characterized by the design of the phase shift matrix of the IRS and the covariance matrix of the fronthaul link compression noise with the aim of maximizing the system uplink and speed. Aiming at an uplink transmission system of a multi-IRS auxiliary C-RAN access link, the invention improves the total transmission rate of the communication system by carrying out joint optimization on the phase shift matrix of the IRS and the covariance matrix of the compression noise of a fronthaul link.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a neutralization rate maximization optimization method in an access link transmission system based on an intelligent reflector assisted cloud wireless access network.
Background
With the development of science and technology, the wireless technology field is also developed vigorously, the demand of wireless communication services is continuously increased, the requirement on the efficiency of communication transmission is higher and higher, and the traditional wireless communication system cannot meet the requirement.
A cloud radio access network (C-RAN), which is a wireless communication system that promises to alleviate the current communication needs, is different from the conventional communication system in that it transfers baseband processing units from the conventional base station to a cloud baseband processing unit (BBU) pool. The user transmits the signal to a Radio Remote Head (RRH), and the RRH transmits the signal to a BBU pool through a fronthaul link through point-to-point compression or Wyner-Ziv coding compression. However, since the users in the cell are far away from the RRH, we here use Intelligent Reflector (IRS) to assist the users to access the RRH. The Intelligent Reflecting Surface (IRS) integrates a passive reflecting original piece on a plane, directly reflects transmitted information, and each reflecting unit is independently controllable, and enhances a reflecting signal by controlling the amplitude and the phase of the reflecting unit. Different from the traditional relay, the wireless network environment can be intelligently reconstructed, and the performance of the wireless network can be effectively improved.
Through an access link of the IRS auxiliary C-RAN, a user transmits signals to the RRH through a direct link and a reflection link, the RRH compresses and receives the signals through Wyner-Ziv coding, and the signals are transmitted to the BBU pool through a fronthaul link. The performance of the system depends on the phase shift matrix of the IRS and the compression noise of the fronthaul link, and the sum rate of users to the BBU pool is further improved by jointly optimizing the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link.
Disclosure of Invention
The invention aims to provide a method for optimizing the neutralization rate maximization in an access link transmission system based on IRS-assisted C-RAN. Namely, under the condition that the capacity of the fronthaul link is limited, the phase shift matrix of the optimal intelligent reflecting surface and the covariance matrix of the fronthaul link compression noise are optimized so as to maximize the system transmission and the speed.
The technical scheme of the invention is as follows:
a multi-intelligent reflector-assisted uplink cloud access network access link transmission method is characterized in that an IRS-assisted C-RAN access link is adopted in a system, under the condition that capacity of a forward link is limited, a phase shift matrix of the IRS and a covariance matrix of compression noise of the forward link are optimized in a combined mode with the aim of maximizing the system and the speed, and the method comprises the following specific steps:
1.1) in the communication system based on the access link of the IRS-assisted C-RAN, a user communicates with a BBU pool through RRH, a plurality of IRS are deployed between the user and RRH, and the user is assisted to access RRH. There are K single antenna users in the system, there are L RRHs, each RRH has NRA root receiving antenna, M IRSs disposed between the user and RRH, each IRS having NIThe RRH compresses the received signal and transmits the compressed signal to the BBU pool through a wired forward link;
1.2) users K, K1, K, send signals x to the individual RRHskAnd each RRH receives signals sent by users through a direct link and a reflection link of the IRS. RRHl, L1.., L, the received signal may be expressed as:
wherein x ═ x1,...,xk]Tx-CN (0, PI), obeying Gaussian distribution, P represents user transmission power, and I represents an identity matrix.Representing the user-to-RRHl channel matrix,a channel matrix representing users to IRSm, M1.., M,representing the channel matrix, Θ, from IRS to RRHlm=diag(θm,1,...,θm,n) The phase-shift matrix representing the IRS is a diagonal matrix whose diagonal elements are taken from vectors(IRS adjusts only the phase, so | θm,n|=1,n=1,...,NI),Is represented by thetamA block diagonal matrix is formed. n isl~CN(0,σ2IM) Is additive Gaussian noise of the channel, Gl,mRepresenting the channel noise, I, from the m IRS to the l RRHMRepresenting an identity matrix of order M, σ2Representing the channel additive gaussian noise factor.
1.3) the RRH compresses the received signal through point-to-point compression or Wyner-Ziv coding and transmits the compressed signal to the BBU pool through a wired fronthaul link. The quantized signal received at the BBU pool can be expressed as:
wherein q isl~CN(0,Ωl) Quantization noise representing RRHl, which obeys a complex Gaussian distribution, ΩlIs its covariance matrix. The sum rate of users to BBU pool can thus be expressed as:
wherein The channel matrix representing all users to all RRHs,direct link representing all users to all RRHsThe channel matrix of the way is formed,the channel matrix representing all IRS to all RRHs,is represented by omegalForming a block diagonal matrix, I is a representation form of mutual information, I represents an identity matrix, VHRepresenting the conjugate transpose of V.
1.4) for RRH adopting point-to-point compression, the compression ratio of the fronthaul link is less than the capacity C of the fronthaul linklNamely, it is required to satisfy:
1.5) for the RRH adopting Wyner-Ziv coding compression, the compression ratio of the fronthaul link is smaller than the capacity of the fronthaul link, namely, the requirements of:wherein C isπ(l)Representing the fronthaul link capacity, and pi (l) represents the decompression order of the received signals at the BBU pool.
For point-to-point compression, the design of the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link comprises the following specific steps:
2.1) the optimization problem for sum rate maximization can be expressed as:
wherein Vl=Hl+GlΘHrRepresenting the channel matrix for all users to RRHl.
2.2) re-determining the maximum iteration number T of the joint optimizationmaxAnd selecting an initial theta satisfying the constraint condition(0)And
2.3) the optimization problem for step 2.1) can be converted into the following form:
2.5) re-fixing W, Σ and ElFor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinAl⊙BTIs represented by AlAnd BTThe product of the Hadamard sum of (C),for column vectors by matrixIs made up of diagonal elements. For column vectors by matrixThe composition of the diagonal line elements of (a),will be relaxed by semi-positive definite (SDR)Removing the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution:represents an optimized solution of the optimization problem in this step, HLRepresenting the channel matrix of all users to the RRHs.
2.6) Re-judgmentWhether the constraint condition of the step 2.5) is met or not, and if the constraint condition is met, directly performing characteristic value decomposition:for step 2.5) optimization of the solution to the optimization problem, where U is expressed asA matrix of eigenvectors, Λ beingIs formed by the eigenvalues ofHIs a conjugate transpose of U;the optimized column vector is represented, the column vector consisting of diagonal elements of the phase shift matrix and the column vector consisting of 1. If the constraint of step 2.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinAre independent random variables uniformly distributed on a unit circle of a complex plane (i.e. the unit circle is aθiIndependently and uniformly distributed in [0,2 pi ]]) Second through the pair omegalScaling is carried out, the generated optimized solution meets the constraint condition of the step 2.5), and finally, one solution which enables the target function in the step 2.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiset=1,...,TmaxThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 2.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also brought into the objective function of step 2.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)The optimization solution of the previous round is taken as the optimization solution of the current round.
2.7) substituting the optimized solution of step 2.6) into the sum-rate expression RsumTo obtain the sum rate of the iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta(t),Wherein ^ represents an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 2.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
2.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 2.1) to 2.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:where phi denotes the discrete phase and tau is 2bAnd b is 1,2, representing discrete levels. Then toIs scaled to obtainSo that it meets the constraints in step 2.1).
For the design of the Wyner-Ziv coding compression, the specific steps for the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link are as follows:
3.1) and the rate maximization optimization problem can be expressed as:
whereinRepresenting a decompression order set, and pi (l) represents that RRH pi (l) is arranged at the I-th bit of the decompression order of the BBU pool.
3.2) for the sequence of the BBU decompression pools, judging:the higher value of (2) is decompressed first. Re-determining maximum iteration number T of joint optimizationmaxAnd selecting the initial theta satisfying the condition(0)And
3.3) the optimization problem in step 3.1) can be written as follows:
3.4) fixing theta, omegalFor the case of W, Σ,by performing the update, the following results are obtained: IKrepresenting a K × K identity matrix.
3.5) resetting W, Sigma andfor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinFor column vectors by matrixThe composition of the diagonal line elements is shown,and then by semi-positive relaxation (SDR)Removing the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution:the solution to the problem is optimized for this step.
3.6) Re-judgmentWhether the constraint condition of the step 3.5) is met or not, and if the constraint condition is met, directly performing characteristic value decomposition:is an optimized solution of the optimization problem of the step 3.5),the optimized column vector is represented, the column vector consisting of diagonal elements of the phase shift matrix and the column vector consisting of 1. If the constraint of step 3.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinAre independent random variables uniformly distributed on a unit circle of a complex plane (i.e. the unit circle is aθiIndependently and uniformly distributed in [0,2 pi ]]) Second through the pair omegalScaling is carried out, the generated optimized solution meets the constraint condition of the step 3.5), and finally, one solution which enables the target function in the step 3.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiset=1,...,TmaxThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 3.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also taken into the objective function of step 3.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)The optimization solution of the previous round is taken as the optimization solution of the current round.
3.7) substituting the optimized solution of step 3.6) into the sum-rate expression RsumTo obtain the sum rate of the iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta(t),Wherein ^ represents an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 3.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
3.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 3.1) to 3.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:where phi denotes the discrete phase and tau is 2bAnd b is 1,2, representing discrete levels. Then toIs scaled to obtainSo that it meets the constraints in step 3.1).
The invention has the advantages that for the communication system of the IRS auxiliary C-RAN access link, the system and the speed are obviously improved by optimizing the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link; in addition, the system and the speed obtained by the optimization algorithm are obviously improved compared with the system and the speed under the condition of IRS random and the condition of no IRS.
Drawings
Fig. 1 is a schematic diagram of an access link system of an auxiliary cloud access network based on an intelligent reflector according to the present invention;
fig. 2 is a schematic speed diagram of an access link system of an auxiliary cloud access network based on an intelligent reflector according to the present invention after the joint optimization method of the present invention is adopted;
FIG. 2 shows the relationship between the system and speed and the number of intelligent reflecting surfaces, and FIG. 2 shows the continuous phase of the optimal decompression sequence, the continuous phase of the suboptimal decompression sequence, the 2-bit discrete phase of the suboptimal decompression sequence, the 1-bit discrete phase of the suboptimal decompression sequence, the sum speed of the suboptimal decompression sequence when no intelligent reflecting surface exists in the stochastic phase and the suboptimal decompression sequence, and the sum speed of the continuous phase, the 2-bit discrete phase, the 1-bit discrete phase, the random phase and the situation when no intelligent reflecting surface exists in the point-to-point compression.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The communication system transmission process based on the IRS assisted C-RAN access link is shown in fig. 1. Before transmission begins, channel information in the system is collected, and then a phase shift matrix of the IRS and a covariance matrix of the compression noise of a fronthaul link are jointly optimized. The transmission process comprises the following steps: the user communicates with the BBU pool through the RRH, the user sends signals to transmit the signals to the RRH through direct and reflected paths, and the RRH compresses the received signals through point-to-point or Wyner-Ziv coding and transmits the signals to the BBU pool through a fronthaul link. The method comprises the following steps of performing joint optimization on a phase shift matrix of the IRS and a covariance matrix of compression noise of a fronthaul link to improve the system and the speed, wherein the specific optimization process is as follows:
1.1) in the communication system based on the access link of the IRS-assisted C-RAN, a user communicates with a BBU pool through RRH, a plurality of IRS are deployed between the user and RRH, and the user is assisted to access RRH. There are K single antenna users in the system, there are L RRHs, each RRH has NRA root receiving antenna, M IRSs disposed between the user and RRH, each IRS having NIA reflection unit. The RRH compresses the received signal and transmits the compressed signal to the BBU pool through a wired forward link.
1.2) users K, K1, K, send signals x to the individual RRHskAnd each RRH receives signals sent by users through a direct link and a reflection link of the IRS. RRHl, L1.., L, the received signal may be expressed as:
wherein x ═ x1,...,xk]Tx-CN (0, PI), obeying a Gaussian distribution.Representing the user-to-RRHl channel matrix,a channel matrix representing users to IRSm, M1.., M, representing the channel matrix IRS to RRHl. Thetam=diag(θm,1,...,θm,n) The phase-shift matrix representing the IRS is a diagonal matrix whose diagonal elements are taken from vectors(IRS adjusts only the phase, so | θm,n|=1,n=1,...,NI),Is represented by thetamA block diagonal matrix is formed. n isl~CN(0,σ2IM) Is additive gaussian noise of the channel.
1.3) the RRH compresses the received signal through point-to-point compression or Wyner-Ziv coding and transmits the compressed signal to the BBU pool through a wired fronthaul link. The quantized signal received at the BBU pool can be expressed as:
wherein q isl~CN(0,Ωl) Quantization noise representing RRHl, which obeys a complex Gaussian distribution, ΩlIs its covariance matrix. The sum rate of users to BBU pool can thus be expressed as:
whereinThe channel matrix representing all users to all RRHs,represents the direct link channel matrix of all users to all RRHs,the channel matrix representing all IRS to all RRHs,is represented by omegalA block diagonal matrix is formed.
1.4) for RRH adopting point-to-point compression, the compression ratio of the fronthaul link is less than the capacity C of the fronthaul linklNamely, it is required to satisfy:
1.5) for the RRH adopting Wyner-Ziv coding compression, the compression ratio of the fronthaul link is smaller than the capacity of the fronthaul link, namely, the requirements of:wherein C isπ(l)Representing the fronthaul link capacity, and pi (l) represents the decompression order of the received signals at the BBU pool.
2. For point-to-point compression, the optimization method for maximizing the sum rate according to the transmission mode of the communication system based on the IRS assisted C-RAN access link in claim 1 is characterized in that the design of the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link comprises the following specific steps:
2.1) the optimization problem for sum rate maximization can be expressed as:
wherein Vl=Hl+GlΘHrRepresenting the channel matrix for all users to RRHl.
2.2) re-determining the maximum iteration number T of the joint optimizationmaxAnd selecting an initial theta satisfying the constraint condition(0)And
2.3) the optimization problem for step 2.1) can be converted into the following form:
2.5) re-fixing W, Σ and ElFor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinAl⊙BTIs represented by AlAnd BTThe product of the Hadamard sum of (C),for column vectors by matrixIs made up of diagonal elements. For column vectors by matrixThe composition of the diagonal line elements of (a),will be relaxed by semi-positive definite (SDR)Removing the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution:represents the optimal solution of the optimization problem in this step. 2.6) Re-judgmentWhether the constraint condition of the step 2.5) is met or not, and if the constraint condition is met, directly performing characteristic value decomposition:is an optimized solution of the optimization problem of the step 2.5),represents the optimized column vector, the column vector consisting of the diagonal elements of the phase shift matrix and the column vector consisting of 1, Λ1/2Represents the square of the lambda. If the constraint of step 2.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinAre independent random variables uniformly distributed on a unit circle of a complex plane (i.e. the unit circle is aθiIndependently and uniformly distributed in [0,2 pi ]]) Second through the pair omegalScaling is carried out, the generated optimized solution meets the constraint condition of the step 2.5), and finally, one solution which enables the target function in the step 2.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiset=1,...,TmaxThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 2.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also brought into the objective function of step 2.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)The optimization solution of the previous round is taken as the optimization solution of the current round.
2.7) substituting the optimized solution of step 2.6) into the sum-rate expression RsumTo obtainThe sum rate of the current iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta(t),Wherein ^ represents an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 2.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
2.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 2.1) to 2.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:where phi denotes the discrete phase and tau is 2bAnd b is 1,2, representing discrete levels. Then toIs scaled to obtainSo that it meets the constraints in step 2.1).
3. For the optimization method of adopting Wyner-Ziv coding compression, according to the transmission mode of communication system based on IRS auxiliary C-RAN access link in claim 1, the optimization method of maximum sum rate is characterized by that the design of the described IRS phase-shift matrix and covariance matrix of forward link compression noise includes the following concrete steps:
3.1) and the rate maximization optimization problem can be expressed as:
whereinRepresenting a decompression order set, and pi (l) represents that RRH pi (l) is arranged at the I-th bit of the decompression order of the BBU pool.
3.2) for the sequence of the BBU decompression pools, judging:the higher value of (2) is decompressed first. Re-determining maximum iteration number T of joint optimizationmaxAnd selecting the initial theta satisfying the condition(0)And
3.3) the optimization problem in step 3.1) can be written as follows:
3.4) fixing theta, omegalFor the case of W, Σ,by performing the update, the following results are obtained:
3.5) resetting W, Sigma andfor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinFor column vectors by matrixThe composition of the diagonal line elements is shown,and then by semi-positive relaxation (SDR)Removing the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution:the solution to the problem is optimized for this step.
3.6) Re-judgmentWhether the constraint condition of the step 3.5) is met or not, and if the constraint condition is metAnd (3) directly carrying out eigenvalue decomposition on the constraint conditions:is an optimized solution of the optimization problem of the step 3.5),the optimized column vector is represented, the column vector consisting of diagonal elements of the phase shift matrix and the column vector consisting of 1. If the constraint of step 3.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinAre independent random variables uniformly distributed on a unit circle of a complex plane (i.e. the unit circle is aθiIndependently and uniformly distributed in [0,2 pi ]]) Second through the pair omegalScaling is carried out, the generated optimized solution meets the constraint condition of the step 3.5), and finally, one solution which enables the target function in the step 3.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiset=1,...,TmaxThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 3.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also taken into the objective function of step 3.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)The optimization solution of the previous round is taken as the optimization solution of the current round.
3.7) step 3.6)Optimized solution entry-and-speed expression RsumTo obtain the sum rate of the iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta(t),WhereinIndicating an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 3.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
3.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 3.1) to 3.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:where phi denotes the discrete phase and tau is 2bAnd b is 1,2, representing discrete levels. Then toIs scaled to obtainSo that it meets the constraints in step 3.1).
Computer simulation shows that the system and the speed of the communication system based on the IRS auxiliary C-RAN access link are obviously higher than those of the traditional C-RAN after the joint optimization method is adopted.
Claims (3)
1. A multi-intelligent reflector-assisted uplink cloud access network access link transmission method is characterized in that a cloud radio access network C-RAN access link performs joint optimization on a phase shift matrix of an Intelligent Reflector (IRS) and a covariance of a forward link compression noise through the assistance of an Intelligent Reflector (IRS) and with the aim of maximizing a system and a speed, and is characterized in that: the method specifically comprises the following steps:
1.1) in a communication system based on an IRS-assisted C-RAN access link, a user communicates with a baseband processing unit (BBU) pool through a Radio Remote Head (RRH), a plurality of IRSs are deployed between the user and the RRH, and the user is assisted to access the RRH; there are K single antenna users in the system, there are L RRHs, each RRH has NRA root receiving antenna, M IRSs disposed between the user and RRH, each IRS having NIA reflection unit; the RRH compresses the received signal and transmits the compressed signal to the BBU pool through a wired forward link;
1.2) users K, K1, K, send signals x to the individual RRHskEach RRH receives signals sent by users through a direct link and a reflection link of the IRS; RRHl, L1.., L, the received signal may be expressed as:
wherein x ═ x1,...,xk]Tx-CN (0, PI) obeying Gaussian distribution, wherein P represents user transmission power, and I represents an identity matrix;representing the user-to-RRHl channel matrix,a channel matrix representing users to IRSm, M1.., M, representing the channel matrix from IRS to RRHl; thetam=diag(θm,1,...,θm,n) The phase-shift matrix representing the IRS is a diagonal matrix whose diagonal elements are taken from vectorsIRS adjusts only the phase, so | θm,n|=1,n=1,...,NI,Is represented by thetamA block diagonal matrix of components; n isl~CN(0,σ2IM) Additive gaussian noise for the channel; gl,mRepresenting the channel noise, I, from the m IRS to the l RRHMRepresenting an identity matrix of order M, σ2Representing the channel additive Gaussian noise factor;
1.3) the RRH compresses the received signal through point-to-point compression or Wyner-Ziv coding and transmits the compressed signal to the BBU pool through a wired fronthaul link; the quantized signal received at the BBU pool can be expressed as:
wherein q isl~CN(0,Ωl) Quantization noise representing RRHl, which obeys a complex Gaussian distribution, ΩlIs its covariance matrix(ii) a The sum rate of users to BBU pool can thus be expressed as:
wherein The channel matrix representing all users to all RRHs,represents the direct link channel matrix of all users to all RRHs,the channel matrix representing all IRS to all RRHs,is represented by omegalA block diagonal matrix of components; i is the representation form of mutual information, I represents an identity matrix, VHRepresents the conjugate transpose of V;
1.4) for RRH adopting point-to-point compression, the compression ratio of the fronthaul link is less than the capacity C of the fronthaul linklNamely, it is required to satisfy:
1.5) for the RRH adopting Wyner-Ziv coding compression, the compression ratio of the fronthaul link is smaller than the capacity of the fronthaul link, namely, the requirements of:wherein C isπ(l)Representing the capacity of the forwarding link, pi (l) representing the decompression order of the received signals in the BBU pool,representing the decompressed sequential set of the first l-1 received signals.
2. The method for transmitting the access link of the multi-intelligent-reflector-assisted uplink cloud access network according to claim 1, wherein for the design of point-to-point compression, the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link, the specific steps are as follows:
2.1) the optimization problem for sum rate maximization can be expressed as:
wherein Vl=Hl+GlΘHrRepresenting the channel matrix from all users to the RRHl;
2.2) re-determining the maximum iteration number T of the joint optimizationmaxAnd selecting an initial theta satisfying the constraint condition(0)And
2.3) the optimization problem for step 2.1) can be converted into the following form:
whereinW is the receive matrix, sigma denotes the a posteriori criterion estimate the covariance matrix of the data symbols, ElAn auxiliary variable matrix;
2.5) re-fixing W, Σ and ElFor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinAl⊙BTIs represented by AlAnd BTThe product of the Hadamard sum of (C),for column vectors by matrixDiagonal element composition of (a); for column vectors by matrixThe composition of the diagonal line elements of (a),by semi-positive relaxationSDR willRemoving the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution: representing an optimization solution to the optimization problem in this step; hLA channel matrix representing all users to RRHs;
2.6) Re-judgmentWhether the constraint condition of the step 2.5) is met or not, and if the constraint condition is met, directly performing characteristic value decomposition:for the optimized solution of the optimization problem of step 2.5), U is expressed asA matrix of eigenvectors, Λ beingIs formed by the eigenvalues ofHIs a conjugate transpose of U;representing the optimized column vector, the column vector consisting of diagonal elements of the phase shift matrix and the column vector consisting of 1; if the constraint of step 2.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinUnit circles uniformly distributed in the complex plane as independent random variables, followed by a pair of ΩlScaling is carried out, the generated optimized solution meets the constraint condition of the step 2.5), and finally, one solution which enables the target function in the step 2.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiseThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 2.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also brought into the objective function of step 2.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)Taking the optimization solution of the previous round as the optimization solution of the current round;
2.7) substituting the optimized solution of step 2.6) into the sum-rate expression RsumTo obtain the sum rate of the iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta*,WhereinIndicating an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 2.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
2.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 2.1) to 2.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:where phi denotes the discrete phase and tau is 2bAnd b is 1,2. represents discrete levels; then toIs scaled to obtainSo that it meets the constraints in step 2.1).
3. The method for transmitting the access link of the multi-intelligent-reflector-surface-assisted uplink cloud access network according to claim 1, wherein for the design of the Wyner-Ziv coding compression adopted, the phase shift matrix of the IRS and the covariance matrix of the compression noise of the fronthaul link are specifically as follows:
3.1) and the rate maximization optimization problem can be expressed as:
wherein Representing a decompression sequence set, and pi (l) represents that RRH pi (l) is arranged at the ith position of a BBU pool decompression sequence;
3.2) for the sequence of the BBU decompression pools, judging:decompressing the larger value of (1); re-determining maximum iteration number T of joint optimizationmaxAnd selecting the initial theta satisfying the condition(0)And
3.3) the optimization problem in step 3.1) can be written as follows:
3.4) fixing theta, omegalFor the case of W, Σ,by performing the update, the following results are obtained: IKan identity matrix representing K;
3.5) resetting W, Sigma andfor theta, omegalJoint optimization is performed such that the optimization problem can be expressed as:
whereinFor column vectors by matrixThe composition of the diagonal line elements is shown,then relaxing SDR through semipositive definiteRemoving the constraint condition, and then performing iterative optimization on the optimization problem after the SDR is relaxed by a convex optimization tool to obtain an optimized solution:optimizing the solution of the problem in the step;
3.6) Re-judgmentWhether the constraint condition of the step 3.5) is met or not, and if the constraint condition is met, directly performing characteristic value decomposition:is an optimized solution of the optimization problem of the step 3.5),the optimized column vector is represented, the column vector consisting of diagonal elements of the phase shift matrix and the column vector consisting of 1. If the constraint of step 3.5) is not satisfied, a plurality of suboptimal solutions are generated by the following method: firstly letWhereinAre independent random variables, are uniformly distributed on a unit circle of a complex plane, and then are subjected to omega pairlScaling is carried out, the generated optimized solution meets the constraint condition of the step 3.5), and finally, one solution which enables the target function in the step 3.5) to reach the minimum value is selected as the optimal solution, and the optimal solution is obtained: phase shift matrix theta(t)Covariance matrix of sum compression noiseThe number of iterations is indicated. Substituting the optimized solution into the objective function of the step 3.5) to obtain f(t)It means that the optimized solution is substituted into the value of the objective function, and the solution theta of the last iteration is substituted(t-1),Also taken into the objective function of step 3.5) of the current round to obtain f(t-1)Comparison is made if f(t)≤f(t-1)Taking the optimization solution of the previous round as the optimization solution of the current round;
3.7) optimal solution entry and rate of step 3.6)Expression RsumTo obtain the sum rate of the iterationFrom the last iterationMake a comparison ifStopping the iteration and determining the optimal resultOutput optimization solution theta(t),WhereinIndicating an allowable error range; if it isJudging whether the iteration number exceeds TmaxIf not, T is exceededmaxReturning to the step 3.2) to continue iterative optimization; if T is exceededmaxThen the final optimization solution is output
3.8) for the case of the IRS reflection surface phase being discrete, first theta is obtained by 3.1) to 3.7)*,Where the diagonal element theta of theta ism,nMapping onto points of discrete phase, i.e.:wherein phi is shownShowing a discrete phase, τ ═ 2bAnd b is 1,2, representing discrete levels. Then toIs scaled to obtainSo that it meets the constraints in step 3.1).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110215615.6A CN113037659B (en) | 2021-02-26 | 2021-02-26 | Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110215615.6A CN113037659B (en) | 2021-02-26 | 2021-02-26 | Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113037659A true CN113037659A (en) | 2021-06-25 |
CN113037659B CN113037659B (en) | 2022-10-21 |
Family
ID=76461617
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110215615.6A Active CN113037659B (en) | 2021-02-26 | 2021-02-26 | Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113037659B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113726395A (en) * | 2021-08-23 | 2021-11-30 | 浙江工业大学 | Intelligent reflector enhanced cloud access network multi-antenna user uplink transmission method |
CN114172552A (en) * | 2021-12-16 | 2022-03-11 | 西安梅隆控制工程有限责任公司 | IRS (intelligent resilient system) assistance-based high-energy-efficiency combined beam forming method |
CN114900398A (en) * | 2022-04-28 | 2022-08-12 | 浙江工业大学 | IRS (intelligent resilient framework) assisted cloud access network downlink beam forming method for non-ideal CSI (channel state information) |
WO2023051226A1 (en) * | 2021-09-30 | 2023-04-06 | 深圳市大数据研究院 | Intelligent reflecting surface phase-shift control method, system, and device, and storage medium |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110225538A (en) * | 2019-06-21 | 2019-09-10 | 电子科技大学 | The non-orthogonal multiple access communications design method of reflecting surface auxiliary |
CN111163511A (en) * | 2019-12-20 | 2020-05-15 | 北京邮电大学 | Intelligent reflection surface assisted uplink power distribution method with limited delay in millimeter wave communication |
CN111162823A (en) * | 2019-12-25 | 2020-05-15 | 浙江工业大学 | Method for optimizing precoding matrix and phase shift matrix in bidirectional MIMO communication system |
CN111294096A (en) * | 2020-02-17 | 2020-06-16 | 南京信息工程大学 | Channel capacity optimization method of intelligent reflector MISO wireless communication system |
CN111953391A (en) * | 2020-07-09 | 2020-11-17 | 东南大学 | Intelligent reflector assisted multi-user MIMO uplink energy efficiency and spectrum efficiency combined optimization method |
KR102192234B1 (en) * | 2019-10-28 | 2020-12-17 | 성균관대학교 산학협력단 | Communication method of wireless communication system including intelligent reflecting surface and an apparatus for the communication method |
-
2021
- 2021-02-26 CN CN202110215615.6A patent/CN113037659B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110225538A (en) * | 2019-06-21 | 2019-09-10 | 电子科技大学 | The non-orthogonal multiple access communications design method of reflecting surface auxiliary |
KR102192234B1 (en) * | 2019-10-28 | 2020-12-17 | 성균관대학교 산학협력단 | Communication method of wireless communication system including intelligent reflecting surface and an apparatus for the communication method |
CN111163511A (en) * | 2019-12-20 | 2020-05-15 | 北京邮电大学 | Intelligent reflection surface assisted uplink power distribution method with limited delay in millimeter wave communication |
CN111162823A (en) * | 2019-12-25 | 2020-05-15 | 浙江工业大学 | Method for optimizing precoding matrix and phase shift matrix in bidirectional MIMO communication system |
CN111294096A (en) * | 2020-02-17 | 2020-06-16 | 南京信息工程大学 | Channel capacity optimization method of intelligent reflector MISO wireless communication system |
CN111953391A (en) * | 2020-07-09 | 2020-11-17 | 东南大学 | Intelligent reflector assisted multi-user MIMO uplink energy efficiency and spectrum efficiency combined optimization method |
Non-Patent Citations (4)
Title |
---|
MARZIEH NAJAFI: "C-RAN with hybrid RF/FSO fronthaul links: joint optimization of fronthaul compression and RF time allocation", 《IEEE TRANSACTIONS ON COMMUNICATIONS》 * |
WEIHENG JIANG等: "Intelligent Reflecting Surface Assisted Secure Wireless Communications With Multiple- Transmit and Multiple-Receive Antennas", 《IEEE ACCESS》 * |
YU ZHANG等: "Fronthaul Compression and Passive Beamforming Design for Intelligent Reflecting Surface-aided Cloud Radio Access Networks", 《HTTPS://ARXIV.ORG/PDF/2102.12817V1.PDF》 * |
ZHENG CHU: "Intelligent reflecting surfaces enabled cognitive internet of things based on practical pathloss model", 《CHINA COMMUNICATIONS》 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113726395A (en) * | 2021-08-23 | 2021-11-30 | 浙江工业大学 | Intelligent reflector enhanced cloud access network multi-antenna user uplink transmission method |
WO2023051226A1 (en) * | 2021-09-30 | 2023-04-06 | 深圳市大数据研究院 | Intelligent reflecting surface phase-shift control method, system, and device, and storage medium |
CN114172552A (en) * | 2021-12-16 | 2022-03-11 | 西安梅隆控制工程有限责任公司 | IRS (intelligent resilient system) assistance-based high-energy-efficiency combined beam forming method |
CN114900398A (en) * | 2022-04-28 | 2022-08-12 | 浙江工业大学 | IRS (intelligent resilient framework) assisted cloud access network downlink beam forming method for non-ideal CSI (channel state information) |
Also Published As
Publication number | Publication date |
---|---|
CN113037659B (en) | 2022-10-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113037659B (en) | Multi-intelligent-reflector-assisted uplink cloud access network access link transmission method | |
CN110266352B (en) | Self-adaptive design method for intelligent reflecting surface phase shift matrix in large-scale MIMO system | |
CN111162823B (en) | Method for optimizing precoding matrix and phase shift matrix in bidirectional MIMO communication system | |
CN109921882B (en) | Deep learning-based MIMO decoding method, device and storage medium | |
CN111953391A (en) | Intelligent reflector assisted multi-user MIMO uplink energy efficiency and spectrum efficiency combined optimization method | |
US7573945B2 (en) | System and method for joint maximal ratio combining using time-domain based signal processing | |
CN111835406B (en) | Robust precoding method suitable for energy efficiency and spectral efficiency balance of multi-beam satellite communication | |
CN113726395B (en) | Uplink transmission method for intelligent reflection surface enhanced cloud access network multi-antenna user | |
CN108809383B (en) | Joint detection method for massive MIMO uplink system signals | |
CN116208619A (en) | Intelligent reflection surface-assisted Internet of vehicles safety calculation unloading method, system, equipment and medium | |
CN113727405A (en) | Method for improving safety rate of wireless communication system based on intelligent reflection surface | |
CN117498900A (en) | Resource allocation device and method for honeycomb-removing large-scale MIMO (multiple input multiple output) general sense integrated system | |
CN114900398A (en) | IRS (intelligent resilient framework) assisted cloud access network downlink beam forming method for non-ideal CSI (channel state information) | |
CN113852402B (en) | IRS (intelligent communications system) -assisted NOMA-MIMO (non-multiple input multiple output) high-capacity access method | |
CN107809399B (en) | Multi-antenna millimeter wave channel estimation method for quantized received signals | |
CN114844541B (en) | Hybrid precoding and feedback method based on deep learning | |
CN112600598B (en) | Intelligent reflecting surface enhanced wireless forward link transmission method in cloud access network | |
CN114745754A (en) | IRS (intelligent resilient System) assisted cloud access network uplink transmission optimization method under non-ideal channel information | |
CN114826833A (en) | Communication optimization method and terminal for CF-mMIMO in IRS-assisted MEC | |
CN116260490B (en) | Forward compression and precoding method for cellular multi-antenna system | |
CN115085782B (en) | Intelligent reflecting surface joint feedback and mixed precoding method based on deep learning | |
CN117856848B (en) | CSI feedback method based on automatic encoder structure | |
CN118264294A (en) | Beam forming method and device | |
CN115941010B (en) | IRS auxiliary honeycomb removing large-scale MIMO system beam forming method based on branch definition | |
US11418548B2 (en) | Method of transmitting security information of single-bit ADC wiretap channel |
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 |