activity
20162019
most citedAnalysis and design of Raptor codes using a multi-edge framework

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT2019

Protograph LDPC Code Design for Asynchronous Random Access

Federico Clazzer, Balazs Matuz, Sachini Jayasooriya +2

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…

cs.IT2017

Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework

Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong +1

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 us…

cs.IT2017★ 1 cited

Analysis and design of Raptor codes using a multi-edge framework

Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong +1

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-dens…

cs.IT2016

New Density Evolution Approximation for LDPC and Multi-Edge Type LDPC Codes

Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong +2

This paper considers density evolution for lowdensity parity-check (LDPC) and multi-edge type low-density parity-check (MET-LDPC) codes over the binary input additive white Gaussia…

cs.IT2016

A Joint Optimization Technique for Multi-Edge Type LDPC Codes

Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong +1

This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize th…

cs.IT2016

Optimization of Graph Based Codes for Belief Propagation Decoding

Sachini Jayasooriya, Sarah J. Johnson, Lawrence Ong +1

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 stand…