CA3067701C - Conception de valeurs de decalage de codes ldpc quasi-cycliques - Google Patents

Conception de valeurs de decalage de codes ldpc quasi-cycliques Download PDF

Info

Publication number
CA3067701C
CA3067701C CA3067701A CA3067701A CA3067701C CA 3067701 C CA3067701 C CA 3067701C CA 3067701 A CA3067701 A CA 3067701A CA 3067701 A CA3067701 A CA 3067701A CA 3067701 C CA3067701 C CA 3067701C
Authority
CA
Canada
Prior art keywords
matrix
entry
shift
sub
pcm
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CA3067701A
Other languages
English (en)
Other versions
CA3067701A1 (fr
Inventor
Sara SANDBERG
Mattias Andersson
Yufei Blankenship
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=62748996&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=CA3067701(C) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of CA3067701A1 publication Critical patent/CA3067701A1/fr
Application granted granted Critical
Publication of CA3067701C publication Critical patent/CA3067701C/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148Structural properties of the code parity-check or generator matrix
    • H03M13/116Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H03M13/1168Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148Structural properties of the code parity-check or generator matrix
    • H03M13/116Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/033Theoretical methods to calculate these checking codes
    • H03M13/036Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/13Linear codes
    • H03M13/15Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • H04L1/0042Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0047Decoding adapted to other signal detection operation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Error Detection And Correction (AREA)

Abstract

Selon certains modes de réalisation, un procédé destiné à être utilisé dans un émetteur sans fil d'un réseau de communication sans fil consiste à coder des bits d'informations à l'aide d'une matrice de contrôle de parité (PCM) et à transmettre les bits d'informations codés à un récepteur sans fil. La matrice de contrôle de parité (PCM) est optimisée conformément à au moins deux contraintes de degré de message extrinsèque de cycle approximatif (ACE). Selon certains modes de réalisation, une première partie de la PCM est optimisée conformément à une première contrainte ACE et une seconde partie de la PCM est optimisée conformément à une seconde contrainte ACE.
CA3067701A 2017-06-27 2018-06-26 Conception de valeurs de decalage de codes ldpc quasi-cycliques Active CA3067701C (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US201762525453P 2017-06-27 2017-06-27
US62/525453 2017-06-27
PCT/EP2018/067098 WO2019002284A1 (fr) 2017-06-27 2018-06-26 Conception de valeurs de décalage de codes ldpc quasi-cycliques

Publications (2)

Publication Number Publication Date
CA3067701A1 CA3067701A1 (fr) 2019-01-03
CA3067701C true CA3067701C (fr) 2022-08-16

Family

ID=62748996

Family Applications (1)

Application Number Title Priority Date Filing Date
CA3067701A Active CA3067701C (fr) 2017-06-27 2018-06-26 Conception de valeurs de decalage de codes ldpc quasi-cycliques

Country Status (17)

Country Link
US (4) US10644724B2 (fr)
EP (2) EP3672085B1 (fr)
JP (1) JP6876834B2 (fr)
KR (1) KR102181784B1 (fr)
CN (2) CN110832782B (fr)
AU (1) AU2018293680B2 (fr)
BR (1) BR112019027009A2 (fr)
CA (1) CA3067701C (fr)
DK (1) DK3491741T3 (fr)
ES (1) ES2776098T3 (fr)
MA (1) MA47656B1 (fr)
MX (1) MX2019015458A (fr)
PH (1) PH12019502740A1 (fr)
PL (1) PL3491741T3 (fr)
PT (1) PT3491741T (fr)
WO (1) WO2019002284A1 (fr)
ZA (1) ZA201908076B (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
BR112019027009A2 (pt) * 2017-06-27 2020-06-30 Telefonaktiebolaget Lm Ericsson (Publ) método para uso em um transmissor sem fio de uma rede de comunicação sem fio, produto de programa de computador, transmissor sem fio, e, receptor sem fio
BR112020003426A2 (pt) * 2017-08-24 2020-08-25 Telefonaktiebolaget Lm Ericsson (Publ) segmentação de bloco de código para novo rádio 3gpp
WO2019164515A1 (fr) * 2018-02-23 2019-08-29 Nokia Technologies Oy Codes ldpc pour communications 3 gpp nr ultra-fiables à faible latence

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006016769A1 (fr) 2004-08-10 2006-02-16 Samsung Electronics Co., Ltd. Appareil et procede pour coder et decoder un code de controle de parite a faible densite en bloc
CN100550655C (zh) * 2004-11-04 2009-10-14 中兴通讯股份有限公司 一种低密度奇偶校验码的编码器/译码器及其生成方法
US7343548B2 (en) * 2004-12-15 2008-03-11 Motorola, Inc. Method and apparatus for encoding and decoding data
KR101503058B1 (ko) 2008-02-26 2015-03-18 삼성전자주식회사 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서의 채널 부호화/복호화 방법 및 장치
US8341492B2 (en) 2008-07-28 2012-12-25 Broadcom Corporation Quasi-cyclic LDPC (low density parity check) code construction
US8103931B2 (en) * 2008-08-27 2012-01-24 Mitsubishi Electric Research Laboratories, Inc. Method for constructing large-girth quasi-cyclic low-density parity-check codes
CN101686061A (zh) 2008-09-27 2010-03-31 松下电器产业株式会社 构造低密度奇偶校验码的方法及发送/接收装置和系统
US20100153819A1 (en) 2008-12-12 2010-06-17 Yeong-Luh Ueng Decoding Method and System for Low-Density Parity Check Code
US8433972B2 (en) * 2009-04-06 2013-04-30 Nec Laboratories America, Inc. Systems and methods for constructing the base matrix of quasi-cyclic low-density parity-check codes
US8595589B2 (en) 2011-09-30 2013-11-26 Mitsubishi Electric Research Laboratories, Inc. Quasi-cyclic low-density parity-check codes
CN102412845A (zh) 2011-11-24 2012-04-11 桂林市思奇通信设备有限公司 基于欧氏几何的准循环低密度校验码的构造方法
KR102019893B1 (ko) * 2013-07-22 2019-09-09 삼성전자주식회사 저밀도 패리티 검사 부호를 지원하는 통신 시스템에서 신호 수신 장치 및 방법
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
BR112019027009A2 (pt) * 2017-06-27 2020-06-30 Telefonaktiebolaget Lm Ericsson (Publ) método para uso em um transmissor sem fio de uma rede de comunicação sem fio, produto de programa de computador, transmissor sem fio, e, receptor sem fio
US11846685B1 (en) * 2022-07-22 2023-12-19 The Boeing Company Lorentz force velocity sensor system

Also Published As

Publication number Publication date
KR102181784B1 (ko) 2020-11-24
US20230087194A1 (en) 2023-03-23
EP3491741A1 (fr) 2019-06-05
EP3672085B1 (fr) 2024-08-07
ES2776098T3 (es) 2020-07-29
PL3491741T3 (pl) 2020-05-18
US20200228142A1 (en) 2020-07-16
ZA201908076B (en) 2021-04-28
EP3672085C0 (fr) 2024-08-07
US10644724B2 (en) 2020-05-05
MX2019015458A (es) 2020-02-12
PH12019502740A1 (en) 2020-07-13
WO2019002284A1 (fr) 2019-01-03
EP3491741B1 (fr) 2019-11-27
EP3672085A1 (fr) 2020-06-24
JP6876834B2 (ja) 2021-05-26
DK3491741T3 (da) 2020-03-02
AU2018293680A1 (en) 2020-01-02
CN110832782B (zh) 2024-04-02
BR112019027009A2 (pt) 2020-06-30
CN118214432A (zh) 2024-06-18
RU2731883C1 (ru) 2020-09-08
MA47656B1 (fr) 2021-02-26
PT3491741T (pt) 2020-01-16
CN110832782A (zh) 2020-02-21
US20190296767A1 (en) 2019-09-26
KR20200004404A (ko) 2020-01-13
MA47656A1 (fr) 2020-11-30
JP2020535670A (ja) 2020-12-03
AU2018293680B2 (en) 2021-07-29
US20240146331A1 (en) 2024-05-02
US11848685B2 (en) 2023-12-19
US11515893B2 (en) 2022-11-29
CA3067701A1 (fr) 2019-01-03

Similar Documents

Publication Publication Date Title
KR102297264B1 (ko) 3gpp nr을 위한 베이스 그래프 선택
US11848685B2 (en) Shift values for quasi-cyclic LDPC codes
US11831428B2 (en) Adaptation of the CRC code length for 3GPP NR
US11025275B2 (en) LDPC code block segmentation
US11469779B2 (en) Efficient polar code construction in 5G
US11146356B2 (en) Adaptive CRC length for beam sweeping
RU2731883C9 (ru) Коэффициенты ldpc-сдвига для нового стандарта радиосвязи
OA20026A (en) Design of shift values for quasi-cyclic LDPC codes.

Legal Events

Date Code Title Description
EEER Examination request

Effective date: 20191217

EEER Examination request

Effective date: 20191217

EEER Examination request

Effective date: 20191217