Power positron beams for High Energy Density physics
In this talk I will discuss the modern theoretical developments and review today situation in power positron beams research, including physical and technical aspects of generation and absorption of the positron beams with GeV particle energy and about (0.01–0.1) A beam current, positive “charge pumping” process, with emphasis on suggestions for some HED (High Energy Density) physics applications: (1) macroparticle accelerator, (2) proton and heavy ion intermediate energy accelerator and (3) soft(about few MeV energy range) gaser. I will also describe the physics and conceptual design of the machines (1)–(3).
Power positron beams as a new branch of beaming
Despite being one of the most accessible forms of antimatter today, positron beams are barely used in High Energy Density Physics (HEDP). For classical problems of HEDP, they offer no immediate advantages in comparison to electron and ion beams, and their production requires more expensive and complicated procedure. However, they might be the solution for a number of advanced problems in HEDP, that have not yet been solved (even theoretically) in more than 50 years of extensive research, including: ; Accelerating macro (1 to 10 grams) particles to the speed of 100 - 1000 kilometers per second : Creating new generation of proton and ion accelerators : Creating the sources of coherent γ - radiation.
Investigation of the Performance of Nikhilam Multiplication Algorithm
Abstract Multiplication is one of the most important operations in computer arithmetic. Multiplication is used in many operations such as squaring, division and computing reciprocal. Moreover, multiplication is a very significant arithmetic operation for lots of signal processing applications which are convolution, correlation, frequency analysis, image processing etc. The efficiency of multiplication operation is crucial for the process time of these applications. Nikhilam algorithm is one of the algorithms developed for increasing the efficiency and reducing the cost in order to simplify multiplication. In this work, the performance of Nikhilam multiplication algorithm is analyzed in terms of the number of multiplication and the total process time for different bit lengths.