Patents by Inventor Vladimir GRITSENKO

Vladimir GRITSENKO 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: 11239945
    Abstract: A polar code encoding/decoding method in a communications system is provided, including: determining an information bit location set or a frozen bit location set of a polar code based on an interleaving operation or a corresponding de-interleaving operation; and encoding or decoding the polar code based on the determined information bit location set or frozen bit location set.
    Type: Grant
    Filed: September 27, 2019
    Date of Patent: February 1, 2022
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Aleksei Eduardovich Maevskii, Vladimir Gritsenko, Jian Wang, Hejia Luo, Gongzheng Zhang, Jie Jin
  • Patent number: 11190213
    Abstract: A coding method, a wireless device, and a chip are described. A coding method may include obtaining, based on a sequence whose length is 2n?, a mother code sequence used for coding, where the sequence whose length is 2n? includes 2n? sequence numbers, a length of the mother code sequence is 2n, the mother code sequence includes 2n sequence numbers, the 2n sequence numbers are some or all of the 2n? sequence numbers, n? is a natural number, and n is a natural number less than or equal to n?. The method may also include coding an input to-be-coded bit by using the mother code sequence. According to this method, a system may store one or more long sequences, and then obtain a required mother code sequence from one of the long sequences according to a coding requirement, thereby reducing storage overheads of the system.
    Type: Grant
    Filed: November 20, 2019
    Date of Patent: November 30, 2021
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Aleksei Eduardovich Maevskii, Vladimir Gritsenko, Yunfei Qiao, Jian Wang, Chaolong Zhang
  • Patent number: 11133828
    Abstract: A method comprises: obtaining a coded bit sequence by performing PC-polar coding on information bits based on first constructor parameters; and sending the coded bit sequence. A check equation of the first constructor parameters includes a first element representing a check-required information bit position and a second element representing a check bit position, the first element corresponds to a first vector (V1) in a generator matrix for PC-polar codes, the second element corresponds to a second vector (V2) in the generator matrix, and if a first Hamming weight (HW1) of V1 is the same as a second Hamming weight (HW2) of V2, then a third Hamming weight (HW3) of an addition modulo 2 vector is greater than HW1 and greater than HW2, or if HW1 is different from HW2, then HW3 is greater than a smaller one of the HW1 and HW2.
    Type: Grant
    Filed: July 1, 2019
    Date of Patent: September 28, 2021
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Huazi Zhang, Jun Wang, Rong Li, Lingchen Huang, Jian Wang, Shengchen Dai, Jiajie Tong, Vladimir Gritsenko, Oleg Feat'evich Kurmaev, Aleksei Eduardovich Maevskii
  • Patent number: 10965399
    Abstract: Method and apparatus for transmission and reception with polar codes are provided to support up to 16 permutations or transformation mappings. For example, 16 versions of copies able to be soft-combined for PBCH or any other data channel or control channel are suggested if the mother code length is 256 or 512 or 1024. With the new design, up to 16 different versions can be used to soft combined to improve the performance. Some sequences are provided as examples to support 16 different permutation patterns. The inverse of these sequences also have the feature to support 16 different permutation patterns.
    Type: Grant
    Filed: May 28, 2019
    Date of Patent: March 30, 2021
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Vladimir Gritsenko, Aleksei Eduardovich Maevskii, Hejia Luo, Rong Li, Jun Wang
  • Patent number: 10879937
    Abstract: An HC of a code B is first transformed into an HB. A parity bit of the code B is obtained by performing an operation on the HB and an information bit of the code B. The parity bit is used to perform RS coding on a code A, to obtain a parity bit of the code A. A check code of a GEL code is obtained by performing an operation on the parity bits of the code B and the code A. Finally, a single bit parity check bit is added. The code A is defined in a finite field GF (2l1), the code B is defined in a finite field GF (2l2), and l1 and l2 are positive integers. A success rate of decoding the code A in the first row can be improved using this method.
    Type: Grant
    Filed: October 24, 2018
    Date of Patent: December 29, 2020
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Aleksei Eduardovich Maevskii, Vladimir Gritsenko, Shiyao Xiao, Hong Chen
  • Patent number: 10826532
    Abstract: A method to explicitly indicate the version information while still supporting soft combining is disclosed. A polar code encoder maps q bits to q positions of q sub-channels, q is a positive integer; wherein the q bits are used to indicate a version of encoded codeword; map 1 to a special frozen bit corresponding to the q bits; map K?q information bits to K?q positions for the K?q information bits, K is an integer, K>q; and perform polar encoding over an input vector u0N-1, comprising the q bits, the special frozen bit and the K?q information bits, with the length of N, N is an integer, N>=K. With this method, there is no need to make blind detection to achieve the version information of transmitted payload, which reduces power consumption for a receiver.
    Type: Grant
    Filed: April 12, 2019
    Date of Patent: November 3, 2020
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Vladimir Gritsenko, Aleksei Eduardovich Maevskii, Hejia Luo, Jian Wang, Rong Li
  • Publication number: 20200091935
    Abstract: A coding method, a wireless device, and a chip are described. A coding method may include obtaining, based on a sequence whose length is 2n?, a mother code sequence used for coding, where the sequence whose length is 2n? includes 2n? sequence numbers, a length of the mother code sequence is 2n, the mother code sequence includes 2n sequence numbers, the 2n sequence numbers are some or all of the 2n? sequence numbers, n? is a natural number, and n is a natural number less than or equal to n?. The method may also include coding an input to-be-coded bit by using the mother code sequence. According to this method, a system may store one or more long sequences, and then obtain a required mother code sequence from one of the long sequences according to a coding requirement, thereby reducing storage overheads of the system.
    Type: Application
    Filed: November 20, 2019
    Publication date: March 19, 2020
    Inventors: Aleksei Eduardovich MAEVSKII, Vladimir GRITSENKO, Yunfei QIAO, Jian WANG, Chaolong ZHANG
  • Publication number: 20200028619
    Abstract: A polar code encoding/decoding method in a communications system is provided, including: determining an information bit location set or a frozen bit location set of a polar code based on an interleaving operation or a corresponding de-interleaving operation; and encoding or decoding the polar code based on the determined information bit location set or frozen bit location set.
    Type: Application
    Filed: September 27, 2019
    Publication date: January 23, 2020
    Inventors: Aleksei Eduardovich Maevskii, Vladimir Gritsenko, Jian Wang, Hejia Luo, Gongzheng Zhang, Jie Jin
  • Publication number: 20190326933
    Abstract: A method comprises: obtaining a coded bit sequence by performing PC-polar coding on information bits based on first constructor parameters; and sending the coded bit sequence. A check equation of the first constructor parameters includes a first element representing a check-required information bit position and a second element representing a check bit position, the first element corresponds to a first vector (V1) in a generator matrix for PC-polar codes, the second element corresponds to a second vector (V2) in the generator matrix, and if a first Hamming weight (HW1) of V1 is the same as a second Hamming weight (HW2) of V2, then a third Hamming weight (HW3) of an addition modulo 2 vector is greater than HW1 and greater than HW2, or if HW1 is different from HW2, then HW3 is greater than a smaller one of the HW1 and HW2.
    Type: Application
    Filed: July 1, 2019
    Publication date: October 24, 2019
    Inventors: Huazi ZHANG, Jun WANG, Rong Li, Lingchen HUANG, Jian WANG, Shengchen DAI, Jiajie TONG, Vladimir GRITSENKO, Oleg Feat'evich KURMAEV, Aleksei Eduardovich MAEVSKII
  • Publication number: 20190296857
    Abstract: Method and apparatus for transmission and reception with polar codes are provided to support up to 16 permutations or transformation mappings. For example, 16 versions of copies able to be soft-combined for PBCH or any other data channel or control channel are suggested if the mother code length is 256 or 512 or 1024. With the new design, up to 16 different versions can be used to soft combined to improve the performance. Some sequences are provided as examples to support 16 different permutation patterns. The inverse of these sequences also have the feature to support 16 different permutation patterns.
    Type: Application
    Filed: May 28, 2019
    Publication date: September 26, 2019
    Inventors: Vladimir GRITSENKO, Aleksei Eduardovich MAEVSKII, Hejia LUO, Rong LI, Jun WANG
  • Publication number: 20190238159
    Abstract: A method to explicitly indicate the version information while still supporting soft combining is disclosed. A polar code encoder maps q bits to q positions of q sub-channels, q is a positive integer; wherein the q bits are used to indicate a version of encoded codeword; map 1 to a special frozen bit corresponding to the q bits; map K?q information bits to K?q positions for the K?q information bits, K is an integer, K>q; and perform polar encoding over an input vector u0N?1, comprising the q bits, the special frozen bit and the K?q information bits, with the length of N, N is an integer, N>=K. With this method, there is no need to make blind detection to achieve the version information of transmitted payload, which reduces power consumption for a receiver.
    Type: Application
    Filed: April 12, 2019
    Publication date: August 1, 2019
    Inventors: Vladimir GRITSENKO, Aleksei Eduardovich MAEVSKII, Hejia LUO, Jian WANG, Rong LI
  • Publication number: 20190089381
    Abstract: Disclosed is a GEL codeword structure encoding method. The method includes: first transforming an HC of a code B into an HB; obtaining a parity bit of the code B by performing an operation on the HB and an information bit of the code B; using the parity bit to perform RS coding on a code A, to obtain a parity bit of the code A; then obtaining a check code of a GEL code by performing an operation on the parity bits of the code B and the code A; and finally adding a single bit parity check bit, where the code A is defined in a finite field GF (2l1), the code B is defined in a finite field GF (2l2), and 11 and 12 are positive integers. A success rate of decoding the code A in the first row can be improved using this method.
    Type: Application
    Filed: October 24, 2018
    Publication date: March 21, 2019
    Inventors: Aleksei MAEVSKII, Vladimir GRITSENKO, Shiyao XIAO, Hong CHEN
  • Patent number: 4500282
    Abstract: The disclosed burner guide vane device includes a housing with an inlet pipe and a cylindrical swirl chamber having equidimensional gas inlet ports symmetrically arranged therein in diametral opposition to each other; pivotable vanes or gates are located centrally of these inlet ports on axles to which they are attached by their central portions, the vanes having their radius of curvature 1.2 to 1.6 times greater than that of the swirl chamber.
    Type: Grant
    Filed: May 27, 1981
    Date of Patent: February 19, 1985
    Inventors: Vladislav Y. Eschenko, Irsali K. Musaev, Zakhidzhan S. Talibdzhanov, Viktor A. Leonov, Anatoly D. Bobrov, Efim I. Kirovsky, Vladimir A. Gritsenko, Alexandr V. Golovanov