Anisotropic numerical potentials for coarse‐grained modeling from high‐speed multidimensional lookup table and interpolation algorithms

2021 ◽  
Author(s):  
Ananya Gangopadhyay ◽  
Simon Winberg ◽  
Kevin J. Naidoo
Keyword(s):  
High Speed ◽  
Lookup Table ◽  
Coarse Grained ◽  
Interpolation Algorithms

scholarly journals Shared Variable Extraction and Hardware Implementation for Nonlinear Boolean Functions Based on Swarm Intelligence

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Longmei Nan ◽  
Xiaoyang Zeng ◽  
Yiran Du ◽  
Zibin Dai ◽  
Lin Chen
Keyword(s):  
Swarm Intelligence ◽  
Association Rule ◽  
Boolean Functions ◽  
Association Rule Mining ◽  
Operation Time ◽  
Lookup Table ◽  
Coarse Grained ◽  
Rule Mining ◽  
Shared Variable ◽  
Shared Variables

To solve the problem of complex relationships among variables and the difficulty of extracting shared variables from nonlinear Boolean functions (NLBFs), an association logic model of variables is established using the classical Apriori rule mining algorithm and the association analysis launched during shared variable extraction (SVE). This work transforms the SVE problem into a traveling salesman problem (TSP) and proposes an SVE based on particle swarm optimization (SVE-PSO) method that combines the association rule mining method with swarm intelligence to improve the efficiency of SVE. Then, according to the shared variables extracted from various NLBFs, the distribution of the shared variables is created, and two corresponding hardware circuits, Element A and Element B, based on cascade lookup table (LUT) structures are proposed to process the various NLBFs. Experimental results show that the performance of SVE via SVE-PSO method is significantly more efficient than the classical association rule mining algorithms. The ratio of the rules is 80.41%, but the operation time is only 21.47% when compared to the Apriori method, which uses 200 iterations. In addition, the area utilizations of Element A and Element B expended by the NLBFs via different parallelisms are measured and compared with other methods. The results show that the integrative performances of Element A and Element B are significantly better than those of other methods. The proposed SVE-PSO method and two cascade LUT-structure circuits can be widely used in coarse-grained reconfigurable cryptogrammic processors, or in application-specific instruction-set cryptogrammic processors, to advance the performance of NLBF processing and mapping.

New insights into the frost heave behavior of coarse grained soils for high-speed railway roadbed: Clustering effect of fines

2019 ◽  
Vol 167 ◽  
pp. 102863 ◽  
Author(s):  
Wei She ◽  
Luansu Wei ◽  
Guotang Zhao ◽  
Guotao Yang ◽  
Jinyang Jiang ◽  
...  
Keyword(s):  
High Speed ◽  
Coarse Grained ◽  
Frost Heave ◽  
High Speed Railway ◽  
Clustering Effect

PARALLEL ALGORITHMS FOR SPLIT-APERTURE CONVENTIONAL BEAMFORMING

1999 ◽  
Vol 07 (04) ◽  
pp. 225-244 ◽  
Author(s):  
ALAN D. GEORGE ◽  
KEONWOOK KIM
Keyword(s):  
Parallel Algorithms ◽  
Distributed System ◽  
High Speed ◽  
Coarse Grained ◽  
Autonomous Operation ◽  
High Speed Network ◽  
Bearing Estimation ◽  
Execution Speed ◽  
Single Aperture ◽  
Performance Results

Quiet submarine threats and high clutter in the littoral undersea environment increase the processing demands on beamforming arrays, particularly for applications which require in-array autonomous operation. Whereas traditional single-aperture beamforming approaches may falter, the Split-Aperture Conventional Beamforming (SA-CBF) algorithm can be used to meet stringent requirements for more precise bearing estimation. Moreover, by coupling each transducer node with a microprocessor, parallel processing of the split-aperture beamformer on a distributed system can glean advantages in execution speed, fault tolerance, scalability, and cost. In this paper, parallel algorithms for SA-CBF are introduced using coarse-grained and medium-grained forms of decomposition. Performance results from parallel and sequential algorithms are presented using a distributed system testbed comprised of a cluster of workstations connected by a high-speed network. The execution times, parallel efficiencies, and memory requirements of each parallel algorithm are presented and analyzed. The results of these analyses demonstrate that parallel in-array processing holds the potential to meet the needs of future advanced sonar beamforming algorithms in a scalable fashion.

Unraveling the Effect of Material Properties and Geometrical Factors on Ballistic Penetration Energy of Nanoscale Thin Films

