Výsledky vyhledávání - "Message-passing decoding algorithms"
-
1
Autoři:
Zdroj: IEEE Transactions on Communications. 65:5110-5122
Témata: 0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
-
2
Autoři: Uzunoglu, Cihan
Thesis Advisors: Diker Yucel, Melek
Témata: TK Telecommunication (including telegraphy, telephone, radio, radar, television) 5101-6720, Message Passing Decoding Algorithms, Binary and Non-binary LDPC Codes.
Popis souboru: text/pdf
-
3
Autoři: Nguyen Ly, Thien Truong
Thesis Advisors: Cergy-Pontoise, Declercq, David
Témata: Ldpc, Imprécisions, D'optimisation de coût, Haut débit, NS-FAIDs, Impreciseness, Cost-Effective, High-Throughput
Dostupnost: http://www.theses.fr/2017CERG0904/document
-
4
Autoři:
Přispěvatelé:
Témata: Ldpc, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Impreciseness, D'optimisation de coût, NS-FAIDs, High-Throughput, Haut débit, Cost-Effective, Imprécisions
Popis souboru: application/pdf
Přístupová URL adresa: https://theses.hal.science/tel-01783859v1
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: https://tel.archives-ouvertes.fr/tel-01783859 ; Networking and Internet Architecture [cs.NI]. Université de Cergy Pontoise, 2017. English. ⟨NNT : 2017CERG0904⟩.
Témata: Ldpc, Impreciseness, Cost-Effective, High-Throughput, NS-FAIDs, Imprécisions, D'optimisation de coût, Haut débit, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Relation: NNT: 2017CERG0904; tel-01783859; https://tel.archives-ouvertes.fr/tel-01783859; https://tel.archives-ouvertes.fr/tel-01783859/document; https://tel.archives-ouvertes.fr/tel-01783859/file/62302_NGUYENLY_2017_difusion.pdf
-
6
Autoři:
Přispěvatelé:
Témata: Ldpc, Imprécisions, D'optimisation de coût, Haut débit, NS-FAIDs, Impreciseness, Cost-Effective, High-Throughput
Dostupnost: http://www.theses.fr/2017CERG0904/document
-
7
Autoři:
Zdroj: IEEE Transactions on Communications; Dec2017, Vol. 65 Issue 12, p5110-5122, 13p
-
8
Autoři: Wei Liu
Témata: capacity-achieving codes, capacity, low-density parity-check block codes and low-density parity-check convolutional codes, maximum likelihood decoding, iterative message-passing decoding algorithms, Belief propagation, universality, maximum a posteriori decoding, threshold saturation, stability condition
Přístupová URL adresa: https://infoscience.epfl.ch/record/271312
-
9
Autoři:
Přispěvatelé:
Popis souboru: application/pdf
Relation: http://etd.lib.metu.edu.tr/upload/2/12609072/index.pdf; https://hdl.handle.net/11511/17319
-
10
Autoři:
Zdroj: IEEE Transactions on Communications vol. 55 no. 2, pp. 292-302
Témata: Density evolution (DE), Hybrid decoding, Irregular low-density parity-check (LDPC) codes, Iterative coding schemes, Message-passing decoding algorithms
Relation: https://ir.library.carleton.ca/pub/22944
-
11
Autoři:
Zdroj: IEEE Communications Letters vol. 8 no. 4, pp. 250-252
Témata: Density evolution, Hybrid decoding, Iterative coding schemes, Low-density parity-check (LDPC) codes, Message-passing decoding algorithms
Relation: https://ir.library.carleton.ca/pub/22875
-
12
Autoři:
Zdroj: IEEE Communications Letters vol. 8 no. 1, pp. 57-59
Témata: Belief propagation, Iterative decoding, Low-density parity-check (LDPC) codes, Message-passing decoding algorithms, Normalized belief propagation, Offset belief propagation
Relation: https://ir.library.carleton.ca/pub/22946
-
13
-
14
-
15
Autoři: a další
Zdroj: 2012 Information Theory & Applications Workshop; 1/ 1/2012, p227-233, 7p
-
16
Autoři:
Zdroj: 2012 7th International Symposium on Turbo Codes & Iterative Information Processing (ISTC); 1/ 1/2012, p185-189, 5p
-
17
Autoři:
Zdroj: IEEE Communications Letters; Oct2013, Vol. 17 Issue 10, p1980-1983, 4p
-
18
Autoři:
Zdroj: i-Manager's Journal on Electronics Engineering; Sep-Nov2013, Vol. 4 Issue 1, p18-23, 6p
-
19
Autoři: a další
Zdroj: IEEE Transactions on Communications; May2010, Vol. 58 Issue 5, p1383-1396, 14p
-
20
Autoři:
Zdroj: IEEE Transactions on Information Theory; Dec2005, Vol. 51 Issue 12, p4216-4236, 21p
Full Text Finder
Nájsť tento článok vo Web of Science