To evaluate the performance of a convolutional code it is common to use a union bound on either the biterror rate or the first-event error rate. Since these bounds are given as infinite sums they must be truncated to be evaluated. However, as the tail of the infinite sum is discarded, the upper bound turns into an approximation. In this paper, two methods to evaluate the union bound while takin...

A Monte Carlo method is presented for checking when a multivariate formal (noncommuting variables) polynoial vanishes. The method uses O(n) random bits to achieve an error upper bound of 1=2, where n is the total degree of the polynomial. It is applied to produce a certiicate of a digital image which for an error upper bound of 1=2 has size O(n + q) log(n + q)) bits where n is the image resolut...

This paper proposes a method for evaluating control performance of a switching control system for which the switching strategy consists of so-called maximal output admissible sets. The proposed method gives an upper bound of the control performance index. The key to calculate it is the use of a dwell time. Two types of the algorithms are presented so as to seek for the dwell time. The proposed ...

An upper bound method for the process of plane strain extrusion through a wedge-shaped die is derived. A technique for constructing a kinematically admissible velocity field satisfying the exact asymptotic singular behavior of real velocity fields in the vicinity of maximum friction surfaces (the friction stress at sliding is equal to the shear yield stress on such surfaces) is described. Two s...

In decision making, consistency in fuzzy preference relations is associated with the study of transitivity property. While using additive consistency property to complete incomplete preference relations, the preference values found may lie outside the interval [0, 1] or the resultant relation may itself be inconsistent. This paper proposes a method that avoids inconsistency and completes an inc...

This paper proposes a new MIMO-OFDM precoding technique that aims to minimize a bit error rate (BER) upper bound of the maximum likelihood detection (MLD) in mobile radio communications. Using a steepest descent algorithm, the proposed method estimates linear precoding matrices that can minimize the upper bound of BER under power constraints. Since the upper bound is derived from all the pairwi...

The analytic hierarchy process (AHP) is a structured technique for dealing with complex decisionmaking and is already used to solve many group decision problems. This paper used the CauchySchwarz inequality to improve the AHP algorithm that was developed by Escobar et al. (2004). They provided an upper bound for the group geometric consistency index in order to prove that the group geometric co...

The assessment of the influence of the work-hardening of material on the optimum die profile and drawing force  in rod drawing process is the main objective of the present paper. The upper bound solution, based on the assumption of perfect plasticity, has been extended to consider the work-hardening of the material during the rod drawing process through curved dies. Analytical results of drawin...

in this work we deal with the coefficients of a (e it ) 2 , where a is in a class of polynomialshaving unimodular coefficients. we first present a technique that calculates lower bounds for particularautocorrelations and then in a more general case we present an upper bound for their maximal order.

We consider the separable quadratic multi-knapsack problem (QMKP) which consists in maximizing a concave separable quadratic integer function subject to m linear capacity constraints. The aim of this paper is to develop an effective method to compute an upper bound for (QMKP) from a surrogate relaxation originally proposed in Djerdjour et al. (1988). The quality of three other upper bounds for...