BR112019023301A2 - Construindo matrizes de verificação de paridade com ortogonalidade em linha por códigos qc-ldpc de taxa compatível - Google Patents

Construindo matrizes de verificação de paridade com ortogonalidade em linha por códigos qc-ldpc de taxa compatível Download PDF

Info

Publication number
BR112019023301A2
BR112019023301A2 BR112019023301-6A BR112019023301A BR112019023301A2 BR 112019023301 A2 BR112019023301 A2 BR 112019023301A2 BR 112019023301 A BR112019023301 A BR 112019023301A BR 112019023301 A2 BR112019023301 A2 BR 112019023301A2
Authority
BR
Brazil
Prior art keywords
parity check
line
check matrix
ldpc
raised
Prior art date
Application number
BR112019023301-6A
Other languages
English (en)
Inventor
Richardson Thomas
Original Assignee
Qualcomm Incorporated
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Incorporated filed Critical Qualcomm Incorporated
Publication of BR112019023301A2 publication Critical patent/BR112019023301A2/pt

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1131—Scheduling of bit node or check node processing
    • H03M13/1137—Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1131—Scheduling of bit node or check node processing
    • H03M13/114—Shuffled, staggered, layered or turbo decoding schedules
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
    • H03M13/1185—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/615—Use of computational or mathematical techniques
    • H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/618—Shortening and extension of codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6393—Rate compatible low-density parity check [LDPC] codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6561—Parallelized implementations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H04L1/0069—Puncturing patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Algebra (AREA)
  • Computing Systems (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

certos aspectos da presente divulgação geralmente se relacionam a métodos e aparelhos para decodificar códigos compatíveis com taxa de verificação de paridade de baixa densidade quase cíclica (qc-ldpc), por exemplo, usando uma matriz de verificação de paridade compreendendo primeiras camadas de acordo com um gráfico de núcleo de alta taxa e segunda camadas para transmissão harq, em que a matriz de verificação de paridade possui quase ortogonalidade de linha ou ortogonalidade de linha completa dentro das segundas camadas. um método exemplar para executar decodificação de verificação de paridade de baixa densidade (ldpc) inclui o recebimento de bits flexíveis associados a uma palavra código ldpc e a execução da decodificação ldpc dos bits flexíveis usando uma matriz de verificação de paridade, em que cada linha da matriz de verificação de paridade corresponde a uma verificação de paridade levantada de um código ldpc levantado, pelo menos duas colunas da matriz de verificação de paridade correspondem a nós variáveis perfurados do código ldpc levantado e a matriz de verificação de paridade tem ortogonalidade de linha entre cada par de linhas consecutivas abaixo de uma linha na qual os pelo menos dois nós variáveis perfurados estão conectados.
BR112019023301-6A 2017-05-12 2018-05-10 Construindo matrizes de verificação de paridade com ortogonalidade em linha por códigos qc-ldpc de taxa compatível BR112019023301A2 (pt)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US201762505573P 2017-05-12 2017-05-12
US62/505,573 2017-05-12
US15/975,440 US10680646B2 (en) 2017-05-12 2018-05-09 Row orthogonality in LDPC rate compatible design
US15/975,440 2018-05-09
PCT/US2018/031988 WO2018209035A1 (en) 2017-05-12 2018-05-10 Constructing parity check matrices with row-orthogonality for rate compatible qc-ldpc codes

Publications (1)

Publication Number Publication Date
BR112019023301A2 true BR112019023301A2 (pt) 2020-06-16

Family

ID=62685080

Family Applications (1)

Application Number Title Priority Date Filing Date
BR112019023301-6A BR112019023301A2 (pt) 2017-05-12 2018-05-10 Construindo matrizes de verificação de paridade com ortogonalidade em linha por códigos qc-ldpc de taxa compatível

Country Status (9)

Country Link
US (3) US10680646B2 (pt)
EP (1) EP3622627A1 (pt)
JP (1) JP6828190B2 (pt)
KR (1) KR102197173B1 (pt)
CN (2) CN118018038A (pt)
BR (1) BR112019023301A2 (pt)
SG (1) SG11201909120PA (pt)
TW (1) TWI725308B (pt)
WO (1) WO2018209035A1 (pt)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10680646B2 (en) 2017-05-12 2020-06-09 Qualcomm Incorporated Row orthogonality in LDPC rate compatible design
US10879927B2 (en) * 2017-05-17 2020-12-29 Futurewei Technologies, Inc. Compact low density parity check (LDPC) base graph
CN108988869B (zh) * 2017-05-31 2021-07-30 大唐移动通信设备有限公司 一种确定校验矩阵的方法及装置、计算机存储介质
US10312939B2 (en) 2017-06-10 2019-06-04 Qualcomm Incorporated Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code
WO2019114992A1 (en) * 2017-12-15 2019-06-20 Huawei Technologies Co., Ltd. Design of base parity-check matrices for ldpc codes that have subsets of orthogonal rows
US11973593B2 (en) * 2018-02-23 2024-04-30 Nokia Technologies Oy LDPC codes for 3GPP NR ultra-reliable low-latency communications
US10979072B2 (en) * 2019-03-19 2021-04-13 Western Digital Technologies, Inc. Punctured bit estimation and bit error rate estimation
US11777524B2 (en) 2019-04-22 2023-10-03 Lg Electronics Inc. Method for supporting rate-compatible non-binary LDPC code, and wireless terminal using same
KR20210090483A (ko) 2020-01-10 2021-07-20 주식회사 엘지에너지솔루션 다공성 환원 그래핀 옥사이드, 이의 제조방법, 이를 포함하는 황-탄소 복합체 및 리튬 이차전지
CN112039536B (zh) * 2020-06-12 2023-04-18 中山大学 一种基于正交频分复用技术的自适应极化码编译码方法
CN116964968A (zh) * 2021-03-18 2023-10-27 高通股份有限公司 用于低密度奇偶校验编码的位替换

Family Cites Families (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6633865B1 (en) 1999-12-23 2003-10-14 Pmc-Sierra Limited Multithreaded address resolution system
US6633856B2 (en) 2001-06-15 2003-10-14 Flarion Technologies, Inc. Methods and apparatus for decoding LDPC codes
US7000167B2 (en) * 2001-08-01 2006-02-14 International Business Machines Corporation Decoding low density parity check codes
US6961888B2 (en) 2002-08-20 2005-11-01 Flarion Technologies, Inc. Methods and apparatus for encoding LDPC codes
TWI272777B (en) * 2003-08-08 2007-02-01 Intel Corp Method and apparatus for varying lengths of low density parity check codewords
KR100981500B1 (ko) * 2006-02-07 2010-09-10 삼성전자주식회사 저밀도 패러티 검사 부호 기반의 하이브리드 재전송 방법
US20070245217A1 (en) * 2006-03-28 2007-10-18 Stmicroelectronics S.R.L. Low-density parity check decoding
JPWO2008075627A1 (ja) * 2006-12-18 2010-04-08 三菱電機株式会社 符号化装置、符号化方法、符号化復号装置及び通信装置
CN101217337B (zh) * 2007-01-01 2013-01-23 中兴通讯股份有限公司 一种支持递增冗余混合自动重传的低密度奇偶校验码编码装置和方法
KR101445080B1 (ko) 2008-02-12 2014-09-29 삼성전자 주식회사 하이브리드 자동 반복 요구 방식을 사용하는 통신 시스템에서 신호 송신 방법 및 장치
US8392789B2 (en) * 2009-07-28 2013-03-05 Texas Instruments Incorporated Method and system for decoding low density parity check codes
US8504887B1 (en) * 2009-12-24 2013-08-06 Marvell International Ltd. Low power LDPC decoding under defects/erasures/puncturing
US8726122B2 (en) * 2011-05-11 2014-05-13 Samsung Electronics Co., Ltd. High throughput LDPC decoder
WO2014127129A1 (en) 2013-02-13 2014-08-21 Qualcomm Incorporated Ldpc design using quasi-cyclic constructions and puncturing for high rate, high parallelism, and low error floor
US20160049962A1 (en) 2013-04-25 2016-02-18 LI, Jian Method and apparatus of ldpc encoder in 10gbase-t system
EP2879318A1 (en) * 2013-11-29 2015-06-03 Panasonic Corporation Efficient component interleaving for rotated constellations with time-frequency slicing
US10313054B2 (en) * 2015-01-07 2019-06-04 Avago Technologies International Sales Pte. Limited Low density parity check (LDPC) codes for communication devices and systems
US9787326B2 (en) * 2015-05-19 2017-10-10 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding low density parity check codes
US9742439B1 (en) * 2015-06-08 2017-08-22 Microsemi Solutions (U.S.), Inc. Method and device for forward error correction decoder system utilizing orthogonality of an H matrix
US10122508B2 (en) * 2015-07-31 2018-11-06 Lg Electronics Inc. Method and apparatus for configuring a long training field in a wireless local area network system
EP3902142A1 (en) * 2016-05-12 2021-10-27 MediaTek Inc. Qc-ldpc coding methods and apparatus
US11195924B2 (en) * 2016-06-27 2021-12-07 Intel Corporation Broken bandgap contact
WO2018128559A1 (en) 2017-01-09 2018-07-12 Huawei Technologies Co., Ltd. Efficiently decodable qc-ldpc code
BR112019012715B1 (pt) * 2017-02-06 2022-11-22 Lg Electronics Inc Método de transmissão, dispositivo transmissor, método de recepção e dispositivo de recepção
US10680646B2 (en) 2017-05-12 2020-06-09 Qualcomm Incorporated Row orthogonality in LDPC rate compatible design

Also Published As

Publication number Publication date
CN118018038A (zh) 2024-05-10
CN110622425A (zh) 2019-12-27
US20190013827A1 (en) 2019-01-10
JP6828190B2 (ja) 2021-02-10
US10680646B2 (en) 2020-06-09
US11411581B2 (en) 2022-08-09
US11916571B2 (en) 2024-02-27
TWI725308B (zh) 2021-04-21
TW201902136A (zh) 2019-01-01
US20200266832A1 (en) 2020-08-20
US20230030277A1 (en) 2023-02-02
KR20200003829A (ko) 2020-01-10
KR102197173B1 (ko) 2020-12-31
JP2020521362A (ja) 2020-07-16
WO2018209035A1 (en) 2018-11-15
CN110622425B (zh) 2024-02-20
SG11201909120PA (en) 2019-11-28
EP3622627A1 (en) 2020-03-18

Similar Documents

Publication Publication Date Title
BR112019023301A2 (pt) Construindo matrizes de verificação de paridade com ortogonalidade em linha por códigos qc-ldpc de taxa compatível
PH12018502070A1 (en) Enhanced puncturing and low-density parity-check (ldpc) code structure
BR112019001032A2 (pt) projeto de bits de retroalimentação de solicitação de repetição automática híbrida (harq) para códigos polares
BR112018009594A2 (pt) perfuração para códigos de verificação de paridade de densidade baixa (ldpc) estruturados
JP2016510185A5 (pt)
BR112019005074A2 (pt) método e aparelho para codificar dados usando um código polar
BR112016027099A2 (pt) aparelho de transmissão
BR112018074414A2 (pt) codificação e decodificação de sinalização de controle com verificação de redundância seccional
BR112018075015A2 (pt) métodos e aparelho para descrever de modo compacto códigos de verificação de paridade de baixa densidade (ldpc) submetidos a lifting
BR112015006374A2 (pt) método e aparelho para gerar código polar híbrido
BR112015019409A2 (pt) projeto de ldpc utilizando construções quase-cíclicas e perfuração para alta taxa, alto paralelismo, e piso de erro baixo
BR112018073194A2 (pt) métodos e aparelhos para a geração eficiente de códigos de verificação de paridade de baixa densidade elevada (ldpc)
BR112019027688A8 (pt) método de codificação, método de decodificação, aparelho, aparelho de comunicação, terminal, estação de base, sistema de comunicação, mídia de armazenamento legível por computador, e produto de programa de computador
WO2016140516A3 (en) Transmitter and parity permutation method thereof
MX2020004655A (es) Transmisor y metodo de segmentacion del mismo.
MX2016015204A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019014457A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019010686A (es) Transmisor y metodo de acortamiento del mismo.
BR112017009424A2 (pt) decodificação de ldpc com precisão finita e ajuste dinâmico do número de iterações
MX2017011147A (es) Transmisor y metodo de acortamiento del mismo.
CL2019002498A1 (es) Método para realizar la codificación sobre la base de la matriz de verificación de paridad del código ldpc en el sistema de comunicación inalámbrico y terminal que usa el mismo.
BR112022008049A2 (pt) Método e aparelho de codificação de ldpc
MX2019009589A (es) Transmisor y metodo de permutacion de paridad del mismo.
MX2017011152A (es) Transmisor y metodo de segmentacion del mismo.
MX2014012118A (es) Codificador de revision de paridad de baja densidad que tiene una longitud de 64800 y un indice de codigo de 4/15 y metodo de codificacion de revision de paridad de baja densidad que utiliza el mismo.

Legal Events

Date Code Title Description
B350 Update of information on the portal [chapter 15.35 patent gazette]