UI-RI Hybrid Lookup Table Method With High Linearity and High-Speed Convergence Performance for FPGA-Based Space Solar Array Simulator

2018 ◽  
Vol 33 (8) ◽  
pp. 7178-7192 ◽  
Author(s):  
Shanshan Jin ◽  
Donglai Zhang ◽  
Chao Wang
Keyword(s):  
High Speed ◽  
Lookup Table ◽  
Solar Array ◽  
High Linearity ◽  
Table Method ◽  
Convergence Performance

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.

Design of a high linearity Gm stage for a high speed current mode SAR ADC

2014 ◽  
Author(s):  
Abdelrahman Elkafrawy ◽  
Ahmad AlMarashli ◽  
Rudolf Ritter ◽  
Jens Anders ◽  
Maurits Ortmanns
Keyword(s):  
High Speed ◽  
Current Mode ◽  
Sar Adc ◽  
High Linearity

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.  

scholarly journals High speed BLASTN: an accelerated MegaBLAST search tool

2015 ◽  
Vol 43 (16) ◽  
pp. 7762-7768 ◽  
Author(s):  
Ying Chen ◽  
Weicai Ye ◽  
Yongdong Zhang ◽  
Yuesheng Xu
Keyword(s):  
Sequence Alignment ◽  
High Speed ◽  
Lookup Table ◽  
Local Alignment ◽  
Biological Sequences ◽  
Parallel Performance ◽  
Seeding Method ◽  
Computational Speed ◽  
Search Tool ◽  
Nucleotide Database

Abstract Sequence alignment is a long standing problem in bioinformatics. The Basic Local Alignment Search Tool (BLAST) is one of the most popular and fundamental alignment tools. The explosive growth of biological sequences calls for speedup of sequence alignment tools such as BLAST. To this end, we develop high speed BLASTN (HS-BLASTN), a parallel and fast nucleotide database search tool that accelerates MegaBLAST—the default module of NCBI-BLASTN. HS-BLASTN builds a new lookup table using the FMD-index of the database and employs an accurate and effective seeding method to find short stretches of identities (called seeds) between the query and the database. HS-BLASTN produces the same alignment results as MegaBLAST and its computational speed is much faster than MegaBLAST. Specifically, our experiments conducted on a 12-core server show that HS-BLASTN can be 22 times faster than MegaBLAST and exhibits better parallel performance than MegaBLAST. HS-BLASTN is written in C++ and the related source code is available at https://github.com/chenying2016/queries under the GPLv3 license.

Sign in / Sign up

Export Citation Format

Share Document