Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userParametric Channel Estimation by Exploiting Hopping Pilots in Uplink OFDMA
238
0
0.0
(
0
)
Added by
Xiaochuan Zhao
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This paper proposes a parametric channel estimation algorithm applicable to uplink of OFDMA systems with pseudo-random subchannelization. It exploits the hopping pilots to facilitate ESPRIT to estimate the delay subspace of the multipath fading channel, and utilizes the global pilot tones to interpolate on data subcarriers. Hence, it outperforms the traditional local channel interpolators considerably.
rate research
Read More
This paper investigates the problem of estimating sparse channels in massive MIMO systems. Most wireless channels are sparse with large delay spread, while some channels can be observed having sparse common support (SCS) within a certain area of the antenna array, i.e., the antenna array can be grouped into several clusters according to the sparse supports of channels. The SCS property is attractive when it comes to the estimation of large number of channels in massive MIMO systems. Using the SCS of channels, one expects better performance, but the number of clusters and the elements for each cluster are always unknown in the receiver. In this paper, {the Dirichlet process} is exploited to model such sparse channels where those in each cluster have SCS. We proposed a low complexity message passing based sparse Bayesian learning to perform channel estimation in massive MIMO systems by using combined BP with MF on a factor graph. Simulation results demonstrate that the proposed massive MIMO sparse channel estimation outperforms the state-of-the-art algorithms. Especially, it even shows better performance than the variational Bayesian method applied for massive MIMO channel estimation.
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.
A typical handover problem requires sequence of complex signaling between a UE, the serving, and target base station. In many handover problems the down link based measurements are transferred from a user equipment to a serving base station and the decision on handover is made on these measurements. These measurements together with the signaling between the user equipment and the serving base station is computationally expensive and can potentially drain user equipment battery. Coupled with this, the future networks are densely deployed with multiple frequency layers, rendering current handover mechanisms sub-optimal, necessitating newer methods that can improve energy efficiency. In this study, we will investigate a ML based approach towards secondary carrier prediction for inter-frequency handover using the up-link reference signals.
In this study, we propose two schemes for uplink control channels based on non-contiguous complementary sequences (CSs) where the peak-to-average-power ratio (PAPR) of the resulting orthogonal frequency division multiplexing (OFDM) signal is always less than or equal to 3 dB. To obtain the proposed schemes, we extend Golays concatenation and interleaving methods by considering extra upsampling and shifting parameters. The proposed schemes enable a flexible non-contiguous resource allocation in frequency, e.g., an arbitrary number of null symbols between the occupied resource blocks (RBs). The first scheme separates the PAPR minimization and the inter-cell interference minimization problems. While the former is solved by spreading the sequences in a Golay complementary pair (GCP) with the sequences in another GCP, the latter is managed by designing a set of GCPs with low cross-correlation. The second scheme generates reference symbols (RSs) and data symbols on each RB as parts of an encoded CS. Therefore, it enables coherent detection at the receiver side. The numerical results show that the proposed schemes offer significantly improved PAPR and cubic metric (CM) results in case of non-contiguous resource allocation as compared to the sequences defined in 3GPP New Radio (NR) and Zadoff-Chu (ZC) sequences.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
