A least-mean-square (LMS) and a recursive-least-square (RLS) algorithm are derived for estimation of the symbol period in communication signals. The algorithms are based on measurements of the time elapsed between two consecutive transitions detected in noisy signals. Number of symbol periods

A robust synchronization procedure for blind estimation of the

We address the blind equalization of a telecommunica-tion signal, the characteristics of which are totally un-known (channel, symbol period, alphabet of the sym-bols, frequency offset). In [1] was proposed a method-ology originating from deconvolution ideas, for jointly estimating the symbol period

The application of the least-mean-square (LMS) and recursive-least-square (RLS) algorithms to the estimation of symbol period is discussed. The algorithms are based on the measurements of time between two consecutive detected transitions in noisy waveforms. Two versions of the algorithm

, for settled and unsettled cultural periods. In settled periods, culture independently influences action, but only by providing resources from which people can construct diverse lines of action. In unsettled cultural periods, explicit ideologies directly govern action, but structural opportunities for action

interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T M complex transmitted

symbolic techniques which analyze such counterexamples and refine the abstract model correspondingly.

type of rational agent, a BeliefDesire -Intention (BDI) agent. The primary aim of this paper is to integrate (a) the theoretical foundations of BDI agents from both a quantitative decision-theoretic perspective and a symbolic reasoning perspective; (b) the implementations of BDI agents from

The blind estimation of the symbol period of an unknown linearly modulated signal is addressed. We propose an original methodology relying on the concept of blind deconvolution, which does not suffer from the drawbacks of the classical approaches relying upon the cyclostatinarity of the received

We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive programs. We used KLEE to thoroughly check all 89 stand-alone programs in the GNU COREUTILS utility suite, which form