Patents by Inventor Jonas KALLEN

Jonas KALLEN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11954456
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a: b]mod d for respective block positions a and b in x where b>a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M?1 modulo units of the logarithmic tree provide x[0: m]mod d for all m?{1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of [log2 M]; and more than M?2u of the subset of modulo units are arranged at the maximal delay of [log2 M], where 2u is the power of 2 immediately smaller than M.
    Type: Grant
    Filed: April 27, 2023
    Date of Patent: April 9, 2024
    Assignee: Imagination Technologies Limited
    Inventors: Jonas Kallen, Sam Elliott
  • Publication number: 20230297338
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a:b]mod d for respective block positions a and b in x where b > a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M - 1 modulo units of the logarithmic tree provide x[0: m]mod d for all m ? {1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of log2 M; and more than M - 2u of the subset of modulo units are arranged at the maximal delay of log2 M, where 2u is the power of 2 immediately smaller than M.
    Type: Application
    Filed: April 27, 2023
    Publication date: September 21, 2023
    Inventors: Jonas KALLEN, Sam ELLIOTT
  • Patent number: 11645042
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a:b]mod d for respective block positions a and b in x where b>a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M?1 modulo units of the logarithmic tree provide x[0:m]mod d for all m?{1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of ?log 2M?; and more than M?2u of the subset of modulo units are arranged at the maximal delay of ?log 2M?, where 2u is the power of 2 immediately smaller than M.
    Type: Grant
    Filed: December 9, 2021
    Date of Patent: May 9, 2023
    Assignee: Imagination Technologies Limited
    Inventors: Jonas Kallen, Sam Elliott
  • Patent number: 11294634
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a: b] mod d for respective block positions a and b in x where b>a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M?1 modulo units of the logarithmic tree provide x[0: m] mod d for all m?{1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of ?log2 M?; and more than M?2u of the subset of modulo units are arranged at the maximal delay of ?log2 M?, where 2u is the power of 2 immediately smaller than M.
    Type: Grant
    Filed: August 22, 2019
    Date of Patent: April 5, 2022
    Assignee: Imagination Technologies Limited
    Inventors: Jonas Källén, Sam Elliott
  • Publication number: 20220100471
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a:b]mod d for respective block positions a and b in x where b>a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M?1 modulo units of the logarithmic tree provide x[0:m]mod d for all m?{1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of ?log2 M?; and more than M?2u of the subset of modulo units are arranged at the maximal delay of ?log2 M?, where 2u is the power of 2 immediately smaller than M.
    Type: Application
    Filed: December 9, 2021
    Publication date: March 31, 2022
    Inventors: Jonas KALLEN, Sam ELLIOTT
  • Publication number: 20200065066
    Abstract: A binary logic circuit for determining the ratio x/d where x is a variable integer input, the binary logic circuit comprising: a logarithmic tree of modulo units each configured to calculate x[a: b] mod d for respective block positions a and b in x where b>a with the numbering of block positions increasing from the most significant bit of x up to the least significant bit of x, the modulo units being arranged such that a subset of M?1 modulo units of the logarithmic tree provide x[0: m] mod d for all m?{1, M}, and, on the basis that any given modulo unit introduces a delay of 1: all of the modulo units are arranged in the logarithmic tree within a delay envelope of ?log2 M?; and more than M?2u of the subset of modulo units are arranged at the maximal delay of ?log2 M?, where 2u is the power of 2 immediately smaller than M.
    Type: Application
    Filed: August 22, 2019
    Publication date: February 27, 2020
    Inventors: Jonas KÄLLÉN, Sam ELLIOTT