The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The main problem of stochastic nonlinear model predictive control (SNMPC) is that the equations for state prediction and calculation of the expected reward are in general not solvable in closed form. A popular approach is to approximate the occurring continuous probability density functions by a discrete density representation, which allows an analytical solution of the SNMPC equations. In this paper,...
Extremely short duration of pulse introduces stringent requirements to the UWB system synchronization. Especially in RAKE scheme, a small timing jitter of system causes performance degradation severely due to the decreased energy acquired by local template. In this paper, a novel method of timing jitter suppression is proposed, in which the cross-correlation function between local template and received...
In a search and prosecute mission, multiple heterogeneous unmanned aerial vehicles UAVs that carry different resources need to perform the classify, prosecute and battle damage assessment (BDA) tasks on targets sequentially. Depending on the target resource requirement, it may be necessary to deploy a coalition of UAVs to perform the action. In this paper, we propose coalition formation algorithms...
We investigate the problem of counting the number of frequent (item)sets - a problem known to be intractable in terms of an exact polynomial time computation. In this paper, we show that it is in general also hard to approximate. Subsequently, a randomized counting algorithm is developed using the Markov chain Monte Carlo method. While for general inputs an exponential running time is needed in order...
A close-form expression of the exact pair-wise error probability (PEP) for space-time (S-T) codes in Rayleigh fading channel is derived using the probability-density function (PDF) of a sum of independent exponential distributed random variables. Since the expression requires evaluating the coefficients for partial fraction expansion, an easy analytical way is proposed for doing this. The exact PEP...
The dramatic increase in leakage current, coupled with the swell in process variability in nano-scaled CMOS technologies, has become a major issue for future IC design. Moreover, due to the spread of leakage power values, leakage variability cannot be neglected anymore. In this work an accurate analytic estimation and modeling methodology has been developed for logic gates leakage under statistical...
In this paper, a low-complexity power-efficient iterative detection scheme for differentially encoded MPSK transmission over AWGN and Rayleigh fading channels is presented. As the main contribution, a novel APP coherent demodulator, which well suits for iterative processing, is derived under the optimal bit-based MAP criterion. The implementation of iteration is not trellis-based, and needn’t reconstruct...
The ergodic capacity of single input multiple output (SIMO) wireless communication systems over Nakagami-m fading channels is available in the literature for the case of identically independent distributed (i.i.d.) subchannels. However, the non- identically independent Nakagami-m case is more practical and has not been considered in the literature. In this paper, we derive an analytical expression...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.