Two-step digit-set-restricted modified signed-digit addition-subtraction algorithm and its optoelectronic implementation

A novel, to our knowledge, two-step digit-set-restricted modified signed-digit (MSD) addition-subtraction algorithm is proposed. With the introduction of the reference digits, the operand words are mapped into an intermediate carry word with all digits restricted to the set {(1) over bar, 0} and an intermediate sum word with all digits restricted to the set {0, 1}, which can be summed to form the final result without carry generation. The operation can be performed in parallel by use of binary logic. An optical system that utilizes an electron-trapping device is suggested for accomplishing the required binary logic operations. By programming of the illumination of data arrays, any complex logic operations of multiple variables can be realized without additional temporal latency of the intermediate results. This technique has a high space-bandwidth product and signal-to-noise ratio. The main structure can be stacked to construct a compact optoelectronic MSD adder-subtracter. (C) 1999 Optical Society of America.

One-step digit-set-restricted modified signed-digit adder using an incoherent correlator based on a shared content-addressable memory

An efficient one-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In this technique, carry propagation is avoided by introducing reference digits to restrict the intermediate carry and sum digits to {1,0} and {0,1}, respectively. The proposed technique requires significantly fewer minterms and simplifies system complexity compared to the reported one-step MSD addition techniques. An incoherent correlator based on an optoelectronic shared content-addressable memory processor is suggested to perform the addition operation. In this technique, only one set of minterms needs to be stored, independent of the operand length. (C) 2002 society or Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Molecular systematics of Xenocyprinae (Teleostei : Cyprinidae): Taxonomy, biogeography, and coevolution of a special group restricted in east Asia

We surveyed mitochondrial DNA (mtDNA) sequence variation in the subfamily Xenocyprinae from China and used these data to estimate intraspecific, interspecific, and intergeneric phylogeny and assess biogeographic scenarios underlying the geographic structu

响蜜lie科的新记录

报道并简述了1994年10月在云南省泸水县的老窝捕获到1只响蜜lie科的黄腰响蜜lieIndicator xanthonotus 为我国鸟类科的新记录。模式标本保存于作者单位。

Molecular systematics of Xenocyprinae (Teleostei : Cyprinidae): Taxonomy, biogeography, and coevolution of a special group restricted in east Asia

We surveyed mitochondrial DNA (mtDNA) sequence variation in the subfamily Xenocyprinae from China and used these data to estimate intraspecific, interspecific, and intergeneric phylogeny and assess biogeographic scenarios underlying the geographic structure of lineages. We sequenced 1140 bp of cytochrome b from 30 individuals of Xenocyprinae and one putative outgroup (Myxocypris asiaticus) and also sequenced 297 bp of ND4L, 1380 bp of ND4, 68 bp of tRNA(His), and 69 bp of tRNA(Ser) from 17 individuals of Xenocyprinae and the outgroup (M. asiaticus). We detected high levels of nucleotide variation among populations, species, and genera. The phylogenetic analysis suggested that Distoechodon hupeinensis might be transferred to the genus Xenocypris, the taxonomic status of the genus Plagiognathops might be preserved, and species of Xenocypris and Plagiognathops form a monophyletic group that is sister to the genus Distoechodon and Pseudobrama. The introgressive hybridization might occur among the populations of X. argentea and X. davidi, causing the two species to not be separated by mtDNA patterns according to their species identification, and the process and direction of hybridization are discussed. The spatial distributions of mtDNA lineages among populations of Xenocypris were compatible with the major geographic region, which indicated that the relationship between Hubei + Hunan and Fujian is closer than that between Hubei + Hunan and Sichuan, From a perspective of parasite investigation, our data suggested that the fauna of Hexamita in Xenocyprinae could be used to infer the phylogeny of their hosts. (C) 2001 Academic Press.

automatic construction of finite algebras

This paper deals withmodel generation for equational theories, i.e., automatically generating (finite) models of a given set of (logical) equations. Our method of finite model generation and a tool for automatic construction of finite algebras is described. Some examples are given to show the applications of our program. We argue that, the combination of model generators and theorem provers enables us to get a better understanding of logical theories. A brief comparison between our tool and other similar tools is also presented.

constructing finite algebras with falcon

The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system.

a computational proof of complexity of some restricted counting problems

South Central University