18277651. EFFICIENT COMPUTATION OF A SHARED EXPONENT simplified abstract (Nokia Solutions and Networks Oy)

From WikiPatents
Jump to navigation Jump to search

EFFICIENT COMPUTATION OF A SHARED EXPONENT

Organization Name

Nokia Solutions and Networks Oy

Inventor(s)

Mihaela Andreea Jivanescu of Bierbeek (BE)

Manil Dev Gomony of Antwerp (BE)

Roberto Airoldi of Espoo (FI)

Marko Timo Juhani Kangas of Ylojarvi (FI)

EFFICIENT COMPUTATION OF A SHARED EXPONENT - A simplified explanation of the abstract

This abstract first appeared for US patent application 18277651 titled 'EFFICIENT COMPUTATION OF A SHARED EXPONENT

The patent application relates to the computation of a shared exponent for numbers using bitwise operations.

  • Plurality of bit vectors are obtained.
  • Bitwise OR-operation is performed on the bit vectors to obtain an auxiliary bit vector.
  • Shared exponent is determined based on the position of the most significant bit with a value of one in the auxiliary bit vector.
  • Representation for the bit vectors is determined based on the shared exponent.
    • Key Features and Innovation:**
  • Computation of a shared exponent for numbers.
  • Efficient bitwise operations to determine the shared exponent.
  • Simplified representation of bit vectors based on the shared exponent.
    • Potential Applications:**
  • Cryptography
  • Data compression
  • Signal processing
    • Problems Solved:**
  • Efficient computation of shared exponents for numbers.
  • Simplified representation of bit vectors.
    • Benefits:**
  • Improved computational efficiency.
  • Simplified representation of data.
  • Enhanced data processing capabilities.
    • Commercial Applications:**
  • Secure communication systems
  • Data storage solutions
  • Image and video processing applications
    • Prior Art:**

Prior art related to this technology can be found in the field of numerical computation and data processing algorithms.

    • Frequently Updated Research:**

Research on efficient algorithms for computing shared exponents and bitwise operations is ongoing in the field of computer science and mathematics.

    • Questions about Shared Exponent Computation:**

1. How does the computation of a shared exponent improve numerical calculations? 2. What are the potential limitations of using shared exponents in data processing algorithms?


Original Abstract Submitted

Various example embodiments relate to computation of a shared exponent for numbers. A plurality of bit vectors may be obtained. A bitwise OR-operation may be performed for the plurality of bit vectors to obtain an auxiliary bit vector. The shared exponent may be then determined based on a position of a most significant bit having value equal to one in the auxiliary bit vector. The representation for the plurality of bit vectors may be then determined based on the shared exponent. Apparatuses, methods, and computer programs are disclosed.