Showing papers on "Binary number published in 1997"

A discrete binary version of the particle swarm algorithm

Abstract: The particle swarm algorithm adjusts the trajectories of a population of "particles" through a problem space on the basis of information about each particle's previous best performance and the best previous performance of its neighbors. Previous versions of the particle swarm have operated in continuous space, where trajectories are defined as changes in position on some number of dimensions. The paper reports a reworking of the algorithm to operate on discrete binary variables. In the binary version, trajectories are changes in the probability that a coordinate will take on a zero or one value. Examples, applications, and issues are discussed.

Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates,

Abstract: Exact computer arithmetic has a variety of uses, including the robust implementation of geometric algorithms. This article has three purposes. The first is to offer fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values. The second is to propose a technique for adaptive precision arithmetic that can often speed these algorithms when they are used to perform multiprecision calculations that do not always require exact arithmetic, but must satisfy some error bound. The third is to use these techniques to develop implementations of several common geometric calculations whose required degree of accuracy depends on their inputs. These robust geometric predicates are adaptive; their running time depends on the degree of uncertainty of the result, and is usually small.

Sidelobe reduction in array-pattern synthesis using genetic algorithm

Abstract: A simple and flexible genetic algorithm (GA) for pattern synthesis of antenna array with arbitrary geometric configuration is presented. Unlike conventional GA using binary coding and binary crossover, this approach directly represents the array excitation weighting vectors as complex number chromosomes and uses decimal linear crossover without a crossover site. Compared with conventional GAs, this approach has a few advantages: giving a clearer and simpler representation of the problem, simplifying chromosome construction, and totally avoiding binary encoding and decoding so as to simplify software programming and to reduce CPU time. This method also allows us to impose constraints on phases and magnitudes of complex excitation coefficients for preferable implementation in practice using digital phase shifters and digital attenuators. Successful applications show that the approach can be used as a general tool for pattern synthesis of arbitrary arrays.

Statistics of chaotic binary sequences

Abstract: Statistical properties of binary sequences generated by a class of ergodic maps with some symmetric properties are discussed on the basis of an ensemble-average technique. We give a simple sufficient condition for such a class of maps to produce a fair Bernoulli sequence, that is, a sequence of independent and identically distributed (i.i.d.) binary random variables. This condition is expressed in terms of binary function, which is a generalized version of the Rademacher function for the dyadic map.

Analytical method for blind binary signal separation

Abstract: The blind separation of multiple co-channel binary digital signals using an antenna array involves finding a factorization of a data matrix X into X=AS, where all entries of S are +1 or -1. It is shown that this problem can be solved exactly and noniteratively, via a certain generalized eigenvalue decomposition. As indicated by simulations, the algorithm is robust in the presence of noise. An interesting implication is that certain cluster segmentation problems can be solved using eigenvalue techniques.

PHDD: an efficient graph representation for floating point circuit verification

Abstract: Data structures such as *BMDs, HDDs, and K*BMDs provide compact representations for functions which map Boolean vectors into integer values, but not floating point values. In this paper, we propose a new data structure, called Multiplicative Power Hybrid Decision Diagrams (*PHDDs), to provide a compact representation for functions that map Boolean vectors into integer or floating point values. The size of the graph to represent the IEEE floating point encoding is linear with the word size. The complexity of floating point multiplication grows linearly with the word size. The complexity of floating point addition grows exponentially with the size of the exponent part, but linearly with the size of the mantissa part. We applied *PHDDs to verify integer multipliers and floating point multipliers before the rounding stage, based on a hierarchical verification approach. For integer multipliers, our results are at least 6 times faster than *BMDs. Previous attempts at verifying floating point multipliers required manual intervention. We verified floating point multipliers before the rounding stage automatically.

Critical end point behavior in a binary fluid mixture

