June 01, 2017

On Performance and Complexity of OSD for Short Error Correcting Codes in 5G-NR

  • Alloum A.
  • Boutros J.
  • Moeneclaey M.
  • Van Wonterghem J.

We compare the performance of a selection of short and very short length linear binary codes on the binary-input Gaussian channel. We use the probabilistic Ordered Statistics Decoder, that is universal to any code construction. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, Turbo, Golay and BCH codes at length 20, 32 and 256 bits. BCH and random codes outperform other codes in absence of a cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds. Optimizations of the Ordered Statistics Decoder are discussed and revealed to bring near-ML performance with a notable complexity reduction for very short length codes at an affordable complexity.

Recent Publications

June 04, 2017

A New PRACH Transmission Scheme in Unlicensed Spectrum

  • Luo Z.
  • Meng Y.
  • Tao T.

For the unlicensed spectrum, the occupied bandwidth requirement is demanded by some regulations. The legacy scheme of Physical Random Access Channel (PRACH) for Long Term Evolution (LTE) cannot satisfy it. In this paper, we propose a novel PRACH transmission scheme to satisfy the requirement of unlicensed spectrum based on preamble ...

June 01, 2017

Mutual service processes in Euclidean spaces: existence and ergodicity

  • Baccelli F.
  • Mathieu F.
  • Norros I.

Consider a set of objects, abstracted to points of a spatially stationary point process in R-d, that deliver to each other a service at a rate depending on their distance. Assume that the points arrive as a Poisson process and leave when their service requirements have been fulfilled. We show ...

June 01, 2017

Incentivizing social media users for mobile crowdsourcing

  • Aiello L.
  • Karaliopoulos M.
  • Koutsopoulos I.
  • Micholia P.
  • Morales G.
  • Quercia D.

We focus on the problem of contributor-task matching in mobile crowd-sourcing. The idea is to identify existing social media users who possess domain expertise (e.g., photography) and incentivize them to perform some tasks (e.g., take quality pictures). To this end, we propose a framework that extracts the potential contributors' expertise ...