Ingmar Land

Ingmar Land

Auto-generated profile, based on publicly available information

Ingmar Land

Department of Communication Technology, Aalborg University, Fredrik Bajers Vej 7, A3, 9220 Aalborg, Denmark

Research Focus & Metrics

Academic Career Length

22Years (2005-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

1 February 2005 in Annals of Telecommunications
Verified
Journal Article
Closed access
PDF file
ILIngmar Land
Ingmar Land
SHSimon Huettinger
Simon Huettinger
XXxxx xxx
xxx xxx
JHJohannes Huber
Johannes Huber

10 August 2005 in arXiv
Verified
Preprint
Open access
PDF file
JMJan Mietzner
Jan Mietzner
SBSabah Badri-Hoeher
Sabah Badri-Hoeher
ILIngmar Land
Ingmar Land
PHPeter A. Hoeher
Peter A. Hoeher
Sparse intersymbol-interference (ISI) channels are encountered in a variety of high-data-rate communication systems. Such channels have a large channel memory length, but only a small number of significant channel coefficients. In this paper, trellis-based equalization of sparse ISI channels is revisited. Due to the large channel memory length, the complexity of maximum-likelihood detection, e.g., by means of the Viterbi algorithm (VA), is normally prohibitive. In the first part of the paper, a unified framework based on factor graphs is presented for complexity reduction without loss of optimality. In this new context, two known reduced-complexity algorithms for sparse ISI channels are recapitulated: The multi-trellis VA (M-VA) and the parallel-trellis VA (P-VA). It is shown that the M-VA, although claimed, does not lead to a reduced computational complexity. The P-VA, on the other hand, leads to a significant complexity reduction, but can only be applied for a certain class of sparse channels. In the second part of the paper, a unified approach is investigated to tackle general sparse channels: It is shown that the use of a linear filter at the receiver renders the application of standard reduced-state trellis-based equalizer algorithms feasible, without significant loss of optimality. Numerical results verify the efficiency of the proposed receiver structure.