MX2019015685A - Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud fija y metodo de relleno con ceros que lo utiliza. - Google Patents

Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud fija y metodo de relleno con ceros que lo utiliza.

Info

Publication number
MX2019015685A
MX2019015685A MX2019015685A MX2019015685A MX2019015685A MX 2019015685 A MX2019015685 A MX 2019015685A MX 2019015685 A MX2019015685 A MX 2019015685A MX 2019015685 A MX2019015685 A MX 2019015685A MX 2019015685 A MX2019015685 A MX 2019015685A
Authority
MX
Mexico
Prior art keywords
zero padding
bit string
signaling information
groups
length
Prior art date
Application number
MX2019015685A
Other languages
English (en)
Inventor
- Young Lee Jae
- Ik PARK Sung
- Hyoung Kwon Sun
- Mook KIM Heung
Original Assignee
Electronics & Telecommunications Res Inst
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 Electronics & Telecommunications Res Inst filed Critical Electronics & Telecommunications Res Inst
Publication of MX2019015685A publication Critical patent/MX2019015685A/es

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/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
    • H03M13/1165—QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]
    • 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
    • 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
    • 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/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
    • H03M13/255—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with 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/27—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 using interleaving techniques
    • 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/27—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 using interleaving techniques
    • H03M13/2739—Permutation polynomial interleaver, e.g. quadratic permutation polynomial [QPP] interleaver and quadratic congruence interleaver
    • 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/27—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 using interleaving techniques
    • H03M13/2778—Interleaver using block-wise interleaving, e.g. the interleaving matrix is sub-divided into sub-matrices and the permutation is performed in blocks of 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/27—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 using interleaving techniques
    • H03M13/2789—Interleaver providing variable interleaving, e.g. variable block sizes
    • 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block 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/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/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • 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/6522—Intended application, e.g. transmission or communication standard
    • H03M13/6552—DVB-T2
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/162—Segmentation; Edge detection involving graph-based methods
    • 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
    • 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/152—Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0466—Wireless resource allocation based on the type of the allocated resource the resource being a scrambling code

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Multimedia (AREA)
  • Error Detection And Correction (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Se describe un aparato y método de relleno con ceros para información de señalización de longitud fija; un aparato de relleno con ceros de acuerdo con una modalidad de la presente invención incluye un procesador configurado para generar una cadena de bits de información LDPC al escoger un número de grupos cuyos bits se van a llenar con 0 usando una diferencia entre una longitud de la cadena de bits de información LDPC y una longitud de una cadena de bits codificada por BCH, seleccionar los grupos que utilizan un orden de patrón de acortamiento para rellenar todos los bits de los grupos con 0 y rellenar al menos una parte de los grupos restantes que no están llenos con 0 con la cadena de bits codificada por BCH; y una memoria configurada para proporcionar la cadena de bits de información LDPC a un codificador LDPC.
MX2019015685A 2015-02-27 2017-08-25 Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud fija y metodo de relleno con ceros que lo utiliza. MX2019015685A (es)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
KR20150028060 2015-02-27
KR20150031947 2015-03-06
KR1020160020636A KR102453471B1 (ko) 2015-02-27 2016-02-22 고정 길이 시그널링 정보 부호화를 위한 제로 패딩 장치 및 이를 이용한 제로 패딩 방법

Publications (1)

Publication Number Publication Date
MX2019015685A true MX2019015685A (es) 2020-02-26

Family

ID=56946137

Family Applications (2)

Application Number Title Priority Date Filing Date
MX2017010994A MX370803B (es) 2015-02-27 2016-02-23 Aparato de relleno con ceros para codificar la información de señalización de longitud fija y método de relleno con ceros que lo utiliza.
MX2019015685A MX2019015685A (es) 2015-02-27 2017-08-25 Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud fija y metodo de relleno con ceros que lo utiliza.

Family Applications Before (1)

Application Number Title Priority Date Filing Date
MX2017010994A MX370803B (es) 2015-02-27 2016-02-23 Aparato de relleno con ceros para codificar la información de señalización de longitud fija y método de relleno con ceros que lo utiliza.

Country Status (4)

Country Link
US (3) US10320418B2 (es)
KR (2) KR102453471B1 (es)
CA (1) CA2977622C (es)
MX (2) MX370803B (es)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102453472B1 (ko) * 2015-02-27 2022-10-14 한국전자통신연구원 가변 길이 시그널링 정보 부호화를 위한 패리티 펑처링 장치 및 이를 이용한 패리티 펑처링 방법
CA3065458C (en) * 2015-02-27 2022-05-24 Electronics And Telecommunications Research Institute Zero padding apparatus for encoding variable-length signaling information and zero padding method using same
KR102453476B1 (ko) * 2015-02-27 2022-10-14 한국전자통신연구원 고정 길이 시그널링 정보 부호화를 위한 패리티 인터리빙 장치 및 이를 이용한 패리티 인터리빙 방법
WO2016137204A1 (ko) 2015-02-27 2016-09-01 한국전자통신연구원 고정 길이 시그널링 정보 부호화를 위한 패리티 인터리빙 장치 및 이를 이용한 패리티 인터리빙 방법

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8266508B2 (en) 2007-06-08 2012-09-11 Telefonaktiebolaget L M Ericsson (Publ) Computational efficient convolutional coding with rate matching
KR101503058B1 (ko) 2008-02-26 2015-03-18 삼성전자주식회사 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서의 채널 부호화/복호화 방법 및 장치
US8689093B2 (en) 2009-12-07 2014-04-01 Samsung Electronics Co., Ltd Method and apparatus for channel encoding and decoding in a communication system using a low-density parity check code
EP2477335B1 (en) 2011-01-18 2019-05-29 Samsung Electronics Co., Ltd. Apparatus and method for transmitting and reveiving data in communication/broadcasting system
KR101791477B1 (ko) 2011-10-10 2017-10-30 삼성전자주식회사 통신/방송 시스템에서 데이터 송수신 장치 및 방법
KR20150005426A (ko) 2013-07-05 2015-01-14 삼성전자주식회사 송신 장치 및 그의 신호 처리 방법
US10305632B2 (en) 2013-09-17 2019-05-28 Samsung Electronics Co., Ltd. Transmitting apparatus and signal processing method thereof
CA3065458C (en) 2015-02-27 2022-05-24 Electronics And Telecommunications Research Institute Zero padding apparatus for encoding variable-length signaling information and zero padding method using same
KR102453475B1 (ko) * 2015-02-27 2022-10-14 한국전자통신연구원 가변 길이 시그널링 정보 부호화를 위한 제로 패딩 장치 및 이를 이용한 제로 패딩 방법

Also Published As

Publication number Publication date
MX2017010994A (es) 2017-10-18
CA2977622C (en) 2020-02-25
KR20160105308A (ko) 2016-09-06
MX370803B (es) 2020-01-07
KR102453471B1 (ko) 2022-10-14
US11463106B2 (en) 2022-10-04
US20210203358A1 (en) 2021-07-01
KR20240023540A (ko) 2024-02-22
US20180034478A1 (en) 2018-02-01
US20190245558A1 (en) 2019-08-08
CA2977622A1 (en) 2016-09-01
US10992316B2 (en) 2021-04-27
US10320418B2 (en) 2019-06-11

Similar Documents

Publication Publication Date Title
MX2019015682A (es) Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud variable y metodo de relleno con ceros que lo utiliza.
MX2019015685A (es) Aparato de relleno con ceros para codificar la informacion de se?alizacion de longitud fija y metodo de relleno con ceros que lo utiliza.
MX2017010998A (es) Aparato de intercalado de paridad para codificar la informacion de señalizacion de longitud variable y metodo de intercalado de paridad que lo utiliza.
MX2016000458A (es) Dispositivo de procesamiento de datos y metodo de procesamiento de datos.
MX2017010997A (es) Dispositivo de perforacion de paridad para la codificacion de informacion de señalizacion de longitud fija y metodo de perforacion de paridad que lo utiliza.
MX2017010999A (es) Dispositivo de perforacion de paridad para la codificacion de informacion de señalizacion de longitud variable y metodo de perforacion de paridad que lo utiliza.
MX338477B (es) Aparato de procesamiento de datos y metodo de procesamiento de datos.
MX2021003362A (es) Aparato receptor y metodo de decodificacion del mismo.
MX2020004656A (es) Transmisor y metodo de acortamiento del mismo.
MX2020004655A (es) Transmisor y metodo de segmentacion del mismo.
MX2019010686A (es) Transmisor y metodo de acortamiento del mismo.
MX2015009839A (es) Dispositivo de procesamiento de datos y metodo de procesamiento de datos.
MY182481A (en) Transmitter and shortening method thereof
GB2544680A (en) Improvements in or relating to centralisers
MX2016003220A (es) Dispositivo de procesamiento de datos y metodo de procesamiento de datos.
MX2015009939A (es) Dispositivo de procesamiento de datos y metodo de procesamiento de datos.
MX2017010995A (es) Aparato de intercalado de paridad para codificar informacion de señalizacion con longitud fija, y metodo de intercalado de paridad que utiliza el mismo.
MX2020004875A (es) Aparato de intercalado de paridad para codificar informacion de se?alizacion con longitud fija, y metodo de intercalado de paridad que utiliza el 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.
MX350599B (es) Codificador de revisión de paridad de baja densidad y método de codificación de revisión de paridad de baja densidad que utiliza el mismo.
MX2018004718A (es) Aparato receptor y metodo de decodificacion del mismo.
MX350602B (es) Codificador de revisión de paridad de baja densidad que tiene una longitud de 64800 y un índice de código de 7/15 y método de codificación de revisión de paridad de baja densidad que utiliza el mismo.
MX2016003228A (es) Dispositivo de procesamiento de datos y metodo de procesamiento de datos.
MX2019010683A (es) Transmisor y metodo de acortamiento del mismo.