MA36996B1 - Generalized decoder with codes other than idpc, low density parity check - Google Patents

Generalized decoder with codes other than idpc, low density parity check

Info

Publication number
MA36996B1
MA36996B1 MA36996A MA36996A MA36996B1 MA 36996 B1 MA36996 B1 MA 36996B1 MA 36996 A MA36996 A MA 36996A MA 36996 A MA36996 A MA 36996A MA 36996 B1 MA36996 B1 MA 36996B1
Authority
MA
Morocco
Prior art keywords
variables
test values
codes
level
idpc
Prior art date
Application number
MA36996A
Other languages
French (fr)
Other versions
MA36996A1 (en
Inventor
Hassan Berbiaa
Original Assignee
Univ Mohammed V Souissi
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 Univ Mohammed V Souissi filed Critical Univ Mohammed V Souissi
Priority to MA36996A priority Critical patent/MA36996B1/en
Priority to PCT/MA2014/000026 priority patent/WO2015170949A1/en
Publication of MA36996A1 publication Critical patent/MA36996A1/en
Publication of MA36996B1 publication Critical patent/MA36996B1/en

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/1191Codes on graphs other than LDPC codes
    • 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/29Coding, 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/2906Coding, 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

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

Notre invention est deux concaténer, deux codes en parallèle après entrelacementdes données. Le décodage ne sera plus fait par l'échange des confiances entre les noeudsde variables et leurs valeurs de test correspondant, mais les confiance vont être transmisdes variables vers leurs valeurs de test correspondant puis ces derniers valeurs de testvers les variables entrelacées puis des variables entrelacées vers leurs valeurs de testcorrespondants et depuis ces derniers en retourne vers les variables voir figure 05.Cette solution va participer à augmenter la taille des cycles et par la suite améliorer lesperformances du système et même utiliser des matrices de moyenne ou petite taille. Enpeut généraliser ce décodeur à n niveaux en passant des variables vers leurs valeurs detest correspondants puis ces derniers vers les variables entrelacées du deuxième niveauxpuis vers les valeurs de test puis vers les variables entrelacées du troisième niveau jusqu'aunième niveaux pour revenir aux variables initiales voir figure 06.Our invention is two concatenate, two codes in parallel after interleaving data. The decoding will no longer be done by the exchange of trusts between the variable nodes and their corresponding test values, but the confidence will be transmitted from the variables to their corresponding test values and then these last test values to the interleaved variables and then interlaced variables to their corresponding test values and from these returns to the variables see figure 05. This solution will participate in increasing the size of the cycles and subsequently improve the performance of the system and even use matrices of medium or small size. It can generalize this decoder to n levels by passing variables to their corresponding detest values and then these to the interlaced variables of the second level, then to the test values then to the interleaved variables of the third level up to the first level to return to the initial variables see figure 06.

MA36996A 2014-05-08 2014-05-08 Generalized decoder with codes other than idpc, low density parity check MA36996B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
MA36996A MA36996B1 (en) 2014-05-08 2014-05-08 Generalized decoder with codes other than idpc, low density parity check
PCT/MA2014/000026 WO2015170949A1 (en) 2014-05-08 2014-11-04 Generalised decoder employing belief propagation using codes other than ldpc codes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
MA36996A MA36996B1 (en) 2014-05-08 2014-05-08 Generalized decoder with codes other than idpc, low density parity check

Publications (2)

Publication Number Publication Date
MA36996A1 MA36996A1 (en) 2016-09-30
MA36996B1 true MA36996B1 (en) 2017-05-31

Family

ID=52282822

Family Applications (1)

Application Number Title Priority Date Filing Date
MA36996A MA36996B1 (en) 2014-05-08 2014-05-08 Generalized decoder with codes other than idpc, low density parity check

Country Status (2)

Country Link
MA (1) MA36996B1 (en)
WO (1) WO2015170949A1 (en)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100918763B1 (en) * 2003-11-14 2009-09-24 삼성전자주식회사 Interleaving apparatus and method in a channel coder using a parallel concatenated low density parity check code
US20050160351A1 (en) * 2003-12-26 2005-07-21 Ko Young J. Method of forming parity check matrix for parallel concatenated LDPC code

Also Published As

Publication number Publication date
WO2015170949A1 (en) 2015-11-12
MA36996A1 (en) 2016-09-30

Similar Documents

Publication Publication Date Title
RU2017120495A (en) METHOD AND DEVICE FOR POLAR CODING
Scoffoni et al. Are leaves ‘freewheelin'? Testing for a W heeler‐type effect in leaf xylem hydraulic decline
EA201500768A1 (en) SYSTEM AND COMPUTER-REALIZABLE METHOD FOR DETERMINING THE PROPERTIES OF WETTABILITY OF FLUID-CONTAINING POROUS MEDIA
JP2015516766A5 (en)
BR112019005942A2 (en) Technologies to improve computer security, variable word length encoding, and variable length decoding
RU2016130452A (en) METHOD AND SYSTEM FOR THE PROVISION OF MUSICAL RECOMMENDATIONS
MA36996B1 (en) Generalized decoder with codes other than idpc, low density parity check
RU2015148437A (en) A method for detecting hidden relationships and a system for investigating the incident of safety on the Internet of Things
Meyer et al. Adaptive Multi-Scale Pore Network Method for Two-Phase Flow in Porous Media
Karimbux Knowing Where We're Going in Assessment.
Ahmed et al. A study and an Analysis of the Experiment of New Assiut City In the Provision of Appropriate Low-income Housing
Alizad et al. Dynamic Response of Florida Big-Bend Wetlands to Sea Level Rise
Kim et al. A Study on JavaScript Optimization Problem in Ziproxy
Oliveira et al. Special education in curricular proposals for child's educational
申昭华 The effects of schema instruction on reading comprehension of English argumentation
Mostafaei et al. The Effect of education on child's family anxiety whom hospitalized in pICU
TAKAHASHI Development of the Interpersonal Stressor Scale.
Griner et al. The Complexity of Network Traffic Traces
Marcoux Bandwith.
Harrington et al. On the emergence of unusual, unfamiliar and unknown climates
Klaus et al. A new non-parametric framework to determine time-variant catchment transit times and their distributions
CN103297199A (en) Data block verification method and device based on P2P network transmission
Куренева Kureneva NR Ryazan State University named after SA Esenin faculty of law, graduate student Russia, Ryazan
Zaman Chaudhry A general framework for the Quantum Zeno and anti-Zeno effects
Khayrat et al. Multiscale Pore Network Model for Two-Phase Flow in Porous Media