Suchergebnisse - "iterative decoding algorithms"

On the Use of Extrinsic Probabilities in the Computation of Non-Bayesian Cramér–Rao Bounds for Coded Linearly Modulated Signals

Autoren: Nele Noels Marc Moeneclaey

Quelle: IEEE TRANSACTIONS ON SIGNAL PROCESSING

Schlagwörter: 0508 media and communications, approximation error, 05 social sciences, Parameter estimation, 0202 electrical engineering, electronic engineering, information engineering, Cramer-Rao bounds, 02 engineering and technology, channel codes, iterative decoding algorithms, 6. Clean water

Dateibeschreibung: application/pdf

Zugangs-URL: https://biblio.ugent.be/publication/8562448/file/8562453.pdf
https://core.ac.uk/display/158345527
https://dblp.uni-trier.de/db/journals/tsp/tsp66.html#NoelsM18
https://ui.adsabs.harvard.edu/abs/2018ITSP...66.2128N/abstract
https://biblio.ugent.be/publication/8562448
https://biblio.ugent.be/publication/8562448/file/8562453.pdf
https://biblio.ugent.be/publication/8562448/file/8562453
https://biblio.ugent.be/publication/8562448
http://hdl.handle.net/1854/LU-8562448
http://doi.org/10.1109/tsp.2018.2806384

Graph-based iterative decoding algorithms for parity-concatenated trellis codes

Autoren: Qi Wang Lei Wei

Quelle: IEEE Transactions on Information Theory. 47:1062-1074

Schlagwörter: trellis-coded modulation, 0508 media and communications, Decoding, Tanner-Wiberg-Loeliger graph, Applications of graph theory, trellis codes, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, concatenated codes, iterative decoding algorithms, Viterbi algorithm, Combined modulation schemes (including trellis codes) in coding theory

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1775817
https://doi.org/10.1109/18.915663
https://dblp.uni-trier.de/db/journals/tit/tit47.html#WangW01
http://ieeexplore.ieee.org/document/915663/
https://ieeexplore.ieee.org/document/915663/
https://core.ac.uk/display/24632995
http://dblp.uni-trier.de/db/journals/tit/tit47.html#WangW01

The distribution of loop lengths in graphical models for turbo decoding

Autoren: Ge, Xian-ping Eppstein, David Smyth, Padhraic

Quelle: IEEE Transactions on Information Theory. 47:2549-2553

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Decoding, Other types of codes, E.4, Directed graphs (digraphs), tournaments, G.2.2, 02 engineering and technology, iterative decoding algorithms, directed graphs, turbo decoding, turbo codes, distribution of loop lengths, 0202 electrical engineering, electronic engineering, information engineering, Cyclic codes, Computer Science - Discrete Mathematics

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/pdf/cs/9907002
http://arxiv.org/abs/cs/9907002
http://core.ac.uk/display/24405947
https://dblp.uni-trier.de/db/journals/tit/tit47.html#GeES01
http://dblp.uni-trier.de/db/journals/tit/tit47.html#GeES01
https://arxiv.org/abs/cs/9907002
http://dblp.uni-trier.de/db/journals/corr/corr9907.html#cs-DM-9907002
https://ui.adsabs.harvard.edu/abs/1999cs........7002G/abstract
https://arxiv.org/pdf/cs/9907002
https://dblp.uni-trier.de/db/journals/corr/corr9907.html#cs-DM-9907002
https://escholarship.org/uc/item/13r93259

Complexity comparison of non-binary LDPC decoders

Autoren: Conde-Canencia, Laura Al Ghouwayel, Ali Boutillon, Emmanuel et al.

Weitere Verfasser: Conde-Canencia, Laura Al Ghouwayel, Ali Boutillon, Emmanuel et al.

Quelle: ICT-MobileSummit 2009 Conference Proceedings ISBN: 978-1-905824-12-0 ; ICT-MobileSummit 2009 ; https://hal.science/hal-00447987 ; ICT-MobileSummit 2009, Jun 2009, Santander, Spain

Schlagwörter: non-binary LDPC codes, iterative decoding algorithms, complexity analysi, Extended Min-Sum, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing

