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 ...
J. G. Pandey +3 more
openaire +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
Decoding binary two-error correcting cyclic codes with Zech logarithms
IEEE Transactions on Communications, 1992Summary: We present a decoding method for binary two-error correcting cyclic codes whose generator polynomials have at most two irreducible factors. This class includes binary narrow-sense BCH codes with designed distance 5. The decoding algorithm uses the Zech logarithm for the finite field in which the roots of the code lie.
Stevens, Patrick, Ward, Harold N.
openaire +2 more sources
An algorithm for the computation of binary logarithms
IEEE Transactions on Computers, 1991The author presents a simple algorithm for the computation of the base-2 logarithm of a given binary number. The concept can be easily extended to base-N. Unlike other methods, this is not a curve fitting of the base-2 logarithm of a given binary number. The algorithm constitutes a simple step-by-step, bit-by-bit, computation of the logarithm of binary
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.
Benben Niu +6 more
openaire +1 more source
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 +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.
S.K. Lam, T. Srikanthan
openaire +1 more source
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
Reconstructing a Binary Tree from Its Traversals in Doubly Logarithmic CREW Time
Journal of Parallel and Distributed Computing, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olariu, Stephan +2 more
openaire +2 more sources
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Mathematical Programming, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vielma, Juan Pablo, Nemhauser, George L.
openaire +2 more sources

