Compact parallel optical modified-signed-digit arithmetic-logic array processor with electron-trapping device

A compact two-step modified-signed-digit arithmetic-logic array processor is proposed. When the reference digits are programmed, both addition and subtraction can be performed by the same binary logic operations regardless of the sign of the input digits. The optical implementation and experimental demonstration with an electron-trapping device are shown. Each digit is encoded by a single pixel, and no polarization is included. Any combinational logic can be easily performed without optoelectronic and electro-optic conversions of the intermediate results. The system is compact, general purpose, simple to align, and has a high signal-to-noise ratio. (C) 1999 Optical Society of America.

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.

Classified one-step modified signed-digit arithmetic and its optical implementation

Based on the two-step modified signed-digit (MSD) algorithm, we present a one-step algorithm for the parallel addition and subtraction of two MSD numbers. This algorithm is reached by classifying the three neighboring digit pairs into 10 groups and then making a decision on the groups. It has only a look-up truth table, and can be further formulated by eight computation rules. A joint spatial encoding technique is developed to represent both the input data and the computation rules. Furthermore, an optical correlation architecture is suggested to implement the MSD adder in parallel. An experimental demonstration is also given. (C) 1996 Society of Photo-Optical instrumentation Engineers.

Parallel optical negabinary signed-digit computing: algorithm and optical implementation

Negabinary is a component of the positional number system. A complete set of negabinary arithmetic operations are presented, including the basic addition/subtraction logic, the two-step carry-free addition/subtraction algorithm based on negabinary signed-digit (NSD) representation, parallel multiplication, and the fast conversion from NSD to the normal negabinary in the carry-look-ahead mode. All the arithmetic operations can be performed with binary logic. By programming the binary reference bits, addition and subtraction can be realized in parallel with the same binary logic functions. This offers a technique to perform space-variant arithmetic-logic functions with space-invariant instructions. Multiplication can be performed in the tree structure and it is simpler than the modified signed-digit (MSD) counterpart. The parallelism of the algorithms is very suitable for optical implementation. Correspondingly, a general-purpose optical logic system using an electron trapping device is suggested. Various complex logic functions can be performed by programming the illumination of the data arrays without additional temporal latency of the intermediate results. The system can be compact. These properties make the proposed negabinary arithmetic-logic system a strong candidate for future applications in digital optical computing with the development of smart pixel arrays. (C) 1999 Society of Photo-Optical Instrumentation Engineers. [S0091-3286(99)00803-X].

Code conversion from signed-digit to complement representation based on look-ahead optical logic operations

We present, for the first time to our knowledge, a generalized lookahead logic algorithm for number conversion from signed-digit to complement representation. By properly encoding the signed-digits, all the operations are performed by binary logic, and unified logical expressions can be obtained for conversion from modified-signed-digit (MSD) to 2's complement, trinary signed-digit (TSD) to 3's complement, and quarternary signed-digit (QSD) to 4's complement. For optical implementation, a parallel logical array module using an electron-trapping device is employed and experimental results are shown. This optical module is suitable for implementing complex logic functions in the form of the sum of the product. The algorithm and architecture are compatible with a general-purpose optoelectronic computing system. (C) 2001 Society of Photo-Optical Instrumentation Engineers.

Optoelectronic quotient-selected modified signed-digit division

A novel optoelectronic quotient-selected modified signed-digit division technique is proposed. This division method generates one quotient digit per iteration involving only one shift operation, one quotient selection operation and one addition/subtraction operation. The quotient digit can be selected by observing three most significant digits of the partial remainder independent of the divisor. Two algorithms based on truth-table look-up and binary logic operations are derived. For optoelectronic implementation, an efficient shared content-addressable memory based architecture as well as compact logic array processor based architecture with an electron-trapping device is proposed. Performance evaluation of the proposed optoelectronic quotient-selected division shows that it is faster than the previously reported convergence division approach. Finally, proof-of-principle experimental results are presented to verify the effectiveness of the proposed technique. (C) 2001 Society of Photo-Optical Instrumentation Engineers.

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.

