BR112016027106A2 - método de intercalação de um aparelho de transmissão - Google Patents

método de intercalação de um aparelho de transmissão

Info

Publication number
BR112016027106A2
BR112016027106A2 BR112016027106A BR112016027106A BR112016027106A2 BR 112016027106 A2 BR112016027106 A2 BR 112016027106A2 BR 112016027106 A BR112016027106 A BR 112016027106A BR 112016027106 A BR112016027106 A BR 112016027106A BR 112016027106 A2 BR112016027106 A2 BR 112016027106A2
Authority
BR
Brazil
Prior art keywords
bits
transmission apparatus
ldpc codeword
ldpc
codeword
Prior art date
Application number
BR112016027106A
Other languages
English (en)
Other versions
BR112016027106B1 (pt
Inventor
Daniel Lobete Ansorregui
Mouhouche Belkacem
Jeong Hong-Sil
Kim Kyung-Joong
Myung Se-Ho
Original Assignee
Samsung Electronics Co Ltd
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 Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Priority claimed from PCT/KR2015/005099 external-priority patent/WO2015178694A1/en
Publication of BR112016027106A2 publication Critical patent/BR112016027106A2/pt
Publication of BR112016027106B1 publication Critical patent/BR112016027106B1/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/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/2792—Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
    • 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/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/2703—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 the interleaver involving at least two directions
    • 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
    • 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/1177—Regular LDPC codes with parity-check matrices wherein all rows and columns have the same row weight and column weight, respectively
    • 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/253—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 concatenated 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/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
    • H03M13/2703—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 the interleaver involving at least two directions
    • H03M13/2707—Simple row-column interleaver, i.e. pure block interleaving
    • 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/2703—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 the interleaver involving at least two directions
    • H03M13/271—Row-column interleaver with permutations, e.g. block interleaving with inter-row, inter-column, intra-row or intra-column 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/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/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
    • 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/0041—Arrangements at the transmitter end
    • 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/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/02—Amplitude-modulated carrier systems, e.g. using on-off keying; Single sideband or vestigial sideband modulation
    • H04L27/04—Modulator circuits; Transmitter circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • 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

Abstract

aparelho de transmissão, e método de intercalação de um aparelho de transmissão. um aparelho de transmissão é fornecido. o aparelho de transmissão inclui: um codificador configurado para gerar uma palavra de código de verificação de paridade de baixa densidade (ldpc) através da codificação de ldpc de bits de entrada com base em uma matriz de verificação de paridade, incluindo bits de palavra de informações e bits de paridade, a palavra de código de ldpc incluindo uma pluralidade de grupos de bits de cada um incluindo uma pluralidade de bits; um intercalador configurado para intercalar a palavra de código de ldpc; e um modulador configurado para mapear a palavra de código de ldpc intercalada para um símbolo de modulação, em que o intercalador é configurado, ainda, para intercalar a palavra de código de ldpc de modo que um bit seja incluído em um grupo de bits predeterminado dentre a pluralidade de grupos de bits que constituem a palavra de código de ldpc para um bit predeterminado do símbolo de modulação.
BR112016027106-8A 2014-05-21 2015-05-21 Método de intercalação de um aparelho de transmissão, e aparelho de transmissão BR112016027106B1 (pt)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US201462001155P 2014-05-21 2014-05-21
US62/001,155 2014-05-21
KR10-2015-0000697 2015-01-05
KR1020150000697A KR101775704B1 (ko) 2014-05-21 2015-01-05 송신 장치 및 그의 인터리빙 방법
PCT/KR2015/005099 WO2015178694A1 (en) 2014-05-21 2015-05-21 Transmitting apparatus and interleaving method thereof

Publications (2)

Publication Number Publication Date
BR112016027106A2 true BR112016027106A2 (pt) 2021-06-08
BR112016027106B1 BR112016027106B1 (pt) 2023-09-19

Family

ID=

Also Published As

Publication number Publication date
CA2949034C (en) 2019-03-12
KR101928991B1 (ko) 2018-12-14
CN110730010B (zh) 2023-06-20
CA3031266C (en) 2021-07-27
KR20200058376A (ko) 2020-05-27
KR101970723B1 (ko) 2019-04-22
KR102413021B1 (ko) 2022-06-24
KR20180133832A (ko) 2018-12-17
MX2019014454A (es) 2020-02-10
CN110719114B (zh) 2023-06-16
KR20190041449A (ko) 2019-04-22
KR20220088839A (ko) 2022-06-28
US11218173B2 (en) 2022-01-04
CN106464270A (zh) 2017-02-22
US20220103190A1 (en) 2022-03-31
KR102531095B1 (ko) 2023-05-10
US20190305801A1 (en) 2019-10-03
CN110719114A (zh) 2020-01-21
CA3121696A1 (en) 2015-11-26
KR101775704B1 (ko) 2017-09-19
CN110730010A (zh) 2020-01-24
KR102116113B1 (ko) 2020-05-27
MX2016015204A (es) 2017-03-03
MX2019014455A (es) 2020-02-10
EP3146635A4 (en) 2018-02-14
EP3146635A1 (en) 2017-03-29
MX370108B (es) 2019-12-02
KR20150134258A (ko) 2015-12-01
CA3121696C (en) 2023-10-24
US11949433B2 (en) 2024-04-02
CN106464270B (zh) 2019-10-18
EP3146635B1 (en) 2022-05-04
CA3031266A1 (en) 2015-11-26
KR20170103730A (ko) 2017-09-13
CA2949034A1 (en) 2015-11-26

Similar Documents

Publication Publication Date Title
BR112016027099A2 (pt) aparelho de transmissão
MX371227B (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019014454A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019008372A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019014457A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX2019014726A (es) Aparato de transmision y metodo de intercalacion del mismo.
MX357188B (es) Aparato transmisor y método de procesamiento de señal del mismo.
MX2019005428A (es) Entrelazador de bits para palabra codigo de revision de paridad de baja densidad que tiene una longitud de 64800 y un indice de codigo de 4/15 y mapeo de 256 simbolos, y metodo para entrelazar bits que utiliza el mismo.
MX2020003772A (es) Entrelazador de bits para palabra codigo de revision de paridad de baja densidad que tiene una longitud de 64800 y un indice de codigo de 5/15 y mapeo de 64 simbolos, y metodo para entrelazar bits que utiliza el mismo.
WO2016140516A3 (en) Transmitter and parity permutation method thereof
MX2020003791A (es) Entrelazador de bits para palabra codigo de revision de paridad de baja densidad que tiene una longitud de 16200 y un indice de codigo de 10/15 y mapeo de 256 simbolos, y metodo para entrelazar bits que utiliza el mismo.
MX2020011643A (es) Transmisor y metodo de permutacion de paridad del mismo.
MX2019015600A (es) Transmisor y metodo de permutacion de paridad del mismo.
MX2019010686A (es) Transmisor y metodo de acortamiento del mismo.
MX2020004657A (es) Transmisor y metodo de acortamiento del mismo.
MX2019009589A (es) Transmisor y metodo de permutacion de paridad del mismo.
MX2015002913A (es) Entrelazador de bits para palabra codigo de revision de paridad de baja densidad que tiene una longitud de 64800 y un indice de codigo de 4/15 y mapeo de 256 simbolos, y metodo para entrelazar bits que utiliza el mismo.
MX2015006530A (es) Entrelazador de bits para palabra codigo de revision de paridad de baja densidad que tiene una longitud de 16200 y un indice de codigo de 3/15 y mapeo de 64 simbolos, y metodo para entrelazar bits que utiliza el mismo.
MX2017011153A (es) Transmisor y metodo de permutacion de paridad del mismo.
MX345595B (es) Entrelazador de bits para palabra código de revisión de paridad de baja densidad que tiene una longitud de 64800 y un índice de código de 5/15 y mapeo de 64 símbolos, y método para entrelazar bits que utiliza el mismo.

Legal Events

Date Code Title Description
B06U Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]
B350 Update of information on the portal [chapter 15.35 patent gazette]
B07A Application suspended after technical examination (opinion) [chapter 7.1 patent gazette]
B154 Notification of filing of divisional application [chapter 15.50 patent gazette]

Free format text: O PEDIDO FOI DIVIDIDO NO BR122023008081-5 PROTOCOLO 870230035387 EM 27/04/2023 15:16.

B09A Decision: intention to grant [chapter 9.1 patent gazette]
B16A Patent or certificate of addition of invention granted [chapter 16.1 patent gazette]

Free format text: PRAZO DE VALIDADE: 20 (VINTE) ANOS CONTADOS A PARTIR DE 21/05/2015, OBSERVADAS AS CONDICOES LEGAIS