Bounds are presented on Zi,i,d,-the achievable information rate for a discrete Gaussian channel with intersymbol interference (IS11 present and i.i.d. channel input symbols governed by an arbitrary predetermined distribution p , (x ) . Upper bounds on I , the achievable information rate with the symbol independence demand relaxed, are given as well. The bounds are formulated in terms of the ave...

We describe a method for hand-drawn symbol recognition based on deformable template matching able to handle uncertainty and imprecision inherent to hand-drawing. Symbols are represented as a set of straight lines and their deformations as geometric transformations of these lines. Matching, however, is done over the original binary image to avoid loss of information during line detection. It is ...

Proportional symbol maps are frequently used to represent numerical data. Commonly used symbols are squares or circles that are area-proportional to the numerical values. Proportional-symbol mapping is included in most geographic information systems (GIS) and is frequently used in digital atlases or Web mapping engines. Graduated symbols are simple for the map author to generate and easy for th...

In this paper we describe a technique of encoding and then decoding symbol sequences containing information into chaotic oscillations of the Belousov-Zhabotinsky reaction. The encoding technique is based on controlling the chaotic oscillations by applying small parameter perturbations and on learning the grammar of corresponding symbol dynamics produced by the free-running chaotic system. The u...

We study the asymptotic eigenvalue distribution of Toeplitz matrices generated by a singular symbol. It has been conjectured by Widom that, for a generic symbol, the eigenvalues converge to the image of the symbol. In this paper we ask how the eigenvalues converge to the image. For a given Toeplitz matrix Tn(a) of size n, we take the standard approach of looking at det(ζ − Tn(a)), of which the ...

This work studies time-slotted communication over molecular timing (MT) channels. The transmitter, assumed to be perfectly synchronized in time with the receiver, is required to send K bits to the receiver using K information particles. It releases a single information particle in each time-slot, where the information is encoded in the time of release. The receiver decodes the transmitted infor...

In this contribution we propose an efficient method for computing symbol-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard solution is to apply a priori reliability information to the a posteriori probability (APP) constituent decoder and compute the resultant average extrinsic information ...

Akhsrract --In the information theory of the multiple-access channel, two types of synchronism are usually assumed among the transmitters, namely, frame and symbol synchronism. Frame synchronism refers to the ability of the users to start the transmission of their codewords in unison. The issue of symbol synchronism arises in continuous-time channels in which each codeword symbol modulates a fi...

Consider coded transmission over a binary-input symmetric memoryless channel. The channel decoder uses the noisy observations of the code symbols to reproduce the transmitted code symbols. Thus, it combines the information about individual code symbols to obtain an overall information about each code symbol, which may be the reproduced code symbol or its a-posteriori probability. This tutorial ...