Abstract: We consider the liquid-gas phase boundary in a binary fluid mixture near its critical end point. Using general scaling arguments we show that the diameter of the liquid-gas coexistence curve exhibits singular behaviour as the critical end point is approached. This prediction is tested by means of extensive Monte-Carlo simulations of a symmetrical Lennard-Jones binary mixture within the grand canonical ensemble. The simulation results show clear evidence for the proposed singularity, as well as confirming a previously predicted singularity in the coexistence chemical potential [Fisher and Upton, Phys. Rev. Lett. 65, 2402 (1990)]. The results suggest that the observed singularities, particularly that in the coexistence diameter, should also be detectable experimentally.

Method and apparatus for recording and reading date data having coexisting formats

Abstract: Years past 1999 are stored as binary integers or in other coding schemes not reserved by ASCII or EBCDIC in fields previously reserved for representations of years as two decimal digits. The binary integers occupy ranges of values for the fields which are not used by an integer value corresponding to any possible combination of two decimal digits from 00 to 99. Data written in binary format and data written in a conventional format such as ASCII can be distinguished in various ways, such as by determining whether the year datum has a binary integer value falling inside or outside the range for possible ASCII combinations of two digits, or testing the bit having a place value of 4,096. If this bit is tested, it will always be on (one) for data written in ASCII and off (zero) for all binary integer values from zero through 4,095. In this way, data using integer-encoded years and years represented by the last two decimal digits will be able to coexist for at least ten thousand years.

Inverse Kinematics of Binary Manipulators Using a Continuum Model

Abstract: Binary actuators have only two discrete states, both of which are stable without feedback As a result, manipulators with binary actuators have a finite number of states The major benefits of binary actuation are that extensive feedback control is not required, reliability and task repeatability are very high, and two-state actuators are generally very inexpensive, resulting in low cost robotic mechanisms These manipulators have great potential for use in both the manufacturing and service sectors, where the cost of high performance robotic manipulators is often difficult to justify The most difficult challenge with a binary manipulator is to achieve relatively continuous end-effector trajectories given the discrete nature of binary actuation Since the number of configurations attainable by binary manipulators grows exponentially in the number of actuated degrees of freedom, calculation of inverse kinematics by direct enumeration of joint states and calculation of forward kinematics is not feasible in the highly actuated case This paper presents an efficient method for performing binary manipulator inverse kinematics and trajectory planning based on having the binary manipulator shape adhere closely to a time-varying curve In this way the configuration of the arm does not exhibit drastic changes as the end effector follows a discrete trajectory

Dependent Sets of Constant Weight Binary Vectors

Abstract: We determine lower bounds for the number of random binary vectors, chosen uniformly from vectors of weight k, needed to obtain a dependent set.

General cardinality genetic algorithms

Abstract: A complete generalization of the Vose genetic algorithm model from the binary to higher cardinality case is provided. Boolean AND and EXCLUSIVE-OR operators are replaced by multiplication and addition over rings of integers. Walsh matrices are generalized with finite Fourier transforms for higher cardinality usage. Comparison of results to the binary case are provided.

Binary odd-periodic complementary sequences

Abstract: A pair of binary sequences is called complementary if the sum of their aperiodic autocorrelation functions is zero except for zero shift Such sequences are known for relatively few lengths This correspondence therefore introduces pairs of binary odd-periodic complementary sequences, which can be constructed using q-ary m-sequences for many more lengths

Method, apparatus and computer programmed product for binary re-optimization using a high level language compiler

Abstract: Apparatus, methods and computer program products are disclosed for a high level language compiler that includes a binary re-optimization capability. This re-optimization capability inputs a binary executable and outputs a binary module optimized for a target computer system. The binary module can be linked to create an optimized binary executable. This capability is provided by adding a front end segment to the compiler that reads the binary executable and creates an intermediate representation of the binary executable. This intermediate representation is normalized to remove prior optimization artifacts and to virtualize register usage. The intermediate representation is then optimized for a target computer system resulting in a binary module that can be linked to make a binary executable that is optimized for the target computer.

Perfect binary space partitions

