Results 251 to 260 of about 796,772 (273)
Some of the next articles are maybe not open access.
A Low-Error, Memory-Based Fast Binary Logarithmic Converter
IEEE Transactions on Circuits and Systems II: Express Briefs, 2020This brief presents a memory based fast binary logarithmic converter based on a piecewise linear approximation technique. The proposed method is simple and arithmetic operation-less, which achieves 10−4 to 10−3 maximum absolute error (MAE) while maintaining a high speed. The approach partitions the logarithmic curve of the fractional component into $
Biswabandhu Jana +3 more
openaire +2 more sources
An FPGA-based fixed-point architecture for binary logarithmic computation
2013 IEEE Second International Conference on Image Information Processing (ICIIP-2013), 2013Real-time numerically intensive image processing applications demand dedicated hardware for various complex arithmetic functions. These arithmetic functions can be efficiently implemented by employing a binary logarithmic circuit. In this paper a field-programmable gate array (FPGA) based architecture for the binary logarithm approximation unit is ...
Jai Gopal Pandey +3 more
openaire +2 more sources
Quantum information & computation
This paper presents further improvements in the transformation of the Discrete Logarithm Problem (DLP) and Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem.
Michał Wroński, Lukasz Dzierzkowski
semanticscholar +1 more source
This paper presents further improvements in the transformation of the Discrete Logarithm Problem (DLP) and Elliptic Curve Discrete Logarithm Problem (ECDLP) over prime fields to the Quadratic Unconstrained Binary Optimization (QUBO) problem.
Michał Wroński, Lukasz Dzierzkowski
semanticscholar +1 more source
Transformation of the discrete logarithm problem over 𝔽2n to the QUBO problem using normal bases
International Journal of Electronics and TelecommunicationsQuantum computations are very important branch of modern cryptology. According to the number of working physical qubits available in general-purpose quantum computers and in quantum annealers, there is no coincidence, that nowadays quantum annealers ...
Michal Wro'nski, Mateusz Le'sniak
semanticscholar +1 more source
A linear approximation based hybrid approach for binary logarithmic conversion
Microprocessors and Microsystems, 2002Abstract Many approaches have been proposed to achieve logarithmic approximation using look-up table, computation, and hybrid methods. The conventional linear approximation method requires a simple hardware implementation but produces results with high approximation error.
Siew-Kei Lam, Thambipillai Srikanthan
openaire +2 more sources
Preliminary limits of a logarithmic correction to the Newtonian gravitational potential in binary pulsars [PDF]
Research in Astronomy and Astrophysics, 2014 We obtain preliminary limits on a logarithmic correction to the Newtonian gravitational potential by using five binary pulsars: PSR J0737-3039, PSR B1534+12, PSR J1756-2251, PSR B1913+16 and PSR B2127+11C. This kind of correction may originate from fundamental frameworks, like string theories, effective models of grav- ity due to quantum effects and ...
Zi-Wei Li +6 more
openaire +1 more source
An Efficient Probability Estimation Design for Logarithmic Binary Arithmetic Coding
2019 Picture Coding Symposium (PCS), 2019This paper proposes an efficient probability estimation design based on the Logarithmic Binary Arithmetic Coding (LBAC) in the second generation of Audio Video coding Standard (AVS2). The probability estimation process in LBAC is not stable enough in case of violent fluctuation and lack of flexibility in updating speed.
Quanhe Yu +6 more
openaire +2 more sources
Performance evaluation of the binary logarithmic arbitration method (BLAM)
Proceedings of LCN - 21st Annual Conference on Local Computer Networks, 2002The binary logarithmic arbitration method (BLAM) is currently under review by the IEEE 802.3 standards committee for possible standardization. BLAM is a new arbitration algorithm for Ethernet that is backwards compatible with the existing binary exponential backoff (BEB) algorithm. Simulation models of BEB and BLAM are developed.
openaire +2 more sources
Explicit binary tree codes with sub-logarithmic size alphabet
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022Ben Yaacov, Inbar +2 more
openaire +1 more source