Sorry, you need to enable JavaScript to visit this website.

In this paper, we consider the rate-distortion problem where a source X is encoded into k parallel descriptions Y1, . . . , Yk, such that the error signals X - Yi, i = 1, . . . , k, are mutually independent given X. We show that if X is one-sided exponentially distributed, the optimal decoder (estimator) under the one-sided absolute error criterion, is simply given by the maximum of the outputs Y1, . . . , Yk. We provide a closed-form expression for the rate and distortion for any k number of parallel descriptions and for any coding rate.

When modelling the stable baseline component of a riometer voltage series, the degradation of statistical performance can be significant if either the data are noisy or the underlying stochastic process is highly nonstationary. It is desirable to explore models which balance the high degree of stability of a quiet-day curve with low computation time. This paper introduces a multitaper method for generating quiet-day curves. A novel metric is introduced for determining the overlap fraction in a section-overlap model of the stable baseline component.

In this paper, we propose an optimized polarization filtering based digital self-interference (SI) cancellation (OPC) scheme for full-duplex communication. The proposed OPC scheme utilizes polarization to increase the distinction between the desired signal and the SI and maximizes the signal to interference plus noise ratio (SINR) of the output signal.

The 3GPP is investigating the concept of integrated access and backhaul (IAB) to provide high capacity wireless backhaul for 5G network. In this paper, we present an analysis of ergodic capacity for full-duplex IAB system, where full-duplex is introduced to further improve the ergodic capacity. Two kinds of interference are considered: the backward interference between two adjacent base stations and the residual self-interference introduced by full-duplex.

Power delay profiles (PDPs) are an important factor in the design of wireless networks, e.g., in choosing the length of a cyclic prefix. While distributed networks are receiving increasing attention, the impact of cooperation on the PDP has not been addressed. We address this issue in this paper. Specifically, we analyze a network where each user is served by a cluster of Remote Radio Heads (RRHs) with RRH locations modeled as a Poisson point process.

Although beamforming optimization problems in full-duplex communication systems can be optimally solved with the semidefinite relaxation (SDR) approach, its computational complexity increases rapidly when the problem size increases. In order to circumvent this issue, in this paper, we propose an alternating direction of multiplier method (ADMM) which minimizes the augmented Lagrangian of the dual of the SDR and handles the inequality constraints with the use of slack variables. The proposed ADMM is then applied for optimizing the relay beamformer to maximize the secrecy rate.

Achieving high resolution time-of-arrival (TOA) estimation in multipath propagation scenarios from bandlimited observations of communication signals is challenging because the multipath channel impulse response (CIR) is not bandlimited. Modeling the CIR as a sparse sequence of Diracs, TOA estimation becomes a problem of parametric spectral inference from observed bandlimited signals. To increase resolution without arriving at unrealistic sampling rates, we consider multiband sampling approach, and propose a practical multibranch receiver for the acquisition.

Backscatter communication (BSC) is emerging as the core technology for pervasive sustainable internet-of-things applications. However, owing to the resource-limitations of passive tags, this work targets at maximizing the achievable sum-backscattered-throughput by jointly optimizing the transceiver (TRX) design at the full-duplex multiantenna reader and backscattering coefficients (BC) at the single antenna tags.

Energy efficient resource allocation in interference networks is a challenging global optimization problem. The main issue is that the computational complexity grows exponentially in the number of variables. In general, resource allocation in interference networks requires optimizing jointly over achievable rates and transmit powers. However, close scrutiny reveals that the non-convexity stems mostly from the powers while the problem is linear in the rates.

We re-examine the problem of designing low-complexity detectors and their performance analysis for the 3-node oneway decode-and-forward (DF) relay network, where the destination has the statistical channel state information (CSI) of the source-relay link, and the instantaneous CSI of both the source-destination and relay-destination links. Recently proposed detection schemes, such as the piece-wise linear detector (PLD), achieve near-optimal error performance with linear complexity (with respect to the modulation size).