Jossy Sayir

Jossy Sayir

Auto-generated profile, based on publicly available information

Jossy Sayir

University of Cambridge, UK

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2006
Verified
Conference Paper
Closed access
GLGottfried Lechner
Gottfried Lechner
JSJossy Sayir
Jossy Sayir
ILIngmar Land
Ingmar Land
The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is computed, based on the code's own EXIT chart, under the Gaussian assumption. While the optimization of the variable node distribution is a nonlinear problem, the optimization of the check node distribution is shown to be a linear problem. This fact is exploited to design codes where both the variable and the check node distributions are optimized, resulting in more robust constructions. The technique presented requires only knowledge of the measured EXIT function of the receiver frontend

28 September 2004
Verified
Conference Paper
Closed access
GLGottfried Lechner
Gottfried Lechner
JSJ. Sayir
J. Sayir
MRM. Rupp
M. Rupp

20 January 2003
Verified
Conference Paper
Closed access
JSJ. Sayir
J. Sayir


25 April 2005
Verified
Conference Paper
Closed access
GGG.A. Gupta
G.A. Gupta
STS. Toumpis
S. Toumpis
JSJ. Sayir
J. Sayir
RMR.R. Muller
R.R. Muller

1 July 2013
Verified
Conference Paper
Closed access
JGJing Guo
Jing Guo
AFAlbert Guillen i Fabregas
Albert Guillen i Fabregas
JSJossy Sayir
Jossy Sayir
We study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. We show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can be proved for the underlying polar code. We also give accurate closed-form upper and lower bounds to the minimum distance of the resulting code when the design channel is the binary erasure channel.