Fast optical binary multiplication using a sign/logarithm number system

Related Experiment Video

Updated: Jun 20, 2026

Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

A Kostrzewski, G Eichmann, D H Kim

    Optics Letters
    |September 24, 2009
    PubMed

    More Related Videos

    Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping09:43

    Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

    Published on: March 20, 2017

    Related Concept Videos

    Laws of Logarithms I01:30

    Laws of Logarithms I

    Logarithms are fundamental mathematical operations that serve as the inverse of exponentiation. They provide a means to express how many times a base must be raised to yield a given number. For base 10, often referred to as the common logarithm, the notation is written simply as log. Thus, if 10n = x, then log⁡(x) = n. This relationship makes logarithms especially valuable in simplifying complex calculations involving multiplication, division, and exponentiation.Logarithmic expressions are...
    Laws of Logarithms II01:28

    Laws of Logarithms II

    Logarithmic laws provide essential tools for simplifying and evaluating exponential expressions, particularly in mathematical and applied settings where powers and repeated multiplication play a central role. Two important rules are the power law and the change-of-base formula, both allowing for transforming expressions into more manageable forms.The power law of logarithms states that the logarithm of a number raised to an exponent equals the exponent multiplied by the logarithm of the base...
    Bulk Modulus01:21

    Bulk Modulus

    The bulk modulus is a scientific term used to describe a material's resistance to uniform compression. It is the proportionality constant that links a change in pressure to the resulting relative volume change.
    Fast Fourier Transform01:10

    Fast Fourier Transform

    The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
    The computational efficiency of the FFT becomes...
    Exponential Equations with Logarithms: Problem Solving01:29

    Exponential Equations with Logarithms: Problem Solving

    In ecological studies, exponential models are often used to predict how populations grow over time under favorable conditions. These models assume that the growth rate is proportional to the current population, leading to continuous and compounding increases.The model expresses the population as a function of time, combining the initial population with a growth factor raised to an exponent involving the growth rate and time. To estimate how long it takes for a population to reach a specific...
    Exponents01:30

    Exponents

    Exponents provide a compact and efficient way of representing repeated multiplication. These tools are fundamental to algebra and broader areas of mathematics, including scientific computation, scaling laws, and dimensional analysis.Exponent Rules and PropertiesExponential notation expresses the repeated multiplication of a number by itself. For any nonzero real number a and integer n, an represent a multiplied by itself n times. Key properties include: These properties allow for the...