اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBlind Estimation of Multiple Carrier Frequency Offsets
485
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received signal contains multiple CFOs due to mismatch between the local oscillators of transmitters and receiver. This results in a time-varying rotation of the data constellation, which needs to be compensated for at the receiver before symbol recovery. This paper proposes a new approach for blind CFO estimation and symbol recovery. The received base-band signal is over-sampled, and its polyphase components are used to formulate a virtual Multiple-Input Multiple-Output (MIMO) problem. By applying blind MIMO system estimation techniques, the system response is estimated and used to subsequently transform the multiple CFOs estimation problem into many independent single CFO estimation problems. Furthermore, an initial estimate of the CFO is obtained from the phase of the MIMO system response. The Cramer-Rao Lower bound is also derived, and the large sample performance of the proposed estimator is compared to the bound.
قيم البحث
اقرأ أيضاً
Spectrum sensing and direction of arrival (DOA) estimation have been thoroughly investigated, both separately and as a joint task. Estimating the support of a set of signals and their DOAs is crucial to many signal processing applications, such as Co
gnitive Radio (CR). A challenging scenario, faced by CRs, is that of multiband signals, composed of several narrowband transmissions spread over a wide spectrum each with unknown carrier frequencies and DOAs. The Nyquist rate of such signals is high and constitutes a bottleneck both in the analog and digital domains. To alleviate the sampling rate issue, several sub-Nyquist sampling methods, such as multicoset sampling or the modulated wideband converter (MWC), have been proposed in the context of spectrum sensing. In this work, we first suggest an alternative sub-Nyquist sampling and signal reconstruction method to the MWC, based on a uniform linear array (ULA). We then extend our approach to joint spectrum sensing and DOA estimation and propose the CompreSsed CArrier and DOA Estimation (CaSCADE) system, composed of an L-shaped array with two ULAs. In both cases, we derive perfect recovery conditions of the signal parameters (carrier frequencies and DOAs if relevant) and the signal itself and provide two reconstruction algorithms, one based on the ESPRIT method and the second on compressed sensing techniques. Both our joint carriers and DOAs recovery algorithms overcome the well-known pairing issue between the two parameters. Simulations demonstrate that our alternative spectrum sensing system outperforms the MWC in terms of recovery error and design complexity and show joint carrier frequencies and DOAs from our CaSCADE systems sub-Nyquist samples.
This work presents a novel method to generate secret keys shared between a legitimate node pair (Alice and Bob) to safeguard the communication between them from an unauthorized node (Eve). To this end, we exploit the {it reciprocal carrier frequency
offset} (CFO) between the legitimate node pair to extract common randomness out of it to generate shared secret keys. The proposed key generation algorithm involves standard steps: the legitimate nodes exchange binary phase-shift keying (BPSK) signals to perform blind CFO estimation on the received signals, and do equi-probable quantization of the noisy CFO estimates followed by information reconciliation--to distil a shared secret key. Furthermore, guided by the Allan deviation curve, we distinguish between the two frequency-stability regimes---when the randomly time-varying CFO process i) has memory, ii) is memoryless; thereafter, we compute the key generation rate for both regimes. Simulation results show that the key disagreement rate decreases exponentially with increase in the signal to noise ratio of the link between Alice and Bob. Additionally, the decipher probability of Eve decreases as soon as either of the two links observed by the Eve becomes more degraded compared to the link between Alice and Bob.
The study on carrier phase estimation (CPE) approaches, involving a one-tap normalized least-mean-square (NLMS) algorithm, a block-wise average algorithm, and a Viterbi-Viterbi algorithm has been carried out in the long-haul high-capacity dispersion-
unmanaged coherent optical systems. The close-form expressions and analytical predictions for bit-error-rate behaviors in these CPE methods have been analyzed by considering both the laser phase noise and the equalization enhanced phase noise. It is found that the Viterbi-Viterbi algorithm outperforms the one-tap NLMS and the block-wise average algorithms for a small phase noise variance (or effective phase noise variance), while the three CPE methods converge to a similar performance for a large phase noise variance (or effective phase noise variance). In addition, the differences between the three CPE approaches become smaller for higher-level modulation formats.
Reconfigurable intelligent surface (RIS) is envisioned to be a promising green technology to reduce the energy consumption and improve the coverage and spectral efficiency of massive multiple-input multiple-output (MIMO) wireless networks. In a RIS-a
ided MIMO system, the acquisition of channel state information (CSI) is important for achieving passive beamforming gains of the RIS, but is also challenging due to the cascaded property of the transmitter-RIS-receiver channel and the lack of signal processing capability of the passive RIS elements. The state-of-the-art approach for CSI acquisition in such a system is a pure training-based strategy that depends on a long sequence of pilot symbols. In this paper, we investigate semi-blind cascaded channel estimation for RIS-aided massive MIMO systems, in which the receiver simultaneously estimates the channel coefficients and the partially unknown transmit signal with a small number of pilot sequences. Specifically, we formulate the semi-blind cascaded channel estimation as a trilinear matrix factorization task. Under the Bayesian inference framework, we develop a computationally efficient iterative algorithm using the approximate message passing principle to resolve the trilinear inference problem. Meanwhile, we present an analytical framework to characterize the theoretical performance bound of the proposed approach in the large-system limit via the replica method developed in statistical physics. Extensive simulation results demonstrate the effectiveness of the proposed semi-blind cascaded channel estimation algorithm.
We consider least squares estimators of carrier phase and amplitude from a noisy communications signal that contains both pilot signals, known to the receiver, and data signals, unknown to the receiver. We focus on signaling constellations that have
symbols evenly distributed on the complex unit circle, i.e., M-ary phase shift keying. We show, under reasonably mild conditions on the distribution of the noise, that the least squares estimator of carrier phase is strongly consistent and asymptotically normally distributed. However, the amplitude estimator is not consistent, but converges to a positive real number that is a function of the true carrier amplitude, the noise distribution and the size of the constellation. Our theoretical results can also be applied to the case where no pilot symbols exist, i.e., noncoherent detection. The results of Monte Carlo simulations are provided and these agree with the theoretical results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
