Patents by Inventor Pavel Anatolyevich Panteleev

Pavel Anatolyevich Panteleev 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: 20200412480
    Abstract: A method for generating a code, a method for encoding and decoding data, and an encoder and a decoder performing the encoding and decoding are disclosed. In an embodiment, a method for lifting a child code from a base code for encoding and decoding data includes determining a single combination of a circulant size, a lifting function, and a labelled base matrix PCM according to an information length and a code rate using data stored in a lifting table. The lifting table was defined at a code generation stage. The method also includes calculating a plurality of shifts for the child code. Each shift is calculated by applying the lifting function to the labelled base matrix PCM with a defined index using the circulant size and using the derived child PCM to encode or decode data.
    Type: Application
    Filed: June 11, 2020
    Publication date: December 31, 2020
    Inventors: Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Pavel Anatolyevich Panteleev, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy, Wen Tong, Carmela Cozzo
  • Patent number: 10862626
    Abstract: A method for generating a code, a method for encoding and decoding data, and an encoder and a decoder performing the encoding and decoding are disclosed. In an embodiment, a method for lifting a child code from a base code for encoding and decoding data includes determining a single combination of a circulant size, a lifting function, and a labelled base matrix PCM according to an information length and a code rate using data stored in a lifting table. The lifting table was defined at a code generation stage. The method also includes calculating a plurality of shifts for the child code. Each shift is calculated by applying the lifting function to the labelled base matrix PCM with a defined index using the circulant size and using the derived child PCM to encode or decode data.
    Type: Grant
    Filed: August 30, 2019
    Date of Patent: December 8, 2020
    Assignee: Futurewei Technologies, Inc.
    Inventors: Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Pavel Anatolyevich Panteleev, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy, Wen Tong, Carmela Cozzo
  • Patent number: 10735138
    Abstract: A method for generating a code, a method for encoding and decoding data, and an encoder and a decoder performing the encoding and decoding are disclosed. In an embodiment, a method for lifting a child code from a base code for encoding and decoding data includes determining a single combination of a circulant size, a lifting function, and a labelled base matrix PCM according to an information length and a code rate using data stored in a lifting table. The lifting table was defined at a code generation stage. The method also includes calculating a plurality of shifts for the child code. Each shift is calculated by applying the lifting function to the labelled base matrix PCM with a defined index using the circulant size and using the derived child PCM to encode or decode data.
    Type: Grant
    Filed: May 1, 2018
    Date of Patent: August 4, 2020
    Assignee: Futurewei Technologies, Inc.
    Inventors: Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Pavel Anatolyevich Panteleev, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy, Wen Tong, Carmela Cozzo
  • Publication number: 20200162107
    Abstract: Certain aspects of the present disclosure provide an efficiently decodable QC-LDPC code which is based on a base matrix, the base matrix being formed by columns and rows, the columns being dividable into one or more columns corresponding to punctured variable nodes and columns corresponding to non-punctured variable nodes. Apparatus at a transmitting side includes a encoder configured to encode a sequence of information bits based on the base matrix. Apparatus at a receiving side configured to receive a codeword in accordance with a radio technology across a wireless channel. The apparatus at the receiving side includes a decoder configured to decode the codeword based on the base matrix.
    Type: Application
    Filed: January 22, 2020
    Publication date: May 21, 2020
    Inventors: Yurii Sergeevich SHUTKIN, Pavel Anatolyevich PANTELEEV, Aleksey Alexandrovich LETUNOVSKIY, Elyar Eldarovich GASANOV, Gleb Vyacheslavovich KALACHEV, Ivan Leonidovich MAZURENKO
  • Patent number: 10594339
    Abstract: A method and system for offset lifting is provided. In an embodiment, a method for encoding data includes receiving a K-bit source word input. The method also includes encoding the K-bit source word input according to a LDPC code, a lifting function, and a circulant size offset to generate an N-bit code word output. The circulant size and lifting function are determined according to an information length, a code rate, and a decoder. The method also includes storing the N-bit code word output in input/output memory.
    Type: Grant
    Filed: February 2, 2018
    Date of Patent: March 17, 2020
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Pavel Anatolyevich Panteleev, Wen Tong, Jiang Li, Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy
  • Publication number: 20200067527
    Abstract: A method for generating a code, a method for encoding and decoding data, and an encoder and a decoder performing the encoding and decoding are disclosed. In an embodiment, a method for lifting a child code from a base code for encoding and decoding data includes determining a single combination of a circulant size, a lifting function, and a labelled base matrix PCM according to an information length and a code rate using data stored in a lifting table. The lifting table was defined at a code generation stage. The method also includes calculating a plurality of shifts for the child code.
    Type: Application
    Filed: August 30, 2019
    Publication date: February 27, 2020
    Inventors: Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Pavel Anatolyevich Panteleev, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy, Wen Tong, Carmela Cozzo
  • Patent number: 10567002
    Abstract: Certain aspects of the present disclosure provide an efficiently decodable QC-LDPC code which is based on a base matrix, the base matrix being formed by columns and rows, the columns being dividable into one or more columns corresponding to punctured variable nodes and columns corresponding to non-punctured variable nodes. Apparatus at a transmitting side includes a encoder configured to encode a sequence of information bits based on the base matrix. Apparatus at a receiving side configured to receive a codeword in accordance with a radio technology across a wireless channel. The apparatus at the receiving side includes a decoder configured to decode the codeword based on the base matrix.
    Type: Grant
    Filed: May 1, 2019
    Date of Patent: February 18, 2020
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Yurii Sergeevich Shutkin, Pavel Anatolyevich Panteleev, Aleksey Alexandrovich Letunovskiy, Elyar Eldarovich Gasanov, Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko
  • Publication number: 20190334559
    Abstract: Provided is a base matrix of a rate-adaptive irregular QC-LDPC code, the base matrix being formed by columns and rows having entries representing circulant submatrices. The columns of the base matrix are divided into at least one or more higher weight first columns and lower weight second columns and the rows of the base matrix are divided into first high weight rows corresponding to the high rate mother code and second low weight rows corresponding to the extension part related to the lower rate codes. A first submatrix formed by an intersection of entries of the second columns and entries of the first and the second rows is divided into first quadratic submatrices, wherein at most one entry in each column of each first submatrix and/or at most one entry in each row of each first submatrix is labelled.
    Type: Application
    Filed: July 9, 2019
    Publication date: October 31, 2019
    Inventors: Pavel Anatolyevich PANTELEEV, Gleb Vyacheslavovich KALACHEV, Ivan Leonidovich MAZURENKO, Elyar Eldarovich GASANOV, Yurii Sergeevich SHUTKIN
  • Publication number: 20190260390
    Abstract: Certain aspects of the present disclosure provide an efficiently decodable QC-LDPC code which is based on a base matrix, the base matrix being formed by columns and rows, the columns being dividable into one or more columns corresponding to punctured variable nodes and columns corresponding to non-punctured variable nodes. Apparatus at a transmitting side includes a encoder configured to encode a sequence of information bits based on the base matrix. Apparatus at a receiving side configured to receive a codeword in accordance with a radio technology across a wireless channel. The apparatus at the receiving side includes a decoder configured to decode the codeword based on the base matrix.
    Type: Application
    Filed: May 1, 2019
    Publication date: August 22, 2019
    Inventors: Yurii Sergeevich SHUTKIN, Pavel Anatolyevich PANTELEEV, Aleksey Alexandrovich LETUNOVSKIY, Elyar Eldarovich GASANOV, Gleb Vyacheslavovich KALACHEV, Ivan Leonidovich MAZURENKO
  • Publication number: 20180323802
    Abstract: A method for generating a code, a method for encoding and decoding data, and an encoder and a decoder performing the encoding and decoding are disclosed. In an embodiment, a method for lifting a child code from a base code for encoding and decoding data includes determining a single combination of a circulant size, a lifting function, and a labelled base matrix PCM according to an information length and a code rate using data stored in a lifting table. The lifting table was defined at a code generation stage. The method also includes calculating a plurality of shifts for the child code. Each shift is calculated by applying the lifting function to the labelled base matrix PCM with a defined index using the circulant size and using the derived child PCM to encode or decode data.
    Type: Application
    Filed: May 1, 2018
    Publication date: November 8, 2018
    Inventors: Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Pavel Anatolyevich Panteleev, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy, Wen Tong, Carmela Cozzo
  • Publication number: 20180226992
    Abstract: A method and system for offset lifting is provided. In an embodiment, a method for encoding data includes receiving a K-bit source word input. The method also includes encoding the K-bit source word input according to a LDPC code, a lifting function, and a circulant size offset to generate an N-bit code word output. The circulant size and lifting function are determined according to an information length, a code rate, and a decoder. The method also includes storing the N-bit code word output in input/output memory.
    Type: Application
    Filed: February 2, 2018
    Publication date: August 9, 2018
    Inventors: Pavel Anatolyevich Panteleev, Wen Tong, Jiang Li, Gleb Vyacheslavovich Kalachev, Ivan Leonidovich Mazurenko, Elyar Eldarovich Gasanov, Aleksey Alexandrovich Letunovskiy
  • Patent number: 9337866
    Abstract: A receiver configured for use in a communication system, such as a magnetic recording channel, and having a soft-output channel detector provided with a soft-input/soft-output (SISO) modulation codec for parity bits of a block error-correction code. A transmitter of the communication system is configured to encode data by applying a modulation code to the parity bits that have been generated using the block error-correction code. The SISO modulation codec provides an interface between the soft-output channel detector and a parity-check decoder that enables decoding iterations between them in a manner that takes into account inter-bit correlations imposed by the modulation code. In some embodiments, the soft-output channel detector is configured to operate at a fractional rate and to process an input signal carrying non-binary symbols, and the parity-check decoder is configured to apply parity-check-based decoding that is based on a non-binary low-density parity-check code.
    Type: Grant
    Filed: December 12, 2013
    Date of Patent: May 10, 2016
    Assignee: Avago Technologies General IP (Singapore) Pte. Ltd.
    Inventors: Elyar Eldarovich Gasanov, Pavel Anatolyevich Panteleev, Yurii Sergeevich Shutkin, Andrey Pavlovich Sokolov, Ilya Vladimirovich Neznanov
  • Patent number: 8923315
    Abstract: A packet-router architecture in which buffer modules are interconnected by one or more interconnect fabrics and arranged to form a plurality of hierarchical buffer levels, with each higher buffer level having more buffer modules than a corresponding lower buffer level. An interconnect fabric is configured to connect three or more respective buffer modules, with one of these buffer modules belonging to one buffer level and the other two or more buffer modules belonging to a next higher buffer level. A buffer module is configured to implement a packet queue that (i) enqueues received packets at the end of the queue in the order of their arrival to the buffer module, (ii) dequeues packets from the head of the queue, and (iii) advances packets toward the head of the queue when the buffer module transmits one or more packets to the higher buffer level or to a respective set of output ports connected to the buffer module.
    Type: Grant
    Filed: February 26, 2013
    Date of Patent: December 30, 2014
    Assignee: LSI Corporation
    Inventors: Pavel Aleksandrovich Aliseychik, Elyar Eldarovich Gasanov, Ilya Vladimirovich Neznanov, Pavel Anatolyevich Panteleev, Andrey Pavlovich Sokolov
  • Publication number: 20140359394
    Abstract: A receiver configured for use in a communication system, such as a magnetic recording channel, and having a soft-output channel detector provided with a soft-input/soft-output (SISO) modulation codec for parity bits of a block error-correction code. A transmitter of the communication system is configured to encode data by applying a modulation code to the parity bits that have been generated using the block error-correction code. The SISO modulation codec provides an interface between the soft-output channel detector and a parity-check decoder that enables decoding iterations between them in a manner that takes into account inter-bit correlations imposed by the modulation code. In some embodiments, the soft-output channel detector is configured to operate at a fractional rate and to process an input signal carrying non-binary symbols, and the parity-check decoder is configured to apply parity-check-based decoding that is based on a non-binary low-density parity-check code.
    Type: Application
    Filed: December 12, 2013
    Publication date: December 4, 2014
    Applicant: LSI CORPORATION
    Inventors: Elyar Eldarovich Gasanov, Pavel Anatolyevich Panteleev, Yurii Sergeevich Shutkin, Andrey Pavlovich Sokolov, Ilya Vladimirovich Neznanov
  • Publication number: 20140164876
    Abstract: A communication system, such as a magnetic recording channel, configured to apply modulation coding to parity bits of a block error-correction code. An embodiment of the communication system may have a transmitter having two different modulation encoders, one configured to apply a first modulation code to information bits and the other configured to apply a second modulation code to the parity bits that have been generated from the information bits using a block error-correction code. Alternatively or in addition, an embodiment of the communication system may have a receiver that incorporates a soft modulation codec configured to use the second modulation code in the log-likelihood-ratio space to enable decoding iterations between a sequence detector and a parity-check decoder.
    Type: Application
    Filed: July 18, 2013
    Publication date: June 12, 2014
    Inventors: Elyar Eldarovich Gasanov, Pavel Anatolyevich Panteleev, Yurii Sergeevich Shutkin, Andrey Pavlovich Sokolov, Ilya Vladimirovich Neznanov
  • Publication number: 20140023085
    Abstract: A packet-router architecture in which buffer modules are interconnected by one or more interconnect fabrics and arranged to form a plurality of hierarchical buffer levels, with each higher buffer level having more buffer modules than a corresponding lower buffer level. An interconnect fabric is configured to connect three or more respective buffer modules, with one of these buffer modules belonging to one buffer level and the other two or more buffer modules belonging to a next higher buffer level. A buffer module is configured to implement a packet queue that (i) enqueues received packets at the end of the queue in the order of their arrival to the buffer module, (ii) dequeues packets from the head of the queue, and (iii) advances packets toward the head of the queue when the buffer module transmits one or more packets to the higher buffer level or to a respective set of output ports connected to the buffer module.
    Type: Application
    Filed: February 26, 2013
    Publication date: January 23, 2014
    Applicant: LSI Corporation
    Inventors: Pavel Aleksandrovich Aliseychik, Elyar Eldarovich Gasanov, Ilya Vladimirovich Neznanov, Pavel Anatolyevich Panteleev, Andrey Pavlovich Sokolov