10 citations · 20 across the 10 of their papers we have counts for
6 papers
Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes
Marzieh Hashemipour-Nazari, Kees Goossens, Alexios Balatsoukas-Stimming
The recently introduced recursive projection aggregation (RPA) decoding method for Reed-Muller (RM) codes can achieve near-maximum likelihood (ML) decoding performance. However, it…
Sliding Window Spectrum Sensing for Full-Duplex Cognitive Radios with Low Access-Latency
Orion Afisiadis, Andrew C. M. Austin, Alexios Balatsoukas-Stimming +1
In a cognitive radio system the failure of secondary user (SU) transceivers to promptly vacate the channel can introduce significant access-latency for primary or high-priority use…
A Low-Complexity Improved Successive Cancellation Decoder for Polar Codes
Orion Afisiadis, Alexios Balatsoukas-Stimming, Andreas Burg
Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorith…
Baseband and RF Hardware Impairments in Full-Duplex Wireless Systems: Experimental Characterisation and Suppression
Alexios Balatsoukas-Stimming, Andrew Charles Mallory Austin, Pavle Belanovic +1
Hardware imperfections can significantly reduce the performance of full-duplex wireless systems by introducing non-idealities and random effects that make it challenging to fully s…
Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage
Alexios Balatsoukas-Stimming, Andreas Burg
We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error mode…
Faulty Successive Cancellation Decoding of Polar Codes for the Binary Erasure Channel
Alexios Balatsoukas-Stimming, Andreas Burg
We study faulty successive cancellation decoding of polar codes for the binary erasure channel. To this end, we introduce a simple erasure-based fault model and we show that, under…