BR112016007458A2 - dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso - Google Patents

dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso

Info

Publication number
BR112016007458A2
BR112016007458A2 BR112016007458A BR112016007458A BR112016007458A2 BR 112016007458 A2 BR112016007458 A2 BR 112016007458A2 BR 112016007458 A BR112016007458 A BR 112016007458A BR 112016007458 A BR112016007458 A BR 112016007458A BR 112016007458 A2 BR112016007458 A2 BR 112016007458A2
Authority
BR
Brazil
Prior art keywords
sparse
chart
creates
code
arbitrary
Prior art date
Application number
BR112016007458A
Other languages
English (en)
Inventor
Shirai Daisuke
Kitamura Masahiko
Nakachi Takayuki
Fujii Tatsuya
Yamaguchi Takahiro
Tonomura Yoshihide
Original Assignee
Nippon Telegraph & Telephone
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 Nippon Telegraph & Telephone filed Critical Nippon Telegraph & Telephone
Publication of BR112016007458A2 publication Critical patent/BR112016007458A2/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/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
    • 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/033—Theoretical methods to calculate these checking codes
    • H03M13/036—Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists
    • 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/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
    • 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/1191—Codes on graphs other than 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/373—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3761—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] 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
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mathematical Physics (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Algebra (AREA)
  • Computational Mathematics (AREA)
  • Computing Systems (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Error Detection And Correction (AREA)
  • Complex Calculations (AREA)

Abstract

resumo dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso a finalidade da presente invenção é criar eficientemente um gráfico esparso em um código do gráfico esparso. a presente invenção se refere a um algoritmo peg seletivo, que cria uma matriz esparsa enquanto mantém o peso da linha/peso da coluna em níveis múltiplos arbitrários e no processo, inativando uma borda arbitrária de modo que um loop mínimo formado entre os nós arbitrários seja ampliado ou realizando a intercalação restrita, de modo que a eficiência da codificação no caso onde um espaço da matriz é estreito seja melhorada. 1/1
BR112016007458A 2013-10-22 2014-10-08 dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso BR112016007458A2 (pt)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2013218933A JP5792256B2 (ja) 2013-10-22 2013-10-22 疎グラフ作成装置及び疎グラフ作成方法
PCT/JP2014/076910 WO2015060130A1 (ja) 2013-10-22 2014-10-08 疎グラフ作成装置及び疎グラフ作成方法

Publications (1)

Publication Number Publication Date
BR112016007458A2 true BR112016007458A2 (pt) 2017-08-01

Family

ID=52992732

Family Applications (1)

Application Number Title Priority Date Filing Date
BR112016007458A BR112016007458A2 (pt) 2013-10-22 2014-10-08 dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso

Country Status (5)

Country Link
US (1) US11303305B2 (pt)
EP (2) EP3264612B1 (pt)
JP (1) JP5792256B2 (pt)
BR (1) BR112016007458A2 (pt)
WO (1) WO2015060130A1 (pt)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10540398B2 (en) * 2017-04-24 2020-01-21 Oracle International Corporation Multi-source breadth-first search (MS-BFS) technique and graph processing system that applies it
CN109165322B (zh) * 2018-08-01 2022-04-19 成都数联铭品科技有限公司 基于路径关系的网络特征提取系统及方法
US20190340511A1 (en) * 2019-06-20 2019-11-07 Intel Corporation Sparsity control based on hardware for deep-neural networks
CN113012555B (zh) * 2019-12-20 2022-06-24 百度在线网络技术（北京）有限公司 地图显示方法、装置、电子设备和存储介质

Family Cites Families (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5327561A (en) * 1991-09-20 1994-07-05 International Business Machines Corporation System and method for solving monotone information propagation problems
WO2006027818A1 (ja) 2004-09-03 2006-03-16 Mitsubishi Denki Kabushiki Kaisha Ｌｄｐｃ符号生成方法および通信装置
FI121431B (fi) 2004-09-13 2010-11-15 Tamfelt Pmc Oy Paperikoneessa käytettävä kudosrakenne ja menetelmä sen valmistamiseksi
US7996746B2 (en) * 2004-10-12 2011-08-09 Nortel Networks Limited Structured low-density parity-check (LDPC) code
US8117523B2 (en) * 2007-05-23 2012-02-14 California Institute Of Technology Rate-compatible protograph LDPC code families with linear minimum distance
US7747633B2 (en) * 2007-07-23 2010-06-29 Microsoft Corporation Incremental parsing of hierarchical files
EP2134018A1 (en) * 2008-05-23 2009-12-16 Deutsches Zentrum für Luft- und Raumfahrt e.V. Method for recovery of lost and/ or corrupted data
US20100146007A1 (en) * 2008-12-09 2010-06-10 Alex Kononov Database For Managing Repertory Grids
JP5523064B2 (ja) 2009-11-13 2014-06-18 三菱電機株式会社 復号装置及び方法
WO2011062111A1 (ja) * 2009-11-17 2011-05-26 三菱電機株式会社 誤り訂正方法および装置ならびにそれを用いた通信システム
US9128998B2 (en) * 2010-09-03 2015-09-08 Robert Lewis Jackson, JR. Presentation of data object hierarchies
US20120095957A1 (en) * 2010-10-18 2012-04-19 Tata Consultancy Services Limited Component Based Approach to Building Data Integration Tools
CN102467709B (zh) * 2010-11-17 2017-03-01 阿里巴巴集团控股有限公司 一种发送商品信息的方法和装置
US8751621B2 (en) * 2011-06-16 2014-06-10 Radiumone, Inc. Building a social graph based on links received and selected by receiving users of the open web
US8583659B1 (en) * 2012-07-09 2013-11-12 Facebook, Inc. Labeling samples in a similarity graph
US8929390B2 (en) * 2012-09-24 2015-01-06 Alcatel Lucent Methods and apparatuses for channel estimation in wireless networks
US20150293994A1 (en) * 2012-11-06 2015-10-15 Hewlett-Packard Development Company, L.P. Enhanced graph traversal
JPWO2014087590A1 (ja) * 2012-12-05 2017-01-05 日本電気株式会社 最適化装置、最適化方法および最適化プログラム
US20140208297A1 (en) * 2013-01-20 2014-07-24 International Business Machines Corporation Validation of revised computer programs
BR112015027153B1 (pt) * 2013-05-02 2021-12-14 Sony Corp Dispositivo e método de processamento de dados
US9501503B2 (en) * 2013-05-09 2016-11-22 Microsoft Technology Licensing, Llc Inferring entity attribute values
EP2816767A1 (en) * 2013-06-17 2014-12-24 Ericsson Modems SA Equalization in the receiver of a multiple input multiple output system
CN104518801A (zh) * 2013-09-29 2015-04-15 Lsi公司 非二进制的分层低密度奇偶校验解码器
US10545938B2 (en) * 2013-09-30 2020-01-28 Spigit, Inc. Scoring members of a set dependent on eliciting preference data amongst subsets selected according to a height-balanced tree
US9396164B2 (en) * 2013-10-21 2016-07-19 International Business Machines Corporation Sparsity-driven matrix representation to optimize operational and storage efficiency

Also Published As

Publication number Publication date
EP3264612A1 (en) 2018-01-03
JP2015082712A (ja) 2015-04-27
EP3264612B1 (en) 2022-08-17
WO2015060130A1 (ja) 2015-04-30
JP5792256B2 (ja) 2015-10-07
EP3062445A1 (en) 2016-08-31
US11303305B2 (en) 2022-04-12
US20160248448A1 (en) 2016-08-25
EP3062445A4 (en) 2017-10-25

Similar Documents

Publication Publication Date Title
BR112017028318A2 (pt) compostos antibacterianos
GB2527966A (en) Creating rules for use in third-party tag management systems
MX2019010132A (es) Metodo y aparato para codificacion y decodificacion de comprobacion de paridad de baja densidad.
BR112019018329B8 (pt) Método para processamento de informação e aparelho em um dispositivo de comunicações
GB2545070A (en) Generating molecular encoding information for data storage
BR112016007458A2 (pt) dispositivo de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso, e, método de criação de gráfico esparso que cria um gráfico esparso utilizado para um código de gráfico esparso
CL2015002728A1 (es) Un método para proporcionar un entorno de aprendizaje de idiomas
BR112016002637A8 (pt) Sincronização de barreira com cálculo dinâmico de largura
BR112018000030A2 (pt) módulo de controle de veículo, e, método para um módulo de controle de veículo
BR112016028225A8 (pt) processo para produção de um laminado, laminado, película protetora, uso da película protetora e dispositivo eletrônico
AR100996A1 (es) Compuestos que contienen guanidina o guanidinio para el tratamiento de formaciones subterráneas
CY1125071T1 (el) Θεραπεια του συνδρομου ευθραυστου χ με κανναβιδιολη
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.
BR112016030086A2 (pt) processo de monitoramento de uma degradação de um dispositivo embarcado de uma aeronave que inclui a determinação de um limite de contagem
BR112016009494A8 (pt) método implantado por computador, produto de programa computador não transitório e sistema para caracterização de um desempenho de operação
BR112015001647A2 (pt) método para associar um elemento óptico com pelo menos uma fonte de luz; elemento óptico ativo; aparelho de iluminação que inclui uma memória e um controlador que pode ser operado para executar as instruções armazenadas na memória; e sistema de iluminação
AR100407A1 (es) Aplicaciones volátiles contra patógenos
BR112018074025A2 (pt) otimizador de consulta para utilização de cpu e reformador de código
GB2512533A (en) Generating a code alphabet of symbols to generate codewords for words used with a program
BR112018002475A2 (pt) método para o controle das pragas de um vegetal de milho e utilização de um ou mais componentes da árvore de ginkgo
BR112017010804A2 (pt) polímero em multi-estágio, sua composição, seu método de preparação, seu uso e composição compreendendo o mesmo
AR093307A1 (es) Sistema, metodo y producto de programa informatico para la validacion estadistica multivariada de tratamientos de pozos y datos de estimulacion
BR112016023624A2 (pt) proteínas de antiporte prótons/ açúcar tonoplásticas e uso do mesmo para o aumento da concentração de sacarose de um órgão de plantas para armazenamento de sacarose
CL2015003554A1 (es) Preparado farmacéutico.
BR112017026203A2 (pt) método de geração de uma estratégia de produção para a explotação de um reservatório de hidrocarbonetos em um ambiente natural

Legal Events

Date Code Title Description
B06F Objections, documents and/or translations needed after an examination request according [chapter 6.6 patent gazette]
B06U Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]
B07A Application suspended after technical examination (opinion) [chapter 7.1 patent gazette]
B07A Application suspended after technical examination (opinion) [chapter 7.1 patent gazette]
B09A Decision: intention to grant [chapter 9.1 patent gazette]