Filetype
In this paper, we consider positioning with observed-time-difference-of-arrival (OTDOA) for a device deployed in long-term-evolution (LTE) based narrow-band Internet-of-things (NB-IoT) systems. We propose an iterative expectation- maximization based successive interference cancellation (EM-SIC) algorithm to jointly consider estimations of residual frequency- offset (FO), fading-channel taps and ti
The global carbon cycle is an important component of the Earth system and it interacts with the hydrology, energy and nutrient cycles as well as ecosystem dynamics. A better understanding of the global carbon cycle is required for improved projections of climate change including corresponding changes in water and food resources and for the verification of measures to reduce anthropogenic greenhous
There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwardin
Operating systems code is often developed according to principles like simplicity, low overhead, and low memory footprint. Schedulers are no exceptions. A scheduler is usually developed with flexibility in mind, and this restricts the ability to provide real-time guarantees. Moreover, even when schedulers can provide real-time guarantees, it is unlikely that these guarantees are properly quantifie
Level crossing sampling (LCS) is a power-efficient analog-to-digital conversion scheme for spikelike signals that arise in many Internet of Things-enabled automotive and environmental monitoring applications. However, LCS scheme requires a dedicated time-to-digital converter with large dynamic range specifications. In this paper, we present a compressed LCS that exploits the signal sparsity in the
Timely loss-of-contact detection between devices in pervasive systems using mobile networks is an important aspect for both functionality and user experience. Traditional schemes where time-to-live is defined by the service provider are not adequate in mobile networks where communication failures are frequent. On the other hand, schemes using keep-alive messaging tend to increase the communication
This brief presents an on-chip memory subsystem for massive multiple-input-multiple-output (MIMO) baseband processing at the base station. In massive MIMO systems, the required memory bandwidth and capacity are orders of magnitude higher than those used in conventional wireless systems, due to the large number of serving antennas. These are further combined with design targets on low access latenc
We develop a simple routine unifying the analysis of several important recently-developed stochastic optimization methods including SAGA, Finito, and stochastic dual coordinate ascent (SDCA). First, we show an intrinsic connection between stochastic optimization methods and dynamic jump systems, and propose a general jump system model for stochastic optimization methods. Our proposed model recover
We consider the problem of finding an event-based sampling scheme that optimizes the trade-off between average sampling rate and control performance in a linear-quadratic-Gaussian (LQG) control problem setting with output feedback. Our analysis is based on a recently presented sampled-data controller structure, which remains LQG-optimal for any choice of sampling scheme. We show that optimization
In this paper, we consider precoder design for multiuser multiple-input-multiple-output (MIMO) Gaussian broadcast (BC) channels and propose a generalized zero-forcing (GZF) precoder based on successive dirty-paper coding (DPC), i.e., the GZF-DP precoder. The GZF-DP precoder is an extension of the GZF-DP precoder designed earlier for multi-input-single-output broadcast (MISO-BC) channels, and also
We introduce a novel design of spatially coupled low density parity check codes in order to reduce the effects of error propagation in low-latency sliding window decoding for large frame lengths or streaming applications. Specifically, we employ reduced-degree check nodes spaced throughout the coupling chain, which have the effect of allowing the decoder to recover from error bursts. A simplified
In this paper, an adaptive design methodology for synthesizing a harmonic free N-path filter with reduced frequency folding is presented. System level analysis of proposed architecture shows that by adding a few extra paths with proper weights to a conventional N-path filter, several characteristics such as harmonic rejection, power reduction, foldback elimination and spectrum shaping can be achie
This paper deals with the real-time implementation of feedback controllers. In particular, it provides an analysis of the stability property of closed-loop systems that include a controller that can sporadically miss deadlines. In this context, the weakly hard m-K computational model has been widely adopted and researchers used it to design and verify controllers that are robust to deadline misses
We investigate error propagation in sliding window decoding of braided convolutional codes (BCCs). Previous studies of BCCs have focused on iterative decoding thresholds, minimum distance properties, and their bit error rate (BER) performance at small to moderate frame length. Here, we consider a sliding window decoder in the context of large frame length or one that continuously outputs blocks in
One of the basic requirements of today's sophisticated world is the availability of electrical energy, and neglect of this matter may have irreparable damages such as an extensive blackout. The problems which were introduced about the traditional power grid, and also, the growing advances in smart technologies make the traditional power grid go towards smart power grid. Although widespread utilisa
Fitting a matrix of a given rank to data in a least squares sense can be done very effectively using 2nd order methods such as Levenberg-Marquardt by explicitly optimizing over a bilinear parameterization of the matrix. In contrast, when applying more general singular value penalties, such as weighted nuclear norm priors, direct optimization over the elements of the matrix is typically used. Due t
In this paper, bilateral teleoperation of multiple slaves coupled to a single master under scheduling communication is investigated. The sampled-data transmission between the master and the multiple slaves is fulfilled over a delayed communication network, and at each sampling instant, only one slave is allowed to transmit its current information to the master side according to some scheduling pro
Handling of critical situations is an important part in the architecture of an autonomous vehicle. A controller for autonomous collision avoidance is developed based on a wary strategy that assumes the least tireroad friction for which the maneuver is still feasible. Should the friction be greater, the controller makes use of this and performs better. The controller uses an acceleration-vector ref
Segmenting a motion-planning problem into smaller subproblems could be beneficial in terms of computational complexity. This observation is used as a basis for a new sub-maneuver decomposition approach investigated in this paper in the context of optimal evasive maneuvers for autonomous ground vehicles. The recently published alternating augmented Lagrangianmethod is adopted and leveraged on, whic
