Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting the distribution of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.
Stochastic computing (SC) was proposed in the 1960s as a low-cost alternative to conventional binary computing. It is unique in that it represents and processes information in the form of digitized probabilities. SC employs very low-complexity arithmetic units which was a primary design concern in the past. Despite this advantage and also its inherent error tolerance, SC was seen as impractical because of very long computation times and relatively low accuracy. However, current technology trends tend to increase uncertainty in circuit behavior and imply a need to better understand, and perhaps exploit, probability in computation. This article surveys SC from a modern perspective where the small size, error resilience, and probabilistic features of SC may compete successfully with conventional methodologies in certain applications. First, we survey the literature and review the key concepts of stochastic number representation and circuit structure. We then describe the design of SC-based circuits and evaluate their advantages and disadvantages. Finally, we give examples of the potential applications of SC and discuss some practical problems that are yet to be solved.
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.
Wind‐turbine operations are associated with bat mortality worldwide; minimizing these fatalities is critically important to both bat conservation and public acceptance of wind‐energy development. We tested the effectiveness of raising wind‐turbine cut‐in speed – defined as the lowest wind speed at which turbines generate power to the utility system, thereby reducing turbine operation during periods of low wind speeds – to decrease bat mortality at the Casselman Wind Project in Somerset County, Pennsylvania, over a 2‐year period. Observed bat mortality at fully operational turbines was, on average, 5.4 and 3.6 times greater than mortality associated with curtailed (ie non‐operating) turbines in 2008 and 2009, respectively. Relatively small changes to wind‐turbine operation resulted in nightly reductions in bat mortality, ranging from 44% to 93%, with marginal annual power loss (≤ 1% of total annual output). Our findings suggest that increasing turbine cut‐in speeds at wind facilities in areas of conservation concern during times when active bats may be at particular risk from turbines could mitigate this detrimental aspect of wind‐energy generation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.