Patents by Inventor Tal Shalev

Tal Shalev 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: 10512048
    Abstract: A system and method for cell synchronization suitable for a wireless signal including substantially identical synchronization signals that repeat in predetermined time intervals, the synchronization signals including a plurality of substantially identical symbols.
    Type: Grant
    Filed: July 24, 2017
    Date of Patent: December 17, 2019
    Assignee: Ceva D.S.P Ltd.
    Inventors: Omri Isaacs, Zeev Kaplan, Tal Shalev
  • Publication number: 20190028982
    Abstract: A system and method for cell synchronization suitable for a wireless signal including substantially identical synchronization signals that repeat in predetermined time intervals, the synchronization signals including a plurality of substantially identical symbols.
    Type: Application
    Filed: July 24, 2017
    Publication date: January 24, 2019
    Applicant: Ceva D.S.P. Ltd.
    Inventors: Omri ISAACS, Zeev KAPLAN, Tal SHALEV
  • Patent number: 9036555
    Abstract: A method includes accepting input values u and v, respectively identifying a uth root Zadoff-Chu sequence whose length is a prime number, and a vth cyclic shift for the sequence. Elements of a Discrete Fourier Transform (DFT) of the vth cyclic shift of the uth root Zadoff-Chu sequence are computed using processing circuitry, by evaluating a single respective exponent depending on u and v in computing each of the elements.
    Type: Grant
    Filed: May 2, 2013
    Date of Patent: May 19, 2015
    Assignee: MARVELL WORLD TRADE LTD
    Inventors: Tal Shalev, Ezer Melzer, Kobby Pick
  • Patent number: 8930965
    Abstract: A method includes, in a communication device, defining multiple state machines including states and respective state conditions that depend on a set of events. Relative priorities are defined, to be applied among the state machines in scheduling the state machines for execution in response to the events. The events are monitored and the state conditions are evaluated based on the monitored events. The state machines are executed based on the evaluated state conditions using a scheduling order that depends on the priorities.
    Type: Grant
    Filed: February 27, 2013
    Date of Patent: January 6, 2015
    Assignee: Marvell International Ltd
    Inventors: Tal Shalev, Ariel Pinhas
  • Publication number: 20130242869
    Abstract: A method includes accepting input values u and v, respectively identifying a uth root Zadoff-Chu sequence whose length is a prime number, and a vth cyclic shift for the sequence. Elements of a Discrete Fourier Transform (DFT) of the vth cyclic shift of the uth root Zadoff-Chu sequence are computed using processing circuitry, by evaluating a single respective exponent depending on u and v in computing each of the elements.
    Type: Application
    Filed: May 2, 2013
    Publication date: September 19, 2013
    Applicant: Marvell World Trade Ltd.
    Inventors: Tal Shalev, Ezer Melzer, Kobby Pick
  • Patent number: 8442129
    Abstract: A method includes accepting input values u and v, respectively identifying a uth root Zadoff-Chu sequence whose length is a prime number, and a vth cyclic shift for the sequence. Elements of a Discrete Fourier Transform (DFT) of the vth cyclic shift of the uth root Zadoff-Chu sequence are computed using processing circuitry, by evaluating a single respective exponent depending on u and v in computing each of the elements.
    Type: Grant
    Filed: September 8, 2010
    Date of Patent: May 14, 2013
    Assignee: Marvell World Trade Ltd.
    Inventors: Tal Shalev, Ezer Melzer, Kobby Pick
  • Publication number: 20110129021
    Abstract: A method includes accepting input values u and v, respectively identifying a uth root Zadoff-Chu sequence whose length is a prime number, and a vth cyclic shift for the sequence. Elements of a Discrete Fourier Transform (DFT) of the vth cyclic shift of the uth root Zadoff-Chu sequence are computed using processing circuitry, by evaluating a single respective exponent depending on u and v in computing each of the elements.
    Type: Application
    Filed: September 8, 2010
    Publication date: June 2, 2011
    Inventors: Tal Shalev, Ezer Melzer, Kobby Pick