Zobrazeno 1 - 10
of 354
pro vyhledávání: '"Alexandre Graell i Amat"'
Autor:
Issam Maarouf, Andreas Lenz, Lorenz Welter, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat
Publikováno v:
IEEE Transactions on Information Theory. 69:910-927
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ba197abe02bc1190049938fc39672cd
https://doi.org/10.1109/tit.2022.3206527
https://doi.org/10.1109/tit.2022.3206527
Autor:
Zonglong He, Jinxiang Song, Kovendhan Vijayan, Christian Hager, Alexandre Graell i Amat, Henk Wymeersch, Peter A. Andrekson, Magnus Karlsson, Jochen Schroder
Publikováno v:
Journal of Lightwave Technology. 40:6168-6178
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d1f43ba49c481238a7d2e45b8ca1eb9
https://doi.org/10.1109/jlt.2022.3191464
https://doi.org/10.1109/jlt.2022.3191464
Publikováno v:
IEEE Transactions on Communications. 70:5771-5787
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes (PCCs) wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::705a1cd73b9f40094f10b8e7ba6147d7
https://doi.org/10.1109/tcomm.2022.3196686
https://doi.org/10.1109/tcomm.2022.3196686
Publikováno v:
Entropy, Vol 23, Iss 2, p 240 (2021)
In this paper, we perform a belief propagation (BP) decoding threshold analysis of spatially coupled (SC) turbo-like codes (TCs) (SC-TCs) on the additive white Gaussian noise (AWGN) channel. We review Monte-Carlo density evolution (MC-DE) and efficie
Externí odkaz:
https://doaj.org/article/6c49a6b177364167ab38088f05d3bf41
Publikováno v:
IEEE Journal on Selected Areas in Communications. 40:54-64
Neural networks (NNs) for multiple hardware impairments mitigation of a realistic direct conversion transmitter are impractical due to high computational complexity. We propose two methods to reduce complexity without significant performance penalty.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a9156c85792a5cea438aa83f2eebb50
https://doi.org/10.1109/jsac.2021.3126024
https://doi.org/10.1109/jsac.2021.3126024
Autor:
Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier, Henry D. Pfister
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c71fbf9e1f1d2735cde15c73a127dd34
https://doi.org/10.1109/tit.2022.3207802
https://doi.org/10.1109/tit.2022.3207802
CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in the trellis with the forward-backward algorithm, and the strength o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ea356badb32cfe002f2a37a72af419a
http://arxiv.org/abs/2211.17056
http://arxiv.org/abs/2211.17056
Publikováno v:
Journal of Lightwave Technology. 39:4909-4922
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance decoding (BDD) of the component codes and iterating between row and column decoders. The performance of iterative BDD (iBDD) can be improved using sof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a33cf7bc2ee6a46d025a8de952a0aa1
https://doi.org/10.1109/jlt.2021.3078172
https://doi.org/10.1109/jlt.2021.3078172
Publikováno v:
Journal of Lightwave Technology. 39:4958-4973
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f51d4cdb8f60dfb677c405ddee585e8
https://doi.org/10.1109/jlt.2021.3081586
https://doi.org/10.1109/jlt.2021.3081586
Publikováno v:
2022 30th European Signal Processing Conference (EUSIPCO).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::737e0e16b07df6d4c28329d23867fa81
https://doi.org/10.23919/eusipco55093.2022.9909849
https://doi.org/10.23919/eusipco55093.2022.9909849