利索-全球专利检索

  1. Login
  2. Sign Up

Search Results

14 records (took 0.013 seconds)

    EFFICIENTLY DECODABLE QC-LDPC CODE
    1.
    发明申请
    EFFICIENTLY DECODABLE QC-LDPC CODE 审中-公开

    公开(公告)号：WO2018128559A1

    公开(公告)日：2018-07-12

    申请号：PCT/RU2017/000002

    申请日：2017-01-09

    Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  PANTELEEV, Pavel Anatolyevich

    Inventor： PANTELEEV, Pavel Anatolyevich ,  KALACHEV, Gleb Vyacheslavovich ,  MAZURENKO, Ivan Leonidovich ,  GASANOV, Elyar Eldarovich ,  SHUTKIN, Yurii Sergeevich

    IPC: H03M13/11

    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 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 thereby dividing the first submatrix into layers of groups of orthogonally labelled rows, wherein the number of orthogonally labelled rows corresponds to the size of the first quadratic submatrices. One or more check node unit processors perform flooding or a combination of flooding and layered (hence hybrid) decoding operations in view of the one or more higher weight first columns and one or more CNU processors perform layered decoding operations in view of the second columns.

    TYPE-I QC-LDPC CODES WITH EFFICIENT ENCODING AND GOOD ERROR FLOOR CHARACTERISTIC
    2.
    发明申请
    TYPE-I QC-LDPC CODES WITH EFFICIENT ENCODING AND GOOD ERROR FLOOR CHARACTERISTIC 审中-公开

    公开(公告)号：WO2019226064A1

    公开(公告)日：2019-11-28

    申请号：PCT/RU2018/000318

    申请日：2018-05-22

    Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  PANTELEEV, Pavel Anatolyevich

    Inventor： PANTELEEV, Pavel Anatolyevich ,  KALACHEV, Gleb Vyacheslavovich ,  LETUNOVSKIY, Aleksey Alexandrovich ,  MAZURENKO, Ivan Leonidovich

    IPC: H03M13/11 ,  H04L1/00

    Abstract: The present invention in particular provides a variable-length rate-adaptive quasi cyclic (QC) low density parity check (LDPC) code with linear time encoding and low error floor. To this end, the present invention provides a data encoding method, the method comprising the steps of receiving a user bits vector u ; determining a parity bits vector p , wherein a vector с=(u,p) is a codeword satisfying a Type-I mZ x nZ parity-check matrix H=(H u ,H p ) with a quasi-cyclic mZ x mZ submatrix H p of circulant size Z , wherein the first left m - r circulant columns of H p have zero circulants above a main diagonal of H p , the remaining right r circulant columns have zero circulants in the first top m - r circulant rows of H p , and the remaining bottom r circulant rows of H p and the remaining right r circulant columns of H p form an rZ x rZ square quasi-cyclic submatrix A , wherein a polynomial representation of the submatrix A over the ring F 2 [x] has a determinant equal to a monomial x i , wherein 0 ≤ i , and 4 ≤ r ≤ m . The present invention also provides a data encoder, a communication device, a storage device and a computer program product comprising said method.

    DISTANCES BETWEEN DISTRIBUTIONS FOR THE BELONGING-TO-THE-DISTRIBUTION MEASUREMENT OF THE IMAGE
    5.
    发明申请
    DISTANCES BETWEEN DISTRIBUTIONS FOR THE BELONGING-TO-THE-DISTRIBUTION MEASUREMENT OF THE IMAGE 审中-公开

    公开(公告)号：WO2022045915A1

    公开(公告)日：2022-03-03

    申请号：PCT/RU2020/000450

    申请日：2020-08-25

    Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  KOMKOV, Stepan Alekseevich

    Inventor： PETIUSHKO, Aleksandr Aleksandrovich ,  MAZURENKO, Ivan Leonidovich ,  LI, Jiang

    IPC: G06T1/40 ,  G06N3/02

    Abstract: The present disclosure relates to processing input data by a neural network. Methods and apparatuses of some embodiments process the input data by at least one layer of the neural network and obtain thereby a feature tensor. Then, the distribution of the obtained feature tensors estimated. Another distribution is obtained. Such other distribution may be a distribution of another input data, or a distribution obtained by combining a plurality of distributions obtained for respective plurality of some input data. Then a distance value indicative of a distance between the two distributions is calculated and based thereon, a characteristic of the input data is determined. The characteristic may be pertinence to a certain class of data or a detection of out-of-distribution data or determination of reliability of a class determination or the like.

    EFFICIENTLY DECODABLE QC-LDPC CODE
    6.
    发明申请
    EFFICIENTLY DECODABLE QC-LDPC CODE 审中-公开

    公开(公告)号：WO2018128560A1

    公开(公告)日：2018-07-12

    申请号：PCT/RU2017/000161

    申请日：2017-03-21

    Applicant: HUAWEI TECHNOLOGIES CO., LTD ,  PANTELEEV, Pavel Anatolyevich

    Inventor： PANTELEEV, Pavel Anatolyevich ,  KALACHEV, Gleb Vyacheslavovich ,  MAZURENKO, Ivan Leonidovich ,  GASANOV, Elyar Eldarovich ,  SHUTKIN, Yurii Sergeevich

    IPC: H03M13/11

    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 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 thereby dividing the first submatrix into layers of groups of orthogonally labelled rows, wherein the number of orthogonally labelled rows corresponds to the size of the first quadratic submatrices. One or more check node unit processors perform flooding or a combination of flooding and layered (hence hybrid) decoding operations in view of the one or more higher weight first columns and one or more CNU processors perform layered decoding operations in view of the second columns.

    METHOD AND APPARATUS FOR ENCODING AND DECODING LDPC CODES
    7.
    发明申请
    METHOD AND APPARATUS FOR ENCODING AND DECODING LDPC CODES 审中-公开
    用于编码和解码LDPC码的方法和设备

    公开(公告)号：WO2018082290A1

    公开(公告)日：2018-05-11

    申请号：PCT/CN2017/086017

    申请日：2017-05-25

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： SHUTKIN, Yurii Sergeevich ,  PANTELEEV, Pavel Anatolyevich ,  LETUNOVSKIY, Aleksey Alexandrovich ,  GASANOV, Elyar Eldarovich ,  KALACHEV, Gleb Vyacheslavovich ,  MAZURENKO, Ivan Leonidovich

    IPC: H03M13/11 ,  H04L1/00

    Abstract: Provided is an efficiently decodable QC-LDPC code which is based on a base matrix of an irregular QC-LDPC matrix, the base matrix being formed by columns and rows, the columns being dividable into one or more columns corresponding to punctured variable nodes (i.e. variable nodes corresponding to information bits which are used by the encoder but are not transmitted to or effectively treated as not received by the decoder) and columns corresponding to not-punctured variable nodes, and the rows being dividable into high-density rows (i.e. rows having a weight which is above a first weight) and low-density rows (i.e. rows having a weight which is below a second weight, wherein the second weight is equal to or smaller than the first weight), wherein a matrix defined by the overlap of the low-density rows and the columns corresponding to the not-punctured variable nodes is dividable into groups of orthogonal rows.

    Abstract translation: 提供一种基于不规则QC-LDPC矩阵的基础矩阵的有效可解码QC-LDPC码，所述基础矩阵由列和行形成，所述列可划分为一个或多个 对应于收缩变量节点的列（即，对应于由编码器使用的信息比特的变量节点，但不被传送到解码器或未被解码器接收或者未被解码器接收到）;以及对应于未删截变量节点的列，并且行是可分割的 成为高密度排（即重量高于第一重量的排）和低密度排（即重量低于第二重量的排，其中第二重量等于或小于第一重量） ，其中由低密度行和与非打孔变量节点对应的列的重叠定义的矩阵可分成正交行的组。

    EFFICIENTLY DECODABLE QC-LDPC CODE
    9.
    发明申请
    EFFICIENTLY DECODABLE QC-LDPC CODE 审中-公开
    有效可解码的QC-LDPC代码

    公开(公告)号：WO2018084735A1

    公开(公告)日：2018-05-11

    申请号：PCT/RU2016/000746

    申请日：2016-11-03

    Applicant: HUAWEI TECHNOLOGIES CO., LTD. ,  SHUTKIN, Yurii Sergeevich

    Inventor： SHUTKIN, Yurii Sergeevich ,  PANTELEEV, Pavel Anatolyevich ,  LETUNOVSKIY, Aleksey Alexandrovich ,  GASANOV, Elyar Eldarovich ,  KALACHEV, Gleb Vyacheslavovich ,  MAZURENKO, Ivan Leonidovich

    IPC: H03M13/11 ,  H03M13/00

    Abstract: Provided is an efficiently decodable QC-LDPC code which is based on a base matrix of an irregular QC-LDPC matrix, the base matrix being formed by columns and rows, the columns being dividable into one or more columns corresponding to punctured variable nodes (i.e. variable nodes corresponding to information bits which are used by the encoder but are not transmitted to or effectively treated as not received by the decoder) and columns corresponding to not-punctured variable nodes, and the rows being dividable into high-density rows (i.e. rows having a weight which is above a first weight) and low-density rows (i.e. rows having a weight which is below a second weight, wherein the second weight is equal to or smaller than the first weight), wherein a matrix defined by the overlap of the low-density rows and the columns corresponding to the not-punctured variable nodes is dividable into groups of orthogonal rows. Combination of a flooding decoding process for punctured variable nodes and a layered decoding process for non-punctured variable nodes.

    Abstract translation: 提供一种基于不规则QC-LDPC矩阵的基础矩阵的有效可解码QC-LDPC码，所述基础矩阵由列和行形成，所述列可划分为一个或多个 对应于收缩变量节点的列（即，对应于由编码器使用的信息比特的变量节点，但不被传送到解码器或未被解码器接收或者未被解码器接收到）;以及对应于未删截变量节点的列，并且行是可分割的 成为高密度排（即重量高于第一重量的排）和低密度排（即重量低于第二重量的排，其中第二重量等于或小于第一重量） 其中由低密度行和与未打孔变量节点对应的列的重叠定义的矩阵可分为正交行的组。 用于删截变量节点的洪泛解码过程和用于非删截变量节点的分层解码过程的组合。

Patent Agency Ranking