Abstract: A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes until all objects are separated. A binary space partition is called perfect if none of the objects is cut by the hyperplanes used by the binary space partition. We present an algorithm that, given a set S of n non-intersecting line segments in the plane, constructs a perfect binary space partition for S , or decides that no perfect binary space partition exists for S , in O(min( n 2 , n log 3 n + m log n )) time, where m is the number of edges in the visibility graph of S . We also prove that deciding whether a set of segments admits a perfect BSP is 3 sum -hard.

S-unit equations, binary forms and curves of genus 2

Abstract: In this paper a practical algorithm is given to find all binary forms with rational coefficients of given degree with discriminant divisible by a given finite set of rational primes, up to an obvious equivalence relation.

New results on binary space partitions in the plane

Abstract: We prove the existence of linear size binary space partitions for sets of objects in the plane under certain conditions. In particular, we construct linear size binary space partitions for sets of fat objects, for sets of line segments where the ratio between the lengths of the longest and shortest segment is bounded by a constant, and for homothetic objects. For all cases we also show how to turn the existence proofs into efficient algorithms.

Object detection with vector quantized binary features

Abstract: This paper presents a new algorithm for detecting objects in images, one of the fundamental tasks of computer vision. The algorithm extends the representational efficiency of eigenimage methods to binary features, which are less sensitive to illumination changes than gray-level values normally used with eigenimages. Binary features (square subtemplates) are automatically chosen on each training image. Using features rather than whole templates makes the algorithm more robust to background clutter and partial occlusions. Instead of representing the features with real-valued eigenvector principle components, we use binary vector quantization to avoid floating point computations. The object is detected in the image using a simple geometric hash table and Hough transform. On a test of 1000 images, the algorithm works on 99.3%. We present a theoretical analysis of the algorithm in terms of the receiver operating characteristic, which consists of the probabilities of detection and false alarm. We verify this analysis with the results of our 1000-image test and we use the analysis as a principled way to select some of the algorithm's important operating parameters.

Scaled and unscaled residue number system to binary conversion techniques using the core function

Abstract: The paper presents related techniques for converting a residue number system (RNS) number to binary, with and without scaling, that use the core function. The techniques remove the difficulties associated with conversion procedures based on the Chinese remainder theorem and the mixed-radix conversion technique. Two new methods for extracting the core of an RNS number are also presented that employ a parity bit to eliminate ambiguity.

Imaging binary stars by the cross-correlation technique

Abstract: We present in this paper a technique for imaging binary stars from speckle data. This technique is based upon the computation of the cross-correlation between the speckle frames and their square. This may be considered as a simple, easy to implement, complementary computation to the autocorrelation function of Labeyrie's technique for a rapid determination of the position angle of binary systems. Angular separation, absolute position angle and relative photometry of binary stars can be derived from this technique. We show an application to the bright double star ζ Sge observed at the 2 m Telescope Bernard Lyot.

On a Property of Perfect Binary Codes

Abstract: It is proved that any perfect binary (n, 3)-code is uniquely reconstructible from the allocation of its code vertices in the two medium layers of the n-dimensional unit cube. A nontrivial upper bound is obtained for the number of such codes.

Microprocessor arithmetic logic unit using multiple number representations