Behavioural reaction of root vole (Microtus oeconomus pallas) males of different social ranks to familiar and novel odour of conspecific males

In this experiment, we tested the hypothesis that males of root voles (Microtus oeconomus Pallas) of different social ranks display different behavioural strategies. To document behavioural differences between social ranks, we investigated patterns in the behavioural responses to urine cues from familiar and novel individu in a choice maze. Ten pairs of male voles were efectively used in this experiment. All behaviour was recorded with OBSERVER 5.0. When experiment was finished, video tapes were transformed into digital data. Then all data were analyzed by SPSS. The results showed that the approach latency of subordinates was shorter for familiar odours than novel ones, dominant individuals preferentially entered the strange odourant box, subordinates preferred familiar odours over novel ones, subordinates spent more time visiting familiar odours compared to the novel odours, dominants preferred novel odours to familiar ones, subordinates approached familiar odours more frequently than novel ones and self-groomed more often in the familiar odourant box than in the novel box, and dominant and subordinate individuals showed significantly different countermarking behaviours to familiar and novel odours. In conclusion, the dominants and subordinates displayed different behaviour patterns when faced to familiar and novel conspecific males' urine cues. The data support our hypothesis that differences in social rank induce differences in behavioural patterns.

Breaking ranks: the emergence of representative associations in the Irish armed forces 1989-1992

This study contexualises the relationship between the armed forces and the civil authority in Ireland using and revising the theoretical framework advanced by Huntington. It tracks the evolution of the idea of a representive body for soldiers in the late 1980s, to the setting up of statutory associations under the Defence Amendment Act 1990. The study considers Irish soldiers political agitation and their use of peaceful democratic activities to achieve their aims. It highlights the fundamental policy arguments that were made against the idea of representation for the army and positions those arguments in the study of civil-military relations. Utilising unique access to secret Department of Defence files, it reveals in-depth ideological arguments advanced by the military authories in Ireland against independent representation. This thesis provides an academic study of the establishment of PDFORRA. It answers key questions regarding the change in the position of Irish government who were categorically opposed to the idea of representation in the army. It illustrates the involvement of other agencies such as the European Organisation of Military Associations (Euromil) reveals reciprocal support by the Irish associations to other emerging groups in Spain. Accessing as yet unpublished Department of Defence files, study analyses tension between the military authorities and the government. It highlights for the first time the role of enlisted personnel in the shaping of new state structures and successfully dismmisses Huntingtons theoretical contention that enlisted personnel are of no consequence in the study of civil-military relations. It fills a gap in our understanding, identified by Finer, as to how politicisation of soldiers takes place. This thesis brings a new dimension to the discipline of civil-military relations and creates new knowledge that will enhance our understanding of an area not covered previously.

Using signed digit arithmetic for low-power multiplication

Hardware implementations of arithmetic operators using signed digit arithmetic have lost some of their earlier popularity. However, SD is revisited and used to realise an efficient radix-16 generic multiplier, which has particular potential for low-power implementation. The SD multiplier algorithm reduces the number of partial products to as much as 1/4, and in initial tests reduces the estimated power consumption to only about 50% of that of the Booth multiplier. It is different from other previous high-radix methods in that it employs a novel method to generate its partial products with zero arithmetic logic.

Analysing partial ranks by using smoothed paired comparison methods:An investigation of value orientation in Europe

This paper introduces the paired comparison model as a suitable approach for the analysis of partially ranked data. For example, the Inglehart index, collected in international social surveys to examine shifts in post-materialistic values, generates such data on a set of attitude items. However, current analysis methods have failed to account for the complex shifts in individual item values, or to incorporate subject covariates. The paired comparison model is thus developed to allow for covariate subject effects at the individual level, and a reparameterization allows the inclusion of smooth non-linear effects of continuous covariates. The Inglehart index collected in the 1993 International Social Science Programme survey is analysed, and complex non-linear changes of item values with age, level of education and religion are identified. The model proposed provides a powerful tool for social scientists.