اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDifferential Evolution Algorithm Aided Turbo Channel Estimation and Multi-User Detection for G.Fast Systems in the Presence of FEXT
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The ever-increasing demand for broadband Internet access has motivated the further development of the digital subscriber line to the G.fast standard in order to expand its operational band from 106 MHz to 212 MHz. Conventional far-end crosstalk (FEXT) based cancellers falter in the upstream transmission of this emerging G.fast system. In this paper, we propose a novel differential evolution algorithm (DEA) aided turbo channel estimation (CE) and multi-user detection (MUD) scheme for the G.fast upstream including the frequency band up to 212 MHz, which is capable of approaching the optimal Cramer-Rao lower bound of the channel estimate, whilst approaching the optimal maximum likelihood (ML) MUDs performance associated with perfect channel state information, and yet only imposing about 5% of its computational complexity. Explicitly, the turbo concept is exploited by iteratively exchanging information between the continuous value-based DEA assisted channel estimator and the discrete value-based DEA MUD. Our extensive simulations show that 18 dB normalized mean square error gain is attained by the channel estimator and 10 dB signal-to-noise ratio gain can be achieved by the MUD upon exploiting this iteration gain. We also quantify the influence of the CE error, of the copper length and of the impulse noise. Our study demonstrates that the proposed DEA aided turbo CE and MUD scheme is capable of offering near-capacity performance at an affordable complexity for the emerging G.fast systems.
قيم البحث
اقرأ أيضاً
In this paper, we study Simultaneous Communication of Data and Control (SCDC) information signals in Full Duplex (FD) Multiple-Input Multiple-Output (MIMO) wireless systems. In particular, considering an FD MIMO base station serving multiple single-a
ntenna FD users, a novel multi-user communication scheme for simultaneous DownLink (DL) beamformed data transmission and UpLink (UL) pilot-assisted channel estimation is presented. Capitalizing on a recent FD MIMO hardware architecture with reduced complexity self-interference analog cancellation, we jointly design the base stations transmit and receive beamforming matrices as well as the settings for the multiple analog taps and the digital SI canceller with the objective to maximize the DL sum rate. Our simulation results showcase that the proposed approach outperforms its conventional half duplex counterpart with 50% reduction in hardware complexity compared to the latest FD-based SCDC schemes.
The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user detection and
channel estimation. In this paper, we exploit the vast sequence space and the beneficial nested structure of the length-$2^m$ second-order Reed-Muller (RM) sequences for designing an efficient RA scheme, which is capable of reliably detecting multiple active users from the set of unknown potential users with a size as large as $2^{m(m-1)/2}$, whilst simultaneously estimating their channel state information as well. Explicitly, at the transmitter each user is mapped to a specially designed RM sequence, which facilitates reliable joint sequence detection and channel estimation based on a single transmission event. To elaborate, as a first step, at the receiver we exploit the elegant nested structure of the RM sequences using a layer-by-layer RM detection algorithm for the single-user (single-sequence) scenario. Then an iterative RM detection and channel estimation algorithm is conceived for the multi-user (multi-sequence) scenario. As a benefit of the information exchange between the RM sequence detector and channel estimator, a compelling performance vs. complexity trade-off is struck, as evidenced both by our analytical and numerical results.
In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output (MIMO) secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix
, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem is shown to be a single-variable optimization that can be solved by one-dimensional (1-D) line search. To reduce computational complexity, a sequential parametric convex approximation (SPCA) method is proposed to find a near-optimal solution. Furthermore, tightness of the relaxation for the 1-D search method is validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D search method but with much lower complexity.
In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output (MIMO) secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix
, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem, on the other hand, is shown to be a single- variable optimization that can be solved by one-dimensional (1- D) line search. To reduce computational complexity, a sequential parametric convex approximation (SPCA) method is proposed to find a near-optimal solution. The work is then extended to the imperfect channel state information case with norm-bounded channel errors. Furthermore, tightness of the relaxation for the proposed schemes are validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D but with much lower complexity.
Reconfigurable Intelligent Surfaces (RISs) have been recently considered as an energy-efficient solution for future wireless networks. Their dynamic and low-power configuration enables coverage extension, massive connectivity, and low-latency communi
cations. Channel estimation and signal recovery in RISbased systems are among the most critical technical challenges, due to the large number of unknown variables referring to the RIS unit elements and the transmitted signals. In this paper, we focus on the downlink of a RIS-assisted multi-user Multiple Input Single Output (MISO) communication system and present a joint channel estimation and signal recovery scheme based on the PARAllel FACtor (PARAFAC) decomposition. This decomposition unfolds the cascaded channel model and facilitates signal recovery using the Bilinear Generalized Approximate Message Passing (BiG-AMP) algorithm. The proposed method includes an alternating least squares algorithm to iteratively estimate the equivalent matrix, which consists of the transmitted signals and the channels between the base station and RIS, as well as the channels between the RIS and the multiple users. Our selective simulation results show that the proposed scheme outperforms a benchmark scheme that uses genie-aided information knowledge. We also provide insights on the impact of different RIS parameter settings on the proposed scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