Abstract: A microprocessor (5) having at least one arithmetic logic unit, or ALU, (42) for operating upon operands of multiple number representation types is disclosed. The ALU (42) includes a binary logical unit (52) for performing logical operations upon operands in a binary representation, and an arithmetic unit (50, 50') for performing arithmetic operations upon operands in a redundant number representation. The redundant number representation is of a type that may be operated upon by adder circuitry such as signed-digit adders or carry-save adders, where carry information need not propagate along the entire operand. A register file (39, 39') is provided, which stores each operand in both the binary form and in the redundant number representation; a valid bit (V) is provided in combination with the binary portion of each entry in the register file (39, 39'). Upon execution of a logical operation, the result is written back into the register file (39, 39') in both the binary and redundant forms, setting the valid bit to indicate that the binary form is valid. Upon execution of an arithmetic instruction, the binary form of the result is not immediately available; the redundant representation of the result is written back, with the valid bit cleared. Conversion of the result in the redundant representation to the binary form may be done in the next machine or instruction cycle by conversion circuitry (60, 60').

Practical techniques for constructing binary space partitions for orthogonal rectangles

Abstract: We present the first systematic comparison of the performance of algorithms that construct Binary Space Partitions for orthogonal rectangles in R3. We compare known algorithms with our implementation of a variant of a recent algorithm of Agarwal et al. [1]. We show via an empirical study that their algorithm constructs BSPS of near-linear size in practice and performs better than most of the other algorithms in the literature.

Signed binary addition circuitry with inherent even parity outputs

Abstract: A signed binary (SE) addition circuit is presented that always produces an even parity representation of the sum word. The novelty of this design is that no extra check bits are generated or used. The redundancy inherent in a SE representation is further exploited to contain parity information.

Random number generator and method, enciphering device and method, decoder and method and stream cipher system

Abstract: PROBLEM TO BE SOLVED: To obtain a random number generator whose linear complexity is large in comparison with a device scale and which is also cryptographically secure by sequentially changing a 1st random number series that is generated based on a 2nd random number series that is generated. SOLUTION: This device is provided with a 1st random number generating part 2, a 2nd random number generating part 4 and a random number converting part 6. The part 2 generates random number series (binary series) and outputs it after it is set to an initial state. Similarly, the part 4 generates random number series binary series) and outputs it after it is set to an initial state. The part 6 switches orders of inputted binary series based on binary series that are differently inputted and outputs them. Random number series (a) which are outputted from the part 2 are inputted to the part 6, and the part 6 switches the orders of the random number series (a) which are outputted from the part 2 through the procedure or operation based on random number series (b) which are outputted from the part 4 and outputs them. COPYRIGHT: (C)1998,JPO

Apparatus and method of rapidly locating edges of machine-readable symbols or other linear images

Abstract: A method and apparatus locates edges of patterns in a stored image, such as edges of bars or finder patterns of machine-readable symbols. The present invention first selects an edge point or pixel within a stored image. A dominant direction is determined therefrom by examining a region surrounding the selected point. A smaller window is then examined around the edge point to derive a hexadecimal code based on binary values of pixels which surround the edge point. The hexadecimal code is compared to a table of codes, where each code maps to a similar window and identifies a next edge point. The process continues in the dominant direction until the entire edge is located. Circuitry for rapidly performing the its location of patterns in a stored image, such as ages of bars of finder patterns of machine-readable symbols.

A Systematic Approach To Signal Space Detection

Abstract: A general procedure is developed to implement the fixed delay tree search (FDTS) detector in the multi-dimensional signal space. The procedure systematically finds a required set of hyperplanes that divide the entire space into different decision regions. A Boolean mapping function is also analytically determined which generates a final binary decision from several intermediate binary variables that indicate the position of the observation vector relative to given hyperplanes. The proposed technique is demonstrated on a (1+D)/sup 2/ partial response channel driven by the (1,k)-coded input.

Method for restoring a binary shape signal

Abstract: In a method for encoding a binary alpha block (BAB) within a current frame based on the current frame and a previous frame, even-numbered horizontal lines of the BAB are sampled to generate a first block and even-numbered vertical lines of the first block are sampled to generate a first sample block. And then, a reconstructed first block and a reconstructed BAB are generated by inserting reconstructed vertical and horizontal lines sequentially at locations of odd-numbered vertical and horizontal lines thereof, respectively. In the above, binary values of first and second binary pixels of the reconstructed vertical and horizontal lines are made by using corresponding first and second context values based on predetermined probability tables, respectively, wherein the corresponding first and second context values are calculated by using the context values of binary pixels within the previous frame located at identical positions to the first and second binary pixels, respectively; and context values of binary pixels located at surrounding positions of the first and the second binary pixels except a binary pixel below the first binary pixel and a binary pixel right to the second binary pixel, respectively.