Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified. It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the...

In this paper we study the computability of the stable and unstable manifolds of a hyperbolic equilibrium point. These manifolds are the essential feature which characterizes a hyperbolic system. We show that (i) locally these manifolds can be computed, but (ii) globally they cannot (though we prove they are semi-computable). We also show that Smale’s horseshoe, the first example of a hyperboli...

A high-frequency asymptotics of the symbol of the Dirichlet-toNeumann map, treated as a periodic pseudodifferential operator, in 2D diffraction problems is discussed. Numerical results support a conjecture on a universal limit shape of the symbol.

We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and propositional meanings are represented by high-dimensional vectors of real numbers. A neural network learns to map between the distributed representations of the symbol sequences and the distributed representations of ...

and sighted participants and its implications for tactile map creation. ABSTRACT Objective: To determine the optimal elevation of tactile map symbols. Background: Tactile perception research predicts that symbol elevation (vertical height) and texture on tactile maps could influence their readability. However, while research has shown that elevation influences detection and discrimination thres...

Abstract: In this paper, simplified forms of Maximum A Posteriori ('MAP) synchronizers are developed for the DPSK scheme. It is shown these Circuits are simple enough to be realized only with digital ICs. such that, this conditional PDF is maximized which in turn minimizes estimation mor [l]. In Maximum Likelihood (ML) estimation, E is assumed to be an unknown constant in the range -Tf2 to +TJ2...

We introduce an analog of the Dirichlet-to-Neumann map for Maxwell equation in a bounded domain. show that it can be approximated by pseudodifferential operator on boundary with matrix-valued symbol and we compute principal symbol. As application, obtain parabolic region free transmission eigenvalues associated equation.

The Baptista cryptosystem uses the logistic map to generate chaotic sequence. The encryption process of a given plaintext character consists of iterating the chaotic map until the state reaches the subinterval assigned to that symbol. The cipher text corresponding to the plaintext symbol is the number of iterations in the chaotic map. We propose a method to enhance the security and compression ...

In earlier work the author proved that the Vostokov symbol of the n-dimensional mixed characteristic local eld X n = kfft 1 n) q ! q commutes with the corresponding Vostokov symbol of X n?1 = kfft 1 gg : : :fft n?2 gg. Here the author generalizes this theorem to the case of a regular local ring A subject to certain conditions. This is done by using Kato's reformulation of the Vostokov symbol as...