Results 261 to 270 of about 943,112 (315)
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, 2020
This 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   +1 more source

Tables of Binary Logarithms, Uncertainty Functions, and Binary Log Functions

Perceptual and Motor Skills, 1965
Three sets of 4-place tables are presented, one set on each of two facing pages: binary logarithms (log2 n) of 3-digit numbers, uncertainty functions (– p log2 p) and binary log functions (log2 1/ p) for values of p from .001 to .999.
openaire   +2 more sources

Efficient Implementation of Two Stage Binary Logarithmic Converter

2019 3rd International conference on Electronics, Communication and Aerospace Technology (ICECA), 2019
This paper studies efficient conversion of floating point normalized binary number into binary logarithmic number. The algorithm is basically combination of piece-wise linear approximation of logarithmic transform curve and piece-wise linear approximation of scaled version of normalized error curve .The implemented algorithm requires less memory and ...
Lomesh Phalle, Pratibha Shingare
openaire   +1 more source

Computer Multiplication and Division Using Binary Logarithms

IEEE Transactions on Electronic Computers, 1962
A method of computer multiplication and division is proposed which uses binary logarithms. The logarithm of a binary number may be determined approximately from the number itself by simple shifting and counting. A simple add or subtract and shift operation is all that is required to multiply or divide.
openaire   +2 more sources

An Efficient Adaptive Binary Arithmetic Coder Based on Logarithmic Domain

IEEE Transactions on Image Processing, 2015
This paper proposes an efficient adaptive binary arithmetic coder based on a logarithmic domain (LBAC) and a probability estimation based on the LBAC (P-LBAC). Both the LBAC and the P-LBAC achieve a high data-compression ratio with low complexity and a hardware-efficient structure.
Quanhe, Yu   +5 more
openaire   +2 more sources

An Improved Two-Step Binary Logarithmic Converter for FPGAs

IEEE Transactions on Circuits and Systems II: Express Briefs, 2015
This brief describes an improved binary linear-to-log (Lin2Log) conversion algorithm that has been optimized for implementation on a field-programmable gate array. The algorithm is based on a piecewise linear (PWL) approximation of the transform curve combined with a PWL approximation of a scaled version of a normalized segment error.
Mandeep Chaudhary, Peter Lee
openaire   +1 more source

A fast binary to logarithmic analogue converter

Radio and Electronic Engineer, 1969
The paper describes a circuit configuration which produces an output proportional to the logarithm of binary numbers presented at its input. The circuit is designed to process the first six significant digits only and can deal with binary numbers up to 220?1. The maximum output settling time, to within ?% of the final output level, is about 2 ?s.
openaire   +1 more source

Base of exponent representation matters - more efficient reduction of discrete logarithm problem and elliptic curve discrete logarithm problem to the QUBO problem

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

Binary Reconstruction Codes for Correcting One Deletion and One Substitution

arXiv.org
In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \emph{single-deletion single-substitution ball} function $ \mathcal{B} $ as a mapping from a sequence to the set of sequences
Yuling Li, Yubo Sun, Gennian Ge
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy