Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sachini Jayasooriya"'
Autor:
Federico Clazzer, Balázs Matuz, Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Sarah J. Johnson
Publikováno v:
Algorithms, Vol 12, Iss 8, p 170 (2019)
This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define
Externí odkaz:
https://doaj.org/article/7debc1b389b24b2780cf78c9b660b1b4
Publikováno v:
ISTC
Batched sparse (BATS) codes, a class of random linear network coding, are proposed to transmit a collection of packets through erasure networks. BATS codes generalize the fountain codes and preserve properties such as ratelessness and low encoding/de
Publikováno v:
IEEE Wireless Communications Letters. 7:110-113
In this paper, we represent Raptor codes as multi-edge type low-density parity-check (MET-LDPC) codes, which gives a general framework to design them for higher-order modulation using MET density evolution. We then propose an efficient Raptor code de
Publikováno v:
IEEE Transactions on Communications. 65:5123-5136
The focus of this paper is on the analysis and design of Raptor codes using a multi-edge framework. In this regard, we first represent the Raptor code as a multi-edge type low-density parity-check (METLDPC) code. This MET representation gives a gener
Publikováno v:
IET Communications. 11:61-68
This study considers the optimisation of multi-edge type low-density parity-check (MET-LDPC) codes to maximise the decoding threshold. The authors propose an algorithm to jointly optimise the node degree distribution and the multi-edge structure of M
Autor:
Balazs Matuz, Sachini Jayasooriya, Sarah J. Johnson, Federico Clazzer, Mahyar Shirvanimoghaddam
Publikováno v:
Algorithms
Volume 12
Issue 8
Algorithms, Vol 12, Iss 8, p 170 (2019)
Volume 12
Issue 8
Algorithms, Vol 12, Iss 8, p 170 (2019)
This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define
Publikováno v:
ITW
A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief propagation, passes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33580ab85c96dc6d5ae9c3915fd14bac
http://arxiv.org/abs/1605.04661
http://arxiv.org/abs/1605.04661
Autor:
Gottfried Lechner, Mahyar Shirvanimoghaddam, Sarah J. Johnson, Sachini Jayasooriya, Lawrence Ong
This paper considers density evolution for low-density parity-check (LDPC) and multi-edge type LDPC (MET-LDPC) codes over the binary input additive white Gaussian noise channel. We first analyze three single-parameter Gaussian approximations for dens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2d4d0e1dde067e5b7d8c745aa4f707a
https://hdl.handle.net/11541.2/124007
https://hdl.handle.net/11541.2/124007
Autor:
Sarah J. Johnson, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Balazs Matuz, Federico Clazzer
Publikováno v:
ISTC
This paper addresses the design of protograph low-density parity-check (LDPC) codes for an asynchronous random access (RA) scheme. At the receiver successive interference cancellation (SIC) is assumed to recover packets subject to Gaussian interferen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20a06a0a593100d2f4b650de78591358
https://elib.dlr.de/122441/
https://elib.dlr.de/122441/