اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of multipath channel delay estimation using subspace fitting
118
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The presence of rich scattering in indoor and urban radio propagation scenarios may cause a high arrival density of multipath components (MPCs). Often the MPCs arrive in clusters at the receiver, where MPCs within one cluster have similar angles and delays. The MPCs arriving within a single cluster are typically unresolvable in the delay domain. In this paper, we analyze the effects of unresolved MPCs on the bias of the delay estimation with a multiband subspace fitting algorithm. We treat the unresolved MPCs as a model error that results in perturbed subspace estimation. Starting from the first-order approximation of the perturbations, we derive the bias of the delay estimate of the line-of-sight (LOS) component. We show that it depends on the power and relative delay of the unresolved MPCs in the first cluster compared to the LOS component. Numerical experiments are included to show that the derived expression for the bias well describes the effects of unresolved MPCs on the delay estimation.
قيم البحث
اقرأ أيضاً
This paper proposes a belief propagation (BP)-based algorithm for sequential detection and estimation of multipath components (MPCs) parameters based on radio signals. Under dynamic channel conditions with moving transmitter and/or receiver, the numb
er of MPCs reflected from visible geometric features, the MPC dispersion parameters (delay, angle, Doppler frequency, etc), and the number of false alarm contributions are unknown and time-varying. We develop a Bayesian model for sequential detection and estimation of MPC dispersion parameters, and represent it by a factor graph enabling the use of BP for efficient computation of the marginal posterior distributions. At each time instance, a snapshot-based channel estimator provides parameter estimates of a set of MPCs which are used as noisy measurements by the proposed BP-based algorithm. It performs joint probabilistic data association, estimation of the time-varying MPC parameters, and the mean number of false alarm measurements by means of the sum-product algorithm rules. The results using synthetic measurements show that the proposed algorithm is able to cope with a high number of false alarm measurements originating from the snapshot-based channel estimator and to sequentially detect and estimate MPCs parameters with very low signal-to-noise ratio (SNR). The performance of the proposed algorithm compares well to existing algorithms for high SNR MPCs, but significantly it outperforms them for medium or low SNR MPCs. In particular, we show that our algorithm outperforms the Kalman enhanced super resolution tracking (KEST) algorithm, a state-of-the-art sequential channel parameters estimation method. Furthermore, results with real radio measurements demonstrate the excellent performance of the algorithm in realistic and challenging scenarios.
The multipath radio channel is considered to have a non-bandlimited channel impulse response. Therefore, it is challenging to achieve high resolution time-delay (TD) estimation of multipath components (MPCs) from bandlimited observations of communica
tion signals. It this paper, we consider the problem of multiband channel sampling and TD estimation of MPCs. We assume that the nonideal multibranch receiver is used for multiband sampling, where the noise is nonuniform across the receiver branches. The resulting data model of Hankel matrices formed from acquired samples has multiple shift-invariance structures, and we propose an algorithm for TD estimation using weighted subspace fitting. The subspace fitting is formulated as a separable nonlinear least squares (NLS) problem, and it is solved using a variable projection method. The proposed algorithm supports high resolution TD estimation from an arbitrary number of bands, and it allows for nonuniform noise across the bands. Numerical simulations show that the algorithm almost attains the Cramer Rao Lower Bound, and it outperforms previously proposed methods such as multiresolution TOA, MI-MUSIC, and ESPRIT.
This paper presents a novel compressed sensing (CS) approach to high dimensional wireless channel estimation by optimizing the input to a deep generative network. Channel estimation using generative networks relies on the assumption that the reconstr
ucted channel lies in the range of a generative model. Channel reconstruction using generative priors outperforms conventional CS techniques and requires fewer pilots. It also eliminates the need of a priori knowledge of the sparsifying basis, instead using the structure captured by the deep generative model as a prior. Using this prior, we also perform channel estimation from one-bit quantized pilot measurements, and propose a novel optimization objective function that attempts to maximize the correlation between the received signal and the generators channel estimate while minimizing the rank of the channel estimate. Our approach significantly outperforms sparse signal recovery methods such as Orthogonal Matching Pursuit (OMP) and Approximate Message Passing (AMP) algorithms such as EM-GM-AMP for narrowband mmWave channel reconstruction, and its execution time is not noticeably affected by the increase in the number of received pilot symbols.
The antenna selection (AS) in non-orthogonal multiple access (NOMA) networks is still a challenging problem since finding optimal AS solution may not be available for all channel realizations and has quite computational complexity when it exists. For
this reason, in this paper, we develop a new suboptimal solution, majority based transmit antenna selection (TAS-maj), with significant reduction in computational complexity. The TAS-maj basically selects the transmit antenna with the majority. It is more efficient when compared to previously proposed suboptimal AS algorithms, namely max-max-max (A^3) and max-min-max (AIA) because these schemes are merely interested in optimizing the performance of the strongest and weakest users, respectively at the price of worse performance for the remaining users. On the other hand, the TAS-maj scheme yields better performance for more than half of mobile users in the NOMA networks. In this paper, we consider a multiple-input multiple-output communication system, where all the nodes are equipped with multi-antenna. Besides the TAS-maj is employed at the base station, a maximal ratio combining (MRC) is also employed at each mobile user in order to achieve superior performance. The impact of the channel estimation errors (CEEs) and feedback delay (FD) on the performance of the TAS-maj/MRC scheme is studied in the NOMA network over Nakagami-m fading channels.
We investigate joint source channel coding (JSCC) for wireless image transmission over multipath fading channels. Inspired by recent works on deep learning based JSCC and model-based learning methods, we combine an autoencoder with orthogonal frequen
cy division multiplexing (OFDM) to cope with multipath fading. The proposed encoder and decoder use convolutional neural networks (CNNs) and directly map the source images to complex-valued baseband samples for OFDM transmission. The multipath channel and OFDM are represented by non-trainable (deterministic) but differentiable layers so that the system can be trained end-to-end. Furthermore, our JSCC decoder further incorporates explicit channel estimation, equalization, and additional subnets to enhance the performance. The proposed method exhibits 2.5 -- 4 dB SNR gain for the equivalent image quality compared to conventional schemes that employ state-of-the-art but separate source and channel coding such as BPG and LDPC. The performance further improves when the system incorporates the channel state information (CSI) feedback. The proposed scheme is robust against OFDM signal clipping and parameter mismatch for the channel model used in training and evaluation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