2018 ◽  
Vol 85 (12) ◽  
Author(s):  
Zhaoxu Meng ◽  
Sinan Keten
Keyword(s):  
Thin Films ◽  
Material Properties ◽  
High Speed ◽  
Coarse Grained ◽  
Geometrical Factor ◽  
Materials Testing ◽  
Multilayer Graphene ◽  
Wide Range ◽  
Geometrical Factors ◽  
Ballistic Penetration

It is crucial to investigate the dynamic mechanical behavior of materials at the nanoscale to create nanostructured protective systems that have superior ballistic impact resistance. Inspired from recent experimental advances that enable ballistic materials testing at small scales, here we report a comparative analysis of the dynamic behavior of nanoscale thin films made from multilayer graphene (MLG), polymer, gold, and aluminum under high-speed projectile impact. We employ atomistic and coarse-grained (CG) molecular dynamics (MD) simulations to measure the ballistic limit velocity (V50) and penetration energy (Ep) of these nanoscale films and investigate their distinctive failure mechanisms over a wide range of impact velocities (Vi). For the local penetration failure mechanism observed in polymer and metal films, we find that the intrinsic mechanical properties influence Ep at low Vi, while material density tends to govern Ep at high Vi. MLG films uniquely show a large impact propagation zone (IPZ), which transfers the highly localized impact energy into elastic deformation energy in a much larger area through cone wave propagation. We present theoretical analyses that corroborate that the size of IPZ should depend not only on material properties but also on a geometrical factor, specifically, the ratio between the projectile radius and film thickness. This study clearly illustrates how material properties and geometrical factors relate to the ballistic penetration energy, thereby allowing a quantitative comparison of the nanoscale ballistic response of different materials.

scholarly journals Hardware Implementation of 32-Bit High-Speed Direct Digital Frequency Synthesizer

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Salah Hasan Ibrahim ◽  
Sawal Hamid Md. Ali ◽  
Md. Shabiul Islam
Keyword(s):  
High Speed ◽  
Frequency Synthesizer ◽  
Logic Gates ◽  
Sine Wave ◽  
Lookup Table ◽  
Frequency Resolution ◽  
Digital Frequency ◽  
Quarter Wave ◽  
Direct Digital Frequency Synthesizer ◽  
Gated Clock

The design and implementation of a high-speed direct digital frequency synthesizer are presented. A modified Brent-Kung parallel adder is combined with pipelining technique to improve the speed of the system. A gated clock technique is proposed to reduce the number of registers in the phase accumulator design. The quarter wave symmetry technique is used to store only one quarter of the sine wave. The ROM lookup table (LUT) is partitioned into three 4-bit sub-ROMs based on angular decomposition technique and trigonometric identity. Exploiting the advantages of sine-cosine symmetrical attributes together with XOR logic gates, one sub-ROM block can be removed from the design. These techniques, compressed the ROM into 368 bits. The ROM compressed ratio is 534.2 : 1, with only two adders, two multipliers, and XOR-gates with high frequency resolution of 0.029 Hz. These techniques make the direct digital frequency synthesizer an attractive candidate for wireless communication applications.

scholarly journals EFFICIENT OPERATIONS IN LARGE FINITE FIELDS FOR ELLIPTIC CURVE CRYPTOGRAPHIC

2020 ◽  
Vol 7 (6) ◽  
pp. 141-151
Author(s):  
Yan-Haw Chen ◽  
Chien-Hsing Huang
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
High Speed ◽  
Lookup Table ◽  
Computation Cost ◽  
Encryption And Decryption ◽  
Software Implementations ◽  
Field Multiplication ◽  
Rule Method ◽  
Elliptic Curve Scalar Multiplication

An efficient method to compute the finite field multiplication for Elliptic Curve point multiplication at high speed encryption of the message is presented. The methods of the operations are based on dynamic lookup table and modified Horner rule method. The modified Horner rule method is not only to finite field operations but also to Elliptic curve scalar multiplication in the encryption and decryption. By comparison with using Russian Peasant method and in the new proposed method, one of the advantages of utilizing the proposed algorithm is that in the Elliptic Curve point addition are reduced by a factor of three in GF (2163). Therefore, using the Algorithm 1 running on Intel CPU, computation cost of the multiplication method is above 70% faster than using standard multiplication by Russian Peasant method. Ultimately, the proposed Algorithm 1 for evaluating multiplication can be made regular, simple and suitable for software implementations.  

Sign in / Sign up

Export Citation Format

Share Document