Geographisches Schlagwort: Santander, Spain

Verfügbarkeit: https://hal.science/hal-00447987

Performance analysis of iterative decoding algorithms with memory over memoryless channels

Autoren: Janulewicz, E. (Emil) Banihashemi, A. (Amir)

Quelle: IEEE Transactions on Communications vol. 60 no. 12, pp. 3556-3566

Schlagwörter: Bayesian networks, belief propagation (BP), density evolution, differential decoding with binary message passing (DD-BMP), Iterative coding schemes, iterative decoding algorithms with memory, low-density parity-check (LDPC) codes, memoryless channels, min-sum (MS)

Relation: https://ir.library.carleton.ca/pub/22854

Verfügbarkeit: https://ir.library.carleton.ca/pub/22854
https://doi.org/10.1109/TCOMM.2012.082812.110838

On implementation of min-sum algorithm and its modifications for decoding low-density parity-check (LDPC) codes

Autoren: Zhao, J. (Jianguang) Zarkeshvari, F. (Farhad) Banihashemi, A. (Amir)

Quelle: IEEE Transactions on Communications vol. 53 no. 4, pp. 549-554

Schlagwörter: Clipping, Iterative decoding algorithms, Low-density parity-check (LDPC) codes, Max-product algorithm, Max-sum algorithm, Min-sum algorithm, Modified min-sum algorithms, Quantization

Relation: https://ir.library.carleton.ca/pub/22913

Verfügbarkeit: https://ir.library.carleton.ca/pub/22913
https://doi.org/10.1109/TCOMM.2004.836563

Comparison Of Decoding Algorithms For Low-density Parity-check Codes

Autoren: Kolayli, Mert

Thesis Advisors: Diker Yucel, Melek

Schlagwörter: TK Telecommunication (including telegraphy, telephone, radio, radar, television) 5101-6720, LDPC codes, sum-product algorithm, bit-flip algorithm, iterative decoding algorithms.

Dateibeschreibung: text/pdf

Verfügbarkeit: http://etd.lib.metu.edu.tr/upload/12607731/index.pdf

Coded modulations for the multiple-antenna and cooperative fading channels ; Modulations codées pour les systèmes à antennes multiples et coopératifs

Autoren: Kraidy, Ghassan Département Communications & Electronique (COMELEC) Télécom ParisTech et al.

Weitere Verfasser: Kraidy, Ghassan Département Communications & Electronique (COMELEC) Télécom ParisTech et al.

Quelle: https://pastel.archives-ouvertes.fr/tel-01823688 ; Information Theory [cs.IT]. Telecom ParisTech, 2007. English.

Schlagwörter: Coded MIMO Systems, Cooperative communications, Iterative decoding algorithms, Space-time coding, Block-fading channel, Communication MIMO, ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]

Relation: tel-01823688; https://pastel.archives-ouvertes.fr/tel-01823688; https://pastel.archives-ouvertes.fr/tel-01823688/document; https://pastel.archives-ouvertes.fr/tel-01823688/file/principal.pdf

Verfügbarkeit: https://pastel.archives-ouvertes.fr/tel-01823688
https://pastel.archives-ouvertes.fr/tel-01823688/document
https://pastel.archives-ouvertes.fr/tel-01823688/file/principal.pdf

Density evolution analysis of node-based verification-based algorithms in compressed sensing

Autoren: Eftekhari, Y. (Yaser) Heidarzadeh, A. (Anoosheh) Banihashemi, A. (Amir) et al.

Quelle: IEEE Transactions on Information Theory vol. 58 no. 10, pp. 6616-6645

Schlagwörter: Asymptotic analysis, channel coding, compressed sensing, density evolution, iterative decoding algorithms, iterative recovery algorithms, low-complexity compressed sensing, low-density parity-check (LDPC) codes, message-passing algorithms, sparse graphs, sparse sensing matrix, success threshold, verification-based recovery algorithms

Relation: https://ir.library.carleton.ca/pub/6336

Verfügbarkeit: https://ir.library.carleton.ca/pub/6336
https://doi.org/10.1109/TIT.2012.2206368