← Search

Alexios Balatsoukas-Stimming

6 accepted papers

2023

Recursive/Iterative Unique Projection-Aggregation Decoding of Reed-Muller Codes

ICASSP 2023accepted

We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respect…

Cited by 0SourceScholar
2023

Single-Anchor UWB Localization Using Channel Impulse Response Distributions

ICASSP 2023accepted

Ultra-wideband (UWB) devices are widely used in indoor localization scenarios. Single-anchor UWB localization shows advantages because of its simple system setup compared to conventional two-way ranging (TWR) and trilateration localization methods. In this work, we focus on single-anchor UWB localiz…

Cited by 0SourceScholar
2021

Hardware Implementation of Iterative Projection-Aggregation Decoding of Reed-Muller Codes

ICASSP 2021accepted

In this work, we present a simplification and a corresponding hardware architecture for hard-decision recursive projection-aggregation (RPA) decoding of Reed-Muller (RM) codes. In particular, we transform the recursive structure of RPA decoding into a simpler and iterative structure with minimal err…

Cited by 0SourceScholar
2021

Towards Practical Near-Maximum-Likelihood Decoding of Error-Correcting Codes: An Overview

ICASSP 2021accepted

While in the past several decades the trend to go towards increasing error-correcting code lengths was predominant to get closer to the Shannon limit, applications that require short block length are developing. Therefore, decoding techniques that can achieve near-maximum-likelihood (near-ML) are ga…

Cited by 0SourceScholar
2020

Lupulus: A Flexible Hardware Accelerator for Neural Networks

ICASSP 2020accepted

Neural networks have become indispensable for a wide range of applications, but they suffer from high computationaland memory-requirements, requiring optimizations from the algorithmic description of the network to the hardware implementation. Moreover, the high rate of innovation in machine learnin…

Cited by 0SourceScholar
2016

Partitioned successive-cancellation list decoding of polar codes

ICASSP 2016accepted

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to re…

Cited by 0SourceScholar