Patents by Inventor Sergey Sukhobok
Sergey Sukhobok 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: 10278113Abstract: In a self-organizing wireless multihop network, each node device selects operation among short-range (SR) and long-range (LR) communication modes, among which the SR mode uses a higher data rate than the LR mode. Each node device advertises connectivity link availability for neighboring node devices, and selectively initiates a link in response to connectivity availability advertised by at least one neighboring node device. The availability advertising is performed in the SR and the LR communication modes, according to a periodicity that is dynamically-variable in response to prevailing circumstances in the local neighborhood. The link initiation is selectively performed in one of either the SR or the LR communication mode based on selection criteria that include data throughput performance associated with different neighboring node devices with which connectivity is available via a certain communication mode.Type: GrantFiled: June 27, 2017Date of Patent: April 30, 2019Assignee: Eaton Intelligent Power LimitedInventors: Roger K. Alexander, Jianming Yuan, Tzeta Tsao, Sergey Sukhobok
-
Patent number: 10070402Abstract: Systems and methods for performing predictive frequency searches in ad-hoc multi-hop wireless networks is described herein. In one exemplary embodiment, a predicted frequency is selected and a synchronization request is sent from an initiating node to a target node on the predicted frequency. If the transmitted synchronization request is the last synchronization request for the predictive frequency search mode sequence, then the initiating node enters into a receiving mode to receive a synchronization response message from the target node. If not, the initiating node selects a new predicted frequency, and sends a new synchronization request to the target node on that frequency. This repeats until the transmitted synchronization request is the last predictive synchronization request, and the initiating node enters into the receiving mode. The initiating node in the selection of synchronization request transmission frequencies can adaptively alternate between predictive and full spectrum frequency searches.Type: GrantFiled: September 28, 2015Date of Patent: September 4, 2018Assignee: EATON INTELLIGENT POWER LIMITEDInventors: Roger Kirk Alexander, Sergey Sukhobok
-
Publication number: 20170367029Abstract: In a self-organizing wireless multihop network, each node device selects operation among short-range (SR) and long-range (LR) communication modes, among which the SR mode uses a higher data rate than the LR mode. Each node device advertises connectivity link availability for neighboring node devices, and selectively initiates a link in response to connectivity availability advertised by at least one neighboring node device. The availability advertising is performed in the SR and the LR communication modes, according to a periodicity that is dynamically-variable in response to prevailing circumstances in the local neighborhood. The link initiation is selectively performed in one of either the SR or the LR communication mode based on selection criteria that include data throughput performance associated with different neighboring node devices with which connectivity is available via a certain communication mode.Type: ApplicationFiled: June 27, 2017Publication date: December 21, 2017Inventors: Roger K. Alexander, Jianming Yuan, Tzeta Tsao, Sergey Sukhobok
-
Patent number: 9699708Abstract: In a self-organizing wireless multihop network, each node device selects operation among short-range (SR) and long-range (LR) communication modes, among which the SR mode uses a higher data rate than the LR mode. Each node device advertises connectivity link availability for neighboring node devices, and selectively initiates a link in response to connectivity availability advertised by at least one neighboring node device. The availability advertising is performed in the SR and the LR communication modes, according to a periodicity that is dynamically-variable in response to prevailing circumstances in the local neighborhood. The link initiation is selectively performed in one of either the SR or the LR communication mode based on selection criteria that include data throughput performance associated with different neighboring node devices with which connectivity is available via a certain communication mode.Type: GrantFiled: January 17, 2014Date of Patent: July 4, 2017Assignee: Cooper Technologies CompanyInventors: Roger K. Alexander, Jianming Yuan, Tzeta Tsao, Sergey Sukhobok
-
Publication number: 20160165557Abstract: Systems and methods for performing predictive frequency searches in ad-hoc multi-hop wireless networks is described herein. In one exemplary embodiment, a predicted frequency is selected and a synchronization request is sent from an initiating node to a target node on the predicted frequency. If the transmitted synchronization request is the last synchronization request for the predictive frequency search mode sequence, then the initiating node enters into a receiving mode to receive a synchronization response message from the target node. If not, the initiating node selects a new predicted frequency, and sends a new synchronization request to the target node on that frequency. This repeats until the transmitted synchronization request is the last predictive synchronization request, and the initiating node enters into the receiving mode. The initiating node in the selection of synchronization request transmission frequencies can adaptively alternate between predictive and full spectrum frequency searches.Type: ApplicationFiled: September 28, 2015Publication date: June 9, 2016Applicant: COOPER TECHNOLOGIES COMPANYInventors: ROGER KIRK ALEXANDER, SERGEY SUKHOBOK
-
Patent number: 9237024Abstract: In a wireless multihop network having node devices within communication range neighboring node devices in a corresponding local neighborhood, the node devices generate visibility messages to be transmitted via connection-less broadcast. The visibility messages include at least an identifier of the corresponding node device. Visibility messages received by each of the node devices from the one or more neighboring node devices are processed to determine a measure of density of the local neighborhood. This measure of density also accounts for the heterogeneous transmit power capabilities of node devices and is used for updating of one or more operational parameter of the node device relating to utilization of the radio communications medium by that node device. A degree of utilization of the medium through the control of transmission data rate and power is adjusted based on an inverse relation to the measure of density determined from the received visibility messages.Type: GrantFiled: March 15, 2013Date of Patent: January 12, 2016Assignee: Cooper Technologies CompanyInventors: Roger Alexander, Shashikant Chowdhary, Steven Baigal, Sergey Sukhobok, Sharif M. Redwan Siddiqui, Shravan Rangaraju
-
Publication number: 20150208320Abstract: In a self-organizing wireless multihop network, each node device selects operation among short-range (SR) and long-range (LR) communication modes, among which the SR mode uses a higher data rate than the LR mode. Each node device advertises connectivity link availability for neighboring node devices, and selectively initiates a link in response to connectivity availability advertised by at least one neighboring node device. The availability advertising is performed in the SR and the LR communication modes, according to a periodicity that is dynamically-variable in response to prevailing circumstances in the local neighborhood. The link initiation is selectively performed in one of either the SR or the LR communication mode based on selection criteria that include data throughput performance associated with different neighboring node devices with which connectivity is available via a certain communication mode.Type: ApplicationFiled: January 17, 2014Publication date: July 23, 2015Inventors: Roger K. Alexander, Jianming Yuan, Tzeta Tsao, Sergey Sukhobok
-
Publication number: 20130013983Abstract: 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: ApplicationFiled: September 14, 2012Publication date: January 10, 2013Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Patent number: 8301975Abstract: 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: GrantFiled: June 9, 2011Date of Patent: October 30, 2012Assignee: Research In Motion LimitedInventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Publication number: 20110307755Abstract: 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: ApplicationFiled: June 9, 2011Publication date: December 15, 2011Applicants: NORTEL NETWORKS INC., NORTEL NETWORKS LIMITEDInventors: Michael LIVSHITZ, Aleksandar PURKOVIC, Nina BURNS, Sergey SUKHOBOK, Muhammad CHAUDHRY
-
Patent number: 8024641Abstract: 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: GrantFiled: February 12, 2010Date of Patent: September 20, 2011Assignees: Nortel Networks Limited, Nortel Networks Inc.Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Patent number: 7996746Abstract: 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: GrantFiled: October 12, 2005Date of Patent: August 9, 2011Assignees: Nortel Networks Limited, Nortel Networks Inc.Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Publication number: 20100211847Abstract: 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: ApplicationFiled: February 12, 2010Publication date: August 19, 2010Applicant: NORTEL NETWORKS LIMITEDInventors: MICHAEL LIVSHITZ, ALEKSANDAR PURKOVIC, NINA BURNS, SERGEY SUKHOBOK, MUHAMMAD CHAUDHRY
-
Publication number: 20090259915Abstract: The invention introduces an apparatus, method and system that allow coding matrices to be expanded to accommodate various information packet sizes and support for various code rates; additionally the invention defines a number of coding matrices particularly suited to the methodology. The invention enables high throughput implementations, allows achieving low latency, and offers other numerous implementation benefits. At the same time, the new parity part of the matrix preserves the simple (recursive) encoding feature.Type: ApplicationFiled: October 12, 2005Publication date: October 15, 2009Inventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Patent number: 7260763Abstract: A higher code rate Low-Density Parity Check (LDPC) matrix may be designed by concatenating additional matrices to a ?-rotation parity check matrix. The concatenated matrix may be selected such that the resultant LDPC matrix exhibits good expansion characteristics to enable the LDPC matrix to be used with variable block length codes. The codes may be designed by generating an ensemble of available codes, encoding them with information vectors of weight 1 and 2 and discarding codes with a low minimum distance. The approximate upper bounds for the remaining codes are then calculated and a small set of codes with the lowest bound under high signal to noise ratio is selected. The girth distributions for the remaining codes are then calculated and the code that has the minimum number of short cycles is selected. The selected code is concatenated to the original ?-rotation parity check matrix.Type: GrantFiled: March 11, 2004Date of Patent: August 21, 2007Assignee: Nortel Networks LimitedInventors: Sergey Sukhobok, Nina Burns, Aleksandar Purkovic
-
Publication number: 20050204253Abstract: A higher code rate Low-Density Parity Check (LDPC) matrix may be designed by concatenating additional matrices to a ?-rotation parity check matrix. The concatenated matrix may be selected such that the resultant LDPC matrix exhibits good expansion characteristics to enable the LDPC matrix to be used with variable block length codes. The codes may be designed by generating an ensemble of available codes, encoding them with information vectors of weight 1 and 2 and discarding codes with a low minimum distance. The approximate upper bounds for the remaining codes are then calculated and a small set of codes with the lowest bound under high signal to noise ratio is selected. The girth distributions for the remaining codes are then calculated and the code that has the minimum number of short cycles is selected. The selected code is concatenated to the original v-rotation parity check matrix.Type: ApplicationFiled: March 11, 2004Publication date: September 15, 2005Applicant: Nortel Networks LimitedInventors: Sergey Sukhobok, Nina Burns, Aleksandar Purkovic
-
Patent number: RE46692Abstract: 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: GrantFiled: October 29, 2014Date of Patent: January 30, 2018Assignee: BlackBerry LimitedInventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Patent number: RE48212Abstract: 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: GrantFiled: December 11, 2017Date of Patent: September 15, 2020Assignee: BlackBerry LimitedInventors: Michael Livshitz, Aleksandar Purkovic, Nina Burns, Sergey Sukhobok, Muhammad Chaudhry
-
Patent number: RE49225Abstract: 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: GrantFiled: July 24, 2020Date of Patent: September 27, 2022Assignee: BlackBerry LimitedInventors: Michael Livshitz, Aleksandar Purkovic, Nina K. Burns, Sergey Sukhobok, Muhammad Chaudhry