The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [Giovannetti et al., Physical Review Letters 92, 027902 (2004), arXiv:quant-ph/0308012]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean-photon number constraint on the...

We present a new kinematic calibration algorithm for redundantly actuated parallel mechanisms, and illustrate the algorithm with a case study of a planar seven-element 2-degree-of-freedom (DOF) mechanism with three actuators. To calibrate a nonredundantly actuated parallel mechanism, one can find actual kinematic parameters by means of geometrical constraint of the mechanism’s kinematic structu...

RECORDING Steven W. McLaughlin1, Patrick Lee2, and Robert Cloke2 1School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332 2 Western Digital Corporation, 863 Rue Ferrari, San Jose, CA 95138. ABSTRACT We consider an alternative to the widely-used (0; G=I) constraint in partial response digital magnetic recording systems. The new one-pairs constraint is an...

Reducing power consumption and increasing battery life of nodes in an ad-hoc network requires an integrated power control and routing strategy. Power optimal routing selects the multi-hop links that require the minimum total power cost for data transmission under a constraint on the link quality. This paper studies optimal power routing under the constraint of a fixed end-to-end probability of ...

This paper proposes a method to simulate inextensible hair strands using tridiagonal matrix formulation in which distance constraints are formulated as a linear system. The proposed method avoids constructing a full matrix explicitly. Instead, it takes advantage of the chain topology and serial indexing to formulate symmetric tridiagonal matrix. Furthermore, we use a linear distance constraint ...

A constraint-based framework for computing privacy preserving OLAP aggregations on data cubes is proposed and experimentally assessed in this paper. Our framework introduces a novel privacy OLAP notion, which, following consolidated paradigms of OLAP research, looks at the privacy of aggregate patterns defined on multidimensional ranges rather than the privacy of individual tuples/data-cells, l...

---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The gate level techniques are used in simulation to identify ISE’s and also these techniques are implemented based on Sequential Automatic Test Pattern Generation (ATPG). But now a day’s IC’s are very complex so by using above gate level method, it...

In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error ...

Sparse adaptive filtering has gained much attention due to its wide applicability in the field of signal processing. Among the main algorithm families, sparse norm constraint adaptive filters develop rapidly in recent years. However, when applied for system identification, most priori work in sparse norm constraint adaptive filtering suffers from the difficulty of adaptability to the sparsity o...