Patents by Inventor Michael Livshitz

Michael Livshitz 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).

  • Publication number: 20230236306
    Abstract: Methods, devices and instruction-carrying storage operate to track a target object over time and space. The tracking techniques involve obtaining a point cloud of reflection points at time n, a target from time n?1, state information including previous location information for the target and previous group distribution for previous reflection points associated with the target at time n?1; predicting a location of the target at time n based on the state information; determining a gate around the target and which of the multiple reflection points are within the gate; determining, for each of the multiple reflection points determined to be within the gate, a likelihood that the corresponding reflection point is associated with the target; determining current group distribution for the reflection points determined to likely be associated with the target; and outputting the determined current group distribution and current location information of the target.
    Type: Application
    Filed: March 28, 2023
    Publication date: July 27, 2023
    Inventors: Michael Livshitz, Mingjian Yan
  • Patent number: 11644560
    Abstract: Techniques for target tracking that include obtaining state information for a first target object, the state information including previous location information for the first target object and a previous group distribution for points associated with the first target object at a previous point in time, predicting a location for the first target object based on the obtained state information, receiving a first set of points, identifying a first distribution of points, from the first set of points based on the predicted location to associate one or more first points of the first distribution of points with the target object, determining a current group distribution for the points associated with the first target object, and outputting a current location information and a current group distribution point.
    Type: Grant
    Filed: June 24, 2020
    Date of Patent: May 9, 2023
    Assignee: Texas Instmments Incorporated
    Inventors: Michael Livshitz, Mingjian Yan
  • Publication number: 20220159672
    Abstract: Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.
    Type: Application
    Filed: November 22, 2021
    Publication date: May 19, 2022
    Inventors: Pierre Bertrand, Jing Jiang, Michael Livshitz
  • Publication number: 20210405178
    Abstract: Techniques for target tracking that include obtaining state information for a first target object, the state information including previous location information for the first target object and a previous group distribution for points associated with the first target object at a previous point in time, predicting a location for the first target object based on the obtained state information, receiving a first set of points, identifying a first distribution of points, from the first set of points based on the predicted location to associate one or more first points of the first distribution of points with the target object, determining a current group distribution for the points associated with the first target object, and outputting a current location information and a current group distribution point.
    Type: Application
    Filed: June 24, 2020
    Publication date: December 30, 2021
    Inventors: Michael LIVSHITZ, Mingjian YAN
  • Patent number: 11184905
    Abstract: Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.
    Type: Grant
    Filed: September 10, 2018
    Date of Patent: November 23, 2021
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Pierre Bertrand, Jing Jiang, Michael Livshitz
  • Publication number: 20190110306
    Abstract: Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.
    Type: Application
    Filed: September 10, 2018
    Publication date: April 11, 2019
    Inventors: Pierre Bertrand, Jing Jiang, Michael Livshitz
  • Patent number: 10075969
    Abstract: Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.
    Type: Grant
    Filed: April 25, 2012
    Date of Patent: September 11, 2018
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Pierre Bertrand, Jing Jiang, Michael Livshitz
  • Patent number: 9047069
    Abstract: A computer implemented method selects K extreme elements of a list of N elements by partitioning each of the N elements into a plurality of sections. For each section the method selects a threshold selection determining at least K extreme entries from the list. This iteratively compares a corresponding section to a section threshold, counts a number of sections which are more extreme than the section threshold, increasing (or decreasing) the section threshold if the count is greater than K and decreasing (or increasing) the section threshold if the count is less than K. The method forms a combined threshold by concatenation of said section thresholds in order, compares each of the N elements to the combined threshold, and selects at least K elements from the set of N elements more extreme than the combined threshold.
    Type: Grant
    Filed: April 12, 2012
    Date of Patent: June 2, 2015
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Constantin Bajenaru, Michael Livshitz, Mingjian Yan, Jing Jiang
  • Patent number: 8583980
    Abstract: Example methods are disclosed for decoding low-density parity-check (LDPC) encoded data, involving applying an expanded parity check matrix to generate decoded data, wherein ?1 represents an 81×81 all-zero square matrix, and any other integer, Sij, represents an 81×81 identity matrix circularly right shifted by a shift amount equal to Sij.
    Type: Grant
    Filed: September 14, 2012
    Date of Patent: November 12, 2013
    Assignee: Research In Motion Limited
    Inventor: Michael Livshitz
  • Publication number: 20130013973
    Abstract: Example methods are disclosed for decoding low-density parity-check (LDPC) encoded data, involving applying an expanded parity check matrix to generate decoded data, wherein ?1 represents an 81×81 all-zero square matrix, and any other integer, Sij, represents an 81×81 identity matrix circularly right shifted by a shift amount equal to Sij.
    Type: Application
    Filed: September 14, 2012
    Publication date: January 10, 2013
    Inventor: Michael Livshitz
  • Publication number: 20130013983
    Abstract: Example methods are disclosed for encoding variable sized data using a low-density parity-check (LDPC) code, and transporting the encoded variable sized data in modulated symbols. Example methods involve calculating a minimum number of modulated symbols capable of transmitting a data packet; selecting a codeword size suitable for transmitting the data packet; calculating a number of shortening Nshortened bits; and calculating a number of puncturing Npunctured bits, to thereby produce a shortened and punctured expanded parity check matrix for transmitting the data packet.
    Type: Application
    Filed: September 14, 2012
    Publication date: January 10, 2013
    Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
  • Publication number: 20130007419
    Abstract: A computer implemented method selects K extreme elements of a list of N elements by partitioning each of the N elements into a plurality of sections. For each section from a most significant section to a least significant section the method selects a threshold selection determining at least K extreme entries from the list. This iteratively compares a corresponding section to a section threshold, counts a number of sections which are more extreme than the section threshold, increasing (or decreasing) the section threshold if the count is greater than K and decreasing the section threshold if the count is less than K. After finding the section threshold for the corresponding section the method forms a combined threshold by concatenation of said section thresholds in order from a most significant section to a least significant section, compares each of the N elements to the combined threshold, and selects at least K elements from the set of N elements more extreme than the combined threshold.
    Type: Application
    Filed: April 12, 2012
    Publication date: January 3, 2013
    Applicant: Texas Instruments Incorporated
    Inventors: Constantin Bajenaru, Michael Livshitz, Mingjian Yan, Jing Jiang
  • Patent number: 8301975
    Abstract: A method for constructing a low-density parity-check (LDPC) code using a structured base parity check matrix with permutation matrix, pseudo-permutation matrix, or zero matrix as constituent sub-matrices; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for constructing a LDPC code using a structured base parity check matrix H=[Hd|Hp], Hd is the data portion, and Hp is the parity portion of the parity check matrix; the parity portion of the structured base parity check matrix is such so that when expanded, an inverse of the parity portion of the expanded parity check matrix is sparse; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for encoding variable sized data by using the expanded LDPC code; and applying shortening, puncturing.
    Type: Grant
    Filed: June 9, 2011
    Date of Patent: October 30, 2012
    Assignee: Research In Motion Limited
    Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
  • Publication number: 20120269143
    Abstract: Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.
    Type: Application
    Filed: April 25, 2012
    Publication date: October 25, 2012
    Applicant: Texas Instruments Incorporated
    Inventors: Pierre Bertrand, Jing Jiang, Michael Livshitz
  • Patent number: 8291289
    Abstract: Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.
    Type: Grant
    Filed: January 9, 2012
    Date of Patent: October 16, 2012
    Assignee: Research In Motion Limited
    Inventor: Michael Livshitz
  • Publication number: 20120117440
    Abstract: Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.
    Type: Application
    Filed: January 9, 2012
    Publication date: May 10, 2012
    Applicant: ROCKSTAR BIDCO, LP
    Inventor: Michael LIVSHITZ
  • Patent number: 8099646
    Abstract: Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.
    Type: Grant
    Filed: January 10, 2011
    Date of Patent: January 17, 2012
    Assignee: Nortel Networks Limited
    Inventor: Michael Livshitz
  • Patent number: RE46692
    Abstract: A method for constructing a low-density parity-check (LDPC) code using a structured base parity check matrix with permutation matrix, pseudo-permutation matrix, or zero matrix as constituent sub-matrices; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for constructing a LDPC code using a structured base parity check matrix H=[Hd|Hp], Hd is the data portion, and Hp is the parity portion of the parity check matrix; the parity portion of the structured base parity check matrix is such so that when expanded, an inverse of the parity portion of the expanded parity check matrix is sparse; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for encoding variable sized data by using the expanded LDPC code; and applying shortening, puncturing.
    Type: Grant
    Filed: October 29, 2014
    Date of Patent: January 30, 2018
    Assignee: BlackBerry Limited
    Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
  • Patent number: RE48212
    Abstract: A method for constructing a low-density parity-check (LDPC) code using a structured base parity check matrix with permutation matrix, pseudo-permutation matrix, or zero matrix as constituent sub-matrices; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for constructing a LDPC code using a structured base parity check matrix H=[Hd|Hp], Hd is the data portion, and Hp is the parity portion of the parity check matrix; the parity portion of the structured base parity check matrix is such so that when expanded, an inverse of the parity portion of the expanded parity check matrix is sparse; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for encoding variable sized data by using the expanded LDPC code; and applying shortening, puncturing.
    Type: Grant
    Filed: December 11, 2017
    Date of Patent: September 15, 2020
    Assignee: BlackBerry Limited
    Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
  • Patent number: RE49225
    Abstract: A method for constructing a low-density parity-check (LDPC) code using a structured base parity check matrix with permutation matrix, pseudo-permutation matrix, or zero matrix as constituent sub-matrices; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for constructing a LDPC code using a structured base parity check matrix H=[Hd|Hp], Hd is the data portion, and Hp is the parity portion of the parity check matrix; the parity portion of the structured base parity check matrix is such so that when expanded, an inverse of the parity portion of the expanded parity check matrix is sparse; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for encoding variable sized data by using the expanded LDPC code; and applying shortening, puncturing. System and method for operating a wireless device to encode data using low-density parity-check (LDPC) encoding is discussed.
    Type: Grant
    Filed: July 24, 2020
    Date of Patent: September 27, 2022
    Assignee: BlackBerry Limited
    Inventors: Michael Livshitz, Aleksandar Purkovic, Nina K. Burns, Sergey Sukhobok, Muhammad Chaudhry