Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTime delay estimator for predetermined repeated signal robust to narrowband interference
52
0
0.0
(
0
)
Added by
Taejin Park
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, time delay estimation techniques robust to narrowband interference (NBI) are proposed. Owing to the deluge of wireless signal interference these days, narrowband interference is a common problem for communication and positioning systems. To mitigate the effect of this narrow band interference, we propose a robust time delay estimator for a predetermined repeated synchronization signal in an NBI environment. We exploit an ensemble of average and sample covariance matrices to estimate the noise profile. In addition, to increase the detection probability, we suppress the variance of likelihood value by employing a von-Mises distribution in the time-delay estimator. Our proposed time delay estimator shows a better performance in an NBI environment compared to a typical time delay estimator.
rate research
Read More
This paper studies a bursty interference channel, where the presence/absence of interference is modeled by a block-i.i.d. Bernoulli process that stays constant for a duration of $T$ symbols (referred to as coherence block) and then changes independently to a new state. We consider both a quasi-static setup, where the interference state remains constant during the whole transmission of the codeword, and an ergodic setup, where a codeword spans several coherence blocks. For the quasi-static setup, we study the largest rate of a coding strategy that provides reliable communication at a basic rate and allows an increased (opportunistic) rate when there is no interference. For the ergodic setup, we study the largest achievable rate. We study how non-causal knowledge of the interference state, referred to as channel-state information (CSI), affects the achievable rates. We derive converse and achievability bounds for (i) local CSI at the receiver-side only; (ii) local CSI at the transmitter- and receiver-side, and (iii) global CSI at all nodes. Our bounds allow us to identify when interference burstiness is beneficial and in which scenarios global CSI outperforms local CSI. The joint treatment of the quasi-static and ergodic setup further allows for a thorough comparison of these two setups.
In this paper, we consider multiuser multiple-input single-output (MISO) interference channel where the received signal is divided into two parts for information decoding and energy harvesting (EH), respectively. The transmit beamforming vectors and receive power splitting (PS) ratios are jointly designed in order to minimize the total transmission power subject to both signal-to-interference-plus-noise ratio (SINR) and EH constraints. Most joint beamforming and power splitting (JBPS) designs assume that perfect channel state information (CSI) is available; however CSI errors are inevitable in practice. To overcome this limitation, we study the robust JBPS design problem assuming a norm-bounded error (NBE) model for the CSI. Three different solution approaches are proposed for the robust JBPS problem, each one leading to a different computational algorithm. Firstly, an efficient semidefinite relaxation (SDR)-based approach is presented to solve the highly non-convex JBPS problem, where the latter can be formulated as a semidefinite programming (SDP) problem. A rank-one recovery method is provided to recover a robust feasible solution to the original problem. Secondly, based on second order cone programming (SOCP) relaxation, we propose a low complexity approach with the aid of a closed-form robust solution recovery method. Thirdly, a new iterative method is also provided which can achieve near-optimal performance when the SDR-based algorithm results in a higher-rank solution. We prove that this iterative algorithm monotonically converges to a Karush-Kuhn-Tucker (KKT) solution of the robust JBPS problem. Finally, simulation results are presented to validate the robustness and efficiency of the proposed algorithms.
The field of satellite communications is enjoying a renewed interest in the global telecom market, and very high throughput satellites (V/HTS), with their multiple spot-beams, are key for delivering the future rate demands. In this article, the state-of-the-art and open research challenges of signal processing techniques for V/HTS systems are presented for the first time, with focus on novel approaches for efficient interference mitigation. The main signal processing topics for the ground, satellite, and user segment are addressed. Also, the critical components for the integration of satellite and terrestrial networks are studied, such as cognitive satellite systems and satellite-terrestrial backhaul for caching. All the reviewed techniques are essential in empowering satellite systems to support the increasing demands of the upcoming generation of communication networks.
Medium-scale or large-scale receive antenna array with digital beamforming can be employed at receiver to make a significant interference reduction, but leads to expensive cost and high complexity of the RF-chain circuit. To deal with this issue, a classic analog-and-digital beamforming (ADB) structure was proposed in the literature for greatly reducing the number of RF-chains. Based on the ADB structure, we in this paper propose a robust hybrid ADB scheme to resist directions of arrival (DOAs) estimation errors. The key idea of our scheme is to employ null space projection (NSP) in analog beamforming domain and diagonal loading (DL) method in digital beamforming domain. Simulation results show that the proposed scheme performs more robustly, and moreover, has a significant improvement on the receive signal to interference plus noise ratio (SINR) compared to NSP ADB scheme and DL method.
In this paper, we consider the dynamic power control for delay-aware D2D communications. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we utilize the interference filtering property of the CSMA-like MAC protocol and derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity power control algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for a sufficiently large carrier sensing distance. Finally, the proposed power control scheme is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
