RESUMEN
The large number of estimated parameters in a reconfigurable intelligent surface (RIS) makes it difficult to achieve accurate channel estimation accuracy in 6G. Therefore, we suggest a novel two-phase channel estimation framework for uplink multiuser communication. In this context, we propose an orthogonal matching pursuit (OMP)-based linear minimum mean square error (LMMSE) channel estimation approach. The OMP algorithm is used in the proposed algorithm to update the support set and pick the columns of the sensing matrix that are most correlated with the residual signal, which successfully reduces pilot overhead by removing redundancy. Here, we use LMMSE's advantages for handling noise to address the problem of inadequate channel estimation accuracy when the signal-to-noise ratio (SNR) is low. Simulation findings demonstrate that the proposed approach outperforms least-squares (LS), traditional OMP, and other OMP-based algorithms in terms of estimate accuracy.
Asunto(s)
Algoritmos , Simulación por Computador , Relación Señal-Ruido , Análisis de los Mínimos CuadradosRESUMEN
To achieve fast and accurate channel estimation of reconfigurable intelligent surface (RIS)-assisted multiple-input single-output (MISO) systems, we propose an accelerated bilinear alternating least squares algorithm (ABALS) based on parallel factor decomposition. Firstly, we build a tensor model of the received signal, and expand it to obtain the unfolded forms of the model. Secondly, we derive the expression of the estimation problem of two channels based on the unfolded forms to transform the problem into a cost function problem. Furthermore, we solve the cost function problem by introducing a simpler iterative optimization constraint and linear interpolation. Finally, we provide a strategy on the receiver design based on the feasibility conditions discussed in this paper, which can guarantee the uniqueness of the channel estimation problem. Simulation results show that the proposed algorithm can obtain a faster estimation speed and less iteration steps than the alternating least squares (ALS) algorithm, and the accuracy of the two algorithms is very close.
RESUMEN
In order to investigate the effect of cooperative Intelligent Reflecting Surface (IRS) in improving spectral efficiency, this paper explores the joint design of active and passive beamforming based on a double IRS-assisted model. First, considering the maximum power constraint of the active vector and the unit modulus constraint of the cooperative passive vector, we establish the non-linear and non-convex optimization problem of multi-user maximization weighted sum rate (WSR). Then, we propose an alternating optimization (AO) algorithm to design the active vector and the cooperative passive vector based on fractional programming (FP) and successive convex approximations (SCA). In addition, we conduct a study on the optimization of the passive reflection vector under discrete phase shift. The simulation results show that the proposed beamforming scheme of double IRS-assisted model performs better than the conventional single IRS-assisted model.
RESUMEN
In this paper, we considered uplink communication, focusing on the improvement of spectral efficiency (SE) for millimeter wave (mmWave) multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems. Firstly, we proposed an adaptive cluster head selection algorithm. Then, a channel-aligned analog beamforming scheme was designed based on the selected cluster heads. After that, the user grouping algorithm was designed based on the user-equivalent channel correlation. Subsequently, the power allocation problem was transformed from a nonconvex problem to a convex one using the quadratic transformation (QT) method considering all relevant constraints. Finally, the optimal user power allocation and digital beamforming design was obtained by iteratively optimizing the power and digital beamforming. Simulation results show that our proposed scheme can achieve a higher SE than existing methods.
RESUMEN
In a reconfigurable intelligent surface (RIS) assisted millimeter Wave (mmWave) communication system, the channel coefficient increases exponentially with the number of RIS elements which results in expensive pilot overhead. Most previous works have proposed some channel estimation algorithms for the estimation accuracy of cascaded channels, which have improved the estimation accuracy, but the pilot overhead is discouraging in the estimation process. To improve the channel estimation accuracy with reduced pilot overhead, we propose a two-stage channel estimation protocol by exploiting semi-passive elements and the coherent time difference of the channel, where the quasi-static channel between the base stations (BS) and RIS is estimated at the RIS, and the user (UE)-RIS time-varying channel is estimated at the BS. In the first stage, we formulate the BS-RIS channel estimation as a mathematical optimization problem by an iterative weighting method and then propose a gradient descent (GD)-based algorithm to solve it. In the second stage, we first transform the received the UE-RIS signal model into an equivalent parallel factor (PARAFAC) tensor model and estimate the UE-RIS channel by the least-squares (LS) algorithm. The simulation results show that the proposed method has better estimation accuracy than the LS, compression sensing (CS) and minimum mean square error (MMSE) methods with less pilot overhead, and the spectral efficiency is improved by at least 10.5% compared to the other three methods.
RESUMEN
Circle detection is a fundamental problem in computer vision. However, conventional circle detection algorithms are usually time-consuming and sensitive to noise. In order to solve these shortcomings, we propose a fast circle detection algorithm based on information compression. First, we introduce the idea of information compression, which compresses the circular information on the image into a small number of points while removing some of the noise through sharpness estimation and orientation filtering. Then, the circle parameters stored in the information point are obtained by the average sampling algorithm with a time complexity of O(1) to obtain candidate circles. Finally, we set different constraints on the complete circle and the defective circle according to the sampling results and find the true circle from the candidate circles. The experimental results on the three datasets show that our method can compress the circular information in the image into 1% of the information points, and compared to RHT, RCD, Jiang, Wang and CACD, Precision, Recall, Time and F-measure are greatly improved.